Sciweavers

649 search results - page 28 / 130
» Some Methods of Replacing the Nearest Neighbor Method
Sort
View
CIVR
2003
Springer
269views Image Analysis» more  CIVR 2003»
14 years 2 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, ...
DEXA
2006
Springer
190views Database» more  DEXA 2006»
14 years 20 days ago
High-Dimensional Similarity Search Using Data-Sensitive Space Partitioning
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
Sachin Kulkarni, Ratko Orlandic
IWCIA
2004
Springer
14 years 2 months ago
Shape Preserving Sampling and Reconstruction of Grayscale Images
Abstract. The expressiveness of a lot of image analysis algorithms depends on the question whether shape information is preserved during digitization. Most existing approaches to a...
Peer Stelldinger

Publication
3460views
15 years 10 months ago
Multistencils Fast Marching Methods: A Highly Accurate Solution to the Eikonal Equation on Cartesian Domains
A wide range of computer vision applications require an accurate solution of a particular Hamilton-Jacobi (HJ) equation known as the Eikonal equation. In this paper, we propose an ...
M. Sabry Hassouna, Aly A. Farag
CVPR
2006
IEEE
14 years 11 months ago
Graph Laplacian Kernels for Object Classification from a Single Example
Classification with only one labeled example per class is a challenging problem in machine learning and pattern recognition. While there have been some attempts to address this pr...
Hong Chang, Dit-Yan Yeung