• ETRI Journal
• /
• v.35 no.3
• /
• pp.512-522
• /
• 2013

In this paper, the radius weight mean (RWM) and the feature-embedding technique are used to present a novel watermarking scheme for color images. Simulations validate that the stego-images generated by the proposed scheme are robust against most common image-processing operations, such as compression, color quantization, bit truncation, noise addition, cropping, blurring, mosaicking, zigzagging, inversion, (edge) sharpening, and so on. The proposed method possesses outstanding performance in resisting high compression ratio attacks: JPEG2000 and JPEG. Further, to provide extra hiding storage, a steganographic method using the RWM with the least significant bit substitution technique is suggested. Experiment results indicate that the resulting perceived quality is desirable, whereas the peak signal-to-noise ratio is high. The payload generated using the proposed method is also superior to that generated by existing approaches.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.403-406
• /
• 2005

The purpose of this paper is to propose ways to remove false color noise (FCN) generated during de-mosaicing on RGB Bayer pattern images. In case of images sensors adapting Bayer pattern color filters array (CFA), de-mosaicing is conducted to recover the RGB color data in single pixels. Here, FCN phenomena would occur where there is clearer silhouette or contrast of colors. The FCN phenomena found during de-mosaicking process appears locally in the edges inside the image and the proposed method of eliminating this is to convert RGB color space to YCbCr space to conduct smoothing process. Moreover, for edges where different colors come together, censoring based smoothing technique is proposed as a way to minimize color blurring effect.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.1
• /
• pp.39-49
• /
• 1995

Stereo vision is useful to obtain three dimensional depth information from two images taken from different view points. In this paper, we reduce searching area for correspondence by using the intra-scanline constraint, and utilize the inter-scanline constraint and the property of disparity continuity among the neighboring pixels for relaxation. Nodes with 3-D stucture are located on the axes of two views, and have matching possibility of correspondent pixels of two images. A matching is accepted if a node at the intersection of the disparity axes has the greatest matching possibility. Otherwise, the matching possibility of the node is updated by relaxation with the cooperation of neighboring nodes. Further relaxation with competition of two views is applied to a matching possibility of randomly selected node. The consensus of two views increases the confidence of matching, and removes a blurring phenomenon on the discontinuity of object. This approach has been tested with various types of image such as random dot stereogram and aerial image, and the experimental results show good matching performance.

• Journal of information and communication convergence engineering
• /
• v.12 no.2
• /
• pp.128-134
• /
• 2014

In this paper, we present a graphics processing unit (GPU)-based matching technique for the purpose of fast feature matching between different images. The scale invariant feature transform algorithm developed by Lowe for various feature matching applications, such as stereo vision and object recognition, is computationally intensive. To address this problem, we propose a matching technique optimized for GPUs to perform computations in less time. We optimize GPUs for fast computation of keypoints to make our system quick and efficient. The proposed method uses a self-organizing map feature matching technique to perform efficient matching between the different images. The experiments are performed on various image sets to examine the performance of the system under varying conditions, such as image rotation, scaling, and blurring. The experimental results show that the proposed algorithm outperforms the existing feature matching methods, resulting in fast feature matching due to the optimization of the GPU.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.97-100
• /
• 2002

In this paper, we propose a watermarking technique that embeds a digital watermark into digital images for the proof of owner or copyright protection. Proposed algorithm is based on discrete wavelet transform. Zerotree structure defined by Shapiro's embedded zerotree wavelet(EZW) algorithm is used. In the proposed algorithm, a digital watermark is embedded on only significant wavelet coefficients chosen by QSWT for the robustness of the algorithm. In other words, only the values of significant wavelet coefficients are modified in accordance with the given watermark pattern. We use the relationship among neighboring coefficients when modifying chosen coefficients to keep good image quality. Visual recognizable patterns such as binary images are used as a watermark. The experimental results show that the proposed algorithm has robustness under a variety of attacks such as JPEG compression, sharpening and blurring and also show that it has a better performance in PSNR comparing with other algorithms.

• Journal of information and communication convergence engineering
• /
• v.13 no.1
• /
• pp.62-68
• /
• 2015

In this paper, we propose a watermarking method for protecting the ownership of three-dimensional (3D) content generated from depth and texture images. After selecting the target areas to preserve the watermark by depth-image-based rendering, the reference viewpoint image is moved right and left in the depth map until the maximum viewpoint change is obtained and the overlapped region is generated for marking space. The region is divided into four subparts and scanned. After applying discrete cosine transform, the watermarks are inserted. To extract the watermark, the viewpoint can be changed by referring to the viewpoint image and the corresponding depth image initially, before returning to the original viewpoint. The watermark embedding and extracting algorithm are based on quantization. The watermarked image is attacked by the methods of JPEG compression, blurring, sharpening, and salt-pepper noise.

• Proceedings of the KIEE Conference
• /
• 1993.07a
• /
• pp.418-420
• /
• 1993

In this paper, we proposed a new FMS Landmark recognition algorithm using color images. Firstly, a NTSC image fame is captured, and then it is converted to a field image in order to reduce the image blurring from the AGV motion. Secondly, the landmark is detected via the comparison of the color vectors of image pixels with the landmark color. Finally, the identification of FMS landmark is executed using a newly designed landmark pattern with a set of reference points. The landmark pattern is normalized against its translation, rotation, and scaling. And then, its vertical projection data are fisted for the pattern classification using the standard data set. Experimental results show that our scheme performs well.

• Journal of Korea Multimedia Society
• /
• v.11 no.12
• /
• pp.1668-1675
• /
• 2008

In this paper, we propose a post-processing technique developed for the subjective improvement of color resolution in DCT-coded color images. The high frequency components caused by complex object parts are compressed and impaired through DCT-based image processing, so color distortions such as blurs in high saturated regions are observed. It's mainly due to the severe loss of color data as Cb and Cr. Generally, the activities of chroma elements in DCT domain correlate strongly with that of luminance as spatial frequency gets higher, and based on the relations between chroma and luma AC activities, we compensate destructed Cb, Cr coefficients using modifications from Y coefficients. Simulation results show that the proposed method enhances color resolution in high saturated region, and improves the visual quality.

• Current Optics and Photonics
• /
• v.5 no.1
• /
• pp.23-31
• /
• 2021

We propose a wheel screen type Lamina 3D display, which realizes a 3D image that can satisfy the accommodation cue by projecting volumetric images encoded by varying polarization states to a multilayered screen. The proposed system is composed of two parts: an encoding part that converts depth information to states of polarization and a decoding part that projects depth images to the corresponded diffusing layer. Though the basic principle of Lamina displays has already been verified by previous studies, those schemes suffered from a bottleneck of inferior resolution of the 3D image due to the blurring on the surfaces of diffusing layers in the stacked volume. In this paper, we propose a new structure to implement the decoding part by adopting a form of the wheel screen. Experimental verification is also provided to support the proposed principle.

• The Journal of the Korea Contents Association
• /
• v.15 no.9
• /
• pp.11-20
• /
• 2015

Digital watermarking provides electronic means for proving the copyrights of distributed digital media copies. Research on digital watermarking for images is recently directed toward that for color images extensively used in real life, based on the substantial results in digital watermarking for gray-scale images. Color images have multiple channels, each of which corresponds to a gray-scale image. While there are some watermarking techniques for color images that just apply those for gray-scale images to one channel of the color images, the correlation characteristics between the channels are not considered in them. This paper proposes a zero-watermarking technique that makes keys via combining an image dependent watermark, created through comparing two channels of the color image and copyright watermark scrambled. Due to zero-watermarking, it does not change anything of cover(host) images. Watermark images are robust against some common attacks such as sharpening, blurring, JPEG lossy compression, scaling, and cropping.