𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient line symmetry-based K-means algorithm

✍ Scribed by Kuo-Liang Chung; Keng-Sheng Lin

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
458 KB
Volume
27
Category
Article
ISSN
0167-8655

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Faster and more robust point symmetry-ba
Faster and more robust point symmetry-based K-means algorithm
✍ Kuo-Liang Chung; Jhin-Sian Lin πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 509 KB

Based on the recently published point symmetry distance (PSD) measure, this paper presents a novel PSD measure, namely symmetry similarity level (SSL) operator for K-means algorithm. Our proposed modified point symmetry-based K-means (MPSK) algorithm is more robust than the previous PSK algorithm by

An efficient sweep-line Delaunay triangu
An efficient sweep-line Delaunay triangulation algorithm
✍ Borut Ε½alik πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 587 KB

This paper introduces a new algorithm for constructing a 2D Delaunay triangulation. It is based on a sweep-line paradigm, which is combined with a local optimization criterion-a characteristic of incremental insertion algorithms. The sweep-line status is represented by a so-called advancing front, w

An efficient triplet-based algorithm for
An efficient triplet-based algorithm for evidential reasoning
✍ Yaxin Bi πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 406 KB

Linear-time computational techniques based on the structure of an evidence space have been developed for combining multiple pieces of evidence using Dempster's rule (orthogonal sum), which is available on a number of contending hypotheses. They offer a means of making the computation-intensive calcu

An efficient watershed algorithm based o
An efficient watershed algorithm based on connected components
✍ A. Bieniek; A. Moga πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 644 KB

In this paper, a formal de"nition and a new algorithmic technique for the watershed transformation is presented. The novelty of the approach is to adapt the connected component operator to solve the watershed segmentation problem. The resulting algorithm is independent of the number of grey-levels,