July 31, 1998 Updated by Ms. Jade Y.S. Hsu
Vol.3 No.1, pp.81-95 (January 1987)

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.

JISE

  1. Machine Vision for Industry Prospects and Future Trends
  2. A Model-Constrained Rule-Based Pattern Matching System for Object Recognition
  3. A Computing Architecture of Adjustable Convolution System for Image Processing
  4. Fast Progressive Image Transmission without Table Look-Up, Computation and Error Propagation
  5. A New 2D Quadrature Mirror FIR Filters for Image Sub-Band Coding
  6. Image Restoration Using a Nonstationary Image Model
  7. Texture Synthesis in Image Processing and Computer Graphics