Sciweavers

1088 search results - page 113 / 218
» Robust Principal Component Analysis for Computer Vision
Sort
View
ICCV
2005
IEEE
16 years 9 days ago
A Spectral Technique for Correspondence Problems Using Pairwise Constraints
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the p...
Marius Leordeanu, Martial Hebert
ECCV
1998
Springer
16 years 7 days ago
Faithful Least-Squares Fitting of Spheres, Cylinders, Cones and Tori for Reliable Segmentation
Abstract. This paper addresses a problem arising in the reverse engineering of solid models from depth-maps. We wish to identify and fit surfaces of known type wherever these are a...
A. David Marshall, Gábor Lukács, Ral...
68
Voted
ICPR
2006
IEEE
15 years 11 months ago
Epipolar Geometry from Two Correspondences
A novel algorithm for robust RANSAC-like estimation of epipolar geometry (of uncalibrated camera pair) from two correspondences of local affine frames (LAFs) is presented. Each LA...
Michal Perdoch, Jiri Matas, Ondrej Chum
CVPR
2010
IEEE
15 years 6 months ago
The Multiscale Competitive Code via Sparse Representation for Palmprint Verification
Palm lines are the most important features for palmprint recognition. They are best considered as typical multiscale features, where the principal lines can be represented at a la...
Wangmeng Zuo, Zhouchen Lin
ICPR
2008
IEEE
15 years 4 months ago
Application of graph coloring in physical layout segmentation
Every-day, the postal sorting systems diffuse several tons of mails. It is noted that the principal origin of mail rejection is related to the failure of address-block localizatio...
Djamel Gaceb, Véronique Eglin, Frank Lebour...