This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Progressive Refinement of 3-D Images Using Coded Binary Trees: Algorithms and Architecture
June 1984 (vol. 6 no. 6)
pp. 748-757
Dilip M. Hardas, Department of Computer Science, State University of New York at Buffalo, Buffalo, NY 14260.; Tektronix Inc., Beaverton, OR 97077.
Sargur N. Srihari, Department of Computer Science, State University of New York at Buffalo, Buffalo, NY 14260.
An encoding/decoding technique and a computer architecture for progressive refinement of 3-D images is suggested. The method is based on a binary tree representation of grey-level images. A scheme to transform an N × N × N image array into a sequence of at most N × N × N elements is given. As more elements of the sequence are scanned finer resolution representations of the image are obtained. The proposed architecture, which is suitable for VLSI implementation, performs the transformations between the image and its encoding using O(log N) processors and in time and space proportional to the image size.
Citation:
Dilip M. Hardas, Sargur N. Srihari, "Progressive Refinement of 3-D Images Using Coded Binary Trees: Algorithms and Architecture," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 6, no. 6, pp. 748-757, June 1984, doi:10.1109/TPAMI.1984.4767598
Usage of this product signifies your acceptance of the Terms of Use.