140 search results - page 21 / 28 » Computing the visibility graph of points within a polygon |
106
click to vote
ECCV
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
121
click to vote
TIP
2011
14 years 6 months ago
2011
Abstract—The purpose of this study is to investigate multiregion graph cut image partitioning via kernel mapping of the image data. The image data is transformed implicitly by a ...
ACIVS
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. This article presents a new algorithm for spatial deinterlacing that could easily be integrated in a more complete deinterlacing system, typically a spatio-temporal motio...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
Boosted by the Middlebury challenge, the precision of dense multi-view stereovision methods has increased drastically in the past few years. Yet, most methods, although they perfo...
ICCV
2001
IEEE
16 years 1 months ago
2001
IEEE
In many cases self-calibration is not able to yield a unique solution for the 3D reconstruction of a scene. This is due to the occurrence of critical motion sequences. If this is ...