Digital watermarking must balance imperceptibility,robustness,complexity,and security.To address the challenge of computational efficiency in trellis-based informed embedding,we propose a modified watermarking framewo...Digital watermarking must balance imperceptibility,robustness,complexity,and security.To address the challenge of computational efficiency in trellis-based informed embedding,we propose a modified watermarking framework that integrates fuzzy c-means(FCM)clustering into the generation off block codewords for labeling trellis arcs.The system incorporates a parallel trellis structure,controllable embedding parameters,and a novel informed embedding algorithm with reduced complexity.Two types of embedding schemes—memoryless and memory-based—are designed to flexibly trade-off between imperceptibility and robustness.Experimental results demonstrate that the proposed method outperforms existing approaches in bit error rate(BER)and computational complexity under various attacks,including additive noise,filtering,JPEG compression,cropping,and rotation.The integration of FCM enhances robustness by increasing the codeword distance,while preserving perceptual quality.Overall,the proposed framework is suitable for real-time and secure watermarking applications.展开更多
Intuitionistic fuzzy sets(IFSs) are useful means to describe and deal with vague and uncertain data.An intuitionistic fuzzy C-means algorithm to cluster IFSs is developed.In each stage of the intuitionistic fuzzy C-me...Intuitionistic fuzzy sets(IFSs) are useful means to describe and deal with vague and uncertain data.An intuitionistic fuzzy C-means algorithm to cluster IFSs is developed.In each stage of the intuitionistic fuzzy C-means method the seeds are modified,and for each IFS a membership degree to each of the clusters is estimated.In the end of the algorithm,all the given IFSs are clustered according to the estimated membership degrees.Furthermore,the algorithm is extended for clustering interval-valued intuitionistic fuzzy sets(IVIFSs).Finally,the developed algorithms are illustrated through conducting experiments on both the real-world and simulated data sets.展开更多
To guarantee safe and efficient tunneling of a tunnel boring machine(TBM),rapid and accurate judgment of the rock mass condition is essential.Based on fuzzy C-means clustering,this paper proposes a grouped machine lea...To guarantee safe and efficient tunneling of a tunnel boring machine(TBM),rapid and accurate judgment of the rock mass condition is essential.Based on fuzzy C-means clustering,this paper proposes a grouped machine learning method for predicting rock mass parameters.An elaborate data set on field rock mass is collected,which also matches field TBM tunneling.Meanwhile,target stratum samples are divided into several clusters by fuzzy C-means clustering,and multiple submodels are trained by samples in different clusters with the input of pretreated TBM tunneling data and the output of rock mass parameter data.Each testing sample or newly encountered tunneling condition can be predicted by multiple submodels with the weight of the membership degree of the sample to each cluster.The proposed method has been realized by 100 training samples and verified by 30 testing samples collected from the C1 part of the Pearl Delta water resources allocation project.The average percentage error of uniaxial compressive strength and joint frequency(Jf)of the 30 testing samples predicted by the pure back propagation(BP)neural network is 13.62%and 12.38%,while that predicted by the BP neural network combined with fuzzy C-means is 7.66%and6.40%,respectively.In addition,by combining fuzzy C-means clustering,the prediction accuracies of support vector regression and random forest are also improved to different degrees,which demonstrates that fuzzy C-means clustering is helpful for improving the prediction accuracy of machine learning and thus has good applicability.Accordingly,the proposed method is valuable for predicting rock mass parameters during TBM tunneling.展开更多
Suppressed fuzzy c-means (S-FCM) clustering algorithm with the intention of combining the higher speed of hard c-means clustering algorithm and the better classification performance of fuzzy c-means clustering algorit...Suppressed fuzzy c-means (S-FCM) clustering algorithm with the intention of combining the higher speed of hard c-means clustering algorithm and the better classification performance of fuzzy c-means clustering algorithm had been studied by many researchers and applied in many fields. In the algorithm, how to select the suppressed rate is a key step. In this paper, we give a method to select the fixed suppressed rate by the structure of the data itself. The experimental results show that the proposed method is a suitable way to select the suppressed rate in suppressed fuzzy c-means clustering algorithm.展开更多
For the question that fuzzy c-means(FCM)clustering algorithm has the disadvantages of being too sensitive to the initial cluster centers and easily trapped in local optima,this paper introduces a new metric norm in FC...For the question that fuzzy c-means(FCM)clustering algorithm has the disadvantages of being too sensitive to the initial cluster centers and easily trapped in local optima,this paper introduces a new metric norm in FCM and particle swarm optimization(PSO)clustering algorithm,and proposes a parallel optimization algorithm using an improved fuzzy c-means method combined with particle swarm optimization(AF-APSO).The experiment shows that the AF-APSO can avoid local optima,and get the best fitness and clustering performance significantly.展开更多
This paper presents an advanced fuzzy C-means(FCM) clustering algorithm to overcome the weakness of the traditional FCM algorithm, including the instability of random selecting of initial center and the limitation of ...This paper presents an advanced fuzzy C-means(FCM) clustering algorithm to overcome the weakness of the traditional FCM algorithm, including the instability of random selecting of initial center and the limitation of the data separation or the size of clusters. The advanced FCM algorithm combines the distance with density and improves the objective function so that the performance of the algorithm can be improved. The experimental results show that the proposed FCM algorithm requires fewer iterations yet provides higher accuracy than the traditional FCM algorithm. The advanced algorithm is applied to the influence of stars' box-office data, and the classification accuracy of the first class stars achieves 92.625%.展开更多
To solve the problem of poor anti-noise performance of the traditional fuzzy C-means (FCM) algorithm in image segmentation, a novel two-dimensional FCM clustering algorithm for image segmentation was proposed. In this...To solve the problem of poor anti-noise performance of the traditional fuzzy C-means (FCM) algorithm in image segmentation, a novel two-dimensional FCM clustering algorithm for image segmentation was proposed. In this method, the image segmentation was converted into an optimization problem. The fitness function containing neighbor information was set up based on the gray information and the neighbor relations between the pixels described by the improved two-dimensional histogram. By making use of the global searching ability of the predator-prey particle swarm optimization, the optimal cluster center could be obtained by iterative optimization, and the image segmentation could be accomplished. The simulation results show that the segmentation accuracy ratio of the proposed method is above 99%. The proposed algorithm has strong anti-noise capability, high clustering accuracy and good segment effect, indicating that it is an effective algorithm for image segmentation.展开更多
The S/N of an underwater image is low and has a fuzzy edge.If using traditional methods to process it directly,the result is not satisfying.Though the traditional fuzzy C-means algorithm can sometimes divide the image...The S/N of an underwater image is low and has a fuzzy edge.If using traditional methods to process it directly,the result is not satisfying.Though the traditional fuzzy C-means algorithm can sometimes divide the image into object and background,its time-consuming computation is often an obstacle.The mission of the vision system of an autonomous underwater vehicle (AUV) is to rapidly and exactly deal with the information about the object in a complex environment for the AUV to use the obtained result to execute the next task.So,by using the statistical characteristics of the gray image histogram,a fast and effective fuzzy C-means underwater image segmentation algorithm was presented.With the weighted histogram modifying the fuzzy membership,the above algorithm can not only cut down on a large amount of data processing and storage during the computation process compared with the traditional algorithm,so as to speed up the efficiency of the segmentation,but also improve the quality of underwater image segmentation.Finally,particle swarm optimization (PSO) described by the sine function was introduced to the algorithm mentioned above.It made up for the shortcomings that the FCM algorithm can not get the global optimal solution.Thus,on the one hand,it considers the global impact and achieves the local optimal solution,and on the other hand,further greatly increases the computing speed.Experimental results indicate that the novel algorithm can reach a better segmentation quality and the processing time of each image is reduced.They enhance efficiency and satisfy the requirements of a highly effective,real-time AUV.展开更多
Aimed at the problem that the traditional suppressed fuzzy C-means clustering algorithms ignore the real needs of different objects, applying the same suppressed parameter for modifying membership degrees of all the o...Aimed at the problem that the traditional suppressed fuzzy C-means clustering algorithms ignore the real needs of different objects, applying the same suppressed parameter for modifying membership degrees of all the objects, a novel partition region-based suppressed fuzzy C-means clustering algorithm with better capacity of adaptability and robustness is proposed in this paper. The model based on the real needs of different objects is built, making it clear to decide whether to proceed with further determination; in addition, the external user-defined suppressed parameter is automatically selected according to the intrinsic structural characteristic of each dataset, making the proposed method become robust to the fluctuations in the incoming dataset and initial conditions. Experimental results show that the proposed method is more robust than its counterparts and overcomes the weakness of the original suppressed clustering algorithm in most cases.展开更多
Fingerprint segmentation is a crucial step in fingerprint recognition system, and determines the results of fingerprint analysis and recognition. This paper proposes an efficient approach for fingerprint segmentation ...Fingerprint segmentation is a crucial step in fingerprint recognition system, and determines the results of fingerprint analysis and recognition. This paper proposes an efficient approach for fingerprint segmentation based on modified fuzzy c-means (FCM). The proposed method is realized by modifying the objective function in the Szilagyi’s algorithm via introducing histogram-based weight. Experimental results show that the proposed approach has an efficient performance while segmenting both original fingerprint image and fingerprint images corrupted by different type of noises.展开更多
Fuzzy C-Means(FCM)is an effective and widely used clustering algorithm,but there are still some problems.considering the number of clusters must be determined manually,the local optimal solutions is easily influenced ...Fuzzy C-Means(FCM)is an effective and widely used clustering algorithm,but there are still some problems.considering the number of clusters must be determined manually,the local optimal solutions is easily influenced by the random selection of initial cluster centers,and the performance of Euclid distance in complex high-dimensional data is poor.To solve the above problems,the improved FCM clustering algorithm based on density Canopy and Manifold learning(DM-FCM)is proposed.First,a density Canopy algorithm based on improved local density is proposed to automatically deter-mine the number of clusters and initial cluster centers,which improves the self-adaptability and stability of the algorithm.Then,considering that high-dimensional data often present a nonlinear structure,the manifold learning method is applied to construct a manifold spatial structure,which preserves the global geometric properties of complex high-dimensional data and improves the clustering effect of the algorithm on complex high-dimensional datasets.Fowlkes-Mallows Index(FMI),the weighted average of homogeneity and completeness(V-measure),Adjusted Mutual Information(AMI),and Adjusted Rand Index(ARI)are used as performance measures of clustering algorithms.The experimental results show that the manifold learning method is the superior distance measure,and the algorithm improves the clustering accuracy and performs superiorly in the clustering of low-dimensional and complex high-dimensional data.展开更多
In this paper, we propose new fuzzy c-means method for improving the magnetic resonance imaging (MRI) segmenta- tion. The proposed method called “possiblistic fuzzy c-means (PFCM)” which hybrids the fuzzy c-means (F...In this paper, we propose new fuzzy c-means method for improving the magnetic resonance imaging (MRI) segmenta- tion. The proposed method called “possiblistic fuzzy c-means (PFCM)” which hybrids the fuzzy c-means (FCM) and possiblistic c-means (PCM) functions. It is realized by modifying the objective function of the conventional PCM algorithm with Gaussian exponent weights to produce memberships and possibilities simultaneously, along with the usual point prototypes or cluster centers for each cluster. The membership values can be interpreted as degrees of possibility of the points belonging to the classes, i.e., the compatibilities of the points with the class prototypes. For that, the proposed algorithm is capable to avoid various problems of existing fuzzy clustering methods that solve the defect of noise sensitivity and overcomes the coincident clusters problem of PCM. The efficiency of the proposed algorithm is demonstrated by extensive segmentation experiments by applying them to the challenging applications: gray matter/white matter segmentation in magnetic resonance image (MRI) datasets and by comparison with other state of the art algorithms. The experimental results show that the proposed method produces accurate and stable results.展开更多
Biometrics represents the technology for measuring the characteristics of the human body.Biometric authentication currently allows for secure,easy,and fast access by recognizing a person based on facial,voice,and fing...Biometrics represents the technology for measuring the characteristics of the human body.Biometric authentication currently allows for secure,easy,and fast access by recognizing a person based on facial,voice,and fingerprint traits.Iris authentication is one of the essential biometric methods for identifying a person.This authentication type has become popular in research and practical applications.Unlike the face and hands,the iris is an internal organ,protected and therefore less likely to be damaged.However,the number of helpful information collected from the iris is much greater than the other biometric human organs.This work proposes a new iris identification model based on a multilevel thresholding technique and modified Fuzzy cmeans algorithm.The multilevel thresholding technique extracts the iris from its surroundings,such as specular reflections,eyelashes,pupils,and sclera.On the other hand,the modified Fuzzy c-means is used to combine and classify the most useful statistical features to maximize the accuracy of the collected information.Therefore,having the most optimal iris recognition.The proposed model results are validated using True Success Rate(TSR)and compared to other existing models.The results show how effective the combination of the two stages of the proposed model is:the Otsu method and modified Fuzzy c-means for the 400 tested images representing 40 people.展开更多
Classifying the data into a meaningful group is one of the fundamental ways of understanding and learning the valuable information. High-quality clustering methods are necessary for the valuable and efficient analysis...Classifying the data into a meaningful group is one of the fundamental ways of understanding and learning the valuable information. High-quality clustering methods are necessary for the valuable and efficient analysis of the increasing data. The Firefly Algorithm (FA) is one of the bio-inspired algorithms and it is recently used to solve the clustering problems. In this paper, Hybrid F-Firefly algorithm is developed by combining the Fuzzy C-Means (FCM) with FA to improve the clustering accuracy with global optimum solution. The Hybrid F-Firefly algorithm is developed by incorporating FCM operator at the end of each iteration in FA algorithm. This proposed algorithm is designed to utilize the goodness of existing algorithm and to enhance the original FA algorithm by solving the shortcomings in the FCM algorithm like the trapping in local optima and sensitive to initial seed points. In this research work, the Hybrid F-Firefly algorithm is implemented and experimentally tested for various performance measures under six different benchmark datasets. From the experimental results, it is observed that the Hybrid F-Firefly algorithm significantly improves the intra-cluster distance when compared with the existing algorithms like K-means, FCM and FA algorithm.展开更多
To improve the accuracy of text clustering, fuzzy c-means clustering based on topic concept sub-space （TCS2FCM） is introduced for classifying texts. Five evaluation functions are combined to extract key phrases. Con...To improve the accuracy of text clustering, fuzzy c-means clustering based on topic concept sub-space （TCS2FCM） is introduced for classifying texts. Five evaluation functions are combined to extract key phrases. Concept phrases, as well as the descriptions of final clusters, are presented using WordNet origin from key phrases. Initial centers and membership matrix are the most important factors affecting clustering performance. Orthogonal concept topic sub-spaces are built with the topic concept phrases representing topics of the texts and the initialization of centers and the membership matrix depend on the concept vectors in sub-spaces. The results show that, different from random initialization of traditional fuzzy c-means clustering, the initialization related to text content contributions can improve clustering precision.展开更多
A novel model of fuzzy clustering, i.e. an allied fuzzy c means （AFCM） model is proposed based on the combination of advantages of fuzzy c means （FCM） and possibilistic c means （PCM） clustering. PCM is sensitive...A novel model of fuzzy clustering, i.e. an allied fuzzy c means （AFCM） model is proposed based on the combination of advantages of fuzzy c means （FCM） and possibilistic c means （PCM） clustering. PCM is sensitive to initializations and often generates coincident clusters. AFCM overcomes this shortcoming and it is an ex tension of PCM. Membership and typicality values can be simultaneously produced in AFCM. Experimental re- suits show that noise data can be well processed, coincident clusters are avoided and clustering accuracy is better.展开更多
基金funded by the National Science and Technology Council,Taiwan,under grant number NSTC 114-2221-E-167-005-MY3,and NSTC 113-2221-E-167-006-.
文摘Digital watermarking must balance imperceptibility,robustness,complexity,and security.To address the challenge of computational efficiency in trellis-based informed embedding,we propose a modified watermarking framework that integrates fuzzy c-means(FCM)clustering into the generation off block codewords for labeling trellis arcs.The system incorporates a parallel trellis structure,controllable embedding parameters,and a novel informed embedding algorithm with reduced complexity.Two types of embedding schemes—memoryless and memory-based—are designed to flexibly trade-off between imperceptibility and robustness.Experimental results demonstrate that the proposed method outperforms existing approaches in bit error rate(BER)and computational complexity under various attacks,including additive noise,filtering,JPEG compression,cropping,and rotation.The integration of FCM enhances robustness by increasing the codeword distance,while preserving perceptual quality.Overall,the proposed framework is suitable for real-time and secure watermarking applications.
基金supported by the National Natural Science Foundation of China for Distinguished Young Scholars(70625005)
文摘Intuitionistic fuzzy sets(IFSs) are useful means to describe and deal with vague and uncertain data.An intuitionistic fuzzy C-means algorithm to cluster IFSs is developed.In each stage of the intuitionistic fuzzy C-means method the seeds are modified,and for each IFS a membership degree to each of the clusters is estimated.In the end of the algorithm,all the given IFSs are clustered according to the estimated membership degrees.Furthermore,the algorithm is extended for clustering interval-valued intuitionistic fuzzy sets(IVIFSs).Finally,the developed algorithms are illustrated through conducting experiments on both the real-world and simulated data sets.
基金Natural Science Foundation of Shandong Province,Grant/Award Number:ZR202103010903Doctoral Fund of Shandong Jianzhu University,Grant/Award Number:X21101Z。
文摘To guarantee safe and efficient tunneling of a tunnel boring machine(TBM),rapid and accurate judgment of the rock mass condition is essential.Based on fuzzy C-means clustering,this paper proposes a grouped machine learning method for predicting rock mass parameters.An elaborate data set on field rock mass is collected,which also matches field TBM tunneling.Meanwhile,target stratum samples are divided into several clusters by fuzzy C-means clustering,and multiple submodels are trained by samples in different clusters with the input of pretreated TBM tunneling data and the output of rock mass parameter data.Each testing sample or newly encountered tunneling condition can be predicted by multiple submodels with the weight of the membership degree of the sample to each cluster.The proposed method has been realized by 100 training samples and verified by 30 testing samples collected from the C1 part of the Pearl Delta water resources allocation project.The average percentage error of uniaxial compressive strength and joint frequency(Jf)of the 30 testing samples predicted by the pure back propagation(BP)neural network is 13.62%and 12.38%,while that predicted by the BP neural network combined with fuzzy C-means is 7.66%and6.40%,respectively.In addition,by combining fuzzy C-means clustering,the prediction accuracies of support vector regression and random forest are also improved to different degrees,which demonstrates that fuzzy C-means clustering is helpful for improving the prediction accuracy of machine learning and thus has good applicability.Accordingly,the proposed method is valuable for predicting rock mass parameters during TBM tunneling.
文摘Suppressed fuzzy c-means (S-FCM) clustering algorithm with the intention of combining the higher speed of hard c-means clustering algorithm and the better classification performance of fuzzy c-means clustering algorithm had been studied by many researchers and applied in many fields. In the algorithm, how to select the suppressed rate is a key step. In this paper, we give a method to select the fixed suppressed rate by the structure of the data itself. The experimental results show that the proposed method is a suitable way to select the suppressed rate in suppressed fuzzy c-means clustering algorithm.
基金the China Agriculture Research System(No.CARS-49)Jiangsu College of Humanities and Social Sciences Outside Campus Research Base & Chinese Development of Strategic Research Base for Internet of Things
文摘For the question that fuzzy c-means(FCM)clustering algorithm has the disadvantages of being too sensitive to the initial cluster centers and easily trapped in local optima,this paper introduces a new metric norm in FCM and particle swarm optimization(PSO)clustering algorithm,and proposes a parallel optimization algorithm using an improved fuzzy c-means method combined with particle swarm optimization(AF-APSO).The experiment shows that the AF-APSO can avoid local optima,and get the best fitness and clustering performance significantly.
文摘This paper presents an advanced fuzzy C-means(FCM) clustering algorithm to overcome the weakness of the traditional FCM algorithm, including the instability of random selecting of initial center and the limitation of the data separation or the size of clusters. The advanced FCM algorithm combines the distance with density and improves the objective function so that the performance of the algorithm can be improved. The experimental results show that the proposed FCM algorithm requires fewer iterations yet provides higher accuracy than the traditional FCM algorithm. The advanced algorithm is applied to the influence of stars' box-office data, and the classification accuracy of the first class stars achieves 92.625%.
基金Project(06JJ50110) supported by the Natural Science Foundation of Hunan Province, China
文摘To solve the problem of poor anti-noise performance of the traditional fuzzy C-means (FCM) algorithm in image segmentation, a novel two-dimensional FCM clustering algorithm for image segmentation was proposed. In this method, the image segmentation was converted into an optimization problem. The fitness function containing neighbor information was set up based on the gray information and the neighbor relations between the pixels described by the improved two-dimensional histogram. By making use of the global searching ability of the predator-prey particle swarm optimization, the optimal cluster center could be obtained by iterative optimization, and the image segmentation could be accomplished. The simulation results show that the segmentation accuracy ratio of the proposed method is above 99%. The proposed algorithm has strong anti-noise capability, high clustering accuracy and good segment effect, indicating that it is an effective algorithm for image segmentation.
基金Supported by the National Natural Science Foundation of China under Grant No.50909025/E091002the Open Research Foundation of SKLab AUV, HEU under Grant No.2008003
文摘The S/N of an underwater image is low and has a fuzzy edge.If using traditional methods to process it directly,the result is not satisfying.Though the traditional fuzzy C-means algorithm can sometimes divide the image into object and background,its time-consuming computation is often an obstacle.The mission of the vision system of an autonomous underwater vehicle (AUV) is to rapidly and exactly deal with the information about the object in a complex environment for the AUV to use the obtained result to execute the next task.So,by using the statistical characteristics of the gray image histogram,a fast and effective fuzzy C-means underwater image segmentation algorithm was presented.With the weighted histogram modifying the fuzzy membership,the above algorithm can not only cut down on a large amount of data processing and storage during the computation process compared with the traditional algorithm,so as to speed up the efficiency of the segmentation,but also improve the quality of underwater image segmentation.Finally,particle swarm optimization (PSO) described by the sine function was introduced to the algorithm mentioned above.It made up for the shortcomings that the FCM algorithm can not get the global optimal solution.Thus,on the one hand,it considers the global impact and achieves the local optimal solution,and on the other hand,further greatly increases the computing speed.Experimental results indicate that the novel algorithm can reach a better segmentation quality and the processing time of each image is reduced.They enhance efficiency and satisfy the requirements of a highly effective,real-time AUV.
基金supported by the National Natural Science Foundation of China(61401363)the Science and Technology on Avionics Integration Laboratory and Aeronautical Science Foundation(20155153034)+1 种基金the Fundamental Research Funds for the Central Universities(3102016AXXX0053102015BJJGZ009)
文摘Aimed at the problem that the traditional suppressed fuzzy C-means clustering algorithms ignore the real needs of different objects, applying the same suppressed parameter for modifying membership degrees of all the objects, a novel partition region-based suppressed fuzzy C-means clustering algorithm with better capacity of adaptability and robustness is proposed in this paper. The model based on the real needs of different objects is built, making it clear to decide whether to proceed with further determination; in addition, the external user-defined suppressed parameter is automatically selected according to the intrinsic structural characteristic of each dataset, making the proposed method become robust to the fluctuations in the incoming dataset and initial conditions. Experimental results show that the proposed method is more robust than its counterparts and overcomes the weakness of the original suppressed clustering algorithm in most cases.
文摘Fingerprint segmentation is a crucial step in fingerprint recognition system, and determines the results of fingerprint analysis and recognition. This paper proposes an efficient approach for fingerprint segmentation based on modified fuzzy c-means (FCM). The proposed method is realized by modifying the objective function in the Szilagyi’s algorithm via introducing histogram-based weight. Experimental results show that the proposed approach has an efficient performance while segmenting both original fingerprint image and fingerprint images corrupted by different type of noises.
基金The National Natural Science Foundation of China(No.62262011)the Natural Science Foundation of Guangxi(No.2021JJA170130).
文摘Fuzzy C-Means(FCM)is an effective and widely used clustering algorithm,but there are still some problems.considering the number of clusters must be determined manually,the local optimal solutions is easily influenced by the random selection of initial cluster centers,and the performance of Euclid distance in complex high-dimensional data is poor.To solve the above problems,the improved FCM clustering algorithm based on density Canopy and Manifold learning(DM-FCM)is proposed.First,a density Canopy algorithm based on improved local density is proposed to automatically deter-mine the number of clusters and initial cluster centers,which improves the self-adaptability and stability of the algorithm.Then,considering that high-dimensional data often present a nonlinear structure,the manifold learning method is applied to construct a manifold spatial structure,which preserves the global geometric properties of complex high-dimensional data and improves the clustering effect of the algorithm on complex high-dimensional datasets.Fowlkes-Mallows Index(FMI),the weighted average of homogeneity and completeness(V-measure),Adjusted Mutual Information(AMI),and Adjusted Rand Index(ARI)are used as performance measures of clustering algorithms.The experimental results show that the manifold learning method is the superior distance measure,and the algorithm improves the clustering accuracy and performs superiorly in the clustering of low-dimensional and complex high-dimensional data.
文摘In this paper, we propose new fuzzy c-means method for improving the magnetic resonance imaging (MRI) segmenta- tion. The proposed method called “possiblistic fuzzy c-means (PFCM)” which hybrids the fuzzy c-means (FCM) and possiblistic c-means (PCM) functions. It is realized by modifying the objective function of the conventional PCM algorithm with Gaussian exponent weights to produce memberships and possibilities simultaneously, along with the usual point prototypes or cluster centers for each cluster. The membership values can be interpreted as degrees of possibility of the points belonging to the classes, i.e., the compatibilities of the points with the class prototypes. For that, the proposed algorithm is capable to avoid various problems of existing fuzzy clustering methods that solve the defect of noise sensitivity and overcomes the coincident clusters problem of PCM. The efficiency of the proposed algorithm is demonstrated by extensive segmentation experiments by applying them to the challenging applications: gray matter/white matter segmentation in magnetic resonance image (MRI) datasets and by comparison with other state of the art algorithms. The experimental results show that the proposed method produces accurate and stable results.
基金This research is supported by the faculty of computers and information Technology and the Industrial Innovation and Robotics Center,University of Tabuk.
文摘Biometrics represents the technology for measuring the characteristics of the human body.Biometric authentication currently allows for secure,easy,and fast access by recognizing a person based on facial,voice,and fingerprint traits.Iris authentication is one of the essential biometric methods for identifying a person.This authentication type has become popular in research and practical applications.Unlike the face and hands,the iris is an internal organ,protected and therefore less likely to be damaged.However,the number of helpful information collected from the iris is much greater than the other biometric human organs.This work proposes a new iris identification model based on a multilevel thresholding technique and modified Fuzzy cmeans algorithm.The multilevel thresholding technique extracts the iris from its surroundings,such as specular reflections,eyelashes,pupils,and sclera.On the other hand,the modified Fuzzy c-means is used to combine and classify the most useful statistical features to maximize the accuracy of the collected information.Therefore,having the most optimal iris recognition.The proposed model results are validated using True Success Rate(TSR)and compared to other existing models.The results show how effective the combination of the two stages of the proposed model is:the Otsu method and modified Fuzzy c-means for the 400 tested images representing 40 people.
文摘Classifying the data into a meaningful group is one of the fundamental ways of understanding and learning the valuable information. High-quality clustering methods are necessary for the valuable and efficient analysis of the increasing data. The Firefly Algorithm (FA) is one of the bio-inspired algorithms and it is recently used to solve the clustering problems. In this paper, Hybrid F-Firefly algorithm is developed by combining the Fuzzy C-Means (FCM) with FA to improve the clustering accuracy with global optimum solution. The Hybrid F-Firefly algorithm is developed by incorporating FCM operator at the end of each iteration in FA algorithm. This proposed algorithm is designed to utilize the goodness of existing algorithm and to enhance the original FA algorithm by solving the shortcomings in the FCM algorithm like the trapping in local optima and sensitive to initial seed points. In this research work, the Hybrid F-Firefly algorithm is implemented and experimentally tested for various performance measures under six different benchmark datasets. From the experimental results, it is observed that the Hybrid F-Firefly algorithm significantly improves the intra-cluster distance when compared with the existing algorithms like K-means, FCM and FA algorithm.
基金The National Natural Science Foundation of China(No60672056)Open Fund of MOE-MS Key Laboratory of Multime-dia Computing and Communication(No06120809)
文摘To improve the accuracy of text clustering, fuzzy c-means clustering based on topic concept sub-space （TCS2FCM） is introduced for classifying texts. Five evaluation functions are combined to extract key phrases. Concept phrases, as well as the descriptions of final clusters, are presented using WordNet origin from key phrases. Initial centers and membership matrix are the most important factors affecting clustering performance. Orthogonal concept topic sub-spaces are built with the topic concept phrases representing topics of the texts and the initialization of centers and the membership matrix depend on the concept vectors in sub-spaces. The results show that, different from random initialization of traditional fuzzy c-means clustering, the initialization related to text content contributions can improve clustering precision.
文摘A novel model of fuzzy clustering, i.e. an allied fuzzy c means （AFCM） model is proposed based on the combination of advantages of fuzzy c means （FCM） and possibilistic c means （PCM） clustering. PCM is sensitive to initializations and often generates coincident clusters. AFCM overcomes this shortcoming and it is an ex tension of PCM. Membership and typicality values can be simultaneously produced in AFCM. Experimental re- suits show that noise data can be well processed, coincident clusters are avoided and clustering accuracy is better.
