• Journal of the Institute of Convergence Signal Processing
• /
• v.7 no.3
• /
• pp.95-101
• /
• 2006

A face detection plays an important role in face recognition, video surveillance, and human computer interaction. In this paper, we propose a progressive threshold method to detect human faces in real time. The consecutive face images are acquired from camera and transformed into YCbCr color space images. The skin color of the input images are separated using a skin color filter in the YCbCr color space and some candidated face areas are decided by connected component analysis. The intensity equalization is performed to avoid the effect of many circumstances and an arbitrary threshold value is applied to get binary images. The eye area can be detected because the area is clearly distinguished from others in the binary image progressive threshold method searches for an optimal eye area by progressively increasing threshold from low values. After progressive thresholding, the eye area is normalized and verified by back propagation algorithm to finalize the face detection.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.85-88
• /
• 2001

In this paper we consider a problem of blind co-channel signal separation, the goal of which is to estimate multiple co-channel digitally modulated signals using an antenna array. We employ the joint maximum likelihood estimation and present a sequential algorithm, which is referred to as sequential joint maximum likelihood (SJML) algorithm. It separates multiple co-channel signal on-line and converges fast in overdetermined noisy communication environment. And the computational complexity of SJML for M-QAM (M=8, 16, 64,...) signals is less expensive compared to the SLSP. Useful behavior of this algorithm are confirmed by simulations.

• Journal of the Korea Computer Graphics Society
• /
• v.4 no.2
• /
• pp.57-68
• /
• 1998

가상 현실의 궁극적인 목표중의 하나는 참여자가 가치 있는 경험을 얻을 수 있도록 하는 것이다. 경험의 내용은 순차적인 이벤트들로서 구성될 수 있으며 본 논문은 이런 이벤트들을 저작(event authoring)하기 위한 알고리듬을 개발하는 것을 목적으로 한다. Event authoring을 위해서 우리는 우선, 가상환경에 포함되는 개체들의 구조를 제안한다. 그리고, event-program을 기술하여 실험을 행할 수 있게 하는 수단인 event authoring language와 event-program 실행 시에 핵심이 되는 event execution manager를 구현한다. 마지막으로, 몇 가지 실험을 통하여 본 논문에서 제시된 접근방법이 유효함을 증명한다.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1996.10a
• /
• pp.61-65
• /
• 1996

본 논문은, 공간영역에서 화상을 압축할 수 있는 Quad-tree 부호화법을 분석하고, 보다 화질 및 압축율을 개선하기 위하여 적응 불록분할 및 병합 알고리듭을 제안하엿다. 화상은 에지부분을 제외하고는 인접한 화소들간에 데이터의 용장도가 높으므로 이 영역을 하나의 대표값으로 설정하여 그 값과 그 블록의 위치좌표를 부호화할 수 있다. Quad-tree 분할은 초기의 병합을 제외하고 순차적으로 분할과정만 반복처리하지만 본 알고리듬에서는 단위블록(3$\times$3 호소) 의 평균잘류에너지(MRE)를 이용하여 블록의 분할과 병합을 반복처리한다. 시뮬레이션결과, 본 알고리듭은 압축율 1bit/pixel에서 기존의 Quad-tree 방법보다 PSNR에서 1.0dB의 개선이 있었으며, 화상의 블록화 현상도 전혀 나타나지 않았다.

• Journal of Navigation and Port Research
• /
• v.39 no.4
• /
• pp.307-312
• /
• 2015

ARPA(Automatic Radar Plotting Aid) is a device to calculate CPA(closest point of approach)/TCPA(time of CPA), true course and speed of targets by vector operation of relative courses and speeds. The purpose of this study is to develop target acquisition and tracking technology for ARPA Radar implementation. After examining the previous studies, applicable algorithms and technologies were developed to be combined and basic ARPA functions were developed as a result. As for main research contents, the sequential image processing technology such as combination of grayscale conversion, gaussian smoothing, binary image conversion and labeling was deviced to achieve a proper target acquisition, and the NNS(Nearest Neighbor Search) algorithm was appllied to identify which target came from the previous image and finally Kalman Filter was used to calculate true course and speed of targets as an analysis of target behavior. Also all technologies stated above were implemented as a SW program and installed onboard, and verified the basic ARPA functions to be operable in practical use through onboard test.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.2
• /
• pp.30-39
• /
• 2009

Extraction of glomeruli region plays a very important role for diagnosing nephritis automatically. However, it is not easy to extract glomeruli region correctly because the difference between glomeruli region and other region is not obvious, simultaneously unevennesses that is brought in the sampling process and in the imaging process. In this study, a new method for extracting renal glomeruli region using genetic algorithm is proposed. The first, low and high resolution images are obtained by using Laplacian-Gaussian filter with ${\sigma}=2.1$ and ${\sigma}=1.8$, then, binary images by setting the threshold value to zero are obtained. And then border edge is detected from low resolution images, the border of glomeruli is expressed by a closed B-splines' curve line. The parameters that decide the closed curve line with this low resolution image prevent the noises and the border lines from breaking off in the middle by searching using genetic algorithm. Next, in order to obtain more precise border edges of glomeruli, the number of node points is increased and corrected in order from eight to sixteen and thirty two from high resolution images. Finally, the validity of this proposed method is shown to be effective by applying to the real images.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.5
• /
• pp.71-78
• /
• 1989

To estimate a performance of MIM's a network modeling method and a simulation algorithm are proposed, and this algorithm is programmed by C language. Especially, state variables are defined to process many concurrent requests ar inputs and a data structure, which contains network informations, is proposed to keep track of each stage. This simulation can be applied to computers which are designed for sequential processing. This method can be used to estimate a performance of MIN's instead of using complex mathematical method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10C
• /
• pp.1469-1483
• /
• 2004

We propose a packet scheduling algorithms for streaming media. We assume that the receiver periodically reports back the channel throughput. From the original video data, the importance level of a video packet is determined by its relative position within its group of pictures, taking into account the motion-texture discrimination and temporal scalability. Thus, we generate a number of nested substreams. Using feedback information from the receiver and statistical characteristics of the video, we model the streaming system as a queueing system, compute the run-time decoding failure probability of a Same in each substream based on effective bandwidth approach, and determine the optimum substream to be sent at that moment in time. Since the optimum substream is updated periodically, the resulting sending order is different from the original playback order. From experiments with real video data, we show that our proposed scheduling scheme outperforms the conventional sequential sending scheme.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.14 no.4
• /
• pp.123-131
• /
• 2006

The majority of pedestrian fatalities and injuries are caused by vehicle-pedestrian accidents. Recently, it has been recognized as a serious problem. Injuries of occupants in a vehicle have been decreased considerably. However, efforts for protection of pedestrians are still insufficient. These days, many advanced industries are striving for a better protection of pedestrians by using an active hood lift system, rather than reforming the existing structure. In this research, the active hood lift system is designed to enhance the performance for protection. The active hood lift system is analyzed by using the nonlinear finite element method. An optimization problem is formulated by incorporation of the analysis results. Orthogonal arrays are utilized to solve the formulated problem. An iterative optimization algothrithm using orthogonal arrays is utilized for design in the discrete space. It is found that the method can remarkably decrease the number of function evaluations.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.28 no.9
• /
• pp.1399-1407
• /
• 2004

Structural optimization has been carried out in continuous design space or in discrete design space. Generally, available designs are discrete in design practice. However, the methods for discrete variables are extremely expensive in computational cost. An iterative optimization algorithm is proposed for design in a discrete space, which is called a sequential algorithm using orthogonal arrays (SOA). We demonstrate verifying the fact that a local optimum solution can be obtained from the process with this algorithm. The local optimum solution is defined in a discrete design space. Then the search space, which is a set of candidate values of each design variables formed by the neighborhood of a current design point, is defined. It is verified that a local optimum solution can be found by sequentially moving the search space. The SOA algorithm has been applied to problems such as truss type structures. Then it is confirmed that a local solution can be obtained by using the SOA algorithm