정보화연구 (Journal of Information Technology and Architecture)

한국엔터프라이즈아키텍처학회 (Korea Institute of Enterprise Architecture)
권호 표지

히스토그램 시퀀스 구성을 위한 공간 지역성 보존 척도

Spatial Locality Preservation Metric for Constructing Histogram Sequences

  • 이정곤 (강원대학교 IT대학 컴퓨터과학과) ;
  • 김범수 (강원대학교 IT대학 컴퓨터과학과) ;
  • 문양세 (강원대학교 IT대학 컴퓨터과학과) ;
  • 최미정 (강원대학교 IT대학 컴퓨터과학과)
  • Lee, Jeonggon (Department of Computer Science, Kangwon National University) ;
  • Kim, Bum-Soo (Department of Computer Science, Kangwon National University) ;
  • Moon, Yang-Sae (Department of Computer Science, Kangwon National University) ;
  • Choi, Mi-Jung (Department of Computer Science, Kangwon National University)
  • 발행 : 2013.03.30
⟨ 이전 논문 다음 논문 ⟩

초록

본 논문은 히스토그램 시퀀스(histogram sequence)에 저차원 변환을 적용할 때, 어떤 공간 채움 곡선(space filling curve: SFC)의 성능이 가장 좋은지를 판단하는 체계적인 평가방법을 제안한다. 히스토그램 시퀀스는 이미지를 주어진 SFC에 따라 시계열 형태로 표현한 것을 말한다. 히스토그램 시퀀스는 매우 고차원이므로 저장 및 검색이 매우 어렵다. 효율적인 저장 및 검색을 위해서 시계열 저차원 변환의 하한을 사용할 수 있는데, 이 하한의 성능은 SFC의 종류에 따라 큰 영향을 받게 된다. 본 논문에서는 히스토그램 시퀀스를 저차원 변환할 때 어떤 SFC의 성능이 좋은지를 평가하기 위해, "히스토그램 시퀀스에서 엔트리들이 인접하면 이미지에서도 해당 셀들이 인접해야 한다"는 공간지역성(spatial locality)의 개념을 제안한다. 다음으로, 공간 지역성을 정량적으로 평가할 수 있는 공간 지역성 보존 척도(spatial locality preservation metric)를 제안하고, 이를 계산하기 위한 정형적인 방법을 제시한다. 본 논문에서는 공간 지역성 보존 척도 측면에서 총 다섯 가지의 SFC를 평가하고, 이 평가 결과가 실제 이미지 매칭의 저차원 변환 성능 평가와 유사함을 확인한다. 또한, 저차원 변환 기반의 k-NN(k-nearest neighbors) 검색을 실험하여, 공간 지역성 보존 척도가 가장 낮은 힐버트-오더가 k-NN 검색에서도 가장 좋은 성능을 보임을 통해, 제안한 공간 지역성 보존 척도의 유용성을 입증한다.

This paper proposes a systematic methodology that could be used to decide which one shows the best performance among space filling curves (SFCs) in applying lower-dimensional transformations to histogram sequences. A histogram sequence represents a time-series converted from an image by the given SFC. Due to the high-dimensionality nature, histogram sequences are very difficult to be stored and searched in their original form. To solve this problem, we generally use lower-dimensional transformations, which produce lower bounds among high dimensional sequences, but the tightness of those lower-bounds is highly affected by the types of SFC. In this paper, we attack a challenging problem of evaluating which SFC shows the better performance when we apply the lower-dimensional transformation to histogram sequences. For this, we first present a concept of spatial locality, which comes from an intuition of "if the entries are adjacent in a histogram sequence, their corresponding cells should also be adjacent in its original image." We also propose spatial locality preservation metric (slpm in short) that quantitatively evaluates spatial locality and present its formal computation method. We then evaluate five SFCs from the perspective of slpm and verify that this evaluation result concurs with the performance evaluation of lower-dimensional transformations in real image matching. Finally, we perform k-NN (k-nearest neighbors) search based on lower-dimensional transformations and validate accuracy of the proposed slpm by providing that the Hilbert-order with the highest slpm also shows the best performance in k-NN search.

키워드

참고문헌

  1. Sagan, H., Space-Filling Curves, Springer-Verlag, 1994.
  2. Kontos, D., Megalooikonomou, V., Ghubade, N., and Faloutsos, C., "Detecting Discriminative Functional MRI Activation Patterns Using Space Filling Curves," In Proc. of the 25th IEEE Annual Int'l Conf. on Medicine and Biology Society, Cancun, Mexico, pp. 963-967, Sept. 2003.
  3. Wang, Q., Kontos, D., Li, G., and Megalooikonomou, V., "Application of Time Series Techniques to Data Mining and Analysis of Spatial Patterns in 3D Images," In Proc. of IEEE Int'l Conf. on Acoustics, speech, and signal Processing, Montreal, Canada, pp. 525-528, May 2004.
  4. Klein, A. W., Grant, T., Finkelstein, A., and Cohen, M. F., "Video Mosaic," In Proc. of Int'l Symp. on Non-Photorealistic Animation and Rendering, Annecy, France, pp. 21-28, June 2002.
  5. Lee, S.-H., Kim, B.-S., Moon, Y.-S., and Kim, J., "Photo Mosaic Smartphone Application in Client-Server Based Large-Scale Image Databases," In Proc. of Int'l Conf. on World Academy of Science, Engineering and Technology, Singapore, pp. 562-565, Sept. 2011.
  6. Agrawal, R., Faloutsos, C., and Swami, A., "Efficient Similarity Search in Sequence Databases," In Proc. of the 4th Int'l Conf. on Foundations of Data Organization and Algorithms, Chicago, Illinois, pp. 69-84, Oct. 1993.
  7. Zhang, Y., and Glass, J., "A Piecewise Aggregate Approximation Lower-Bound Estimate for Posteriorgram-based Dynamic Time Warping," In Proc. of Int'l Conf. on Interspeech, Florence, Italy, pp. 1909-1912, Aug. 2011.
  8. Moon, Y.-S., Whang, K.-Y., and Han, W.-S., "General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows," In Proc. of Int'l Conf. on Management of Data, ACM SIGMOD, Wisconsin, Madison, pp. 382-393, June 2002.
  9. Lee, A. J. T., Wu, H. W., Lee, T. Y., Liu, Y. H., and Chen, K. T., "Mining Closed Patterns in Multisequence Time-series Databases," Data & Knowledge Engineering, Vol. 68, No. 10, pp. 1071-1090, Oct. 2009. https://doi.org/10.1016/j.datak.2009.04.005
  10. Lian, X., Chen, L., Yu, J. X., Han, J., and Ma, J., "Multiscale Representations for Fast Pattern Matching in Stream Time Series," IEEE Trans. on Knowledge and Data Engineering, Vol. 21, No. 4, pp. 568-581, Apr. 2009. https://doi.org/10.1109/TKDE.2008.184
  11. Moon, Y.-S., Whang, K.-Y., and Loh, W.-K., "Dualitybased Subsequence Matching in Time-Series Databases," In Proc. of the 17th Int'l Conf. on Data Engineering, IEEE ICDE, Heidelberg, Germany, pp. 263-272, Apr. 2001.
  12. Moon, Y.-S., Kim, B.-S., Kim, M.-S., and Whang, K.-Y., "Scaling-invariant Boundary Image Matching Using Time-series Matching Techniques," Data & Knowledge Engineering, Vol. 69, No. 10, pp. 1022-1042, Oct. 2010. https://doi.org/10.1016/j.datak.2010.07.001
  13. Kim, B.-S., Moon, Y.-S., and Kim, J., "Noise Control Boundary Image Matching Using Time-series Moving Average Transform," In Proc. of Int'l Conf. on Database and Expert Systems Applications, Turin, Italy, pp. 362-375, Sept. 2008.
  14. Loh, W.-K., Park, Y.-H., and Yoon, Y.-I., "Fast Recognition of Asian Characters based on Database Methodologies," In Proc. of British National Conf. on Databases, Glasgow, UK, pp. 37-48, July 2007.
  15. Keogh, E., and Ratanamahatana, C. A., "Indexing and Mining Large Time Series Databases," In Proc. of Int'l Conf. on Database Systems for Advanced Applications, Tutorial, Bangkok, Thailland, Apr. 2007.
  16. Zhu, Y., and Shasha, D., "Warping Indexes with Envelope Transforms for Query by Humming," In Proc. of Int'l Conf. on Management of Data, ACM SIGMOD, San Diego, California, pp. 181-192, June 2003.
  17. Chan, K. P., Fu, A. W. C., and Yu, C. T., "Haar Wavelets for Efficient Similarity Search of Time-Series: With and Without Time Warping," IEEE Trans. on Knowledge and Data Engineering, Vol. 15, No. 3, pp. 686-705, May/June 2003. https://doi.org/10.1109/TKDE.2003.1198399
  18. Faloutsos, C., Ranganathan, M., and Manolopoulos, Y., "Fast Subsequence Matching in Time-Series Databases," In Proc. of Int'l Conf. on Management of Data, ACM SIGMOD, Minneapolis, Minnesota, pp. 419-429, May 1994.
  19. Han, W.-S., Lee, J., Moon, Y.-S., and Jiang, H., "Ranked Subsequence Matching in Time-Series Databases," In Proc. of Int'l Conf. on Very Large Data Bases, Vienna, Austria, pp. 423-434, Sept. 2007.
  20. Aggarwal, C. C., and Yu, P. S., "Privacy-Preserving Data Mining: A Survey," In Handbook of Database Security: Applications and Trends, pp. 431-460, 2008.
  21. Jiang, W., Murugesan, M., Clifton, C., and Si, L., "Similar Document Detection with Limited Information Disclosure," In Proc. of the 24th Int'l Conf. on Data Engineering, IEEE ICDE, Cancun, Mexico, pp. 735-743, Apr. 2008.
  22. Han, W.-S., Lee, J.-S., Moon, Y.-S., Hwang, S.-W., and Yu, H., "A New Approach for Processing Ranked Subsequence Matching Based on Ranked Union," In Proc. of Int'l Conf. on Management of Data, ACM SIGMOD, Athens, Greece, pp. 457-468, June 2011.
  23. Hilbert, D., "Ueber Die Stetige Abbildung Einer Line Auf Ein Flachenstuck," Mathematische Annalen, Vol. 38. pp. 459-460, 1891. https://doi.org/10.1007/BF01199431
  24. Griffin, G., Holub, A. D., and Perona, P., The Caltech-256, Caltech Technical Report.
  25. 이근우, 양근우, "분산 의사결정지원시스템 구축을 위한 웹서비스 기반 모델-솔버의 통합 설계," 정보기술아키텍처연구, 제9권 제1호, pp. 43-55, 2012년 3월.
  26. 김현수, 김인규, "온톨로지와 시각화가 적용된 기술참조 모델의 활용방안에 관한 연구," 정보기술아키텍처연구, 제8권 제4호, pp. 347-360, 2011년 12월.