Sciweavers

136 search results - page 2 / 28
» A Spectral Technique for Correspondence Problems Using Pairw...
Sort
View
ICCV
2007
IEEE
14 years 7 months ago
A Robust Graph-Based Method for The General Correspondence Problem Demonstrated on Image Stitching
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
Martin Bujnak, Radim Sára
CVPR
2004
IEEE
14 years 7 months ago
Wide Baseline Feature Matching Using the Cross-Epipolar Ordering Constraint
? Robust feature matching across different views of the same scene taken by two cameras with wide baseline and arbitrary rotation is still an open problem. Matching based on appear...
Xiaoye Lu, Roberto Manduchi
CVPR
2010
IEEE
14 years 1 months ago
Learning Full Pairwise Affinities for Spectral Segmentation
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...
Tae Hoon Kim (Seoul National University), Kyoung M...
DIS
2005
Springer
13 years 10 months ago
Active Constrained Clustering by Examining Spectral Eigenvectors
Abstract. This work focuses on the active selection of pairwise constraints for spectral clustering. We develop and analyze a technique for Active Constrained Clustering by Examini...
Qianjun Xu, Marie desJardins, Kiri Wagstaff
CVPR
2010
IEEE
14 years 2 months ago
Online Visual Vocabulary Pruning Using Pairwise Constraints
Given a pair of images represented using bag-of-visual words and a label corresponding to whether the images are “related”(must-link constraint) or “unrelated” (must not li...
Pavan Mallapragada, Rong Jin and Anil Jain