Fast full-search schemes for pattern matching using integral images = 적분 영상을 이용한 패턴 정합을 위한 고속 전역 검색 기법 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 326
  • Download : 0
Pattern matching plays an important role in various fields such as image registration, stereo matching, image coding, texture synthesis, image retrieval, object tracking, etc. Since the pattern matching process have been a time-consuming work, many fast pattern matching algorithms have been proposed. They can be categorized into several groups: 1) candidate sampling; 2) simplification of matching criterion; 3) bitwidth reduction; 4) hierarchical search; and 5) fast full-search. By adopting mathematical inequality, fast full-search can be boosted while preserving the same result of full search algorithm. In this dissertation, fast full-search pattern matching schemes based on four different criteria (sum of absolute difference, sum of squared error, normalized cross correlation, and pixel difference classification) are further investigated and compared to several conventional schemes. Key tools of proposed schemes are the Minkowski inequality, the Cauchy-Schwarz inequality, and the concept of integral image. Simulation results show that proposed schemes outperform conventional schemes.
Advisors
Park, Dong-Joresearcher박동조researcher
Description
한국과학기술원 : 전기 및 전자공학과,
Publisher
한국과학기술원
Issue Date
2011
Identifier
466462/325007  / 020035878
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전기 및 전자공학과, 2011.2, [ viii, 116 p. ]

Keywords

fast full-search; pattern matching; integral image; 적분 영상; 고속 전역 검색; 패턴 정합

URI
http://hdl.handle.net/10203/35941
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=466462&flag=dissertation
Appears in Collection
EE-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0