On the choice of transforms for data hiding in compressed video

Date

1999-01-01

Author

Ramkumar, M
Akansu, AN
Alatan, Abdullah Aydın

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

128
views

0
downloads

We present an information-theoretic approach to obtain an estimate of the number of bits that can be hidden in compressed image sequences. We show how addition of the message signal in a suitable transform domain rather than the spatial domain can significantly increase the data hiding capacity. We compare the data hiding capacities achievable with different block transforms and show that the choice of the transform should depend on the robustness needed. While it is better to choose transforms with good energy compaction property (like DCT, Wavelet etc.) when the robustness required is low, transforms with poorer energy compaction property (like Hadamard or Hartley transform) are preferable choices for higher robustness requirements.

URI

https://hdl.handle.net/11511/36605

DOI

https://doi.org/10.1109/icassp.1999.757484

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

ON THE PERIOD LENGTH OF CONGRUENTIAL PSEUDORANDOM NUMBER SEQUENCES GENERATED BY INVERSIONS EICHENAUERHERRMANN, J; TOPUZOGLU, A (1990-07-24) Congruential pseudorandom number sequences generated by inversions have been studied recently. These sequences do not show the undesirable lattice structure of the linear congruential method. The necessary and sufficient condition for the generated sequence to have the maximal period length was given by Eichenauer (1988) for the case of 2e modulus. Generalization of this result to the case of an arbitrary prime power modulus is obtained.
On the independence of statistical randomness tests included in the NIST test suite SULAK, FATİH; Uğuz, Muhiddin; Koçak, Onur Ozan; Doğanaksoy, Ali (2017-01-01) Random numbers and random sequences are used to produce vital parts of cryptographic algorithms such as encryption keys and therefore the generation and evaluation of random sequences in terms of randomness are vital. Test suites consisting of a number of statistical randomness tests are used to detect the nonrandom characteristics of the sequences. Construction of a test suite is not an easy task. On one hand, the coverage of a suite should be wide; that is, it should compare the sequence under considerati...
A shape deformation algorithm for constrained multidimensional scaling Sahillioğlu, Yusuf (2015-12-01) We present a new Euclidean embedding technique based on volumetric shape registration. Extrinsic representation of the intrinsic geometry of a shape is preferable in various computer graphics applications as it poses only a small degrees of freedom to deal with during processing. A popular Euclidean embedding approach to achieve such a representation is multidimensional scaling (MDS), which, however, distorts the original geometric details drastically. Our method introduces a constraint on the original MDS ...
Investigation of the Effects of False Matches and Distribution of the Matched Keypoints on The PnP Algorithm Demirtaş, Fatih; Gülmez, Baran; Yıldırım, İrem; Leloğlu, Uğur Murat; Yaman, Mustafa; Güneyi, Eylem Tuğçe (null; 2019-04-27) Perspective-n-Point (PnP) problem is the estimation of the pose (location and orientation) of a calibrated camera from 3D-2D point correspondences, that is, three-dimensional coordinates of objects in a world coordinate system and corresponding pixels in two-dimensional images. PnP algorithms are used in computer vision, augmented reality, robotics, photogrammetry etc. Distribution of the points in the image and the accuracy of the 3D information are important on the accuracy of the estimated pose of the ca...
A methodology of swarm intelligence application in clustering based on neighborhood construction İnkaya, Tülin; Kayalıgil, Sinan; Özdemirel, Nur Evin; Department of Industrial Engineering (2011) In this dissertation, we consider the clustering problem in data sets with unknown number of clusters having arbitrary shapes, intracluster and intercluster density variations. We introduce a clustering methodology which is composed of three methods that ensures extraction of local density and connectivity properties, data set reduction, and clustering. The first method constructs a unique neighborhood for each data point using the connectivity and density relations among the points based upon the graph the...

Citation Formats

M. Ramkumar, A. Akansu, and A. A. Alatan, “On the choice of transforms for data hiding in compressed video,” 1999, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/36605.