A data-flow multiprocessor architecture for the transform coding of regularly decomposed images

N.A. Alexandridis, P.D. Tsanakas and S.V. Konstantinidou

Mathematics and Computers in Simulation (MATCOM), 1985, vol. 27, issue 5, 609-622

Abstract: An architecture for the parallel implementation of an orthogonal transform of images is presented. Images are preprocessed by the “regular decomposition” procedure and converted into a quad-tree representation. The orthogonal transformation is performed progressivelly by adjusting to the various hierarchies of the quad-tree nodes. The architecture of the proposed machine is based on the data-driven model of computation in which an operation is executed when its operands are available. The specific requirements of the image processing algorithms have been taken into account, principally the efficient handling of array data-structures. The tagged-token method supports recursive operations and helps to better exploit the inherent parallelism of the transformation algorithms.

Date: 1985
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0378475485900783
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:27:y:1985:i:5:p:609-622

DOI: 10.1016/0378-4754(85)90078-3

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().