• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.8
• /
• pp.50-59
• /
• 1996

In this paper, a new hierarchical motion estiamtion scheme using the wavelet transformed multi-resolution image layers is proposed. Compared with the full search motion estimation method, the existing hierarchical methods remarkably reduce the amount of the computation but their efficiencies are depreciated by the local minima problem. In order to solve the local minima problem, the multi-resolution image layers are composed using the wavelet transform and the number of layers participated in the motion estimation for a block is determined by considering of its low band energy and higher band energy on the first wavelet transformed layer. The ratio between higher band energy and low band energy of each block is evaluated and in the case of the blocks which include relatively large higher band energy, the motion estimation is carried out in the high resolution layer. Otherwise, all layers are used. The final motion vectors are obtained in the first wavelet transformed layer. So less bits for motion vectors are transmitted, and the decomposition of received image using inverse wavelet transform decreases the blocking effect.

• 제어로봇시스템학회:학술대회논문집
• /
• 1998.10a
• /
• pp.221-225
• /
• 1998

This paper is to present a method for recognizing an image of a tracking object by processing the image from a camera, whose attitude is controlled in inertial space with inertial co-ordinate system. In order to recognize an object, a pseudo-random M-array is attached on the object and it is observed by the camera which is controlled on inertial coordinate basis by inertial stabilization unit. When the attitude of the camera is changed, the observed image of M-array is transformed by use of affine transformation to the image in inertial coordinate system. Taking the cross-correlation function between the affine-transformed image and the original image, we can recognize the object. As parameters of the attitude of the camera, we used the azimuth angle of camera, which is de-fected by gyroscope of an inertial sensor, and elevation an91e of camera which is calculated from the gravitational acceleration detected by servo accelerometer.

• Proceedings of the Korean Printing Society Conference
• /
• 2000.04a
• /
• pp.35-44
• /
• 2000

Because Image on the CRT change under different illuminants, human is difficult to see original color of object. If what is information of used illuminant on capturing object know, image can be transformed according to viewing condition using the linear matrix method. To know information of used illuminant at an image, the spectral radiance of illuminant can be estimated using the linear model of Maloney and Wandell form an image. And then image can be properly transformed it using color appearance model. In this paper, we predict the spectral radiance of illuminant using spectral power distribution of specular light and using surface spectral reflectance at maximum gray area. and then we perform visual experiments for the corresponding color reproduction according to viewing condition. In results, we ensure that the spectral radiance of illuminant at an image can be well estimated using above algorithms and that human visual system is 70% adapted to the monitor's white point and 30% to ambient light when viewing softcopy images.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.2
• /
• pp.162-171
• /
• 1991

This paper presents an algorithm for compressing image data by separating the image into two parts. I.e. edge image containing high-frequency components and non-edge image containing low-frequency components of image. The edge image is extracted by using 8 level compass gradient masks and the non-edge image is obtained by removing the edge image from the original image. The edge image is coded by Huffman run-length code and the non edge image is transformed first by DCT and the transformed images is coded next by a quantized bit allocation table. For an example image. GIRL. the proposed algorithm shows bit rate of 0.52 bpp with PSNR of 36dB.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.3
• /
• pp.615-622
• /
• 2007

In general, Harris detector is commonly used for finding salient points in watermarking systems using feature points. Harris detector is a kind of combined comer and edge detector which is based on neighboring image data distribution, therefore it has some limitation to find accurate salient points after watermark embedding or any kinds of digital attacks. In this paper, we have used cross reference points which use not data distribution but geometrical structure of a normalized image in order to avoid pointing error caused by the distortion of image data. After normalization, we find cross reference points and take inverse normalization of these points. Next, we construct a group of triangles using tessellation with inversely normalized cross reference points. The watermarks are affine transformed and transformed-watermarks are embedded into not normalized image but original one. Only locations of watermarks are determined on the normalized image. Therefore, we can reduce data loss of watermark which is caused by inverse normalization. As a result, we can detect watermarks with high correlation after several digital attacks.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.2
• /
• pp.1-8
• /
• 2008

The object of watermarking is to prevent from copying and distributing without the copyright or right of ownership. In case of using watermark as an image data we can detect watermark whether an original image exists or not. In this paper, we proposed that an image data is used for watermark and the watermark is detected without an original image. After the original image is transformed with DWT and the watermark is transformed with DCT, they are transformed with binary number. We calculate an optimal bit position for concealing watermark of an original binary image and insert the watermark and determine the best position for robustness against JPEG compression, filtering, and resampling attacks within inserted watermark image. In this paper, we are able to confirm the right of copyright and ownership easily while using invisible watermark and also we can detect a watermark without an original image.

• Journal of Information Processing Systems
• /
• v.13 no.5
• /
• pp.1372-1381
• /
• 2017

In this paper, a texture feature extraction method using local energy and local correlation of Gabor transformed images is proposed and applied to an image retrieval system. The Gabor wavelet is known to be similar to the response of the human visual system. The outputs of the Gabor transformation are robust to variants of object size and illumination. Due to such advantages, it has been actively studied in various fields such as image retrieval, classification, analysis, etc. In this paper, in order to fully exploit the superior aspects of Gabor wavelet, local energy and local correlation features are extracted from Gabor transformed images and then applied to an image retrieval system. Some experiments are conducted to compare the performance of the proposed method with those of the conventional Gabor method and the popular rotation-invariant uniform local binary pattern (RULBP) method in terms of precision vs recall. The Mahalanobis distance is used to measure the similarity between a query image and a database (DB) image. Experimental results for Corel DB and VisTex DB show that the proposed method is superior to the conventional Gabor method. The proposed method also yields precision and recall 6.58% and 3.66% higher on average in Corel DB, respectively, and 4.87% and 3.37% higher on average in VisTex DB, respectively, than the popular RULBP method.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06a
• /
• pp.181-185
• /
• 1996

Color image is largely corrupted by various ambient illumination. However, human perceives always white color as white under any illumination because of a characteristic of human vision, called color constancy. In the conventional algorithm which applied the constancy effect, after the RGB color space is transformed to the IHS(Intensity, Hue, and Saturation) color space, then the hue is preserved and the intensity or the saturation is properly enhanced. Then the enhanced IHS color is reversely transformed to the RGB color space. In this process, the color distortion is included due to the color gamut error. But in the proposed algorithm, there is not transformation. In that, the RGB color is considered as 3 dimensional color vector and we assume that white color is the natural daylight. As the color vector of the illumination can be calculated as the average vector of R, G, and B image, we can achieve the constancy effect by simply rotating the illumination vector to the white color vector. The simulation results show the efficiency of the vector rotating process for color image enhancement.

• Proceedings of the KOSOMBE Conference
• /
• v.1992 no.05
• /
• pp.55-57
• /
• 1992

Image display is the last step of imaging chain in which the diagnostic information is transformed into perceivable intensities and transformed to observer's eye-brain system. In this process, a certain part of information may be efficiently transfered and another part may be inefficiently transfered leading to information loss. In this study, the visual perceptual properties of image display on CRT monitor has been investigated. Psychophysical experiment of target image detection has been performed using CRT monitor for various background grey levels, and the threshold difference grey levels required for visual discrimination have been predicted by computer simulation with visual model.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.1
• /
• pp.70-76
• /
• 2003

Digital watermarking is a technique embedding hidden information into multimedia data imperceptibly such as images and sounds. Generally an original image is transformed and coded watermark data is embedded in frequency domain watermarking models. In this paper, We propose a new data embedding method using Fresnel transform. A watermark image is fresnel-transformed and the intensity of transformed pattern is embedded into original image. Our watermarking model has the flexibility In data embedding. It is possible to get many embedding patterns from a single watermark image by using various distance parameters with Fresnel transform. All kinds of image models such af shape, letter and photo ran be used as a watermark data. The watermarking experiments were conducted to show the validity of the proposed method, and the results show that our method has the robustness against lossy compression, filtering and geometric transformation.