• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.10
• /
• pp.2409-2416
• /
• 2015

This paper presents an orientation-based adaptive prediction method for effective lossless image compression. For a robust prediction, the proposed method estimates the directional information and the property near the current pixel in a support region-based fashion, not a pixel-based one which is sensitive to a small variation. We improve the prediction performance effectively by selection of the prediction pixel adaptively according to the similarity between support regions of the current pixel and the neighboring pixels. Comprehensive experiments demonstrate that the proposed scheme achieves excellent prediction performance measured in entropy of the prediction error compared to a number of conventional prediction methods such as MED, GAP, and EDP. Moreover the complexity of the proposed algorithm measured by average execution time is low compared to MED which is the simplest prediction method.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.11
• /
• pp.179-186
• /
• 2009

In this paper, we propose a head detection method based on vertical and horizontal pixel histogram analysis in order to overcome drawbacks of the previous head detection approach using Haar-like feature-based face detection. In the proposed method, we create the vertical and horizontal foreground pixel histogram images from the background subtraction image, which represent the number of foreground pixels in the same vertical or horizontal position. Then we extract feature points of a head region by applying Harris corner detection method to the foreground pixel histogram images and by analyzing corner points. The proposal method shows robust head detection results even in the face image covering forelock by hairs or the back view image in which the previous approaches cannot detect the head regions.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.10
• /
• pp.1280-1285
• /
• 1995

In this paper the optimized overlap driving scheme for improving the reduction problem of the operating voltage range occured by the overlap driving scheme proposed precedently and increasing the contrast ratio of screen image in the simple matrix LCDs is proposed. The characteristic estimation of the proposed method was performed in a condition that the number of scan electrodes was 120 and the threshold voltage of LC pixel was 2V and the overlap rate of scan signal was varied from 0% to 40% . As a result of estimation compared with the overlap driving scheme proposed precedently, this new method was certified as a method which it could increase the operating voltage range of the LC pixel by 16% in 20% overlap condition and it's operating voltage range was also increased very much with the increase of the overlap rate. Consequently this newly proposed method was certified as a method which it could maintain the improvement effect of the operating characteristics obtained by the overlap driving scheme proposed precedently with the big improvement in the contrast ratio of screen image.

• 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.

• Proceedings of the Korean Society of Agricultural Engineers Conference
• /
• 2002.10a
• /
• pp.289-292
• /
• 2002

In this study, a topography based hydrologic model (TOPMODEL) was tested on the Anseong-cheon watershed. Pit in watershed was removed by liner trend surface interpolator. The DTM Analysis program is used to derived a distribution of ln($a/tan{\beta}$) values from DEM (Digital Elevation Model) using the MDF (Multiple Direction Flow) algorithm of Quinn et al (1995). Current TOPMODEL program limits are number of time step, ln($a/tan{\beta}$) increment, delay histogram ordinate and size of subcatchment pixel maps. Therefore, TOPMODEL is not suitable for application of large watershed. Muskingum method and watershed division enhance grid pixel resolution for rainfall-runoff simulation accuracy.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.5
• /
• pp.95-107
• /
• 1994

A new efficient contour following algorithm for connected-component labeling processing is proposed. The basic idea of the algorithm is that the total number of downward chain codes is the same as one of upward chain codes along the closed contour. If the chain code direction is upward, then region start mark is assigned at the chain code departure pixel and if the chain code is downward, then region end mark is assigned at the chain code arrival pixel. The proposed algorithm extracts directly the contour information from only the current direction information of chain. This makes the algorithm simple and fast and requires less memory with comparison to the conventional algorithms.The proposed contour following algorithm can be applied to the various kind of image processing such as region filling, restoration and region feature extraction.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.3 no.4
• /
• pp.175-180
• /
• 2003

In this paper, we present a new method for early depth test for a 3D rendering engine. We add a filter stage to the rasterizer in the 3D rendering engine, in an attempt to identify and avoid the occluded pixels. This filtering block determines if a pixel is hidden by a certain plane. If a pixel is hidden by the plane, it can be removed. The simulation results show that the filter reduces the number of pixels to the next stage up to 71.7%. As a result, 67% of memory bandwidth is saved with simple extra hardware.

• 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 Korea Institute of Military Science and Technology
• /
• v.11 no.3
• /
• pp.115-122
• /
• 2008

Wu and Tsai's pixel-value differencing method and Chang and Tseng's side-match method are based on the theory that the number of bits which can be embedded is determined by the degree of the pixel's smoothness, or its proximity to the edge of the image. If pixels are located in the edge area, they may tolerate larger changes than those in smooth areas. However, both methods are subject to the fall off the boundary problem(FOBP). This study proposes a new scheme that can solve the FOBP. The experimental results demonstrate that the proposed method resolves the problem, and achieves a higher image quality index value than other methods.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.221-224
• /
• 2005

In this paper, we propose a fast video mixing method for reducing the computational complexity in the MCU (Multipoint Control Unit) used in the video conferencing. The conventional mixing method is based on the pixeldomain transcoder, of which computational complexity is linearly increased as the number of participants is increased. Basically the method requires N decoders and one huge encoder to mix the bitstreams from the N participants. To reduce the computational complexity, we propose a hybrid mixing method based on the bitstreamdomain and pixel-domain transcoding methods. The proposed method reduces the computational complexity about 45% at the improved quality, compared with the conventional mixing method based on the pixel-domain transcoders.