6274 search results - page 319 / 1255 » From query complexity to computational complexity |
184
click to vote
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
203
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
Recovering 3D geometry from a single 2D line drawing is an important and challenging problem in computer vision. It has wide applications in interactive 3D modeling from images, c...
155
click to vote
ECCV
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We propose a homography estimation method from the contours of planar regions. Standard projective invariants such as cross ratios or canonical frames based on hot points...
171
click to vote
IJCV
1998
15 years 6 months ago
1998
A fundamental problem in depth from defocus is the measurement of relative defocus between images. The performance of previously proposed focus operators are inevitably sensitive t...
149
click to vote
IMR
2004
Springer
16 years 1 days ago
2004
Springer
We present a method that computes a global potentially visible set for the complete region outside the convex hull of an object. The technique is used to remove invisible parts (t...