Sciweavers

255 search results - page 13 / 51
» An Efficient Euclidean Distance Transform
Sort
View
ICMCS
2005
IEEE
85views Multimedia» more  ICMCS 2005»
15 years 3 months ago
Fast Search Method for Image Vector Quantization Based on Equal-Average Equal-Variance and Partial Sum Concept
The encoding process of image vector quantization (VQ) is very heavy due to it performing a lot of k-dimensional Euclidean distance computations. In order to speed up VQ encoding,...
Zhibin Pan, Koji Kotani, Tadahiro Ohmi
CVPR
2000
IEEE
16 years 13 hour ago
Robust and Efficient Skeletal Graphs
There has recently been significant interest in using repions based on abstractions of Blum's skeleton into a graph, for qualitative shape matching. The application of these ...
Pavel Dimitrov, Carlos Phillips, Kaleem Siddiqi
ICASSP
2009
IEEE
15 years 4 months ago
Using fourier-based shape alignment to add geometric prior to snakes
In this paper, we present a new algorithm of snakes with geometric prior. A method of shape alignment using Fourier coefficients is introduced to estimate the Euclidean transform...
Mohamed Ali Charmi, Faouzi Ghorbel, Stéphan...
DATAMINE
2006
176views more  DATAMINE 2006»
14 years 10 months ago
A Bit Level Representation for Time Series Data Mining with Shape Based Similarity
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
Anthony J. Bagnall, Chotirat (Ann) Ratanamahatana,...
SIGMOD
2001
ACM
184views Database» more  SIGMOD 2001»
15 years 10 months ago
Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
Eamonn J. Keogh, Kaushik Chakrabarti, Sharad Mehro...