• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.8
• /
• pp.35-43
• /
• 1992

We have presented the tracing algorithm for center pixel of character image. Character image was read by scanner device. Performing the tracing process, it can be possible to detect feature points, such as branch point, stroke of 4 directions. So, the tracing process covers the thinning and feature point detection process for improving the processing time. Usage of suggested tracing algorithm instead of thinning that is the preprocessing of character recognition increases speed up to 5 times. The preprocessing chip has been designed by using single layer perceptron algorithm.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2006.08a
• /
• pp.98-102
• /
• 2006

Historically, LCD monitors have not been able to be used for frame-sequential stereoscopic 3D visualisation due to their slow pixel response rate. With LCD pixel response rates now in the single-digit millisecond range it is natural to ask whether it is now possible to achieve frame-sequential stereoscopic 3D viewing on LCDs.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2007.08b
• /
• pp.1330-1332
• /
• 2007

We have newly developed transflective LCDs with a specific sub-pixel and the single cell gap structure. In our structure, the overall transmittance and reflectance has become higher than typical transflective LCDs. Furthermore, it can simplify the fabrication process of the transflective LCDs.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2323-2326
• /
• 2003

Theoretical analysis of the depth measurement system with the use of a single camera and a rotating mirror has hem done. A camera in front of a rotating mirror acquires a sequence of reflected images, from which depth information is extracted. For an object pint at a longer distance, the corresponding pixel in the sequence of images moves at a higher speed. In this paper, the principle d the depth measurement-based on the relation of the pixel movement speed and the depth of objects have been investigated. Also, necessary mathematics to implement the technique is derived and presented. The factors affecting the measurement precision have been studied Analysis shows that the measurement m increases with the increase of depth. The rotational angle of the mirror between two image-takings also affects the measurement precision. Experimental results using the real camera-mirror setup are reported.

• Journal of Korea Multimedia Society
• /
• v.18 no.3
• /
• pp.349-358
• /
• 2015

Simulating color appearance of makeup effect is an important issue in computer graphics as well as cosmetic industry. Most of previous works on makeup simulation are simple color blending to mimic the cosmetic effects. Some of previous works employed Kubelka-Munk model to accurately simulate the layering effect of cosmetics. However, the simulation limited on single point, and the rest of area are still computed by simple color blending utilizing the color of the single point simulation. This paper presents an image-based method to compute the color appearance effect of makeup application using per-pixel Kubelka-Munk model. Unlike the previous methods, it is possible to compute per-pixel application thickness as well as optical property of cosmetics. The computed thickness pattern can be used in makeup simulation for a more realistic makeup simulation.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.06a
• /
• pp.116-119
• /
• 2018

In this paper, we propose a new single-image dehazing method. The proposed method constructs color ellipsoids that are statistically fitted to haze pixel clusters in RGB space and then calculates the transmission values through color ellipsoid geometry. The transmission values generated by the proposed method maximize the contrast of dehazed pixels, while preventing over-saturated pixels. The values are also statistically robust because they are calculated from the averages of the haze pixel values. Furthermore, rather than apply a highly complex refinement process to reduce halo or unnatural artifacts, we embed a fuzzy segmentation process into the construction of the color ellipsoid so that the proposed method simultaneously executes the transmission calculation and the refinement process. The results of an experimental performance evaluation verify that compared to prevailing dehazing methods the proposed method performs effectively across a wide range of haze and noise levels without causing any visible artifacts. Moreover, the relatively low complexity of the proposed method will facilitate its real-time applications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4C
• /
• pp.355-362
• /
• 2009

A new intra field deinterlacing algorithm with edge map in the image block is introduced. Conventional deinterlacing methods usually employ edge-based line average algorithm within pixel-by-pixel approach. However, it is sensitive to variation of intensity. To reduce this shortcoming, we proposed edge direction vector computed by edge map, and also its interpolation technique. We first introduce an edge direction vector, which is computed by Sobel mask, so that finer resolution of the edge direction can be acquired. The proposed edge direction vector oriented deinterlacer operates by identifying small pixel variations in five orientations, while weighted averaging to estimate missing pixel. According to the edge direction of the direction vector, we calculate weights on each edge direction. These weight values multiplied by the candidate deinterlaced pixels in order to successively build approximations of the deinterlaced sequence.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.1
• /
• pp.257-264
• /
• 2019

This paper presents a single image haze removal method via a pixel-based joint BDCP (bright and dark channel prior) and a hierarchical bilateral filter in order to reduce computational complexity and memory requirement while improving the dehazing performance. Pixel-based joint BDCP reduces the computational complexity compared to the patch-based DCP, while making it possible to estimate the atmospheric light in pixel unit and the transmission more accurately. Moreover the bilateral filter, which can smooth an image effectively while preserving edges, refines the transmission to reduce the halo effects, and its hierarchical structure applied to edges only prevents the increase of complexity from the iterative application. Experimental results on various hazy images show that the proposed method exhibits excellent haze removal performance with low computational complexity compared to the conventional methods, and thus it can be applied in various fields.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.136-139
• /
• 2004

The extraction of 'end-pixels' (i.e. end-members) aims to quantify the abundance of different materials in a single pixel, which becomes popular in the subpixel analysis for hyperspectral dataset. In this paper, we present a new concept called 'End-Pixel of Features (EPF)' to extends the concept of end-pixels for multispectral data and even panchromatic data. The algorithm combines the advantages of previous simplex and clustering methods to search the EPFs in the feature space and reduce the effects of noise. Some experimental results show that, the proposed methodology can be successfully used to hyperspectral data and other remote sensing data.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.901-902
• /
• 2008

In this paper, we have proposed a new method to estimate three dimensional (3D) shape of an object. The new method is simple and fast, based on Pixel-Intensities in the images sequence as a model for depth measurement. The images are taken by varying the focus value in small steps, and each pixel in the image is taken as a single measurement. The proposed algorithm is more fast and accurate than previous methods.