English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/87202
Share/Impact:
Statistics
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE
Exportar a otros formatos:

DC FieldValueLanguage
dc.contributor.authorFischer, Sylvain-
dc.contributor.authorBayerl, P.-
dc.contributor.authorNeumann, H.-
dc.contributor.authorRedondo, Rafael-
dc.contributor.authorCristóbal, Gabriel-
dc.date.accessioned2013-11-21T11:48:46Z-
dc.date.available2013-11-21T11:48:46Z-
dc.date.issued2007-
dc.identifierdoi: 10.1016/j.sigpro.2007.03.019-
dc.identifierissn: 0165-1684-
dc.identifier.citationSignal Processing 87: 2503-2515 (2007)-
dc.identifier.urihttp://hdl.handle.net/10261/87202-
dc.description.abstractTensor voting (TV) methods have been developed in a series of papers by Medioni and coworkers during the last years. The method has been proved efficient for feature extraction and grouping and has been applied successfully in a diversity of applications such as contour and surface inferences, motion analysis, etc. We present here two studies on improvements of the method. The first one consists in iterating the TV process, and the second one integrates curvature information. In contrast to other grouping methods, TV claims the advantage to be non-iterative. Although non-iterative TV methods provide good results in many cases, the algorithm can be iterated to deal with more complex or more ambiguous data configurations. We present experiments that demonstrate that iterations substantially improve the process of feature extraction and help to overcome limitations of the original algorithm. As a further contribution, we propose a curvature improvement for TV. Unlike the curvature-augmented TV proposed by Tang and Medioni, our method evaluates the full curvature, sign and amplitude in the 2D case. Another advantage of the method is that it uses part of the curvature calculation already performed by the classical TV, limiting the computational costs. Curvature-modified voting fields are also proposed. Results show smoother curves, a lower degree of artifacts and a high tolerance against scale variations of the input. The methods are finally tested under noisy conditions showing that the proposed improvements preserve the noise robustness of the TV method. © 2007 Elsevier B.V. All rights reserved.-
dc.description.sponsorshipThis research is supported in part by the German–Spanish Academic Research Collaboration Program HA 2001-0087 (DAAD, Acciones integradas Hispano-Alemanas 2002/2003) and the research Grants TEC2004-00834; TEC2005-24739-E; TEC2005-24046-E and PI040765. S.F. and R.R. are supported by a MEC-FPU and a CSIC-I3P fellowship, respectively.-
dc.language.isoeng-
dc.publisherElsevier-
dc.rightsclosedAccess-
dc.titleIterated tensor voting and curvature improvement-
dc.typeartículo-
dc.identifier.doihttp://dx.doi.org/10.1016/j.sigpro.2007.03.019-
dc.date.updated2013-11-21T11:48:46Z-
dc.description.versionPeer Reviewed-
Appears in Collections:(CFMAC-IO) Artículos
Files in This Item:
File Description SizeFormat 
accesoRestringido.pdf15,38 kBAdobe PDFThumbnail
View/Open
Show simple item record
 

Related articles:


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.