International Journal of Advanced Networking and Applications

Rekha B. Venkatapur ¹, V. D. Mytri ², A. Damodaram ³

Affiliations
1 Dept. of CSE, A P S College of Engineering, Bangalore-78, Karnataka, IN
2 GND College of Engineering, Bidar, Karnataka, IN
3 JNTU College of Engineering, Hyderabad, IN

Abstract

Assessing and comparing the performance of watermarking algorithms is difficult. The visibility of the watermark is an important aspect in this process. The ease in which digital data can be manipulated has created a need for techniques that determine the credibility of digital information. In the recent development of digital multimedia in an entire range of our everyday life has brought forth two active areas of research, namely, retrieval systems and watermarking technology. The problem of associating messages to multimedia content can be addressed by a watermarking system which embeds the associated messages into the multimedia content (also called Works). A drawback of watermarking is that the content will be distorted during embedding. On the other hand, if we assume that the database is available, the problem can be addressed by a retrieval system. Although no undesirable distortion is created, searching in large databases is fundamentally difficult (also known as the dimensionality curse). In the present study a novel framework is presented which strikes a trade off between watermarking and retrieval systems. The framework avoids the dimensionality curse by introducing small distortions (watermark) into the multimedia content. From another perspective, the framework improves the watermarking performance, marked by significant reduction in distortion, by introducing searching ability in the message detection stage. To prove the concept, we give an algorithm based on the proposed notion of “clustering by watermarking”.

Keywords

Algorithm, Clustering, Multimedia Messages, Watermark.

Full Text

   

Rekha B. Venkatapur ¹, V. D. Mytri ², A. Damodaram ³

Affiliations
1 Dept. of CSE, A P S College of Engineering, Bangalore-78, Karnataka, IN
2 GND College of Engineering, Bidar, Karnataka, IN
3 J N T U College of Engineering, Hyderabad, IN

Abstract

In the recent years, there has been a strong growth in the number and the size of image databases. Large image databases typically consist of different types of photographic archives. Also the number of industrial image databases has grown remarkably due to a rapid increase of industrial imaging systems. Image databases often need to organize the images automatically by their content. Clustering operations can be applied for the content based organization of the images. In the present study an efficient method is proposed for the clustering of large image databases. The method is based on hierarchical clustering of the image database using grid. In this paper, the grid-based clustering methods are applied to fast image database browsing and retrieval. Proposed clustering methods are tested using real image databases.

Keywords

Image Database, Clustering, Retrieval, Browsing.

Full Text