• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.1
• /
• pp.149-159
• /
• 2008

In this paper, we propose a blind watermarking algorithm of 3d mesh model using spherical parameterization. Spherical parameterization is a useful method which is applicable to 3D data processing. Especially, orthogonal coordinate can not analyse the feature of the vertex coordination of the 3D mesh model, but this is possible to analyse and process. In this paper, the centroid center of the 3D model was set to the origin of the spherical coordinate, the orthogonal coordinate system was transformed to the spherical coordinate system, and then the spherical parameterization was applied. The watermark was embedded via addition/modification of the vertex after the feature analysis of the geometrical information and topological information. This algorithm is robust against to the typical geometrical attacks such as translation, scaling and rotation. It is also robust to the mesh reordering, file format change, mesh simplification, and smoothing. In this case, the this algorithm can extract the watermark information about $90{\sim}98%$ from the attacked model. This means it can be applicable to the game, virtual reality and rapid prototyping fields.

• Journal of Ubiquitous Convergence Technology
• /
• v.2 no.1
• /
• pp.18-26
• /
• 2008

The invariance relation existing in the non-negative matrix factorization (NMF) is used for constructing robust image hashes in this work. The image is first re-scaled to a fixed size. Low-pass filtering is performed on the luminance component of the re-sized image to produce a normalized matrix. Entries in the normalized matrix are pseudo-randomly re-arranged under the control of a secret key to generate a secondary image. Non-negative matrix factorization is then performed on the secondary image. As the relation between most pairs of adjacent entries in the NMF's coefficient matrix is basically invariant to ordinary image processing, a coarse quantization scheme is devised to compress the extracted features contained in the coefficient matrix. The obtained binary elements are used to form the image hash after being scrambled based on another key. Similarity between hashes is measured by the Hamming distance. Experimental results show that the proposed scheme is robust against perceptually acceptable modifications to the image such as Gaussian filtering, moderate noise contamination, JPEG compression, re-scaling, and watermark embedding. Hashes of different images have very low collision probability. Tampering to local image areas can be detected by comparing the Hamming distance with a predetermined threshold, indicating the usefulness of the technique in digital forensics.

• International Journal of Computer Science & Network Security
• /
• v.24 no.3
• /
• pp.93-100
• /
• 2024

In this paper, we propose a novel robust blind crypto-watermarking method for medical images security based on hiding of DICOM patient information (patient name, age...) in the medical imaging. The DICOM patient information is encrypted using the AES standard algorithm before its insertion in the medical image. The cover image is divided in blocks of 8x8, in each we insert 1-bit of the encrypted watermark in the hybrid transform domain by applying respectively the 2D-LWT (Lifting wavelet transforms), the 2D-DCT (discrete cosine transforms), and the SVD (singular value decomposition). The scheme is tested by applying various attacks such as noise, filtering and compression. Experimental results show that no visible difference between the watermarked images and the original images and the test against attack shows the good robustness of the proposed algorithm.

• Journal of Korea Multimedia Society
• /
• v.7 no.1
• /
• pp.80-90
• /
• 2004

Watermarking algorithm for 3D mesh model using EGI distribution of each patch is proposed. The proposed algorithm divides a 3D mesh model into 6 patches to have the robustness against the partial geometric deformation. Plus, it uses EGI distributions as the consistent factor that has the robustness against the topological deformation. To satisfy both geometric and topological deformation, the same watermark bits for each subdivided patch are embedded by changing the mesh normal vectors. Moreover, the proposed algorithm does not need not only the original mesh model but also the resampling process to extract the watermark. Experimental results verify that the proposed algorithm is imperceptible and robust against geometrical and topological attacks.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.691-694
• /
• 2003

This paper proposes an 3D face image watermarking method based on discrete wavelet transform(DWT). First, 3D face image are transformed by DWT and inserted gaussian watermark into frequency domain. To increase the robustness and perceptual invisibility of watermark, the proposed algorithm is combined with the characteristics of 3D face image and human visual system. The proposed method is invisible and blind watermarking which the original image is not required. Simulation results show that the proposed method is robust to the general attack such as JPEG compression, enhancement, noise, cropping, and filtering etc.

• The KIPS Transactions:PartB
• /
• v.12B no.3 s.99
• /
• pp.283-290
• /
• 2005

The mismatched allocation of watermarking position due to parallel translation, rotation, and scaling distortion is a problem that requires an answer in watermarking. In this paper, we propose a watermarking method robust enough to hold against geometrical distorting using restoration pattern matching. The proposed method defines restoration pattern, then inserts the pattern to a watermark embedded image for distribution. Geometrical distortion is verified by comparing restoration pattern extracted from distributed image and the original restoration pattern inserted to the image. If geometrical distortion is found, inverse transformation is equally performed to synchronize the watermark insertion and extraction position. To evaluate the performance of the proposed method, experiments in translation, rotation, and scaling attack are performed.

• The KIPS Transactions:PartB
• /
• v.10B no.6
• /
• pp.629-638
• /
• 2003

In this paper, we propose an improved method of watermarking to increase the invisibility of a watermark and robustness against attacks for the purpose of removing the embedded watermark. The proposed method adaptively selects DCT blocks and determines position and intensity for watermarking based on the characteristics of human visual system. The used features are texture, luminance and contrast. We show the experimental results against image processing attacks such as cropping, image enhancement, low pass filtering, and JPEG compression, and then discuss the performance of the proposed method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.570-595
• /
• 2017

Robust and perceptually-adaptive image watermarking algorithms have mainly targeted gray-scale images either at the modeling or embedding levels despite the widespread availability of color images. Only few of the existing algorithms are specifically designed for color images where color correlation and perception are constructively exploited. In this paper, a new perceptual and high-capacity color image watermarking solution is proposed based on the extension of Tsui et al. algorithm. The $CIEL^*a^*b^*$ space and the spatio-chromatic Fourier transform (SCFT) are combined along with a perceptual model to hide watermarks in color images where the embedding process reconciles between the conflicting requirements of digital watermarking. The perceptual model, based on an emerging color image model, exploits the non-uniform just-noticeable color difference (NUJNCD) thresholds of the $CIEL^*a^*b^*$ space. Also, spread-spectrum techniques and semi-random low-density parity check codes (SR-LDPC) are used to boost the watermark robustness and capacity. Unlike, existing color-based models, the data hiding capacity of our scheme relies on a game-theoretic model where upper bounds for watermark embedding are derived. Finally, the proposed watermarking solution outperforms existing color-based watermarking schemes in terms of robustness to standard image/color attacks, hiding capacity and imperceptibility.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.1165-1168
• /
• 2005

This paper proposes an digital image watermarking method based on discrete wavelet transform(DWT) and spatial perceptual properties of human visula system. first, an digital image is transformed by DWT and inserted gaussian watermark into the frequency domain. To increase the robustness and perceptual invisibility of watermark, the proposed algorithm is combined with the characteristics of digital image and human visual system. The proposed method is invisible and blind watermarking which the original image is not required to detect watermarks. Simulation results show that the proposed method is robust to the general attack such as JPEG compression, enhancement, noise, cropping, and filtering etc.

• The KIPS Transactions:PartD
• /
• v.11D no.6
• /
• pp.1335-1340
• /
• 2004

This study introduces a technology utilizing digital images as electronic money by inserting watermark into the images. Watermarking technology assign contents ID to images and inserts the contents ID into the images in an unnoticeable way. The server that manages the issue and the usage of mage electronic money (called ‘WaterCash’ hereafter) stores issued contents ID to database and manage them as electronic money. WaterCash guarantees anonymity and prevents the forgery and modification of WaterCash based on semi-fragile watermarking technique. In addition, WaterCash is transferable and the illegal use of WaterCash can be prevented based on the watermarking technology. The watermarking .technology used in this paper was designed to be robust to image compression but vulnerable to intentional or non-intentional Image processing.