Histogram sequences represent high-dimensional timeseries converted from images by space filling curves (SFCs). To overcome the high-dimensionality nature of histogram sequences (e.g., 106 dimensions for a 1024×1024 image), we often use lower-dimensional transformations, but the tightness of their lower-bounds is highly affected by the types of SFCs. 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 and propose spatial locality preservation metric (SLPM in short). We then evaluate five well-known SFCs from the perspective of SLPM and verify that the evaluation result concurs with the actual transformation performance. Finally, we empirically validate the accuracy of SLPM by providing that the Hilbert-order with the highest SLPM also shows the best performance in k-NN (k-nearest neighbors) search. key words: data mining, time-series data, space filling curve, lowerdimensional transformation
[1]
Yang-Sae Moon,et al.
Scaling-invariant boundary image matching using time-series matching techniques
,
2010,
Data Knowl. Eng..
[2]
D. Hilbert.
Ueber die stetige Abbildung einer Line auf ein Flächenstück
,
1891
.
[3]
Eamonn J. Keogh.
Indexing and Mining Time Series Data
,
2008,
Encyclopedia of GIS.
[4]
Yang-Sae Moon,et al.
General match: a subsequence matching method in time-series databases based on generalized windows
,
2002,
SIGMOD '02.
[5]
H. Sagan.
Space-filling curves
,
1994
.
[6]
Qiang Wang,et al.
Application of time series techniques to data mining and analysis of spatial patterns in 3D images
,
2004,
2004 IEEE International Conference on Acoustics, Speech, and Signal Processing.
[7]
Adam Finkelstein,et al.
Video mosaics
,
2002,
NPAR '02.