• Title/Summary/Keyword: Segmentation algorithm

Search Result 1,332, Processing Time 0.025 seconds

Variable Block Size Transform Coding Using Segmented Information (영역 분할 정보를 이용한 가변 블록 크기 변환 부호화)

  • 오정수;김진태;최종수
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.1
    • /
    • pp.72-80
    • /
    • 1994
  • In this paper, a new variable block-size transform coding algorithm using information of segmentation is proposed. In general variable block-size transform coding algorithms, the information which is used to form variable blocks is thrown away, but in the proposed algorithm, the information of segmentation which is composed of texture and contour information is maintained for efficient coding. That is, the number of blocks can be reduced by contour information, a DC component of block can be predicted by texture information, and the region compensation, which reduces mean difference between regions, using texture and contour information can diminish the magnitude of AC components. The result is that the proposed algorithm has improved highly the coding efficiency of DC and AC components.

  • PDF

Surface Segmentation and Feature Description using the Signature Technique (Signature 기법을 이용한 면의 특징 표현 및 분할 기법)

  • 이보형;한헌수
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.12
    • /
    • pp.90-97
    • /
    • 1997
  • This paper presents a new algorithm for surface segmentation and feature description. The algorithm extracts the signature of an edge image based on the signature technqique[12] in the first stage. If there exists a range in the angle axis where more than two signatures form a closed curve, we can conclude there is a surface inside the range. Using this feature of the signature, surfaces can be segmented. The surface features such as number of vertices, number of edges, and type of surfaces can also be extracted by finding the signatures of individual surfaces. This algorithm has distinguished advantages: it can easily recover the lost part occuring in the edge iage using the curve fitting method and it can extract surface features even when surfaces are rotated in 3-D space.

  • PDF

Video Segmentation and Key frame Extraction using Multi-resolution Analysis and Statistical Characteristic

  • Cho, Wan-Hyun;Park, Soon-Young;Park, Jong-Hyun
    • Communications for Statistical Applications and Methods
    • /
    • v.10 no.2
    • /
    • pp.457-469
    • /
    • 2003
  • In this paper, we have proposed the efficient algorithm that can segment the video scene change using a various statistical characteristics obtained from by applying the wavelet transformation for each frames. Our method firstly extracts the histogram features from low frequency subband of wavelet-transformed image and then uses these features to detect the abrupt scene change. Second, it extracts the edge information from applying the mesh method to the high frequency subband of transformed image. We quantify the extracted edge information as the values of variance characteristic of each pixel and use these values to detect the gradual scene change. And we have also proposed an algorithm how extract the proper key frame from segmented video scene. Experiment results show that the proposed method is both very efficient algorithm in segmenting video frames and also is to become the appropriate key frame extraction method.

Face Region Segmentation using Watershed Algorithm And Object Grouping (Watershed Algorithm 과 Object Grouping 을 이용한 얼굴영역분할)

  • Hwang, Hoon;Choi, Young-Kwan;Choi, Chul;Lee, Jeong-A;Park, Chang-Choon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.11a
    • /
    • pp.587-590
    • /
    • 2003
  • 얼굴영역을 분할하기 위해서 Watershed Algorithm 와 Object Grouping 을 이용한 얼굴영역 분할기법을 제안한다. 영상분할에 단점은 단일 알고리즘으로 영역분할이 어렵고, 또한 복잡한 영상에서 정확한 영역을 분할하기가 어렵다는 것이다. 그래서 본 논문에서는 Watershed Segmentation 기법과 Grouping 작업을 통한 병합, 그리고 색상의 선형회귀분석을 이용한 분석법을 적용하여 분할하고자 한다. 얼굴영역 분할방법을 전처리 과정과 영역 병합 그리고 얼굴 부분을 추출하는 3 단계의 과정으로 나누고, 전처리 과정에서는 수리형태학적(Mophological) 연산자를 이용한 영상 분할기법을 이용하여 분할한 후 얼굴 후보 영역을 검출, 영역병합과정에서 기존의 학습데이터와의 유사도를 측정, 얼굴객체추출 조건에 맞지 않는 객체들을 모두 제거함으로써, 정확한 얼굴부분을 분할해 낸다. 실험결과 제안한 방법을 통해 비교적 정확한 얼굴영역을 분할 할 수 있었다.

  • PDF

A New Face Tracking Algorithm Using Convex-hull and Hausdorff Distance (Convex hull과 Robust Hausdorff Distance를 이용한 실시간 얼굴 트래킹)

  • Park, Min-Sik;Park, Chang-U;Park, Min-Yong
    • Proceedings of the KIEE Conference
    • /
    • 2001.11c
    • /
    • pp.438-441
    • /
    • 2001
  • This paper describes a system for tracking a face in a input video sequence using facial convex hull based facial segmentation and a robust hausdorff distance. The algorithm adapts YCbCr color model for classifying face region by [l]. Then, we obtain an initial face model with preprocessing and convex hull. For tracking, a Robust Hausdorff distance is computed and the best possible displacement is selected. Finally, the previous face model is updated using the displacement t. It is robust to some noises and outliers. We provide an example to illustrate the proposed tracking algorithm in video sequences obtained from CCD camera.

  • PDF

Clustering of Stereo Matching Data for Vehicle Segmentation (차량분리를 위한 스테레오매칭 데이터의 클러스터링)

  • Lee, Ki-Yong;Lee, Joon-Woong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.16 no.8
    • /
    • pp.744-750
    • /
    • 2010
  • To segment instances of vehicle classes in a sparse stereo-matching data set, this paper presents an algorithm for clustering based on DP (Dynamic Programming). The algorithm is agglomerative: it begins with each element in the set as a separate cluster and merges them into successively larger clusters according to similarity of two clusters. Here, similarity is formulated as a cost function of DP. The proposed algorithm is proven to be effective by experiments performed on various images acquired by a moving vehicle.

Face Tracking Using Skin-Color and Robust Hausdorff Distance in Video Sequences

  • Park, Jungho;Park, Changwoo;Park, Minyong
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.540-543
    • /
    • 1999
  • We propose a face tracking algorithm using skin-color based segmentation and a robust Hausdorff distance. First, we present L*a*b* color model and face segmentation algorithm. A face is segmented from the first frame of input video sequences using skin-color map. Then, we obtain an initial face model with Laplacian operator. For tracking, a robust Hausdorff distance is computed and the best possible displacement t. is selected. Finally, the previous face model is updated using the displacement t. It is robust to some noises and outliers. We provide an example to illustrate the proposed tracking algorithm in video sequences obtained from CCD camera.

  • PDF

Video image segmentation based on color histogram and change detector (칼라 히스토그램과 변화 검출기에 기반한 비디오 영상 분할)

  • 박진우;정의윤;김희수;송근원;하영호
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.1093-1096
    • /
    • 1999
  • In this paper, video image segmentation algorithm based on color histogram and change detector is proposed. Color histograms are calculated from both changed region which is detected in the previous and current frame and unchanged region. With each histogram, modes and valleys are detected. Then, color vectors are calculated by averaging pixels in modes. Markers are extracted by labeling color vectors that represent modes, the watershed algorithm is applied to determine uncertain region. In growing region, the root mean square(RMS) of the distance between average pixel in marker region and adjacent pixel is used as a measure. The proposed algorithm based on color histogram and change detector segments video image fastly and effectively. And simulation results show that the proposed method determines the exact boundary between background and foreground.

  • PDF

A Study on the Search for the Boundary node of Circuit Segmentation using t-Distribution (t-분포를 이용한 회로분할의 경계노드 탐색에 관한 연구)

  • 이강현;김용득
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.9
    • /
    • pp.1442-1447
    • /
    • 1990
  • In this paper we propose the search algorithm of the boundary nodes that defined as the circuit segmentation when CUT is tested by pseudo-exhaustive testing. The algorithm treats the testability values of the nodes in CUT as the population composed of teh raw data, and after examines the level of significance a and then estimate the confidence interval of teh testability values. Thus One can easily searched the c9oundary nodes and PO of sub circuits. The proposed algorithm has been implemented under UNIX OS with C-language, applied to the combinational logic CUT. As a result, it is shown that the pseudo-exhaustive test patterns are least generated when \ulcornerhas 0.786. We confirmed that the rate of test pattern is 1.22%, compared with exhaustive test.

  • PDF

The Moving Object Segmentation By Using Multistage Merging (다단계 결합을 이용한 이동 물체 분리 알고리즘에 관한 연구)

  • 안용학;이정헌;채옥삼
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.10
    • /
    • pp.2552-2562
    • /
    • 1996
  • In this paper, we propose a segmentation algorithm that can reliably separate moving objects from noisy background in the image sequance received from a camera at the fixed position. The proposed algorithm consists of three processes:generation of the difference image between the input image and the reference image, multilevel quantization of the difference image, and multistagemerging in the quantized image. The quantization process requantizes the difference image based on the multiple threshold values determined bythe histogram analysis. The merging starts from the seed region which created by using the highest threshold value and ends when termination conditions are met. the proposed method has been tested with various real imge sequances containing intruders. The test results show that the proposed algorithm can detect moving objects like intruders very effectively in the noisy environment.

  • PDF