163 search results - page 2 / 33 » Optimal Correspondences from Pairwise Constraints |
IAT
2009
IEEE
14 years 7 min ago
2009
IEEE
—This paper proposes a method of learning a similarity matrix from pairwise constraints for interactive clustering. The similarity matrix can be learned by solving an optimizatio...
CVPR
2010
IEEE
14 years 2 months ago
2010
IEEE
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...
WEBI
2007
Springer
13 years 11 months ago
2007
Springer
Nonnegative Matrix Factorization (NMF) has been proven to be effective in text mining. However, since NMF is a well-known unsupervised components analysis technique, the existing ...
PAMI
2006
13 years 5 months ago
2006
A novel algorithm for pose and motion estimation using corresponding features and a Digital Terrain Map is proposed. Using a Digital Terrain (or Digital Elevation) Map (DTM/DEM) as...
ICCV
2009
IEEE
14 years 10 months ago
2009
IEEE
Clustering performance can often be greatly improved by
leveraging side information. In this paper, we consider constrained
clustering with pairwise constraints, which specify
s...