For access to this article, please select a purchase option:
Buy conference paper PDF
Buy Knowledge Pack
IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.
The double tree algorithm is one of the most expensive algorithms in wavelet image compression. We introduce strategies for implementing this algorithm on parallel MIMD computers. Experimental results concerning the efficiency of the parallelization on a network of workstations (NOW) are included.