• Title/Summary/Keyword: 모양 정보 부호화

Search Result 22, Processing Time 0.014 seconds

Effective segmentation of non-rigid object in a still picture and video sequences (정지영상/동영상에서 non-rigid object의 효율적인 영역 분할 방식에 관한 연구)

  • Lee, In-Jae;Kim, Yong-Ho;Kim, Jung-Gyu;Lee, Myeong-Ho;An, Chi-Deuk
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.1
    • /
    • pp.17-31
    • /
    • 2002
  • The new MPEG-4 video coding standard enables content-based functionalities. Image segmentation is an indispensable process for it. This paper addresses an effective segmentation of non-rigid objects. Non-rigid objects are deformable objects with fuzzy, blurred and indefinite boundaries. So it is difficult to segment deformable objects precisely. In order to solve this problem, we propose an effective segmentation of non-rigid objects using watershed algorithms in still pictures. And we propose an automatic segmentation through intra-frame and inter-frame segmentation process in video sequences. Automatic segmentation preforms boundary-based and region-based segmentation to extract precise object boundaries.

A Two-Step Vertex Selection Method for Minimizing Polygonal Approximation Error (다각형 근사 오차를 최소화하기 위한 2단계 정점 선택 기법)

  • 윤병주;이훈철;고윤호;이시웅;김성대
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.6
    • /
    • pp.114-123
    • /
    • 2003
  • The current paper proposes a new vertex selection scheme for polygon-based contour coding. To efficiently characterize the shape of an object, we incorporate the curvature information in addition to the conventional maximum distance criterion in vertex selection process. The proposed method consists of "two-step procedure." At first, contour pixels of high curvature value are selected as key vortices based on the curvature scale space (CSS), thereby dividing an overall contour into several contour-segments. Each segment is considered as an open contour whose end points are two consecutive key vortices and is processed independently. In the second step, vertices for each contour segment are selected using progressive vertex selection (PVS) method in order to obtain minimum number of vertices under the given maximum distance criterion ( $D_{max}$$^{*}$). Furthermore, the obtained vortices are adjusted using the dynamic programming (DP) technique to optimal positions in the error area sense. Experimental results are presented to compare the approximation performances of the proposed and conventional methods.imation performances of the proposed and conventional methods.