• Journal of Korea Multimedia Society
• /
• v.13 no.9
• /
• pp.1314-1321
• /
• 2010

In this paper, we study about the vehicle detection algorithm which is in the process of travelling from the road. An input image is segmented by means of split and merge algorithm. And two largest segmented regions are removed for reducing search region and speed up processing time. In order to detect the back side of the front vehicle considers a vertical/horizontal component, uses an integral image with to apply Haar-like methods which are the possibility of shortening a calculation time, classified with SVM. The simulation result of the method which is proposed appeared highly.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10C
• /
• pp.1023-1032
• /
• 2003

Object-based coding, such as MPEG-4, enables various content-based functionalities for multimedia applications. In order to support such functionalities, as well as to improve coding efficiency, each frame of video sequences should be segmented into video objects. In this paper. we propose an effective video object segmentation method using nonlinear multiscale filtering and spatio-temporal information. Proposed method performs a spatial segmentation using a nonlinear multiscale filtering based on the stabilized inverse diffusion equation(SIDE). And, the segmented regions are merged using region adjacency graph(RAG). In this paper, we use a statistical significance test and a time-variant memory as temporal segmentation methods. By combining of extracted spatial and temporal segmentations, we can segment the video objects effectively. Proposed method is more robust to noise than the existing watershed algorithm. Experimental result shows that the proposed method improves a boundary accuracy ratio by 43% on "Akiyo" and by 29% on "Claire" than A. Neri's Method does.

• Journal of KIISE:Software and Applications
• /
• v.27 no.12
• /
• pp.1219-1226
• /
• 2000

본 논문에서는 유전자 알고리즘과 피라미드(다단계 또는 다 해상도)를 결합한 새로운 영상분할 방법을 제안하다. 먼저, 영상을 피라미드의 해상도가 낮은 상위 단계로 분할하고 좋은 적합도를 가진 염색체의 개체군을 얻는다. 둘째, 해상도를 높인 다음 단계의 입력으로 앞 단계에서 얻은 염색체들을 사용하며, 더욱 세분화된 분할이 이루어지도록 염색체를 진화시키다. 유전자 알고리즘의 적합함수는 각 영역의 규질성과 peakiness를 이용하여 정의하였다. 교차는 교차점을 중심으로 영상을 2분하여 서로 교환하는 1점 교환법을 사용하였으며, 돌연변이는 병합과 분할이 이루어지도록 설계하였다. 본 논문은 저 해상도에서 가능성(적합성)이 큰 유전자를 신속히 구한 훙 단계적으로고 해상도에서 적합한 유전자로 진화시켜 나가는 방법으로 처음부터 최고 해상도에 유전자 알고리즘을 적용하는 종전의 방법보다 훨씬 더 효율적이며 유전자 알고리즘과 다단계 기법의 이상적인 결합이라 할 수 있다. 분할 결과에서도 타 알고리즘에 비하여 우수하거나 비슷한 결과를 얻었다.

• Journal of Platform Technology
• /
• v.9 no.2
• /
• pp.46-54
• /
• 2021

Recently, interest in the safety of Self-driving has been increasing. Self-driving have been studied and developed by many universities, research centers, car companies, and companies of other industries around the world since the middle 1980s. In this study, we propose the automatic extraction method of the threatening obstacle on the Road for the Self-driving. A threatening obstacle is defined in this study as a comparatively large object at center of the image. First of all, an input image and its decreased resolution images are segmented. Segmented areas are classified as the outer or the inner area. The outer area is adjacent to boundaries of the image and the other is not. Each area is merged with its neighbors when adjacent areas are included by a same area in the decreased resolution image. The Obstacle area and Non Obstacle area are selected from the inner area and outer area respectively. Obstacle areas are the representative areas for the obstacle and are selected by using the information about the area size and location. The Obstacle area and Non Obstacle area consist of the threatening obstacle on the road. Through experiments, we expect that the proposed method will be able to reduce accidents and casualties in Self-driving.

• The KIPS Transactions:PartB
• /
• v.10B no.4
• /
• pp.465-472
• /
• 2003

For an effective pre-treatment process of a face input image, it is necessary to detect each of face components, calculate the face area, and estimate the rotary angle of the face. A proposed method of this study can estimate an robust result under such renditions as some different levels of illumination, variable fate sizes, fate rotation angels, and background color similar to skin color of the face. The first step of the proposed method detects the estimated face area that can be calculated by both adapted skin color Information of the band-wide HSV color coordinate converted from RGB coordinate, and skin color Information using histogram. Using the results of the former processes, we can detect a lip area within an estimated face area. After estimating a rotary angle slope of the lip area along the X axis, the method determines the face shape based on face information. After detecting eyes in face area by matching a partial template which is made with both eyes, we can estimate Y axis rotary angle by calculating the eye´s locations in three dimensional space in the reference of the face area. As a result of the experiment on various face images, the effectuality of proposed algorithm was verified.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.5
• /
• pp.77-84
• /
• 2008

This paper proposes a new approach to eliminate the reflectance component for the localization of text in natural scene images. Natural scene images normally have an illumination component as well as a reflectance component. It is well known that a reflectance component usually obstructs the task of detecting and recognizing objects like texts in the scene, since it blurs out an overall image. We have developed an approach that efficiently removes reflectance components while Preserving illumination components. We decided whether an input image hits Normal or Polarized for determining the light environment, using the histogram which consisted of a red component. In the normal image, we acquired the text region without additional processing. Otherwise we removed light reflecting from the object using homomorphic filtering in the polarized image. And then this decided the each text region based on the color merging technique and the Saliency Map. Finally, we localized text region on these two candidate regions.

• Journal of Intelligence and Information Systems
• /
• v.13 no.1
• /
• pp.15-27
• /
• 2007

In Korea, hepatoma is the thirdly frequent cause of death from cancer occupying 17.2% among the whole deaths from cancer and the rate of death from hepatoma comes to about 21's persons per one-hundred thousand ones. This paper proposes an automatic method for the extraction of areas being suspicious as hepatoma from a CT scan and evaluates the availability as an auxiliary tool for the diagnosis of hepatoma. For detecting tumors in the internal of the liver from CT scans, first, an area of the liver is extracted from about $45{\sim}50's$ CT scans obtained by scanning in 2.5-mm intervals starting from the lower part of the chest. In the extraction of an area of the liver, after unconcerned areas outside of the ribs being removed, areas of the internal organs are separated and enlarged by using intensity information of the CT scan. The area of the liver is extracted among separated areas by using information on position and morphology of the liver. Since hepatoma is a hypervascular turner, the area corresponding to hepatoma appears more brightly than the surroundings in contrast-enhancement CT scans, and when hepatoma shows expansile growth, the area has a spherical shape. So, for the extraction of areas of hepatoma, areas being brighter than the surroundings and globe-shaped are selected as candidate ones in an area of the liver, and then, areas appearing at the same position in successive CT scans among the candidates are discriminated as hepatoma. For the performance evaluation of the proposed method, experiment results obtained by applying the proposed method to CT scans were compared with the diagnoses by radiologists. The evaluation results showed that all areas of the liver and liver tumors were extracted exactly and the proposed method has a high availability as an auxiliary diagnosis tools for the discrimination of liver tumors.

• Journal of the Korea Computer Graphics Society
• /
• v.9 no.1
• /
• pp.11-18
• /
• 2003

본 논문에서는 회화적 렌더링에서 칼라변환을 이용한 브러쉬 스트로크의 생성에 관한 새로운 알고리즘을 제안한다. 본 논문의 브러쉬 스트로크 생성을 위한 전체적인 구성은 다음과 같다. 첫째, 두 장의 사진(한 장의 소스 이미지와 한 장의 참조 이미지)을 입력으로 하여 칼라 변환 이론을 적용하여 색상 테이블이 바뀐 새로운 이미지를 생성한다. 이 방법은 소스 이미지의 칼라 분포 형태를 창조 이미지의 칼라 분포 형태로 변환하기 위해, 선형 히스토그램 매칭이라 불리는, 간단한 통계학적 방법을 이용한다. 둘째, 가우시안 블러링과 소벨 필터를 이용하여 에지를 검출한다. 검출된 에지는 브러쉬 스트로크 렌더링 시 에지 부분에서 스트로크를 클리핑 함으로써 이미지의 윤곽선 보존을 위해 사용된다. 셋째, 브러쉬 스트로크의 방향을 결정하기 위한 방향맵을 생성한다. 방향맵은 입력 영상에 대한 영역 분할 및 병합을 토대로 만들어진다. 영역별 각 픽셀들에 대해 이미지 그래디언트에 기초한 일정한 방향을 부여함으로써 방향맵을 구성한다. 넷째, 구성된 방향맵을 참조하여 브러쉬 스트로크 생성의 기초가 되는 베지어 곡선(Bezier Curve)의 제어점(Control point)을 설정한다. 실제 회화작품에서 사용되는 브러쉬 스트로크는 일반적으로 곡선의 형태를 이루므로 곡선 표현이 가능한 베지어 곡선을 이용하여 브러쉬 스트로크를 표현하였다. 마지막으로, 생성된 브러쉬 스트로크를 에지부문에서 클리핑하고 배경색을 참조하여 블렌딩하거나 퐁 조명 모델을 이용하여 이미지에 적용하게 된다.

• Journal of Biomedical Engineering Research
• /
• v.24 no.2
• /
• pp.91-97
• /
• 2003

The Propose of this paper is hierarchical detection method for the optic disc in fundus image. We detected the optic disc boundary by using the Prior information. It is based on the anatomical knowledge of fundus which are the vessel information. the image complexity. and etc. The whole method can be divided into three stages . First, we selected the region of interest(ROI) which included optic disc region. This is used to calculate location and size of the optic disc which are prior knowledge to simplify image preprocessing. And then. we divided the fundus image into numberous regions with watershed algorithm and detected intial boundary of the optic disc by reducing the number of the separated regions in ROI. Finally, we have searching the defective parts of boundary as a result of serious vessel interference in order to detect the accurate boundary of optic disc and we have removing and interpolating them.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.10
• /
• pp.713-722
• /
• 2013

This paper proposes a method of using depth information to detect the hand region in real-time based on the cascade method. In order to ensure stable and speedy detection of the hand region even under conditions of lighting changes in the test environment, this study uses only features based on depth information, and proposes a method of detecting the hand region by means of a classifier that uses boosting and cascading methods. First, in order to extract features using only depth information, we calculate the difference between the depth value at the center of the input image and the average of depth value within the segmented block, and to ensure that hand regions of all sizes will be detected, we use the central depth value and the second order linear model to predict the size of the hand region. The cascade method is applied to implement training and recognition by extracting features from the hand region. The classifier proposed in this paper maintains accuracy and enhances speed by composing each stage into a single weak classifier and obtaining the threshold value that satisfies the detection rate while exhibiting the lowest error rate to perform over-fitting training. The trained classifier is used to classify the hand region, and detects the final hand region in the final merger stage. Lastly, to verify performance, we perform quantitative and qualitative comparative analyses with various conventional AdaBoost algorithms to confirm the efficiency of the hand region detection algorithm proposed in this paper.