An address generator for a 3-dimensional pseudo-Hilbert scan in a cuboid region
作者： Y. Bandoh , S. Kamata
关键词:
摘要: Hilbert curve is a one-to-one mapping between N-dimensional (N-D) space and 1-D space. The has been applied to image processing as scanning technique (Hilbert scan). Recently the application moving-image also studied actively. In this application, we use 3-D scan which maps data l-D along curve. However, limited in cube region. paper, present novel algorithm for generating pseudo-Hilbert curves cuboid Our suitable real-time easy implement hardware, since it simple non-recursive computation using look-up tables.
elsevier.com
sci-hub.se 参考文章(8)
Hans Sagan, A three-dimensional Hilbert curve International Journal of Mathematical Education in Science and Technology. ,vol. 24, pp. 541- 545 ,(1993) , 10.1080/0020739930240405
Arthur R. Butz, Convergence with Hilbert's space filling curve Journal of Computer and System Sciences. ,vol. 3, pp. 128- 146 ,(1969) , 10.1016/S0022-0000(69)80010-3
Xian Liu, G.F. Schrack, An algorithm for encoding and decoding the 3-D Hilbert order IEEE Transactions on Image Processing. ,vol. 6, pp. 1333- 1337 ,(1997) , 10.1109/83.623197
R. J. Millar, The Millar Polyhedron and its use in the Construction of Octrees The Computer Journal. ,vol. 36, pp. 186- 194 ,(1993) , 10.1093/COMJNL/36.2.186
Joel Quinqueton, Marc Berthod, A Locally Adaptive Peano Scanning Algorithm IEEE Transactions on Pattern Analysis and Machine Intelligence. ,vol. PAMI-3, pp. 403- 412 ,(1981) , 10.1109/TPAMI.1981.4767126
S.-I. Kamata, R.O. Eason, Y. Bandou, A new algorithm for N-dimensional Hilbert scanning IEEE Transactions on Image Processing. ,vol. 8, pp. 964- 973 ,(1999) , 10.1109/83.772242
Y. Bandoh, S. Kamata, An address generator of a pseudo-Hilbert scan in a rectangle region international conference on image processing. ,vol. 1, pp. 707- 710 ,(1997) , 10.1109/ICIP.1997.648017
Hans Sagan, Space-filling curves ,(1994)