20 May 2015 in 3D Research
1 January 2017 in Security and Communication Networks
This study proposes a low-complexity region-based authentication algorithm for three-dimensional (3D) polygonal models, based on local geometrical property evaluation. A vertex traversal scheme with a secret key is adopted to classify each vertex into one of two categories: embeddable vertices and reference vertices. An embeddable vertex is one with an authentication code embedded. The algorithm then uses reference vertices to calculate local geometrical properties for the corresponding embeddable vertices. For each embeddable vertex, we feed the number of reference vertices and local properties into a hash function to generate the authentication code. The embeddable vertex is then embedded with the authentication code, which is based on a simple message-digit substitution scheme. The proposed algorithm is of low complexity and distortion-controllable and possesses a higher and more adaptive embedding capacity and a higher embedding rate than most existing region-based authentication algorithms for 3D polygonal models. The experimental results demonstrate the feasibility of the proposed algorithm.
1 September 2006 in Journal of the Chinese Institute of Engineers
A color transfer algorithm between images intends to modify the colors in the source image by borrowing the color characteristics from the target image. In this paper, we present a novel automatic color transfer algorithm between images. This algorithm is able to proceed on color transfer with no user intervention, and produce visually plausible resultant images. To the best of our knowledge, our algorithm is the first to achieve this kind of automation. Our technique consists of an image segmentation algorithm, a swatch merging algorithm, and a pattern recognition algorithm. The image segmentation algorithm generates a number of swatches with different features in the source and target images. The swatch merging algorithm merges a particular swatch with its neighbors in the source image when it fails to pass the normality test. The pattern recognition algorithm then automatically matches these swatches for color transfer. We develop a boundary transition algorithm to make possible a consistent transition between two boundaries of patches. Experimental results demonstrate that, without any user intervention, our technique performs color transfer results with good visual realism. The technique is superior to the original user‐intervention color transfer algorithm.
1 April 2016 in International Journal of Digital Crime and Forensics
Data hiding can be regarded as a type of image processing techniques. Other image processing operations are usually integrated to increase the embedding capacity or decrease the visual distortion. Interpolation is an example of this type of operation. However, previous interpolation-based data hiding algorithms suffered from low and fixed embedding capacity and high visual distortion. This study proposes a more effective two-stage data hiding algorithm based on interpolation, LSB substitution, and histogram shifting. First, the authors modify the formula for embedding capacity calculation and make some adjustments on the sample pixels determination. A threshold is used to obtain the block complexity and each embeddable pixel has a different amount of message embedded. Second, an LSB substitution method and an optimal pixel adjustment process are adopted to raise the image quality. Finally, the authors' proposed algorithm can support adjustable embedding capacity. Compared to the previous algorithm, the experimental results demonstrate the feasibility of the proposed method.