Sciweavers

372 search results - page 47 / 75
» Matching Shapes with a Reference Point
Sort
View
ICCV
2005
IEEE
14 years 9 months ago
Improved Sub-pixel Stereo Correspondences through Symmetric Refinement
Most dense stereo correspondence algorithms start by establishing discrete pixel matches and later refine these matches to sub-pixel precision. Traditional sub-pixel refinement me...
Diego Nehab, Szymon Rusinkiewicz, James Davis
BMCBI
2008
117views more  BMCBI 2008»
13 years 7 months ago
An iterative block-shifting approach to retention time alignment that preserves the shape and area of gas chromatography-mass sp
Background: Metabolomics, petroleum and biodiesel chemistry, biomarker discovery, and other fields which rely on high-resolution profiling of complex chemical mixtures generate da...
Minho Chae, Robert J. Shmookler Reis, John J. Thad...
ICML
2008
IEEE
14 years 8 months ago
Robust matching and recognition using context-dependent kernels
The success of kernel methods including support vector machines (SVMs) strongly depends on the design of appropriate kernels. While initially kernels were designed in order to han...
Hichem Sahbi, Jean-Yves Audibert, Jaonary Rabariso...
JMM2
2007
127views more  JMM2 2007»
13 years 7 months ago
Robust Face Recognition through Local Graph Matching
— A novel face recognition method is proposed, in which face images are represented by a set of local labeled graphs, each containing information about the appearance and geometr...
Ehsan Fazl Ersi, John S. Zelek, John K. Tsotsos
JMIV
2008
69views more  JMIV 2008»
13 years 7 months ago
Transport of Relational Structures in Groups of Diffeomorphisms
This paper focuses on the issue of translating the relative variation of one shape with respect to another in a template centered representation. The context is the theory of Diffe...
Laurent Younes, Anqi Qiu, Raimond L. Winslow, Mich...