Double tree wavelet image compression on parallel MIMD computers

摘要

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.