DocumentCode
1122191
Title
Progressive Refinement of 3-D Images Using Coded Binary Trees: Algorithms and Architecture
Author
Hardas, Dilip M. ; Srihari, Sargur N.
Author_Institution
Department of Computer Science, State University of New York at Buffalo, Buffalo, NY 14260.; Tektronix Inc., Beaverton, OR 97077.
Issue
6
fYear
1984
Firstpage
748
Lastpage
757
Abstract
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.
Keywords
Bandwidth; Binary trees; Computer architecture; Graphics; Image coding; Image resolution; Nuclear magnetic resonance; Picture archiving and communication systems; Tomography; Very large scale integration; Computed tomography; VLSI for graphics; computer vision; image transmission; k-d trees; progressive image refinement;
fLanguage
English
Journal_Title
Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publisher
ieee
ISSN
0162-8828
Type
jour
DOI
10.1109/TPAMI.1984.4767598
Filename
4767598
Link To Document