KC Two-Way Clustering Algorithms For Multi-Child Semantic Maps In Image Mining

Two-Dimensional Clustering Algorithms for Image Segmentation

This paper introduces modified versions of the K-Means (KM) and Moving K-Means (MKM) clustering algorithms, called the Two-Dimensional K-Means (2D-KM) and Two-Dimensional Moving KMeans (2D-MKM) algorithms respectively. The performances of these two proposed algorithms are compared with three of the commonly used conventional clustering algorithms, namely K-Means (KM), Fuzzy C-Means (FCM), and M...

Two Novel Chaos-Based Algorithms for Image and Video Watermarking

In this paper we introduce two innovative image and video watermarking algorithms. The paper’s main emphasis is on the use of chaotic maps to boost the algorithms’ security and resistance against attacks. By encrypting the watermark information in a one dimensional chaotic map, we make the extraction of watermark for potential attackers very hard. In another approach, we select embedding po...

Simultaneous Multi-way Clustering

Web Image Semantic Clustering

This paper provides a novel Web image clustering methodology based on their associated texts. In our approach, the semantics of Web images are firstly represented into vectors of term-weight pairs. In order to correctly correlate terms to a Web image, the associated text of the Web image is partitioned into semantic blocks according to the semantic structure of the text with respect to the Web ...

Multi-Image Semantic Matching by Mining Consistent Features

This work proposes a multi-image matching method to estimate semantic correspondences across multiple images. In contrast to the previous methods that optimize all pairwise correspondences, the proposed method identifies and matches only a sparse set of reliable features in the image collection. In this way, the proposed method is able to prune nonrepeatable features and also highly scalable to...