본문 바로가기
  • Home

Index-based Boundary Matching Supporting Partial Denoising for Large Image Databases

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2019, 24(10), pp.91-99
  • DOI : 10.9708/jksci.2019.24.10.091
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science
  • Received : September 18, 2019
  • Accepted : October 7, 2019
  • Published : October 31, 2019

Bum-Soo Kim 1

1한국건설기술연구원

Accredited

ABSTRACT

In this paper, we propose partial denoising boundary matching based on an index for faster matching in very large image databases. Attempts have recently been made to convert boundary images to time-series with the objective of solving the partial denoising problem in boundary matching. In this paper, we deal with the disk I/O overhead problem of boundary matching to support partial denoising in a large image database. Although the solution to the problem superficially appears trivial as it only applies indexing techniques to boundary matching, it is not trivial since multiple indexes are required for every possible denoising parameters. Our solution is an efficient index-based approach to partial denoising using R*-tree in boundary matching. The results of experiments conducted show that our index-based matching methods improve search performance by orders of magnitude.

Citation status

* References for papers published after 2023 are currently being built.