An integer wavelet transform based scheme for reversible data hiding in encrypted images

Xiong, Lizhi; Wang, Chao; Shi, Yun-Qing

doi:10.1007/s11045-017-0497-5

Cited by 108 publications

(44 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to the recoverability of the cover image, data-hiding methods can be classified into lossy [6][7][8][9][10][11][12][13][14] and lossless [15][16][17]. The least significant bit (LSB) matching [18] is one of the well-known lossy methods.…”

Section: Introductionmentioning

confidence: 99%

“…On the other hand, the lossless data hiding methods have the capability to restore the cover image after data extraction and thus they have wide applications. For example, [17] employs a lossless data hiding scheme using integer wavelet transform to embed data into encrypted images. Nevertheless, the payload and stego image quality offered by the lossless methods are often considerably lower than that of lossy ones.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Hong

2018

Symmetry

View full text Add to dashboard Cite

Abstract:In this paper, an efficient data hiding method that embeds data into absolute moment block truncation coding (AMBTC) codes is proposed. The AMBTC method represents image blocks by trios, and each trio consists of two quantization levels and an asymmetrically distributed bitmap. However, the asymmetric phenomena of bitmaps cause large degradation in image quality during data embedment. With the help of reference tables filled with symmetrical patterns, the proposed method exploits a symmetry adjustment model to modify the quantization levels in those smooth blocks to achieve the smallest distortion. If the block is complex, a lossless embedding method is performed to carry one additional bit. A sophisticated division switching mechanism is also proposed to modify a block from smooth to complex if the solution to the minimal distortion cannot be found. The payload can be adjusted by varying the threshold, or by embedding more bits into the quantization levels. The experiments indicate that the proposed work provides the best stego image quality under various payloads when comparing to the related prior works.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

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

Hong

2018

Symmetry

View full text Add to dashboard Cite

show abstract

“…For example, an integer wavelet transform is proposed by Lizhi Xiong, it shows that this scheme outperforms all of other existing RDH schemes in encrypted domain in terms of higher PSNR at the same amount of payload [5]. It is effective in diagnosing and classifying different states of gearbox in short time.…”

Section: Introductionmentioning

confidence: 99%

The correlation analysis of gear tooth broken-pitting compound fault and single fault based on Laplacian Eigenmaps

Wang¹,

He²,

Du³

et al. 2018

J. vibroeng.

View full text Add to dashboard Cite

Gear break and pitting are two common faults in transmission system, when these two faults coexist and form a compound fault, the damage speed and frequency of gear transmission system will be greatly increased. Taking the gear fault-pitting compound fault as the object, the dynamic model of gear single fault and compound fault is established, and the vibration characteristics of gear single fault, pitting single fault and broken tooth-pitting compound fault signal are analyzed. The characteristic manifolds of the intrinsic dimension space in the case of gear single failure and compound fault are extracted by using the Laplacian Eigenmaps algorithm, the evolution trend of single fault and compound fault in the overlapping region of the feature space, the degree of correlation and the curvature of the fault circle core are analyzed and obtained. The study found that with the deepening of the fault severity, the overlapping area of fault circle between compound fault and single fault become smaller gradually, that is, the degree of correlation become weakened, tooth broken single fault and compound fault can be identified in mid-late stage of fault, while the pitting single fault and compound fault are in the late stage. The experimental results of gearbox compound fault correlation show that the conclusion of the simulation analysis is correct and effective, which provides a new idea for the diagnosis of mechanical complex faults.

show abstract

“…Many of these graph processing frameworks employ iterative processing techniques [38,41,50]. Namely, graph processing involves many iterations.…”

Section: Introductionmentioning

confidence: 99%

WolfPath: Accelerating Iterative Traversing-Based Graph Processing Algorithms on GPU

Zhu

et al. 2017

Int J Parallel Prog

View full text Add to dashboard Cite

There is the significant interest nowadays in developing the frameworks of parallelizing the processing for the large graphs such as social networks, Web graphs, etc. Most parallel graph processing frameworks employ iterative processing model. However, by benchmarking the state-of-art GPU-based graph processing frameworks, we observed that the performance of iterative traversing-based graph algorithms (such as Bread First Search, Single Source Shortest Path and so on) on GPU is limited by the frequent data exchange between host and GPU. In order to tackle the problem, we develop a GPU-based graph framework called WolfPath to accelerate the processing of iterative traversing-based graph processing algorithms. In WolfPath, the iterative process is guided by the graph diameter to eliminate the frequent data exchange between host and GPU. To accomplish this goal, WolfPath proposes a data structure called Layered Edge list to represent the graph, from which the graph diameter is known before the start of graph processing. In order to enhance the applicability of our WolfPath 123Int J Parallel Prog framework, a graph preprocessing algorithm is also developed in this work to convert any graph into the format of the Layered Edge list. We conducted extensive experiments to verify the effectiveness of WolfPath. The experimental results show that WolfPath achieves significant speedup over the state-of-art GPU-based in-memory and out-of-memory graph processing frameworks.

show abstract

An integer wavelet transform based scheme for reversible data hiding in encrypted images

Cited by 108 publications

References 15 publications

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

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

The correlation analysis of gear tooth broken-pitting compound fault and single fault based on Laplacian Eigenmaps

WolfPath: Accelerating Iterative Traversing-Based Graph Processing Algorithms on GPU

Contact Info

Product

Resources

About