Sciweavers

83 search results - page 10 / 17
» Fast Euclidean Distance Transform using a Graph-Search Algor...
Sort
View
ML
2010
ACM
142views Machine Learning» more  ML 2010»
14 years 8 months ago
Fast adaptive algorithms for abrupt change detection
We propose two fast algorithms for abrupt change detection in streaming data that can operate on arbitrary unknown data distributions before and after the change. The first algor...
Daniel Nikovski, Ankur Jain
85
Voted
DICTA
2003
14 years 11 months ago
Fast Adaptive Algorithm for Time-Critical Color Quantization Application
Color quantization is the process of grouping n data points to k cluster. We proposed a new approach, based on Wu’s color quantization [6]. Our approach can significantly reduce ...
Kiattisin Kanjanawanishkul, Bunyarit Uyyanonvara
66
Voted
MVA
1994
100views Computer Vision» more  MVA 1994»
14 years 11 months ago
Reconstruction of 3-D Terrain Data from Contour Map
This pqm pments a rasterbased algorithm for reconstruction of 3-D terrain data from contour information appearing on the conventional 2-D map The height of an interior point betwe...
Jin-Seon Lee, Seung Jong Chung
COMPGEOM
2011
ACM
14 years 1 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
74
Voted
PR
2010
144views more  PR 2010»
14 years 8 months ago
Classifying transformation-variant attributed point patterns
This paper presents a classification approach, where a sample is represented by a set of feature vectors called an attributed point pattern. Some attributes of a point are transf...
K. E. Dungan, L. C. Potter