HyperSAX: Fast approximate search of multidimensional data

Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  • Jens Emil Gydesen
  • ,
  • Henrik Haxholm
  • ,
  • Niels Sonnich Poulsen
  • ,
  • Sebastian Wahl
  • ,
  • Bo Thiesson

The increasing amount and size of data makes indexing and searching more difficult. It is especially challenging for multidimensional data such as images, videos, etc. In this paper we introduce a new indexable symbolic data representation that allows us to efficiently index and retrieve from a large amount of data that may appear in multiple dimensions. We use an approximate lower bounding distance measure to compute the distance between multidimensional arrays, which allows us to perform fast similarity searches. We present two search methods, exact and approximate, which can quickly retrieve data using our representation. Our approach is very general and works for many types of multidimensional data, including different types of image representations. Even for millions of multidimensional arrays, the approximate search will find a result in a few milliseconds, and will in many cases return a result similar to the best match.

OriginalsprogEngelsk
TitelProceedings of the International Conference on Pattern Recognition Applications and Methods
Antal sider9
Vol/bind1
ForlagSCITEPRESS Digital Library
Udgivelsesår2015
Sider190-198
ISBN (trykt)978-989-758-076-5
DOI
StatusUdgivet - 2015
Eksternt udgivetJa
Begivenhed4th International Conference on Pattern Recognition Applications and Methods, ICPRAM 2015 - Lisbon, Portugal
Varighed: 10 jan. 201512 jan. 2015

Konference

Konference4th International Conference on Pattern Recognition Applications and Methods, ICPRAM 2015
LandPortugal
ByLisbon
Periode10/01/201512/01/2015
Sponsor

Se relationer på Aarhus Universitet Citationsformater

ID: 99642042