A NEW DATA EMBEDDING METHOD FOR MPEG LAYER III AUDIO STEGANOGRAPHY

2016 ◽  
Vol 78 (7-5) ◽  
Author(s):  
Mohsen Bazyar ◽  
Rubita Sudirman
Keyword(s):  
Computational Complexity ◽  
Experimental Results ◽  
Huffman Coding ◽  
Data Embedding ◽  
Embedding Capacity ◽  
Carrier Medium ◽  
Audio File ◽  
Huffman Codes ◽  
Information Embedding ◽  
Audio Files

A new method of MP3 steganography is proposed with emphasis on increasing the steganography capacity of the carrier medium. This paper proposes a data embedding algorithm to hide more information for compressed bitstream of MP3 audio files. The sign bits of Huffman codes are selected as the stego-object according to the Huffman coding characteristic in region of Count1. Embedding process does not require the main MP3 audio file during the extraction of hidden message and the size of MP3 file cannot be changed in this step. Our proposed method caused much higher information embedding capacity with lower computational complexity compared with MP3Stego tools. Experimental results show an excellent imperceptibility for the new algorithm.  

Reversible Data Hiding Based on Statistical Correlation of Blocked Sub-Sampled Image

2012 ◽  
Vol 2 (1) ◽  
pp. 42-59
Author(s):  
Mona Nafari ◽  
Mansour Nejati Jahromi ◽  
Gholam Hosein Sheisi
Keyword(s):  
Image Quality ◽  
Data Hiding ◽  
Reversible Data Hiding ◽  
Statistical Correlation ◽  
Experimental Results ◽  
Data Embedding ◽  
Embedding Capacity ◽  
Stego Image

In this paper, a reversible data hiding scheme has been proposed which is based on correlation of subsample images. The proposed method modifies the blocks of sub-sampled image to prepare vacant positions for data embedding. The PSNR of the stego image produced by the proposed method is guaranteed to be above 47.5 dB, while the embedding capacity is at least, almost 6.5 times higher than that of the Kim et al. techniques with the same PSNR. This technique has the capability to control the capacity-PSNR. Experimental results support that the proposed method exploits the correlation of blocked sub-sampled image outperforms the prior works in terms of larger capacity and stego image quality. On various test images, the authors demonstrate the validity of the proposed method by comparing it with other existing reversible data hiding algorithms.

scholarly journals A Distortion-Free Data Hiding Scheme for Triangular Meshes Based on Recursive Subdivision

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Yuan-Yu Tsai
Keyword(s):  
Principal Component Analysis ◽  
Data Hiding ◽  
Similarity Transformation ◽  
Principal Component ◽  
Secret Message ◽  
Subdivision Scheme ◽  
Data Embedding ◽  
Embedding Capacity ◽  
Free Data ◽  
Reversible Data Embedding

This study adopts a triangle subdivision scheme to achieve reversible data embedding. The secret message is embedded into the newly added vertices. The topology of added vertex is constructed by connecting it with the vertices of located triangle. For further raising the total embedding capacity, a recursive subdivision mechanism, terminated by a given criterion, is employed. Finally, a principal component analysis can make the stego model against similarity transformation and vertex/triangle reordering attacks. Our proposed algorithm can provide a high and adjustable embedding capacity with reversibility. The experimental results demonstrate the feasibility of our proposed algorithm.

Computational Models of Bio Heuristics Based on Physical and Cognitive Processes (Review)

2021 ◽  
Vol 27 (11) ◽  
pp. 563-574
Author(s):  
V. V. Kureychik ◽  
◽  
S. I. Rodzin ◽  
Keyword(s):  
Computational Complexity ◽  
Convergence Rate ◽  
Rate Of Convergence ◽  
Cognitive Processes ◽  
Computational Models ◽  
Optimization Problems ◽  
Search Space ◽  
Experimental Results ◽  
Software Implementation ◽  
Minimum Total Length

Computational models of bio heuristics based on physical and cognitive processes are presented. Data on such characteristics of bio heuristics (including evolutionary and swarm bio heuristics) are compared.) such as the rate of convergence, computational complexity, the required amount of memory, the configuration of the algorithm parameters, the difficulties of software implementation. The balance between the convergence rate of bio heuristics and the diversification of the search space for solutions to optimization problems is estimated. Experimental results are presented for the problem of placing Peco graphs in a lattice with the minimum total length of the graph edges.

scholarly journals Block-Based Steganography Method Using Optimal Selection to Reach High Efficiency and Capacity for Palette Images

2020 ◽  
Vol 10 (21) ◽  
pp. 7820
Author(s):  
Han-Yan Wu ◽  
Ling-Hwei Chen ◽  
Yu-Tai Ching
Keyword(s):  
High Efficiency ◽  
Optimal Selection ◽  
Data Embedding ◽  
Embedding Capacity ◽  
Embedding Efficiency ◽  
Block Based ◽  
Location Map ◽  
Embedding Distortion ◽  
Minimal Embedding

The primary goal of steganographic methods is to develop statically undetectable methods with high steganographic capacity. The embedding efficiency is one kind of measure for undetectability. Block-based steganography methods have been proposed for achieving higher embedding efficiency under limited embedding capacity. However, in these methods, some blocks with larger embedding distortions are skipped, and a location map is usually incorporated into these methods to record the embedding status of each block. This reduces the embedding capacity for secret messages. In this study, we proposed a block-based steganography method without a location map for palette images. In this method, multiple secret bits can be embedded in a block by modifying at most one pixel with minimal embedding distortion; this enables each block to be used for data embedding; thus, our method provides higher embedding capacity. Furthermore, under the same capacity, the estimated and experimental embedding efficiencies of the proposed method are compared with those of Imaizumi et al. and Aryal et al.’s methods; the comparisons indicate that the proposed method has higher embedding efficiency than Imaizumi et al. and Aryal et al.’s methods.

A Novel Steganography Algorithm Based on Quantization Table Modification and Image Scrambling in DCT Domain

2020 ◽  
pp. 2154001
Author(s):  
Hongzhu Dai ◽  
Jie Cheng ◽  
Yafeng Li
Keyword(s):  
Image Quality ◽  
Cover Image ◽  
Embedding Capacity ◽  
Image Scrambling ◽  
Information Embedding ◽  
Dct Domain ◽  
Confidential Data ◽  
Dct Coefficients

In this paper, a steganography algorithm has been proposed which is based on quantization table modification and image scrambling in the DCT domain. First, the algorithm homogenizes the energy by scrambling the cover image to improve the number of DCT coefficients suitable for information embedding. Second, the embedding capacity of the DCT block is determined by the value of the quantization table in the algorithm, different quantization tables get different embedding effects. In addition, this paper proposes an optimized modified quantization table. Extensive experiments show that the proposed algorithm achieves a great potential for confidential data and indiscernible image quality.

scholarly journals Data-Hiding Scheme Using Multidirectional Pixel-Value Differencing on Colour Images

2019 ◽  
Vol 2019 ◽  
pp. 1-11
Author(s):  
Pyung-Han Kim ◽  
Eun-Jun Yoon ◽  
Kwan-Woo Ryu ◽  
Ki-Hyun Jung
Keyword(s):  
Data Hiding ◽  
Vision System ◽  
Experimental Results ◽  
Human Vision ◽  
Embedding Capacity ◽  
Secret Data ◽  
Colour Image ◽  
Pixel Value ◽  
The Difference ◽  
Pixel Value Differencing

Data hiding is a technique that hides the existence of secret data from malicious attackers. In this paper, we propose a new data-hiding scheme using multidirectional pixel-value differencing, which can embed secret data in two directions or three directions on colour images. The cover colour image is divided into nonoverlapping blocks, and the pixels of each block are decomposed into R, G, and B channels. The pixels of each block perform regrouping, and then the minimum pixel value within each block is selected. The secret data can be embedded into two directions or three directions based on the minimum pixel value by using the difference value for the block. The pixel pairs with the embedded secret data are put separately into two stego images for secret data extraction on receiver sides. In the extraction process, the secret data can be extracted using the difference value of the two stego images. Experimental results show that the proposed scheme has the highest embedding capacity when the secret data are embedded into three directions. Experimental results also show that the proposed scheme has a high embedding capacity while maintaining the degree of distortion that cannot be perceived by human vision system for two directions.

Study on Tracking in Interested Moving Objects

2011 ◽  
Vol 382 ◽  
pp. 418-421
Author(s):  
Dong Yan Cui ◽  
Zai Xing Xie
Keyword(s):  
Computational Complexity ◽  
Real Time ◽  
Monitoring System ◽  
Moving Objects ◽  
Moving Object ◽  
Experimental Results ◽  
Real Time Monitoring ◽  
Automatic Program ◽  
Inter Frame

This paper presents an automatic program to track in moving objects, using segmentation algorithm quickly and efficiently after the division of a moving object, in the follow-up frame through the establishment of inter-frame vectors to track moving objects of interest. Experimental results show that the algorithm can accurately and effectively track moving objects of interest, and because the algorithm is simple, the computational complexity is small, can be well positioned to meet real-time monitoring system in the extraction of moving objects of interest and tracking needs.

Audio Retrieval Based on Chinese Keyword Search in Relational Databases

2013 ◽  
Vol 756-759 ◽  
pp. 3236-3240
Author(s):  
Bo Yan Zhu ◽  
Guang Liu ◽  
Liang Zhu
Keyword(s):  
Relational Database ◽  
Relational Databases ◽  
Keyword Search ◽  
Database System ◽  
Experimental Results ◽  
Chinese Characters ◽  
Relational Database System ◽  
Audio Retrieval ◽  
Ranking Strategy ◽  
Audio Files

In this paper, we propose a new method based on Chinese keyword search to select the WAV or MP3 files in audio post-production. First, we listen to each file and label it with Chinese characters, and then classify and store the files in a relational database system. Then, we use the techniques of Chinese keyword search to match query characters and the tuple characters quickly, and to compute similarities between the query and candidate tuples. For the characteristics of Chinese keyword search, we present a ranking strategy and an algorithm to refine the candidate tuples resulting from the first round matching, and finally get top-Nresults of audio files. The experimental results show that our method is efficient and effective.

QoS Routing Optimization Based on Improved Genetic Algorithm

2014 ◽  
Vol 998-999 ◽  
pp. 1169-1173
Author(s):  
Chang Lin He ◽  
Yu Fen Li ◽  
Lei Zhang
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Computational Complexity ◽  
Fitness Function ◽  
Qos Routing ◽  
Experimental Results ◽  
Improved Genetic Algorithm ◽  
Coding Schemes ◽  
Routing Optimization

A improved genetic algorithm is proposed to QoS routing optimization. By improving coding schemes, fitness function designs, selection schemes, crossover schemes and variations, the proposed method can effectively reduce computational complexity and improve coding accuracy. Simulations are carried out to compare our algorithm with the traditional genetic algorithms. Experimental results show that our algorithm converges quickly and is reliable. Hence, our method vastly outperforms the traditional algorithms.

A NEWLY MODIFIED ALGORITHM OF HOUGH TRANSFORM FOR LINE DETECTION

2005 ◽  
Vol 05 (04) ◽  
pp. 715-727
Author(s):  
QIANG WANG ◽  
HONGBO CHEN ◽  
XIAORONG XU ◽  
HAIYAN LIU
Keyword(s):  
Computational Complexity ◽  
Digital Image ◽  
Hough Transform ◽  
Experimental Results ◽  
Line Detection ◽  
Storage Requirement ◽  
Heavy Burden ◽  
Modified Algorithm ◽  
Better Than

The heavy burden of computational complexity and massive storage requirement is the drawback of the standard Hough transform (SHT). To overcome the weakness of SHT, many modified approaches, for example, the probabilistic Hough transform (PHT), have been presented. However, a very important fact, which is that a line has its own width in a real digital image and the width of the line is uniform, was ignored by all of these modified algorithms of Hough transform. This phenomenon influenced the result of line detection. In this paper a new modified algorithm of Hough transform for line detection is proposed. In our algorithm, the fact mentioned above is fully considered and a strip-shaped area corresponding to the accumulate cells of HT is proposed. Experimental results have shown that our approach is efficient and promising, and the effect of detection is far better than the popular modified approaches.

Sign in / Sign up

Export Citation Format

Share Document