Sciweavers

611 search results - page 29 / 123
» The Cardinality Matrix Constraint
Sort
View
ICPR
2000
IEEE
15 years 2 months ago
A General Rank-2 Parameterization of the Fundamental Matrix
All the methods for estimating the fundamental matrix do not naturally exploit the rank-2 constraint. For these reason some few rank-2 parameterizations of the fundamental matrix ...
Francesco Isgrò, Emanuele Trucco
IVC
2007
131views more  IVC 2007»
14 years 9 months ago
Multi-view correspondence by enforcement of rigidity constraints
Establishing the correct correspondence between features in an image set remains a challenging problem amongst computer vision researchers. In fact, the combinatorial nature of fe...
Ricardo Oliveira, João Xavier, João ...
CVPR
2010
IEEE
15 years 2 months ago
Anatomical Parts-Based Regression Using Non-Negative Matrix Factorization
Non-negative matrix factorization (NMF) is an excellent tool for unsupervised parts-based learning, but proves to be ineffective when parts of a whole follow a specific pattern. ...
Swapna Joshi, Karthikeyan Shanmugavadivel, B.S. Ma...
TNN
2008
128views more  TNN 2008»
14 years 9 months ago
Nonnegative Matrix Factorization in Polynomial Feature Space
Abstract--Plenty of methods have been proposed in order to discover latent variables (features) in data sets. Such approaches include the principal component analysis (PCA), indepe...
Ioan Buciu, Nikos Nikolaidis, Ioannis Pitas
74
Voted
PSIVT
2009
Springer
130views Multimedia» more  PSIVT 2009»
15 years 4 months ago
Compact Fundamental Matrix Computation
Abstract. A very compact algorithm is presented for fundamental matrix computation from point correspondences over two images. The computation is based on the strict maximum likeli...
Kenichi Kanatani, Yasuyuki Sugaya