Sciweavers

1348 search results - page 51 / 270
» Matching planar maps
Sort
View
ICIP
2004
IEEE
14 years 11 months ago
Building blocks for autonomous navigation using contour correspondences
We address a few problems in navigation of automated vehicles using images captured by a mounted camera. Specifically, we look at the recognition of sign boards, rectification of ...
M. Pawan Kumar, C. V. Jawahar, P. J. Narayanan
SODA
2010
ACM
176views Algorithms» more  SODA 2010»
14 years 7 months ago
Self-improving Algorithms for Convex Hulls
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
ECCV
2000
Springer
14 years 11 months ago
On the Reprojection of 3D and 2D Scenes Without Explicit Model Selection
It is known that recovering projection matrices from planar con gurations is ambiguous, thus, posing the problem of model selection | is the scene planar 2D or non-planar 3D? For ...
Amnon Shashua, Shai Avidan
ICDE
2005
IEEE
120views Database» more  ICDE 2005»
14 years 11 months ago
Corpus-based Schema Matching
Schema Matching is the problem of identifying corresponding elements in different schemas. Discovering these correspondences or matches is inherently difficult to automate. Past s...
Jayant Madhavan, Philip A. Bernstein, AnHai Doan, ...
PR
2007
180views more  PR 2007»
13 years 9 months ago
Hybrid image matching combining Hausdorff distance with normalized gradient matching
Image matching has been a central problem in computer vision and image processing for decades. Most of the previous approaches to image matching can be categorized into the intens...
Chyuan-Huei Thomas Yang, Shang-Hong Lai, Long-Wen ...