• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.1689-1694
• /
• 2005

Face detection plays an important role in face recognition, video surveillance, and human computer interface. In this paper, we present a face detection system using eye detection with progressive thresholding from a digital camera. The face candidate is detected by using skin color segmentation in the YCbCr color space. The face candidates are verified by detecting the eyes that is located by iterative thresholding and correlation coefficients. Preprocessing includes histogram equalization, log transformation, and gray-scale morphology for the emphasized eyes image. The distance of the eye candidate points generated by the progressive increasing threshold value is employed to extract the facial region. The process of the face detection is repeated by using the increasing threshold value. Experimental results show that more enhanced face detection in real time.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
• /
• pp.438-441
• /
• 2004

Image binarization using a global threshold value [3] performs at high speed, but usually results in undesired binary images when the source images are of poor quality. In such cases, adaptive local thresholding algorithms [1][2][3] are used to obtain better results, and the algorithm proposed by A.E.Savekis which chooses local threshold using fore­ground and background clustering [1] is one of the best thresholding algorithms. However, this algorithm runs slowly due to its re-computing threshold value of each central pixel in a local window MxM. In this paper, we present a dynamic programming approach for the step of calculating local threshold value that reduces many redundant computations and improves the execution speed significantly. Experiments show that our proposal improvement runs more ten times faster than the original algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.287-287
• /
• 2000

As a method to control the bacteria number in adequate level, a real time control system based on microscope image processing measurement for the bacteria is adopted. For the experiment, Ammonia-oxidizing bacteria such as Acinetobacter sp. are used. This paper proposed hybrid method combined watershed algorithm with adaptive automatic thresholding method to enhance segmentation efficiency of overlapped image. Experiments was done to show the effectiveness of the proposed method compared to traditional Otsu's method, Otsu's method with adaptive automatic thresholding method and human visual method.

• 한국지능시스템학회논문지
• /
• 제23권2호
• /
• pp.139-143
• /
• 2013

기존의 영상 이진화에 대한 알고리즘의 기본 아이디어는 영상이 회색 수준의 차이에 의하여 물체와 배경으로 구분된다는 가정에서 이루어지고 있다. 본 논문에서는 이러한 가정을 확장하여 영상은 물체와 배경뿐만 아니라 하나를 더 추가하여 그 테두리로 이루어진다고 가정하고 테두리 검출에 기반한 이진화 기법을 제안한다. 제안한 방법의 타당성을 보이기 위하여 6개의 잘 알려진 영상에 대하여 모의실험을 수행하고, 그 결과로부터 기존의 방법들과의 성능을 비교 검토한다.

• 한국컴퓨터정보학회논문지
• /
• 제7권4호
• /
• pp.163-167
• /
• 2002

본 연구는 이미지 디노이징을 위한 새로운 공간 적응적 웨이블릿 임계화를 제안하였다. 웨이블릿 임계화를 이용한 디노이징은 최상의 기저함수와 임계치를 구하는 연구에 집중되어왔으나 이미지의 통계적 특성의 변화에 효과적으로 적용되는 방법은 아직 충분하지 않은 상태이다. 제안된 방법에 의한 실험 결과는 Wiener필터링 방법과 Level dependent 임계치 방법보다 좋은 결과를 나타내었다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.126-128
• /
• 2006

For pattern matching, an object image should be segmented and analyzed for the first time. Thresholding is a fundamental approach to segmentation that utilizes a significant degree of pixel popularity or intensity. Otsu's thresholding is one of the most veil-known methods proposed in the literature. However, the method has a disadvantage of repeatedly searching the optimal thresholds for the entire region. To overcome this problem, a number of methods have been proposed. In this paper, we propose a simple and fast thresholding method of finding multi-level threshold values by extending the Otsu's method. Our experimental results for the benchmak images show a possibility that the proposed method could be used efficiently for pattern matching.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(4)
• /
• pp.77-80
• /
• 2000

In this paper, we present a new automatic thresholding algorithm based on maximum entropy of two-dimensional pixel histogram. While most of the previous algorithms select thresholds depending only on the histogram of gray level itself in the image, the presented algorithm considers 2D relational histogram of gray levels of two adjacent pixels in the image. Thus, the new algorithm tends to leave salient edge features on the image after thresholding. The experimental results show the good performance of the presented algorithm.

• 한국항공우주학회지
• /
• 제35권11호
• /
• pp.1043-1051
• /
• 2007

디지털 태양센서는 CMOS 이미지 센서에 맺힌 태양광 이미지를 이용하여 태양광의 입사 각도를 계산한다. 이를 위해서는 태양광 이미지의 정확한 중심점을 찾아야하며 따라서 정밀한 중심점 추정은 디지털 태양센서 개발에서 가장 중요한 요소가 된다. 중심점을 찾기 위해서 가장 일반적으로 쓰이는 중심 알고리즘은 thresholding 방법이며 가장 단순하고 구현하기 쉽다. 또 다른 알고리즘으로는 이미지 처리를 이용하는 image filtering 방법이 있다. 하지만 이러한 방법들은 태양센서 정밀도가 이미지 센서에서 획득한 태양광 강도(intensity) 데이터의 노이즈에 영향을 많이 받으며, 특히 thresholding 방법의 경우 threshold 값에 따라 정밀도가 바뀌기 때문에 효과적인 threshold 값을 정하기 어려운 단점이 있다. 따라서 본 논문에서는 태양광 이미지의 중심점을 구하기 위해서 태양광 이미지 모델을 이용하는 template 방법을 제시하고 성능을 비교 분석하였다. 제안한 template 방법은 thereshold, image filtering 방법과 달리 비교적 높은 정밀도를 가지며, 특히 노이즈 수준에 관계없이 거의 일정한 수준의 정밀도를 가지는 장점이 있어 신뢰성이 높다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집; 한국과학기술대학, 충남; 16-17 Oct. 1987
• /
• pp.488-491
• /
• 1987

In this paper. a heuristic multi-thresholding algorithm is proposed to extract objects from background. Specifically the proposed algorithm finds out multi valleys from gray level histogram automatically and non-recursively. Some experimental result for various types of image. are presented, to show the effectiveness of the proposed algorithm.

• Journal of Biosystems Engineering
• /
• 제38권2호
• /
• pp.149-162
• /
• 2013

Purpose: In image segmentation via thresholding, Otsu and Kapur methods have been widely used because of their effectiveness and robustness. However, computational complexity of these methods grows exponentially as the number of thresholds increases due to the exhaustive search characteristics. Methods: Particle swarm optimization (PSO) and genetic algorithms (GAs) can accelerate the computation. Both methods, however, also have some drawbacks including slow convergence and ease of being trapped in a local optimum instead of a global optimum. To overcome these difficulties, we proposed two new multi-level thresholding methods based on Bacteria Foraging PSO (BFPSO) and real-coded GA algorithms for fast segmentation. Results: The results from BFPSO and real-coded GA methods were compared with each other and also compared with the results obtained from the Otsu and Kapur methods. Conclusions: The proposed methods were computationally efficient and showed the excellent accuracy and stability. Results of the proposed methods were demonstrated using four real images.