Graph-theoretical approaches have been widely used for data clustering and image segmentation recently. The goal of data clustering is to discover the underlying distribution and structural information of the given da...Graph-theoretical approaches have been widely used for data clustering and image segmentation recently. The goal of data clustering is to discover the underlying distribution and structural information of the given data, while image segmentation is to partition an image into several non-overlapping regions. Therefore, two popular graph-theoretical clustering methods are analyzed, including the directed tree based data clustering and the minimum spanning tree based image segmentation. There are two contributions： （1） To improve the directed tree based data clustering for image segmentation, （2） To improve the minimum spanning tree based image segmentation for data clustering. The extensive experiments using artificial and real-world data indicate that the improved directed tree based image segmentation can partition images well by preserving enough details, and the improved minimum spanning tree based data clustering can well cluster data in manifold structure.展开更多
One of the most important problems of clustering is to define the number of classes. In fact, it is not easy to find an appropriate method to measure whether the cluster configuration is acceptable or not. In this pap...One of the most important problems of clustering is to define the number of classes. In fact, it is not easy to find an appropriate method to measure whether the cluster configuration is acceptable or not. In this paper we propose a possible and non-automatic solution considering different criteria of clustering and comparing their results. In this way robust structures of an analyzed dataset can be often caught （or established） and an optimal cluster configuration, which presents a meaningful association, may be defined. In particular, we also focus on the variables which may be used in cluster analysis. In fact, variables which contain little clustering information can cause misleading and not-robustness results. Therefore, three algorithms are employed in this study： K-means partitioning methods, Partitioning Around Medoids （PAM） and the Heuristic Identification of Noisy Variables （HINoV）. The results are compared with robust methods ones.展开更多
A novel moving objects segmentation method is proposed in this paper. A modified three dimensional recursive search （3DRS） algorithm is used in order to obtain motion information accurately. A motion feature descrip...A novel moving objects segmentation method is proposed in this paper. A modified three dimensional recursive search （3DRS） algorithm is used in order to obtain motion information accurately. A motion feature descriptor （MFD） is designed to describe motion feature of each block in a picture based on motion intensity, motion in occlusion areas, and motion correlation among neighbouring blocks. Then, a fuzzy C-means clustering algorithm （FCM） is implemented based on those MFDs so as to segment moving objects. Moreover, a new parameter named as gathering degree is used to distinguish foreground moving objects and background motion. Experimental results demonstrate the effectiveness of the proposed method.展开更多
Previously we have designed and implemented new image browsing facilities to support effective offiine image contents on mobile devices with limited capabilities： low bandwidth, small display, and slow processing. In...Previously we have designed and implemented new image browsing facilities to support effective offiine image contents on mobile devices with limited capabilities： low bandwidth, small display, and slow processing. In this letter, we fulfill the automatic production of cartoon contents fitting small-screen display, and introduce a clustering method useful for various types of cartoon images as a prerequisite stage for preserving semantic meaning. The usage of neural networks is to properly cut the various forms of pages. Texture information that is useful for grayscale image segmentation gives us a good clue for page layout analysis using the multilayer perceptron （MLP） based x-y recursive algorithm. We also automatically frame the segment MLP using agglomerative segmentation. Our experimental results show that the combined approaches yield good results of segmentation for several cartoons.展开更多
基金Supported by the Key National Natural Science Foundation of China(61035003)~~
文摘Graph-theoretical approaches have been widely used for data clustering and image segmentation recently. The goal of data clustering is to discover the underlying distribution and structural information of the given data, while image segmentation is to partition an image into several non-overlapping regions. Therefore, two popular graph-theoretical clustering methods are analyzed, including the directed tree based data clustering and the minimum spanning tree based image segmentation. There are two contributions： （1） To improve the directed tree based data clustering for image segmentation, （2） To improve the minimum spanning tree based image segmentation for data clustering. The extensive experiments using artificial and real-world data indicate that the improved directed tree based image segmentation can partition images well by preserving enough details, and the improved minimum spanning tree based data clustering can well cluster data in manifold structure.
文摘One of the most important problems of clustering is to define the number of classes. In fact, it is not easy to find an appropriate method to measure whether the cluster configuration is acceptable or not. In this paper we propose a possible and non-automatic solution considering different criteria of clustering and comparing their results. In this way robust structures of an analyzed dataset can be often caught （or established） and an optimal cluster configuration, which presents a meaningful association, may be defined. In particular, we also focus on the variables which may be used in cluster analysis. In fact, variables which contain little clustering information can cause misleading and not-robustness results. Therefore, three algorithms are employed in this study： K-means partitioning methods, Partitioning Around Medoids （PAM） and the Heuristic Identification of Noisy Variables （HINoV）. The results are compared with robust methods ones.
基金Supported by the National Natural Science Foundation of China （No. 60772134, 60902081, 60902052） the 111 Project （No.B08038） the Fundamental Research Funds for the Central Universities（No.72105457）.
文摘A novel moving objects segmentation method is proposed in this paper. A modified three dimensional recursive search （3DRS） algorithm is used in order to obtain motion information accurately. A motion feature descriptor （MFD） is designed to describe motion feature of each block in a picture based on motion intensity, motion in occlusion areas, and motion correlation among neighbouring blocks. Then, a fuzzy C-means clustering algorithm （FCM） is implemented based on those MFDs so as to segment moving objects. Moreover, a new parameter named as gathering degree is used to distinguish foreground moving objects and background motion. Experimental results demonstrate the effectiveness of the proposed method.
基金Project partially supported by the Ministry of Knowledge Economy (MKE) of Korea under the Information Technology Research Center (ITRC) Support Programthe Basic Research Program of the Korea Science (No. R01-2006-000-11214-0)
文摘Previously we have designed and implemented new image browsing facilities to support effective offiine image contents on mobile devices with limited capabilities： low bandwidth, small display, and slow processing. In this letter, we fulfill the automatic production of cartoon contents fitting small-screen display, and introduce a clustering method useful for various types of cartoon images as a prerequisite stage for preserving semantic meaning. The usage of neural networks is to properly cut the various forms of pages. Texture information that is useful for grayscale image segmentation gives us a good clue for page layout analysis using the multilayer perceptron （MLP） based x-y recursive algorithm. We also automatically frame the segment MLP using agglomerative segmentation. Our experimental results show that the combined approaches yield good results of segmentation for several cartoons.
