scholarly journals Efficient Data Hiding Based on Block Truncation Coding Using Pixel Pair Matching Technique

Symmetry ◽  
2018 ◽  
Vol 10 (2) ◽  
pp. 36 ◽  
Author(s):  
Wien Hong
Keyword(s):  
Data Hiding ◽  
Block Truncation Coding ◽  
Pixel Pair ◽  
Matching Technique ◽  
Efficient Data ◽  
Pair Matching

Extended Adaptive Pixel Pair Matching for data hiding in medical images

2015 ◽  
Vol 29 (2) ◽  
pp. 877-883 ◽  
Author(s):  
S Arivazhagan ◽  
W. Sylvia Lilly Jebarani ◽  
S Keerthinathan
Keyword(s):  
Data Hiding ◽  
Medical Images ◽  
Pixel Pair ◽  
Pair Matching

scholarly journals Pixel P Air-Wise Fragile Image Watermarking Based on HC-Based Absolute Moment Block Truncation Coding

Electronics ◽  
2021 ◽  
Vol 10 (6) ◽  
pp. 690
Author(s):  
Chia-Chen Lin ◽  
Si-Liang He ◽  
Chin-Chen Chang
Keyword(s):  
Data Hiding ◽  
Image Watermarking ◽  
Huffman Code ◽  
Original Image ◽  
Absolute Moment ◽  
Authentication Code ◽  
Block Truncation Coding ◽  
Pixel Pair ◽  
Recovery Mechanisms ◽  
Content Recovery

In this paper, we first designed Huffman code (HC)-based absolute moment block truncation coding (AMBTC). Then, we applied Huffman code (HC)-based absolute moment block truncation coding (AMBTC) to design a pixel pair-wise fragile image watermarking method. Pixel pair-wise tampering detection and content recovery mechanisms were collaboratively applied in the proposed scheme to enhance readability even when images have been tampered with. Representative features are derived from our proposed HC-based AMBTC compression codes of the original image, and then serve as authentication code and recovery information at the same time during tamper detection and recovery operations. Recovery information is embedded into two LSB of the original image with a turtle shell-based data hiding method and a pre-determined matrix. Therefore, each non-overlapping pixel-pair carries four bits of recovery information. When the recipient suspects that the received image may have been tampered with, the compressed image can be used to locate tampered pixels, and then the recovery information can be used to restore the tampered pixels.

Monocular Structure from Motion Based on Angular BA

2015 ◽  
Vol 742 ◽  
pp. 290-293
Author(s):  
Xiu Zhi Li ◽  
Ai Lin Yang ◽  
Huan Qiu ◽  
Song Min Jia
Keyword(s):  
Optical Flow ◽  
Structure From Motion ◽  
Structure Refinement ◽  
3D Structure ◽  
Flow Fields ◽  
Image Point ◽  
Pixel Pair ◽  
Pair Matching ◽  
Dense Correspondence

This paper presents a technique for monocular Structure from Motion (SFM) that reconstructs 3D world shape. The technique proposed uses optical flow for 2D pixel pair matching and Angular Bundle Ajustment (ABA) for 3D structure refinement. The proposed strategy has two main advantages. Firstly, optical flow fields provide sufficient dense correspondence of image point pairs and secondly, ABA outperforms classic BA variants, especially for the points relatively far from camera. The reconstruction results obtained in realistic scenario demonstrate the effectiveness and accuracy of the proposed algorithm.

An efficient authentication method for AMBTC compressed images using adaptive pixel pair matching

2017 ◽  
Vol 77 (4) ◽  
pp. 4677-4695 ◽  
Author(s):  
Wien Hong ◽  
Meijin Chen ◽  
Tung Shou Chen ◽  
Chien-Che Huang
Keyword(s):  
Compressed Images ◽  
Pixel Pair ◽  
Pair Matching

scholarly journals Reversible Data Hiding Scheme Using Adaptive Block Truncation Coding Based on an Edge-Based Quantization Approach

Symmetry ◽  
2019 ◽  
Vol 11 (6) ◽  
pp. 765 ◽  
Author(s):  
Chia-Chen Lin ◽  
Ching-Chun Chang ◽  
Zhi-Ming Wang
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Zero Point ◽  
Edge Image ◽  
Block Truncation Coding ◽  
Canny Edge ◽  
High Embedding Capacity ◽  
Processing Block ◽  
And Performance ◽  
Edge Based

In this paper, we provide a novel reversible data hiding method using adaptive block truncation coding based on an edge-based quantization (ABTC-EQ) approach. We exploit the characteristic not being used in ABTC-EQ. To accomplish this, we first utilized a Canny edge detector to obtain an edge image and classify each block in a cover image into two versions, edge-block and non-edge-block. Subsequently, k-means clustering was used to obtain three quantization levels and derive the corresponding bit map while the current processing block was the case of an edge-block. Then Zero-Point Fixed Histogram Shifting (ZPF-HS) was applied to embed the secret information into compressed code. The experimental results show that our method provides a high embedding capacity for each test image and performance is better than other methods.

Sign in / Sign up

Export Citation Format

Share Document