Sciweavers

233 search results - page 20 / 47
» The Shapes of Trees
Sort
View
3DIM
2003
IEEE
15 years 4 months ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
Michael A. Greenspan, Mike Yurick
108
Voted
PR
2008
206views more  PR 2008»
15 years 10 days ago
A study of graph spectra for comparing graphs and trees
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...
Richard C. Wilson, Ping Zhu
105
Voted
IJCAI
2003
15 years 1 months ago
Propagate the Right Thing: How Preferences Can Speed-Up Constraint Solving
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...
Christian Bessière, Anaïs Fabre, Ulric...
CAIP
1997
Springer
116views Image Analysis» more  CAIP 1997»
15 years 4 months ago
Coordinate-Free Camera Calibration
A method for calibration of the optic center and the focal length of a pin-hole camera is suggested, where the camera parameters are constructed geometrically in the image plane. B...
Jens Arnspang, Knud Henriksen, Niels Holm Olsen
ICIP
2004
IEEE
16 years 2 months ago
Shape-adaptive coding using binary set splitting with k-d trees
The binary set splitting with k-d trees (BISK) algorithm is introduced. An embedded wavelet-based image coder based on the popular bitplane-coding paradigm, BISK is designed speci...
James E. Fowler