• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.544-547
• /
• 1999

This paper proposes a high-speed texture mapping algorithm and apply it for the realtime face animation. The mapping process devide into pixel correspondences, Z-buffering, and pixel value interpolation. Pixel correspondences and Z-buffering are calculated exactly through the algorithm. However, pixel values interpolation is approximated without additional calculations. The algorithm dramatically reduces the operations needed for texture mapping. Only three additions are needed in calculation of a pixel value. We simulate the 256$\times$240 pixel facial image with about 100 pixel face width. Simulation results shows that frame generation speed are about 60, 44, 21 frames/second in pentium PC 550MHz, 400MHz, 200MHz, respectively,

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.21 no.4
• /
• pp.368-375
• /
• 2008

In this paper, we calculated the pixel and all the inter-electrode capacitances in a unit pixel of three kinds of TFT-LCD modes in order to realize the full color image. And we analyzed the effect on applied voltage. We fixed size of sub-pixel and designed a unit pixel of three kinds of TFT-LCD modes. We calculated rigorously the pixel and all the inter-electrode capacitances by the three dimensional simulation. And we expanded one pixel into whole panel using H-SPICE. As a result, we calculated the RMS voltage and kickback voltage which most affect gray scale of the pixel and calculated the number of bit according to permissible range of minimum gray scale using V-T curve.

• Journal of Industrial Technology
• /
• v.28 no.A
• /
• pp.35-42
• /
• 2008

Recently, there are a lot of multimedia products to using image interpolation system. However, most interpolation systems in existence suffer visually to some extents the effects of blurred edges and jagged artifacts in the image. I in this paper, we propose the adaptive linear interpolation system that uses the sub-pixel. We system calculate the warped distance among the pixels of an image, and use data for Optimize length parameter. Our experimental results show that our new algorithm significantly outperforms linear interpolation in subjective quality, and in most cases, in terms of PSNR as well.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2006.04a
• /
• pp.211-216
• /
• 2006

The Constrained Linear Spectral Unmixing(CLSU) is investigated for sub-pixel image processing, Its result is the abundance map which mean fractions of endmember existing in a mixed pixel. Compared to the Linear Spectral Unmixing using least square method, CLSU uses the NNLS (Non-Negative Least Square) algorithm to guarantee that the estimated fractions are constrained. But, CLSU gets Into difficulty in image processing due to select endmember at a user's disposition. In this study, endmember selection optimization method using entropy in the error-image analysis is proposed. In experiments which is used hyperion image, it is shown that our method can select endmember number than CLSU based on unsupervised endemeber selection.

• Journal of Korea Multimedia Society
• /
• v.4 no.4
• /
• pp.234-332
• /
• 2001

For a method improving fractal image segmentation which is a new application of fractal image coding, YST scheme have proposed an image segmentation scheme using labeling based on periodic points of pixel transformation and error-correction of labels by iterating fractal transformation. The scheme generates the high quality segmentation, however, it has the redundancy in the process of labeling and correction of labels. To solve this problem, we propose a labeling algorithm based on orbit of pixel transformation and restricted condition on iterating process of fractal transformation.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.1105-1108
• /
• 1999

In this paper, we propose a new addressing mode, which can be used for programmable image processor to perform image- processing algorithms effectively. Conventional addressing modes are suitable for one-dimensional data processing such as voice, but the proposed addressing mode consider two-dimensional characteristics of image data. The proposed instruction for two-dimensional addressing requires two operands to specify a pixel and doesn't require any change of memory architecture. Combining several instructions to load a pixel-data from an external memory to a register, the proposed instruction reduces code size so that satisfy hish performance and low power requirements of image processor. In addition, it uses inherent two-dimensional characteristics of image data and offers user-friendly instruction to assembler programmer.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2006.06a
• /
• pp.34-39
• /
• 2006

An automated surface-strain measurement system, named ASIAS, was developed by using the image processing and stereo vision techniques in the previous studies by the corresponding author and his coworkers. This system has been upgraded mainly to improve the accuracy through image enhancement, sub-pixel measurement, surface smoothing, etc., since the first version was released. The present study has still more improved the convenience of users as well as the accuracy of measurement by processing high resolution images 8 mega pixels or more which can be easily obtained from a portable digital steal camera. It is proved that high resolution image processing greatly decreases the measurement error and gives strain data without considerable deterioration of accuracy even when the deformed grids to be measured and the master grids for camera calibration are captured together in the same image, making the whole process of strain measurement much simpler.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.10 no.2
• /
• pp.80-85
• /
• 2011

In this paper, I propose flexible base point used for a BTC(Block Truncation Coding). Halftoning images are used for printer by reducing the number of pixel depth. During over 20 years, many researches have been studied to apply this techniques to image compression. BTC algorithms are the compression methods using digital halftoning technique about images. In the BTC algorithm, an image block is divided into higher and lower domain compared with the mean of block. then the MAX and MIN representative values are evaluated by calculating the mean of higher and lower domain respectively. At a result, an image block(for example 88 size) is compressed into 64bits pixel representation and 16 bits of the MAX and MIN. And they also have been tried to sustain the image quality high after compression. In this paper, I found that there is some marginal possibility to enhance the image quality by adjusting the base point(generally mean of block) of existing algorithms.

• Journal of the Optical Society of Korea
• /
• v.12 no.2
• /
• pp.79-87
• /
• 2008

We have developed a miniature fisheye lens with $190^{\circ}$ field of view operating simultaneously in the visible and the near infrared wavelengths. The modulation transfer function characteristic for the visible wavelength is sufficient for a mega-pixel-grade image sensor. The lens also has a fair resolution in the infrared wavelength region. The calibrated $f-{\theta}$ distortion is less than 5%, and the relative illumination is over 90%. In consequence, a sharp wide-angle image can be obtained which is uniform in brightness over the entire range of field angles. The real image heights for the visible and the near infrared wavelengths have been fitted to polynomial functions of incidence angle with sub-pixel accuracies. Combined with the near equidistance projection scheme of the lens, this lens can be advantageously employed in various image-processing applications requiring a wide-angle lens.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.15 no.1
• /
• pp.99-107
• /
• 2019

Retinex-based image enhancement is a technique that utilizes the property that the human visual characteristics are sensitive to the difference from the surrounding pixel value rather than the pixel value itself. These Retinex-based algorithms show different characteristics of the improved image depending on the applied color space or gamma correction. In this paper, we set eight different experimental conditions according to the application of color space and gamma correction, and analyze the objective and subjective performance of each Retinex based image enhancement algorithm and apply it to the implementation of Retinex based algorithm. In the case of gamma correction, quantitative low entropy images and low contrast images are obtained. The application of Retinex technique in HSI color space rather than RGB color space is found to be high in overall subjective image quality as well as maintaining color.