We propose a fast reconstruction method for a subband-decomposed, progressi
ve signal coding system. We show that unlike the conventional approach whic
h requires a fixed computational complexity, the computational complexity o
f the proposed approach is proportional to the number of refined coefficien
ts at each level of progression. Therefore, unrefined coefficients do not a
dd to the computational complexity of the proposed scheme. It is shown, thr
ough specific examples, that the proposed approach can lead to significant
reductions in reconstruction complexity. Furthermore, the proposed approach
provides the capability for an online updating of the reconstructed image
based on receiving the refinement of each coefficient.