Reversible data hiding (RDH) schemes based on pixel value ordering have gained significant popularity due to their unique capability of providing high-quality marked images with a decent embedding capacity, while also enabling secret information extraction and the lossless recovery original at receiving side. However, image quality may be distorted severely when (PVO) method is employed in laye...

In this paper, a geometrically invariant image watermarking scheme is proposed by exploiting multilevel histogram shapes. The embedding procedure starts decomposing the host with first level Haar wavelet. After that, histograms are extracted from approximation subband via several rounds, which used to embed watermark bits. Each round of extracts at specified level. Then split into fragments, nu...

In this paper we present a high capacity data hiding method for 3D meshes. The proposed method is blind and orders selected vertices from the 3D object’s mesh based on a pseudo random path. When a vertex is added to the path we embed a part of the message by displacing its location according to the location of another vertex called reference vertex. We solve the causality issue by removing cert...

In this paper we present a novel digital pen device, called data-embedding pen, for enhancing the value of handwriting on physical paper. This pen produces an additional ink-dot sequence along a written stroke during writing. This ink-dot sequence represents arbitrary information, such as writer’s name and writing date. Since the information is placed on the paper as an ink-dot sequence, it can...

In broadcast service operators would like the viewing of such a sufficiently corrupted video on the screen of the unauthorized viewer to allure potential customers without sacrificing the level of robustness provided by digital encryption techniques.A technique for embedding data in scrambled AVI video is described. The embedding technique is applied to the video sequence jointly with the video...

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...