대한전자공학회논문지SP (Journal of the Institute of Electronics Engineers of Korea SP)

대한전자공학회 (The Institute of Electronics and Information Engineers)
권호 표지

동영상에서의 모양 정보 부호화를 위한 정점 선택 알고리즘

Inter-frame vertex selection algorithm for lossy coding of shapes in video sequences

  • 서종열 (연세대학교 전기컴퓨터공학과) ;
  • 김경중 (현대전자 통신부문 단말기) ;
  • 강문기 (연세대학교 전기컴퓨터공학과)
  • Suh, Jong-Yeul (Department of Electric & Computer Engineering, Yonsei University) ;
  • Kim, Kyong-Joong (Telecommunication Business personal Equipment Division, Hyundai Electronics Industries Co, Ltd) ;
  • Kang, Moon-Gi (Department of Electric & Computer Engineering, Yonsei University)
  • 발행 : 2000.07.25
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

본 논문에서는 동영상에 효과적으로 적용 가능한 정점 기반 모양 정보 부호화 알고리즘을 제안한다. 제안한 방법은 영상 사이에 존재하는 시간적 중복성을 해결하기 위해 현재 영상의 외곽선으로부터 정점을 선택 할 뿐 아니라 이미 근사화 되어 부호화된 이전 영상으로부터도 정점을 선택하여 상대적으로 부호화하였으며 고정된 오차 한계 이내에서 비트 발생량이 최소가 되도록 정점을 선택한다. 이는 코드표현 방법이 정해져 있을 때 비율-왜곡 측면에서 최적이다. 쟁점 선택은 가중치를 갖는 방향그래프에서의 최단 경로 탐색으로 모델링되어 최적의 정점을 선택하도록 하였으며 실험 결과 기존의 모양 정보 부호화 방법보다 적은 비트율을 요구하였다. 제안한 방법은 실시간 부호화를 필요로 하지 않는 저장 매체를 위한 객체 기반 부호화 시스템 및 웹을 통한 동영상 전송에 이용될 수 있다.

The vertex-based boundary encoding scheme is widely used in object-based video coding area and computer graphics due to its scalability with natural looking approximation. Existing single framebased vertex encoding algorithm is not efficient for temporally correlated video sequences because it does not remove temporal redundancy. In the proposed method, a vertex point is selected from not only the boundary points of the current frame but also the vertex points of the previous frame to remove temporal redundancy of shape information in video sequences. The problem of selecting optimal vertex points is modeled as finding shortest path in the directed acyclic graph with weight The boundary is approximated by a polygon which can be encoded with the smallest number of bits for maximum distortion. The temporal redundancy between two successive frames is efficiently removed with the proposed scheme, resulting in lower bit-rate than the conventional algorithms.

키워드

참고문헌

  1. H. Musmann, M Htter, and J. Ostermann, 'Object-oriented analysis-synthesis coding of moving images,' Signal Processing Image Communication, Vol 1. pp 117- 128, Oct 1989 https://doi.org/10.1016/0923-5965(89)90005-2
  2. M Htter, 'Object-oriented analysis-synthesis coding based on moving two-dimensional objects,' Signal Processing Image Communication, Vol. 2, pp.409-428, 1990 https://doi.org/10.1016/0923-5965(90)90027-F
  3. M. Htter, 'Optimization and efficiency of an object-based analysis-synthesis coder,' IEEE Trans Circ. Syst Video Technol, Vol. 4, No. 2, pp 181-194, April 1994 https://doi.org/10.1109/76.285624
  4. P. Gerken, 'Object-based analysis-synthesis coding of image sequences at very low bit-rates,' IEEE Trans. Circ. Syst. Video Technol., Vol 4, No 3, pp. 228-235, June 1994 https://doi.org/10.1109/76.305868
  5. J Ostermann, 'Object-based analysis-synthesis coding based on the source model of moving rigid 3D objects,' Signal Processing Image Communication, Vol. 6, pp.143-161, 1994 https://doi.org/10.1016/0923-5965(94)90012-4
  6. J Ostermann, 'Object-based analysis-synthesis coding (OBASC) based on the source model of moving flexible 3-D objects,' IEEE Trans. Image Processing, Vol 3, No. 5, Sep 1994 https://doi.org/10.1109/83.334972
  7. 'Final Draft of International Standard', ISO/IEC JTC1/SC29/WG11 Document N2502, Oct. 1998
  8. H. Freeman, 'On the encoding of arbitary geometric configurations,' IRE Trans Electron Comput, EC-10 260-268, June 1961
  9. J. Saghn and H. Freeman, 'Analysis of the precision of generalized chain codes for the representation of planar curves,' IEEE Trans Pattern Analysis and Machine Intelligence, PAMI Vol 3, No 5, pp. 533-539, Sept 1981
  10. P Gerken, 'Object-based analysis-synthesis coding of image sequences at very low bit rates,' IEEE Trans Circuits and Systems, Vol 4, pp 228-235, June 1994 https://doi.org/10.1109/76.305868
  11. K. J O'Connell, 'Object-adaptive vertex-based shape coding method,' IEEE Trans Circ Syst Video Technol., Vol 7, pp. 251-255, Feb 1997 https://doi.org/10.1109/76.554440
  12. G Schuster and A Katsaggelos, 'An optimal lossy segmentation encoding scheme,' Proceedings of the Conference on Visual Communications and Image Processing, SPIE, pp.1050-1061, Mar 1996 https://doi.org/10.1117/12.233321
  13. G. Schuster and A. Katsaggelos, 'An Optimal Polygonal Boundary Encoding Scheme in the Rate Distortion Sence,' IEEE Trans. Image Processing, Vol 7, No 1, Jan 1998 https://doi.org/10.1109/83.650847
  14. F. W Meier, G M. Schuster and A. K. Katsaggelos, 'An efficient boundary encoding scheme using B-spline curves which is optimal in rate-distortion sense,' Proceedings of International Conference on Image Processing, 1997
  15. G Heckner, 'Redundance reducing coding of moving object shapes,' Signal Processing Image Communication, Vol 9, No 1, pp. 91-98, 1997 https://doi.org/10.1016/S0923-5965(96)00012-4
  16. A. K. Katsaggelos, L P Kondi, F. W Meier, J. Ostermann, and G. M. Schuster, 'MPEG-4 and Rate-Distortion-Based Shape-Coding Techniques,' Proceedings of IEEE, Vol. 86, No 6, June 1998 https://doi.org/10.1109/5.687833
  17. M. Sonka, V Hlavac, and R. Boyle, Image Processing, Analysis and Machine Vision, Chapman & Hall, 1993