Semi-supervised cross-entropy clustering with information bottleneck constraint

In this paper, we propose a semi-supervised clustering method, CEC-IB, that models data with a set of Gaussian distributions and that retrieves clusters based on a partial labeling provided by the user (partition-level side information). By combining the ideas from cross-entropy clustering (CEC) with those from the information bottleneck method (IB), our method trades between three conflicting goals: the accuracy with which the data set is modeled, the simplicity of the model, and the consistency of the clustering with side information. Experiments demonstrate that CEC-IB has a performance comparable to Gaussian mixture models (GMM) in a classical semi-supervised scenario, but is faster, more robust to noisy labels, automatically determines the optimal number of clusters, and performs well when not all classes are present in the side information. Moreover, in contrast to other semi-supervised models, it can be successfully applied in discovering natural subgroups if the partition-level side information is derived from the top levels of a hierarchical clustering

Spatial Kernel-based Generalized C-mean Clustering for Medical Image Segmentation.

Segmentasi imej merupakan salah satu tugas penting yang telah dibangunkan secara pesat sejak beberapa dekad yang lalu. Image segmentation is one of the important tasks that has been rapidly develop in pass few decades

Visual-hint Boundary to Segment Algorithm for Image Segmentation

Image segmentation has been a very active research topic in image analysis area. Currently, most of the image segmentation algorithms are designed based on the idea that images are partitioned into a set of regions preserving homogeneous intra-regions and inhomogeneous inter-regions. However, human visual intuition does not always follow this pattern. A new image segmentation method named Visual-Hint Boundary to Segment (VHBS) is introduced, which is more consistent with human perceptions. VHBS abides by two visual hint rules based on human perceptions: (i) the global scale boundaries tend to be the real boundaries of the objects; (ii) two adjacent regions with quite different colors or textures tend to result in the real boundaries between them. It has been demonstrated by experiments that, compared with traditional image segmentation method, VHBS has better performance and also preserves higher computational efficiency.Comment: 45 page

Adaptive smoothness constraint image multilevel fuzzy enhancement algorithm

For the problems of poor enhancement effect and long time consuming of the traditional algorithm, an adaptive smoothness constraint image multilevel fuzzy enhancement algorithm based on secondary color-to-grayscale conversion is proposed. By using fuzzy set theory and generalized fuzzy set theory, a new linear generalized fuzzy operator transformation is carried out to obtain a new linear generalized fuzzy operator. By using linear generalized membership transformation and inverse transformation, secondary color-to-grayscale conversion of adaptive smoothness constraint image is performed. Combined with generalized fuzzy operator, the region contrast fuzzy enhancement of adaptive smoothness constraint image is realized, and image multilevel fuzzy enhancement is realized. Experimental results show that the fuzzy degree of the image is reduced by the improved algorithm, and the clarity of the adaptive smoothness constraint image is improved effectively. The time consuming is short, and it has some advantages

Semi-supervised model-based clustering with controlled clusters leakage

In this paper, we focus on finding clusters in partially categorized data sets. We propose a semi-supervised version of Gaussian mixture model, called C3L, which retrieves natural subgroups of given categories. In contrast to other semi-supervised models, C3L is parametrized by user-defined leakage level, which controls maximal inconsistency between initial categorization and resulting clustering. Our method can be implemented as a module in practical expert systems to detect clusters, which combine expert knowledge with true distribution of data. Moreover, it can be used for improving the results of less flexible clustering techniques, such as projection pursuit clustering. The paper presents extensive theoretical analysis of the model and fast algorithm for its efficient optimization. Experimental results show that C3L finds high quality clustering model, which can be applied in discovering meaningful groups in partially classified data