대한전기학회:학술대회논문집 (Proceedings of the KIEE Conference)

대한전기학회 (The Korean Institute of Electrical Engineers)
권호 표지

BF 선형 4진트리로 표현된 화상에서 둘레 길이 연산

Computing Perimeters of Regions for Images Represented by BF Linear Quadtree

  • 한상호 (서울대학교 공과대학 전자계산기공학과) ;
  • 이극 (서울대학교 공과대학 전자계산기공학과) ;
  • 김민환 (서울대학교 공과대학 전자계산기공학과) ;
  • 황희융 (서울대학교 공과대학 전자계산기공학과)
  • Han, Sang-Ho (SEOUL NATIONAL UNIVERSITY, DEPT. COMPUTER ENGINEERING) ;
  • Lee, Geuk (SEOUL NATIONAL UNIVERSITY, DEPT. COMPUTER ENGINEERING) ;
  • Kim, Min-Hwan (SEOUL NATIONAL UNIVERSITY, DEPT. COMPUTER ENGINEERING) ;
  • Hwang, Hee-Yeung (SEOUL NATIONAL UNIVERSITY, DEPT. COMPUTER ENGINEERING)
  • 발행 : 1987.11.20
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

An algorithm is presented which computes the perimeter of regions in images represented by BF( breadth first) linear quadtree. In order to compute the perimeter, we determine adjacent neighbor nodes in the horizontal and vertical directions. It is the method which directly find the associated nodes in order to know whether it exists in BF linear quad tree or not. Average execution time of the algorithm is proportional to the number of black nodes in the quadtree.

키워드