124 research outputs found
Recommended from our members
Fuzzy Image Segmentation using Suppressed Fuzzy C-Means Clustering
Clustering algorithms are highly dependent on the features used and the type of the objects in a particular image. By considering object similar surface variations (SSV) as well as the arbitrariness of the fuzzy c-means (FCM) algorithm for pixellocation, a fuzzy image segmentation considering object surface similarity (FSOS) algorithm was developed, but it was unable to segment objects having SSV satisfactorily. To improve the effectiveness of FSOS in segmenting objects with SSV, thispaper introduces a new fuzzy image segmentation using suppressed fuzzy c-means clustering (FSSC) algorithm, which directly considers object SSV and incorporates the use of suppressed-FCM (SFCM) using pixel location. The algorithmalso perceptually selects the threshold within the range of human visual perception. Both qualitative and quantitative resultsconfirm the improved segmentation performance of FSSC compared with other algorithms including FSOS, FCM,possibilistic c-means (PCM) and SFCM for many different images
Recommended from our members
Automatic Feature Set Selection for Merging Image Segmentation Results Using Fuzzy Clustering
The image segmentation performance of clustering algorithms is highly dependent on the features used and the type of objects contained in the image, which limits the generalization ability of such algorithms. As a consequence, a fuzzy image segmentation using suppressed fuzzy c-means clustering (FSSC) algorithm was proposed that merged the initially segmented regions produced by a fuzzy clustering algorithm, using two different feature sets each comprising two features from pixel location, pixel intensity and a combination of both, which considered objects with similar surface variations (SSV), the arbitrariness of fuzzy c-means (FCM) algorithm using pixel location and the connectedness property of objects. The feature set selection for the initial segmentation in the merging technique was however, inaccurate because it did not consider all possible feature set combinations and also manually defined the threshold used to identify objects having SSV. To overcome these limitations, a new automatic feature set selection for merging image segmentation results using fuzzy clustering (AFMSF) algorithm is proposed, which considers the best feature set selection and also calculates the threshold based upon human visual perception. Both qualitative and quantitative analysis prove the superiority of AFMSF algorithm compared with other clustering techniques including FSSC, FCM, possibilistic c-means (PCM) and SFCM, for different image types
Recommended from our members
Fuzzy image segmentation considering surface characteristics and feature set selection strategy
The image segmentation performance of any clustering algorithm is sensitive to the features used and the types of object in an image, both of which compromise the overall generality of the algorithm. This paper proposes a novel fuzzy image segmentation considering surface characteristics and feature set selection strategy (FISFS) algorithm which addresses these issues. Features that are exploited when the initially segmented results from a clustering algorithm are subsequently merged include connectedness, object surface characteristics and the arbitrariness of the fuzzy c-means (FCM) algorithm for pixel location. A perceptual threshold is also integrated within the region merging strategy. Qualitative and quantitative results are presented, together with a full time-complexity analysis, to confirm the superior performance of FISFS compared with FCM, possibilistic c-means (PCM), and suppressed FCM (SFCM) clustering algorithms, for a wide range of disparate images
An Efficient Fuzzy Possibilistic C-Means with Penalized and Compensated Constraints
Improvement in sensing and storage devices and impressive growth in applications such as Internet search, digital imaging, and video surveillance have generated many high-volume, high-dimensional data. The raise in both the quantity and the kind of data requires improvement in techniques to understand, process and summarize the data. Categorizing data into reasonable groupings is one of the most essential techniques for understanding and learning. This is performed with the help of technique called clustering. This clustering technique is widely helpful in fields such as pattern recognition, image processing, and data analysis. The commonly used clustering technique is K-Means clustering. But this clustering results in misclassification when large data are involved in clustering. To overcome this disadvantage, Fuzzy- Possibilistic C-Means (FPCM) algorithm can be used for clustering. FPCM combines the advantages of Possibilistic C-Means (PCM) algorithm and fuzzy logic. For further improving the performance of clustering, penalized and compensated constraints are used in this paper. Penalized and compensated terms are embedded with the modified fuzzy possibilistic clustering method2019;s objective function to construct the clustering with enhanced performance. The experimental result illustrates the enhanced performance of the proposed clustering technique when compared to the fuzzy possibilistic c-means clustering algorithm
Recommended from our members
Review on Fuzzy Clustering Algorithms
Image segmentation especially fuzzy-based segmentation techniques are widely used due to effective segmentation performance. For this reason, a number of algorithms are proposed in the literature. This paper presents a survey report of different types of classical fuzzy clustering techniques which are available in the literature
Recommended from our members
Fuzzy image segmentation of generic shaped clusters
The segmentation performance of any clustering algorithm is very sensitive to the features in an image, which ultimately restricts their generalisation capability. This limitation was the primary motivation in our investigation into using shape information to improve the generality of these algorithms. Fuzzy shape-based clustering techniques already consider ring and elliptical profiles in segmentation, though most real objects are neither ring nor elliptically shaped. This paper addresses this issue by introducing a new shape-based algorithm called fuzzy image segmentation of generic shaped clusters (FISG) that incorporates generic shape information into the framework of the fuzzy c-means (FCM) algorithm. Both qualitative and quantitative analyses confirm the superiority of FISG compared to other shape-based fuzzy clustering methods including, Gustafson-Kessel algorithm, ring-shaped, circular shell, c-ellipsoidal shells and elliptic ring-shaped clusters. The new algorithm has also been shown to be application independent so it can be applied in areas such as video object plane segmentation in MPEG-4 based coding
Outline of a new feature space deformation approach in fuzzy pattern recognition
Sposobnost prepoznavanja oblika je jedno od najznačajnijih svojstava koja karakterišu inteligentno ponašanje bioloških ili veštačkih sistema. Matematičko prepoznavanje oblika predstavlja formalnu osnovu za rešavanje ovog zadatka primenom precizno forumulisanih algoritama, koji su u najvećem delu bazirni na konvencionalnoj matematici. Kod kompleksnih sistema ovakav pristup pokazuje značajne nedostatke, prvenstveno zbog zahteva za obimnim izračunavanjima i nedovoljne robusnosti. Algoritmi koji su bazirani na 'soft computing' metodama predstavljaju dobru alternativu, otvarajući prostor za razvoj efikasnih algoritama za primenu u realnom vremenu, polazeći od činjenice da značenje sadržaja informacija nosi veću vrednost u odnosu na preciznost. U ovom radu izlaže se modifikacija i proširenje 'Subrtactive Clustering' metode, koja se pokazala efikasnom u obradi masivnih skupova oblika u realnom vremenu. Novi pristup koji je baziran prvenstveno na povezivanju parametara algoritma sa informacionim sadržajem prisutnim u skupu oblika koji se obrađuje, daje dodatne stepene slobode i omogućava da proces prepoznavanja bude vođen podacima koji se obrađuju. Predloženi algoritam je verifikovan velikim brojem simulacionih eksperimenata, od kojih su neki navedeni u ovom radu.Pattern recognition ability is one of the most important features that characterize intelligent behavior of either biological or artificial systems. Mathematical pattern recognition is the way to solve this problem using transparent algorithms that are mostly based on conventional mathematics. In complex systems it shows inadequacy, primary due to the needs for extensive computation and insufficient robustness. Algorithms based on soft computing approach offer a good alternative, giving a room to design effective tools for real-time application, having in mind that relevance (significance) prevails precision in complex systems. In this article is modified and extended subtractive clustering method, which is proven to be effective in real-time applications, when massive pattern sets is processed. The new understanding and new relations that connect parameters of the algorithm with the information underlying the pattern set are established, giving on this way the algorithm ability to be data driven to the maximum extent. Proposed algorithm is verified by a number of experiments and few of them are presented in this article
Outline of a new feature space deformation approach in fuzzy pattern recognition
Sposobnost prepoznavanja oblika je jedno od najznačajnijih svojstava koja karakterišu inteligentno ponašanje bioloških ili veštačkih sistema. Matematičko prepoznavanje oblika predstavlja formalnu osnovu za rešavanje ovog zadatka primenom precizno forumulisanih algoritama, koji su u najvećem delu bazirni na konvencionalnoj matematici. Kod kompleksnih sistema ovakav pristup pokazuje značajne nedostatke, prvenstveno zbog zahteva za obimnim izračunavanjima i nedovoljne robusnosti. Algoritmi koji su bazirani na 'soft computing' metodama predstavljaju dobru alternativu, otvarajući prostor za razvoj efikasnih algoritama za primenu u realnom vremenu, polazeći od činjenice da značenje sadržaja informacija nosi veću vrednost u odnosu na preciznost. U ovom radu izlaže se modifikacija i proširenje 'Subrtactive Clustering' metode, koja se pokazala efikasnom u obradi masivnih skupova oblika u realnom vremenu. Novi pristup koji je baziran prvenstveno na povezivanju parametara algoritma sa informacionim sadržajem prisutnim u skupu oblika koji se obrađuje, daje dodatne stepene slobode i omogućava da proces prepoznavanja bude vođen podacima koji se obrađuju. Predloženi algoritam je verifikovan velikim brojem simulacionih eksperimenata, od kojih su neki navedeni u ovom radu.Pattern recognition ability is one of the most important features that characterize intelligent behavior of either biological or artificial systems. Mathematical pattern recognition is the way to solve this problem using transparent algorithms that are mostly based on conventional mathematics. In complex systems it shows inadequacy, primary due to the needs for extensive computation and insufficient robustness. Algorithms based on soft computing approach offer a good alternative, giving a room to design effective tools for real-time application, having in mind that relevance (significance) prevails precision in complex systems. In this article is modified and extended subtractive clustering method, which is proven to be effective in real-time applications, when massive pattern sets is processed. The new understanding and new relations that connect parameters of the algorithm with the information underlying the pattern set are established, giving on this way the algorithm ability to be data driven to the maximum extent. Proposed algorithm is verified by a number of experiments and few of them are presented in this article
Evaluating student behaviour on the MathE Platform - clustering algorithms approaches
The MathE platform is an online educational platform that aims to help students who struggle to learn college mathematics as well as students who wish to deepen their knowledge on subjects that rely on a strong mathematical background, at their own pace. The MathE platform is currently being used by a significant number of users, from all over the world, as a tool to support and engage students, ensuring new and creative ways to encourage them to improve their mathematical skills. This paper is addressed to evaluate the students’ performance on the Linear Algebra topic, which is a specific topic of the MathE platform. In order to achieve this goal, four clustering algorithms were considered; three of them based on different bio-inspired techniques and the k-means algorithm. The results showed that most students choose to answer only basic level questions, and even within that subset, they make a lot of mistakes. When students take the risk of answering advanced questions, they make even more mistakes, which causes them to return to the basic level questions. Considering these results, it is now necessary to carry out an in-depth study to reorganize the available questions according to other levels of difficulty, and not just between basic and advanced levels as it is.FCT - Fundação para a Ciência e a Tecnologia(2021-1-PT01-KA220-HED-000023288)This work has been supported by FCT Fundação para a Ciência e Tecnologia within the R&D Units Project Scope UIDB/00319/2020 and UIDB/05757/2020. Beatriz Flamia Azevedo is supported by FCT Grant Reference SFRH/BD/07427/202
- …