✦ LIBER ✦

A clustering method based on multidimensional texture analysis

✍ Scribed by K. Hammouche; M. Diaf; J.-G. Postaire

Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 762 KB
Volume: 39
Category: Article
ISSN: 0031-3203
DOI: 10.1016/j.patcog.2005.11.024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two remarks on multidimensional texture

Two remarks on multidimensional texture analysis

✍ David G Morgenthaler; Cheng-Ye Wang; Azriel Rosenfeld 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 263 KB

A clustering method based on boosting

✍ D. Frossyniotis; A. Likas; A. Stafylopatis 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 732 KB

A clustering method based on the L1-norm

✍ Krzysztof Jajuga 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 758 KB

A kernel-based subtractive clustering me

A kernel-based subtractive clustering method

✍ Dae-Won Kim; KiYoung Lee; Doheon Lee; Kwang H. Lee 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 352 KB

In this paper the conventional subtractive clustering method is extended by calculating the mountain value of each data point based on a kernel-induced distance instead of the conventional sum-of-squares distance. The kernel function is a generalization of the distance metric that measures the dista

A kernel-based core growing clustering m

A kernel-based core growing clustering method

✍ T. W. Hsieh; J. S. Taur; C. W. Tao; S. Y. Kung 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 360 KB

In this paper, a novel clustering method in the kernel space is proposed. It effectively integrates several existing algorithms to become an iterative clustering scheme, which can handle clusters with arbitrary shapes. In our proposed approach, a reasonable initial core for each of the cluster is es

Unsupervised color–texture segmentation

Unsupervised color–texture segmentation based on soft criterion with adaptive mean-shift clustering

✍ Yuzhong Wang; Jie Yang; Ningsong Peng 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 529 KB