Sciweavers

255 search results - page 41 / 51
» An Efficient Euclidean Distance Transform
Sort
View
ICDAR
2007
IEEE
15 years 4 months ago
Skeletonization by Gradient Regularization and Diffusion
This paper describes a skeletonization process for grayscale or color images based on the diffusion of the color gradient vectors by using a simple iterative regularization scheme...
Frank Lebourgeois, Hubert Emptoz
SDM
2004
SIAM
212views Data Mining» more  SDM 2004»
14 years 11 months ago
Clustering with Bregman Divergences
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
Arindam Banerjee, Srujana Merugu, Inderjit S. Dhil...
JCST
2008
124views more  JCST 2008»
14 years 10 months ago
Clustering by Pattern Similarity
The task of clustering is to identify classes of similar objects among a set of objects. The definition of similarity varies from one clustering model to another. However, in most ...
Haixun Wang, Jian Pei
CORR
2010
Springer
180views Education» more  CORR 2010»
14 years 7 months ago
Shortest path problem in rectangular complexes of global nonpositive curvature
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
Victor Chepoi, Daniela Maftuleac
ICPR
2008
IEEE
15 years 4 months ago
Semi-supervised marginal discriminant analysis based on QR decomposition
In this paper, a novel subspace learning method, semi-supervised marginal discriminant analysis (SMDA), is proposed for classification. SMDA aims at maintaining the intrinsic neig...
Rui Xiao, Pengfei Shi