Sciweavers

ADC
2006
Springer
136views Database» more  ADC 2006»
13 years 10 months ago
A multi-step strategy for approximate similarity search in image databases
Many strategies for similarity search in image databases assume a metric and quadratic form-based similarity model where an optimal lower bounding distance function exists for fil...
Paul Wing Hing Kwan, Junbin Gao
ACCV
2006
Springer
13 years 10 months ago
Waterfall Segmentation of Complex Scenes
Abstract. We present an image segmentation technique using the morphological Waterfall algorithm. Improvements in the segmentation are brought about by using improved gradients. Th...
Allan Hanbury, Beatriz Marcotegui
SISAP
2008
IEEE
175views Data Mining» more  SISAP 2008»
13 years 11 months ago
Anytime K-Nearest Neighbor Search for Database Applications
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
Weijia Xu, Daniel P. Miranker, Rui Mao, Smriti R. ...
SISAP
2008
IEEE
188views Data Mining» more  SISAP 2008»
13 years 11 months ago
High-Dimensional Similarity Retrieval Using Dimensional Choice
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
Dave Tahmoush, Hanan Samet
SSD
2009
Springer
149views Database» more  SSD 2009»
13 years 11 months ago
Analyzing Trajectories Using Uncertainty and Background Information
A key issue in clustering data, regardless the algorithm used, is the definition of a distance function. In the case of trajectory data, different distance functions have been pro...
Bart Kuijpers, Bart Moelans, Walied Othman, Alejan...
CPM
2009
Springer
94views Combinatorics» more  CPM 2009»
13 years 11 months ago
Online Approximate Matching with Non-local Distances
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
Raphaël Clifford, Benjamin Sach
ISBI
2009
IEEE
13 years 11 months ago
Cell Tracking and Segmentation in Electron Microscopy Images Using Graph Cuts
Understanding neural connectivity and structures in the brain requires detailed 3D anatomical models, and such an understanding is essential to the study of the nervous system. Ho...
Huei-Fang Yang, Yoonsuck Choe
CVPR
2010
IEEE
14 years 12 days ago
A Novel Riemannian Framework for Shape Analysis of 3D Objects
In this paper we introduce a novel Riemannian framework for shape analysis of parameterized surfaces. We derive a distance function between any two surfaces that is invariant to r...
Sebastian Kurtek, Eric Klassen, Anuj Srivastava, Z...
KDD
2005
ACM
109views Data Mining» more  KDD 2005»
14 years 5 months ago
Formulating distance functions via the kernel trick
Tasks of data mining and information retrieval depend on a good distance function for measuring similarity between data instances. The most effective distance function must be for...
Gang Wu, Edward Y. Chang, Navneet Panda
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 5 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales