A C-MOVE architecture based multiprocessor system for encoding Walsh-Hadamard transformed images

Dimitriadis, B; Alexandridis, N; Bourbakis, N

dc.contributor.author	Dimitriadis, B	en
dc.contributor.author	Alexandridis, N	en
dc.contributor.author	Bourbakis, N	en
dc.date.accessioned	2014-03-01T01:06:07Z
dc.date.available	2014-03-01T01:06:07Z
dc.date.issued	1983	en
dc.identifier.issn	0165-6074	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/9174
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0020724422&partnerID=40&md5=023f353953c09f4f25cf8c2952f9b71f	en
dc.subject	C-MOVE Architecture	en
dc.subject	Hadamard Encoded Images	en
dc.subject	Hadamard Transforms	en
dc.subject	Image Transforms	en
dc.subject	Parallel Picture Processing	en
dc.subject	Quad-Tree Image Decomposition	en
dc.subject.classification	Computer Science, Hardware & Architecture	en
dc.subject.other	COMPUTER ARCHITECTURE	en
dc.subject.other	IMAGE PROCESSING	en
dc.subject.other	MATHEMATICAL TRANSFORMATIONS	en
dc.subject.other	COMPUTER SYSTEMS, DIGITAL	en
dc.title	A C-MOVE architecture based multiprocessor system for encoding Walsh-Hadamard transformed images	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	1983	en
heal.abstract	A novel architecture has been proposed based on the C-MOVE microprocessor for the fast and efficient parallel structural decomposition, W-H transform and encoding of digital images. A hierarchical and reconfigurable tree of interconnected processors is used to implement the W-H transform of an image which is already preprocessed and decomposed into a succession of consecutive ""quadrant"" sub-pictures. The regular decomposition procedure is followed to develop the quad-tree structure associated with a given image. Then a parallel algorithm is developed for the realization of the W-H transform of the given image. The W-H transform of the whole picture can be implemented by parallel processing. The C-MOVE architecture has been invoked for the realization of the above mentioned scheme. The C-MOVE architecture can prove to be extremely economical and fast, especially when a large number of parallel processors is utilized. The tree-structure of the decomposed picture and the proposed hierarchically distributed processing scheme match very well, resulting in a very flexible and adaptable architecture for implementing an image processing scheme. The proposed scheme uses C-MOVE processors to implement all the modules of the system. The architecture presented exhibits a high degree of parallelism with the main processing modules sharing the same main memory and exchanging data over the common very high speed bus, under the control of the master-controller processor. Each module works independently on the assigned task once the data and instruction string have been loaded in its part of memory. Meanwhile, the picture preprocessing module is freed to proceed on the next step of the regular decomposition algorithm. © 1983.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Microprocessing and Microprogramming	en
dc.identifier.isi	ISI:A1983RE13800009	en
dc.identifier.volume	11	en
dc.identifier.issue	3-4	en
dc.identifier.spage	227	en
dc.identifier.epage	232	en