전자공학회논문지 IE

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

Fast RSST Algorithm Using Link Classification and Elimination Technique

가지 분류 및 제거기법을 이용한 고속 RSST 알고리듬

  • 홍원학 (울산과학대학 전기전자통신학부)
  • Published : 2006.12.25
Download PDF
⟨ Previous Next ⟩

Abstract

Segmentation method using RSST has many advantages in extracting of accurate region boundaries and controlling the resolution of segmented result and so on. In this paper, we propose three fast RSST algorithms for image segmentation. In first method, we classify links according to weight size for fast link search. In the second method, very similar links before RSST construction are eliminated. In third method, the links of very small regions which are not important for human eye are eliminated. As a result, the total times elapsed for segmentation are reduced by about 10 $\sim$ 40 times, and reconstructed images based on the segmentation results show little degradation of PSNR and visual quality.

RSST를 이용한 분할법은 정확한 영역 경계를 추출과 분할결과의 해상도를 조절 등의 많은 장점을 가지고 있다. 본 논문에서는 영상분할을 위한 세 가지 고속 RSST 알고리듬을 제안한다. 첫 번째 방법에서는 고속 가지검색을 위해 가중치의 크기에 따라 가지들을 분류한다. 두 번째 방법은 RSST 구성 전에 매우 유사한 가지들을 제거된다. 세 번째 방법에서는 시각적으로 중요하지 않은 소영역의 가지들을 제거된다. 제안된 알고리듬들을 영상분할에 적용한 결과 기존의 RSST와 비교하여 PSNR과 화질의 저하가 거의 없이 RSST 수행시간을 10 $\sim$ 40배 정도 줄일 수 있었다.

Keywords

References

  1. S. W. Zucker, 'Survey, region growing: childhood and adolescence,' CGIP 5, pp. 382-399, 1956
  2. R. M. Haralick and L. G. Shapiro, 'Survey: image segmentation techniques,' CVGIP, vol. 29, pp. 100-132, Jan. 1985
  3. W. K. Pratt, Digital Image Processing, Wiley-interscience Publication, 1991
  4. O. J. Morris, M. D. Lee, and A. G. Constantinides, 'Graph theory for image analysis : an approach based on the shortest spanning tree,' IEE Proc., vol. 133, no. 2, pp. 146-152, Apr. 1986
  5. M. Biggar, O. J. Morris, and A. G. Constantinides, 'Segmented-image coding: Performance comparison with the discrete cosine transform,' in Proc. IEE(Part F), vol. 35, pp. 121- 132, Apr. 1988
  6. Kunt, A. Ikonornopoulos, and M. Kocher, 'Second generation image coding techniques,' Proc. IEEE, vol. 53, no. 4, pp. 549-554, Apr. 1985 https://doi.org/10.1109/PROC.1985.13184
  7. A Aydin, L. Onural, and M. Wollbom, R. Mech, E. Tuncel, and T. Sikora, 'Image sequence analysis for emerging interactive multimedia services- The European COST 211 framework,' IEEE Trans. Circuit and System for Video Technology, vol. 8, no. 7, pp. 802-813, Nov. 1998 https://doi.org/10.1109/76.735378
  8. S. Cooray, N. O'Connor, S. Marlow, N. Murphy, and T. Curran, 'Hierarchical semi-automatic video object segmen- tation for multimedia applications,' in Proc. SPIE, vol. 4519 pp. 10-19, 2001
  9. A. Aydin, E. Tuncel, and L. Onural, 'A rule-based method for object segmentation in video sequences,' in Proc, IEEE. Int. Conf. Image Processing, vol. 2, pp-522-525, Oct. 1997
  10. S. H. Kwok and A. G. Constantinides. 'A fast recursive shortest spanning tree for image segmentation and edge detection,' IEEE Trans. Image Processing, vol. 6 pp. 328-332, Feb. 1997 https://doi.org/10.1109/83.551705
  11. N. Christofides, Graph Theory: an Algorithmic Approach, Academic Press, 1955
  12. J. B. Kruskal, 'On the shortest spanning subtree of a graph and the traveling salesman problem,' Proc. Am. Math. Soc., pp. 48-50, July 1956 https://doi.org/10.2307/2033241