Sciweavers

194 search results - page 13 / 39
» Computing Distance Histograms Efficiently in Scientific Data...
Sort
View
CVPR
2005
IEEE
14 years 11 months ago
Efficient Image Matching with Distributions of Local Invariant Features
Sets of local features that are invariant to common image transformations are an effective representation to use when comparing images; current methods typically judge feature set...
Kristen Grauman, Trevor Darrell
PODS
2005
ACM
127views Database» more  PODS 2005»
14 years 9 months ago
FTW: fast similarity search under the time warping distance
Time-series data naturally arise in countless domains, such as meteorology, astrophysics, geology, multimedia, and economics. Similarity search is very popular, and DTW (Dynamic T...
Yasushi Sakurai, Masatoshi Yoshikawa, Christos Fal...
KDD
2004
ACM
182views Data Mining» more  KDD 2004»
14 years 9 months ago
Rotation invariant distance measures for trajectories
For the discovery of similar patterns in 1D time-series, it is very typical to perform a normalization of the data (for example a transformation so that the data follow a zero mea...
Michail Vlachos, Dimitrios Gunopulos, Gautam Das
ISM
2006
IEEE
207views Multimedia» more  ISM 2006»
13 years 9 months ago
Affinity Hybrid Tree: An Indexing Technique for Content-Based Image Retrieval in Multimedia Databases
A novel indexing and access method, called Affinity Hybrid Tree (AH-Tree), is proposed to organize large image data sets efficiently and to support popular image access mechanisms...
Kasturi Chatterjee, Shu-Ching Chen
ICDE
2006
IEEE
160views Database» more  ICDE 2006»
14 years 10 months ago
Surface k-NN Query Processing
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
Ke Deng, Xiaofang Zhou, Heng Tao Shen, Kai Xu 0003...