Sciweavers

80 search results - page 8 / 16
» Nearest Neighbor Search Using Additive Binary Tree
Sort
View
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
14 years 1 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
SSDBM
2002
IEEE
122views Database» more  SSDBM 2002»
14 years 24 days ago
ATreeGrep: Approximate Searching in Unordered Trees
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, ...
CIVR
2003
Springer
269views Image Analysis» more  CIVR 2003»
14 years 1 months ago
HPAT Indexing for Fast Object/Scene Recognition Based on Local Appearance
Abstract. The paper describes a fast system for appearance based image recognition . It uses local invariant descriptors and efficient nearest neighbor search. First, local affine ...
Hao Shao, Tomás Svoboda, Tinne Tuytelaars, ...
3DIM
2003
IEEE
13 years 11 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
ICIP
2005
IEEE
14 years 1 months ago
Object representation using colour, shape and structure criteria in a binary partition tree
Binary Partition Trees (BPTs) are a well known technique used for region-based image representation and analysis. BPTs are usually created as a result of a merging process based o...
Christian Ferran Bennström, Josep R. Casas