Line Segment-Based Clustering Approach With Self-Organizing Maps

Line Segment-Based Clustering Approach With Self-Organizing Maps

G. Chamundeswari, G. P. S. Varma, C. Satyanarayana
Copyright: © 2021 |Pages: 12
DOI: 10.4018/JITR.2021100103
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Clustering techniques are used widely in computer vision and pattern recognition. The clustering techniques are found to be efficient with the feature vector of the input image. So, the present paper uses an approach for evaluating the feature vector by using Hough transformation. With the Hough transformation, the present paper mapped the points to line segment. The line features are considered as the feature vector and are given to the neural network for performing clustering. The present paper uses self-organizing map (SOM) neural network for performing the clustering process. The proposed method is evaluated with various leaf images, and the evaluated performance measures show the efficiency of the proposed method.
Article Preview
Top

Introduction

Clustering is found to be one of the thrust research areas in computer vision and pattern recognition. There are various techniques and approaches to perform clustering in the literature (Pavel Berkhin, 2002; M. Steinbach, G. Karypis, V. Kumar, 2000). The reason for gaining high attention by the researchers is its wide variety of applications viz., segmentation, object recognition and content based information retrieval etc. In unsupervised approach, the relevant information search is found to be a difficult task (Cai, Deng and Zhang, Chiyuan and He, Xiaofei, 2010). For this, a Multi Cluster Feature Selection (MCFS) approach is used for solving the combinatorial optimization problem. It also solves the L1 regularized least squares and sparse Eigen problems. An incremental procedure is adopted for the K-means clustering method (AristidisLikas, NikosVlassis, JakobJ. Verbeek, 2003). It appends cluster by cluster dynamically. For this, it uses a globally deterministic search algorithm. With this, the computational load is also greatly reduced. The clustering techniques are found to be efficient to segment the vessels (Gehad Hassan, et al, 2015) in the input retina image. The K-means clustering algorithm and the mathematical morphology are used for smoothing and segmenting the image.

The inter neurons are clustered by using neuro morphological approach (Ivan Grbatinić, Nebojša Milošević, Bojana Krstonošić, 2017). It estimates the predictor and then performs the analysis of multivariate clusters and is then classified into multiple labels. To improve the efficiency of the Fuzzy Min-Max network, an ensemble of clustering tree (Manjeevan Seera, Kuldeep Randhawa, Chee Peng Lim, 2017) is used. It uses an efficient learning model to improve the performance of the clustering method. It uses four different types of mean measures in the network. A multi layer immune network (Xiao Yu, 2017) is used for clustering the fuzzy mid-wave infrared image. It uses the mechanism of the coordination network. It minimizes the inter class variance with immune neural network. The Euclidean distance based clustering with ART2 network is found to yield low performance when compared to other networks. To improve this, a steganographic projection with hybrid neural system (Andrzej Bielecki, Mateusz Wójcik, 2017) is used. It also improves the performance of both ART2 and RBF networks. It is observed that an unsupervised neural network (Marina Resta, Michele Sonnessa, Elena Tànfani, Angela Testi, 2017) is found to be efficient for analyzing the patterns of patient data flow information. In this, SOM is used for analyzing the data with clustering techniques and then the cluster information is represented with seasonal connotation. The failing banks (Michael Negnevitsky, 2017) are efficiently clustered with the SOM neural network. This method is found to be efficient to represent the likelihood of bank failures.

Complete Article List

Search this Journal:
Reset
Volume 16: 1 Issue (2024): Forthcoming, Available for Pre-Order
Volume 15: 6 Issues (2022): 1 Released, 5 Forthcoming
Volume 14: 4 Issues (2021)
Volume 13: 4 Issues (2020)
Volume 12: 4 Issues (2019)
Volume 11: 4 Issues (2018)
Volume 10: 4 Issues (2017)
Volume 9: 4 Issues (2016)
Volume 8: 4 Issues (2015)
Volume 7: 4 Issues (2014)
Volume 6: 4 Issues (2013)
Volume 5: 4 Issues (2012)
Volume 4: 4 Issues (2011)
Volume 3: 4 Issues (2010)
Volume 2: 4 Issues (2009)
Volume 1: 4 Issues (2008)
View Complete Journal Contents Listing