Sciweavers

1539 search results - page 47 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
CVPR
2000
IEEE
15 years 6 months ago
A Fast and Robust Approach to Recovering Structure and Motion from Live Video Frames
This paper describes a fast and robust approach to recovering structure and motion from video frames. It rst describes a robust recursive factorization method for ane projection...
Takeshi Kurata, Jun Fujiki, Masakatsu Kourogi, Kat...
CVPR
2007
IEEE
16 years 4 months ago
Saliency Detection: A Spectral Residual Approach
The ability of human visual system to detect visual saliency is extraordinarily fast and reliable. However, computational modeling of this basic intelligent behavior still remains...
Xiaodi Hou, Liqing Zhang
CVPR
2007
IEEE
16 years 4 months ago
Efficient Indexing For Articulation Invariant Shape Matching And Retrieval
Most shape matching methods are either fast but too simplistic to give the desired performance or promising as far as performance is concerned but computationally demanding. In th...
Soma Biswas, Gaurav Aggarwal, Rama Chellappa
ICCV
1995
IEEE
15 years 5 months ago
In Defence of the 8-Point Algorithm
The fundamental matrix is a basic tool in the analysis of scenes taken with two uncalibrated cameras, and the 8-point algorithm is a frequently cited method for computing the fund...
Richard I. Hartley
AMC
2010
143views more  AMC 2010»
15 years 2 months ago
Fixed-point iterations in determining a Tikhonov regularization parameter in Kirsch's factorization method
Kirsch's factorization method is a fast inversion technique for visualizing the profile of a scatterer from measurements of the far-field pattern. The mathematical basis of t...
Koung Hee Leem, George Pelekanos, Fermín S....