Sciweavers

873 search results - page 111 / 175
» Using Top-Points as Interest Points for Image Matching
Sort
View
ECCV
2002
Springer
14 years 9 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel
CRV
2007
IEEE
161views Robotics» more  CRV 2007»
14 years 2 months ago
Dense Stereo Range Sensing with Marching Pseudo-Random Patterns
As an extension to classical structured lighting techniques, the use of bi-dimensional pseudo-random color codes is explored to perform range sensing with variable density from a ...
Danick Desjardins, Pierre Payeur
3DPVT
2002
IEEE
117views Visualization» more  3DPVT 2002»
14 years 20 days ago
Inpainting from Multiple Views
Inpainting refers to the task of filling in missing or damaged regions of an image. In this paper, we are interested in the inpainting problem where the missing regions are so la...
Sung Ha Kang, Tony F. Chan, Stefano Soatto
ICIP
1999
IEEE
14 years 9 months ago
In-Picture Search Algorithm for Content-Based Image Retrieval
Researchers are currently more interested in searching for fragments that are similar to a query, than a total data item that is similar to a query; the search interest is for &qu...
Punpiti Piamsa-nga, Nikitas A. Alexandridis, Sanan...
ICIP
2008
IEEE
14 years 9 months ago
A scalable complexity specification for video applications
We propose a new complexity modeling framework for multimedia tasks. We characterize the traffic with five parameters that together we designate as a task's complexity specif...
Nicholas Mastronarde, Mihaela van der Schaar