Sciweavers

214 search results - page 26 / 43
» Computing the Closest Point to a Circle
Sort
View
ICRA
2005
IEEE
100views Robotics» more  ICRA 2005»
14 years 1 months ago
Improved Signal To Noise Ratio And Computational Speed For Gradient-Based Detection Algorithms
— Image gradient-based feature detectors offer great advantages over their standard edge-only equivalents. In driver support systems research, the radial symmetry detection algor...
Nick Barnes
ICCV
2007
IEEE
14 years 9 months ago
Novel Depth Cues from Uncalibrated Near-field Lighting
We present the first method to compute depth cues from images taken solely under uncalibrated near point lighting. A stationary scene is illuminated by a point source that is move...
Sanjeev J. Koppal, Srinivasa G. Narasimhan
ECCV
2006
Springer
14 years 9 months ago
Multi-way Clustering Using Super-Symmetric Non-negative Tensor Factorization
Abstract. We consider the problem of clustering data into k 2 clusters given complex relations -- going beyond pairwise -- between the data points. The complex n-wise relations ar...
Amnon Shashua, Ron Zass, Tamir Hazan
ICIP
2003
IEEE
14 years 9 months ago
A refined ICP algorithm for robust 3-D correspondence estimation
Robust registration of two 3-D point sets is a common problem in computer vision. The Iterative Closest Point (ICP) algorithm is undoubtedly the most popular algorithm for solving...
Heinrich Niemann, Jochen Schmidt, Timo Zinße...
MVA
1990
123views Computer Vision» more  MVA 1990»
13 years 8 months ago
Randomized Hough Transform (RHT) in Engineering Drawing Vectorization System
Abstract When the data is processed from the digitized drawThis paper presents how the recently presented Randomized IIough Transform (RHT) method can be used as a part of an engin...
Pekka Kultanen, Erkki Oja, Lei Xu