Fast Progressive Image Transmission without Table
Look-Up, Computation and Errror Propagation
Soo-Chang Pei, Sy-Been Jaw and In-Chen Chu
Department of Electrical Engineering
National aiwan University
Taipei, Taiwan, Republic of China
Knowlton's binary tree decomposition and Sloan-Tanimoto's selection reduction rule are combined to form an efficient scheme for progressive image transimission; this method eliminated the look-up table to save tremendous memory storage, it transmits and receives very fast without any computation overhead and also avoids the serious error propagation problem.