대용량 이미지 데이터베이스 대상의 부분 노이즈 제거를 지원하는 색인 기반 윤곽선 매칭
Index-based Boundary Matching Supporting Partial Denoising for Large Image Databases
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
본 논문에서는 대용량 이미지 데이터베이스에서 보다 빠른 매칭을 위한 색인 기반의 부분 노이즈 제거 윤곽선 매칭을 제안한다. 최근에는 윤곽선 매칭에서 부분 노이즈제거 문제를 해결하기위해 윤곽선 이미지를 시계열로 변환하는 시도가 있어 왔다. 본 논문에서는 대용량 이미지 데이터베이스에서 부분 노이즈제거를 지원하기 위해 윤곽선 매칭의 디스크 I/O 오버헤드 문제를 다룬다. 이는 색인 기술을 윤곽선 매칭에 단순히 적용하면 되기 때문에 단순해 보이지만 가능한 모든노이즈제거 매개변수에 대해 여러 개의 색인이 필요하기 때문에 어려운 문제이다. 이 문제를 해결하기 위해 본 논문에서는 윤곽선 매칭에서 R*-tree를 사용하여 부분 노이즈제거에 대한 효율적인 색인 기반 접근 방식을 제안한다. 수행 된 실험 결과, 제안한 색인 기반 매칭 방법은 검색 성능을 수백 배 향상시킨다.
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.
참고문헌 (29)
- R. Agrawal, "Efficient Similarity Search in Sequence Databases", Proc. of the 4th Int'l Conf. on Foundations of Data Organization and Algorithms, pp.69~84 (1993)
- Y. Cai, "Facets : Fast Comprehensive Mining of Coevolving High-Order Time Series", Proc. of the 21th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, pp.79~88 (2015)
- W. -K. Loh, "Envelope-based Boundary Image Matching for Smart Devices under Arbitrary Rotations", Multimedia Systems, 21(1), pp.29~47 (2015)
- Y. -S. Moon, "Safe MBR-Transformation in Similar Sequence Matching", Information Sciences, 270(2), pp.28~40 (2014)
- J. Paparrizos, "k-Shape : Efficient and Accurate Clustering of Time Series", Proc. of the ACM SIGMOD Int'l Conf. on Management of Data, pp.1855~1870 (2015)
- B. -S. Kim, "Boundary Image Matching Supporting Partial Denoising Using Time-Series Matching Techniques", Multimedia Tools and Applications, 76(6), pp.8471~8496 (2017)
- Y. -S. Moon, "Triangular Inequality-based Rotation-Invariant Boundary Image Matching for Smart Devices", Multimedia Systems, 21(1), pp.15~28 (2015)
- A. Dalton, "Development of a Body Sensor Network to Detect Motor Patterns of Epileptic Seizures", IEEE Trans. on Biomedical Engineering, 59(11), pp.3204~3211 (2012)
- M. Bashir, "Advanced Biometric Pen System for Recording and Analyzing Handwriting", Journal of Signal Processing Systems, 68(1), pp.75~81 (2012)
- B. -S. Kim, "Interactive Noise-Controlled Boundary Image Matching Using the Time-Series Moving Average Transform", Multimedia Tools and Applications, 72(3), pp.2543~2571 (2014)
- Y. -S. Moon, "Scaling-Invariant Boundary Image Matching Using Time-Series Matching Techniques", Data & Knowledge Engineering, 69(10), pp.1022~1042 (2010)
- F. Korn, "Efficiently Supporting Ad Hoc Queries in Large Data Sets of Time Sequences", Proc. of the ACM SIGMOD Int'l Conf. on Management of Data, pp.289~300 (1997)
- R. Datta, "Image Retrieval : Ideas, Influences, and Trends of the New Age", ACM Computing Surveys, 40(2), pp.34~94 (2008)
- A. W. M. Smeulders, "Content-based Image Retrieval at the End of the Early Years", IEEE Trans. on Pattern Analysis and Machine Intelligence, 22(12), pp.1349~1380 (2000)
- N. Beckmann, "The R*-tree : An Efficient and Robust Access Method for Points and Rectangles", Proc. of the ACM SIGMOD Int’l Conf. on Management of Data, pp.322~331 (1990)
- C. Faloutsos, "Fast Subsequence Matching in Time-Series Databases", Proc. of the ACM SIGMOD Int’l Conf. on Management of Data, pp.419~429 (1994)
- W. -S. Han, "A New Approach for Processing Ranked Subsequence Matching based on Ranked Union", Proc. of the ACM SIGMOD Int'l Conf. on Management of Data, pp.457~468 (2011)
- M. Vlachos, "Discovering Similar Multidimensional Trajectories", Proc. of the 18th IEEE Int'l Conf. on Data Engineering, pp.673~684 (2002)
- L. Chen, "Robust and Fast Similarity Search for Moving Object Trajectories", Proc. of the ACM SIGMOD Int'l Conf. on Management of Data, pp.491~502 (2005)
- R. H. Shumway, "Time Series Analysis and Its Applications: With R Examples" (2006), Springer Texts in Statistics
- S. Berchtold, "The Pyramid-Technique : Towards Breaking the Curse of Dimensionality", Proc. of the ACM SIGMOD Int’l Conf. on Management of Data, pp.142~153 (1998)
- K. -P. Chan, "Haar Wavelets for Efficient Similarity Search of Time-Series : With and Without Time Warping", IEEE Trans. on Knowledge and Data Engineering, 15(3), pp.686~705 (2003)
- R. Lesch, "Component Analysis in Financial Time Series", Proc. of the IEEE Int'l Conf. on Computational Intelligence for Financial Engineering, pp.183~190 (1999)
- M. Krawczak, "An Approach to Dimensionality Reduction in Time Series", Information Sciences, 260(2), pp.15~36 (2014)
- S. Belongie, "Shape Matching and Object Recognition Using Shape Contexts", IEEE Trans. on Pattern Analysis and Machine Intelligence, 24(4), pp.509~522 (2002)
- M. Sonka, "Image Processing, Analysis, and Machine Vision" (2014), Cengage Learning
- P. Suetens, "Computational Strategies for Object Recognition", ACM Computing Surveys, 24(1), pp.5~62 (1992)
- Y. -S. Moon, "Efficient Moving Average Transform-based Subsequence Matching Algorithms in Time-Series Databases", Information Sciences, 177(23), pp.5415~5431 (2007)
- R. Arandjelovi´c, "Three Things Everyone Should Know to Improve Object Retrieval", Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition, pp.2911~2918 (2012)