Sciweavers

1375 search results - page 123 / 275
» Matching Points with Things
Sort
View
143
Voted
SODA
1992
ACM
109views Algorithms» more  SODA 1992»
15 years 4 months ago
New Algorithms for Minimum Area k-gons
Given a set P of n points in the plane, we wish to find a set Q P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of fi...
David Eppstein
166
Voted
MVA
2002
261views Computer Vision» more  MVA 2002»
15 years 3 months ago
Detecting Faces in Color Images Using an Adaptive Color Model and Salient Features
Face detection has many interesting applications such as a face recognition system, a surveillance system, and videolimage indexing system. In this paper, we propose a new method ...
Hang-Bong Kang
BMVC
2010
15 years 1 months ago
Reducing mismatching under time-pressure by reasoning about visibility and occlusion
Three methods are explored which help indicate whether feature points are potentially visible or occluded in the matching phase of the keyframe-based real-time visual SLAM system....
Somkiat Wangsiripitak, David W. Murray
140
Voted
CORR
2010
Springer
168views Education» more  CORR 2010»
15 years 1 months ago
Bounds on the maximum multiplicity of some common geometric graphs
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...
Adrian Dumitrescu, André Schulz, Adam Sheff...
140
Voted
CVPR
2008
IEEE
16 years 5 months ago
Efficient sequential correspondence selection by cosegmentation
In many retrieval, object recognition and wide baseline stereo methods, correspondences of interest points are established possibly sublinearly by matching a compact descriptor su...
Jan Cech, Jiri Matas, Michal Perdoch