• Journal of the Korea Society of Computer and Information
• /
• v.13 no.1
• /
• pp.75-80
• /
• 2008

This paper proposes a method to detect scene change using global decision tree that extract boundary cut that have width of big change that happen by camera brake from difference value of frames. First, calculate frame difference value through regional X2-histogram and normalization, next, calculate distance between difference value using normalization. Shot boundary detection is performed by compare global threshold distance with distance value for two adjacent frames that calculating global threshold distance based on distance between calculated difference value. Global decision tree proposed this paper can detect easily sudden scene change such as motion from object or camera and flashlight.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.6
• /
• pp.1169-1174
• /
• 2001

A new approach for determining global threshold value of binary image is proposed in this paper. In the proposed algorithm, bit-plane information which involve the shapes of original image is used for dividing image into two parts; object and background. Optimal threshold value are selected based on difference values of average between two regions, which is considered in global binary thresholding. Proposed method is no need to set a initial value, and consequently, it is relatively simple as well as robust. Experimental results showed a good performance in preserving edge not only continuous tone images but also document image.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.4
• /
• pp.1-5
• /
• 2001

A new approach for determining global threshold value for image binarization is proposed in this paper. In the proposed algorithm, bit-plane information which involve the shapes of original image is used for dividing image into two parts object and background, and then compared each average values. Optimal threshold value are selected in center of two averages. Proposed method is relatively simple but robust and achieved good results in continuous tone images and document image.

• The Journal of the Korea Contents Association
• /
• v.11 no.6
• /
• pp.18-25
• /
• 2011

Salient object attracts more and more attention from researchers due to its important role in many fields of multimedia processing like tracking, segmentation, adaptive compression, and content-base image retrieval. Usually, a saliency map is binarized into black and white map, which is considered as the binary mask of the salient object in the image. Still, the threshold is heuristically chosen or parametrically controlled. This paper suggests using the global optimal threshold to perform saliency map thresholding. This work also considers the usage of multi-level optimal thresholds and the local adaptive thresholds in the experiments. These experimental results show that using global optimal threshold method is better than parametric controlled or local adaptive threshold method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.10
• /
• pp.1877-1884
• /
• 2006

Image binarization is an important preprocessing to identify objects of interest by dividing pixels into background and objects. Usually binarization methods are classified into global and local thresholding approaches. In this paper, we propose an efficient and adaptive binarization method for the character segmentation by combining both advantages of the global and the local thresholding methods. Experimental results with the korean character images present that the proposed method binarizes character image faster and better than other local binarization methods.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.11a
• /
• pp.33-36
• /
• 2012

변이 탐색 범위는 스테레오 정합을 위한 변이 추정 알고리즘의 성능에 가장 큰 영향을 줄 수 있는 변수 중 하나이다. 일반적으로 이러한 변이 탐색 범위는 영상 전체의 최소 변이 값과 최대 변이 값의 범위로 정의된 전역적인 탐색 범위를 사용하게 된다. 이러한 전역적인 탐색 범위는 픽셀에 따라서 불필요한 범위에까지 탐색하게 하며, 이는 변이 추정의 성능적, 속도적 측면에서 좋지 않은 영향을 미치게 된다. 본 논문에서는 픽셀에 따라 변이 탐색 범위를 제한시키는 방법을 제안한다. 낮은 계산 복잡도를 갖는 간단한 변이 추정 알고리즘을 통해 먼저 변이 지도를 생성하여 각 픽셀 당 윈도우를 대응하여 변이 히스토그램을 만든다. 변이 히스토그램에 적응적인 임계 값을 적용하여 픽셀당 변이 후보군을 결정한다. 전역적인 변이 탐색 범위와 제안하는 방법으로 제한된 변이 탐색 범위를 각각 동일한 변이 추정 알고리즘에 적용해 보는 실험을 통해 제안하는 방법의 성능을 분석하였다. 실험 결과로부터 제안하는 방식은 변이 추정 알고리즘의 정확도 측면의 성능을 향상시켰고, 알고리즘의 속도를 평균 5배 이상 향상시켜주는 결과를 보여주었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10b
• /
• pp.398-400
• /
• 2000

이 논문은 웹에서 찾을 수 있는 비디오 포맷들에 대한, 간단하고 개선된 비디오 세그먼테이션 방법을 다룬다. 2개의 임계 값을 이용해서 효과적인 비디오 프레임간의 차이를 비교한다. 또한 개체의 이동과 같은 이유로 프레임 사이에 차이가 날 경우, 하지만 다른 비디오 세그먼테이션이라고 볼 수 없을 경우를 위해, 공간 정보를 이용한 방법과 전역 정보를 이용한 방법간의 균형점을 찾아 본다. 그렇게 하기 위해 전역적인 히스토그램은 적절한 크기의 작은 히스토그램으로 나뉘어 진다. 웹에서는 여러 가지의 비디오 포맷이 존재하기 때문에, 각 포맷과의 독립성을 위해 상위 수준에서의 프로세싱을 위주로 한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.2
• /
• pp.431-436
• /
• 2014

Cell segmentation which extracts cell objects from background is one of basic works in bio-imaging which analyze cell images acquired from live cells in cell culture. In the case of clear images, they have a bi-modal histogram distribution and segmentation of them can easily be performed by global threshold algorithm such as Otsu algorithm. But In the case of degraded images, it is difficult to get exact segmentation results. In this paper, we developed a cell segmentation system that it classify input images by the type of their histogram distribution and then apply a proper segmentation algorithm. If it has a bi-modal distribution, a global threshold algorithm is applied for segmentation. Otherwise it has a uni-modal distribution, our algorithm is performed. By experimentation, our system gave exact segmentation results for uni-modal cell images as well as bi-modal cell images.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2004.10a
• /
• pp.908-911
• /
• 2004

In this paper, we describe a robust image processing algorithm to recognize the road lane in real-time. For the real-time processing, a detection area is decided by a lane segment of a previous frame and edges are detected on the basis of the lane width. For the robust driving, the global threshold with the Otsu algorithm is used to get a binary image in a frame. Therefore, reliable edges are obtained from the algorithms suggested in this paper in a short time. Lastly, the lane segment is found by hough transform. We made a RC(Radio Control) car equipped with a vision system and verified these algorithms using the RC Car.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.195-202
• /
• 2005

An adaptive segmentation algorithm is used to efficiently target decisions in local non-stationary images. Until now, several adaptive approaches have been proposed as a method of segmentation. However, they can't be directly used for radar target detection because a radar signal has different characteristics from general images. Generally, a histogram of radar signal shows that targets have a relatively small number of frequency functions compared to the background and distribution of background, which have several shapes as the environment changes. In this paper, we propose an adaptive segmentation algorithm using a histogram chord which is a right-down line from maximum pick of frequency function. The proposed method provides thresholds which are optimum for several radar environments because the used chord for threshold search is not significantly effected by interference conditions. Simulation results show that the proposed method is superior to the traditional algorithms, global threshold method and distribution median method, with respect to detection performance.