Sciweavers

242 search results - page 4 / 49
» Compact Fundamental Matrix Computation
Sort
View
DICTA
2003
14 years 11 months ago
A Robust Method for Estimating the Fundamental Matrix
In this paper, we propose a robust method to estimate the fundamental matrix in the presence of outliers. The new method uses random minimum subsets as a search engine to find inli...
C. L. Feng, Y. S. Hung
64
Voted
ECCV
2006
Springer
15 years 1 months ago
The Space of Multibody Fundamental Matrices: Rank, Geometry and Projection
We study the rank and geometry of the multibody fundamental matrix, a geometric entity characterizing the two-view geometry of dynamic scenes consisting of multiple rigidbody moti...
Xiaodong Fan, René Vidal
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
14 years 11 months ago
Less is More: Compact Matrix Decomposition for Large Sparse Graphs
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
Jimeng Sun, Yinglian Xie, Hui Zhang, Christos Falo...
66
Voted
CVPR
2007
IEEE
15 years 11 months ago
On the Spacetime Geometry of Galilean Cameras
In this paper, a projection model is presented for cameras moving at constant velocity (which we refer to as Galilean cameras). To that end, we introduce the concept of spacetime ...
Yaser Sheikh, Alexei Gritai, Mubarak Shah
84
Voted
KDD
2005
ACM
165views Data Mining» more  KDD 2005»
15 years 10 months ago
Co-clustering by block value decomposition
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu