A pseudo-hilbert scan for arbitrarily-sized arrays

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E90-A, Issue 3, 2007, Pages 682-690

  Zhang, Jian ^a   Kamata, Sei Ichiro ^a   Ueshige, Yoshifumi ^b  

^a WASEDA UNIVERSITY   (Japan)

^b Institute of Systems Information Technologies and Nanotechnologies   (Japan)

Author keywords

Euclidean distance; Hilbert curve; Look up tables; Pseudo Hilbert scan; Space filling curve

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONFORMAL MAPPING; CORRELATION THEORY; CURVE FITTING; RECURSIVE FUNCTIONS; TWO DIMENSIONAL;

EUCLIDEAN DISTANCE; HILBERT CURVES; LOOK UP TABLES; PSEUDO-HILBERT SCAN; SPACE FILLING CURVE;

IMAGE RECOGNITION;

EID: 33947177151     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/e90-a.3.682     Document Type: Article

References (16)

1. S. Biswas, "Hubert scan and image compression," Proc. IEEE Int. Conf. on Pattern Recognition, pp.201-210, 2000.
2. B. Moon, H.V. Jagadish, and C. Faloutsos, "Analysis of the clustering properties of the Hubert space-filling curve," IEEE Trans. Knowl. Data Eng., vol.13, no.1, pp.124-141, 2001.
3. S. Kamata and Y. Bandoh, "An address generator of a Pseudo-Hubert scan in a rectangle region," Proc. IEEE Int. Conf. on Image Process., pp.707-710, 1997.
4. S. Kamata, R.O. Eason, and Y. Bandou, "A new algorithm for N-dimensional Hubert scanning," IEEE Trans. Image Process., vol.8, no.7, pp.964-973, 1999.
5. T. Agui, T. Nagae, and M. Nakajima, "Generalized Peano scans for arbitrary-sized arrays," IEICE Trans., vol.E74, no.5, pp. 1337-1342, May 1991.
6. J. Quinqueton and M. Berthod, "A locally adaptive Peano scanning algorithm," IEEE Trans. Pattern Anal. Mach. Intell., vol.3, no.4, pp.409-412, 1981.
7. D. Hubert, "Uber die stetige Abbildung einer Linie auf ein Flachen-stuck," Mathematische Annalen, vol.38, pp.459-460, 1891.
8. H. Sagan, Space-filling Curve, Springer Verlag, 1994.
9. A. Lempel and J. Ziv, "Compression of two dimensional data," IEEE Trans. Inf. Theory, vol.IT-32, no.1, pp.2-8, 1986.
10. C. Gotsman and M. Lindenbaum, "On the metric properties of discrete space-filling curves," IEEE Trans. Image Process., vol.5, pp.794-797, 1996.
11. K. Abend, T.J. Harley, and L.N. Kanal, "Classification of binary random patterns," IEEE Trans. Inf. Theory, vol.IT-11, no.4, pp.538-544, 1965.
12. N. Memon, D.L. Neuhoff, and S. Shende, "An analysis of some common scanning techniques for lossless image coding," IEEE Trans. Image Process., vol.9, no.11, pp.1837-1848, 2000.
13. H.V. Jagadish, "Linear clustering of objects with multiple atributes," Int. Conf. on Management of Data, pp.332-342, 1990.
14. A.R. Butz, "Space filling curves and mathematical programming," Trans. Information and Control, vol.12, no.4, pp.314-330, 1968.
15. A.R. Butz, "Convergence with Hubert's space filling curve," J. Cornput. Syst. Sci., vol.3, no.2, pp. 128-146, 1969.
16. L. Tian, S. Kamata, K. Tsuneyoshi, and H.J. Tang, "A fast and accurate algorithm for matching images using Hubert scanning distance with threshold elimination function," IEICE Trans. Inf. & Syst., vol.E89-D, no.1, pp.290-297, Jan. 2006.