1 / 11

A Novel Error Correction Method without Overhead for Corrupted JPEG Images

A Novel Error Correction Method without Overhead for Corrupted JPEG Images. M. Bingabr and P.K. Varshney Syracuse University ICIP 2002. Outline. Introduction Detection And Correction Algorithm for An Image Block Experimental Results. Introduction. JPEG overview A C. DC. DPCM. A. DCT.

jacie
Download Presentation

A Novel Error Correction Method without Overhead for Corrupted JPEG Images

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. A Novel Error Correction Method without Overhead for Corrupted JPEG Images M. Bingabr and P.K. Varshney Syracuse University ICIP 2002

  2. Outline • Introduction • Detection And Correction Algorithm for An Image Block • Experimental Results

  3. Introduction • JPEG overview • AC DC DPCM A DCT Quantization VLC 8x8 C RLC Zigzag DCT AC iDCT

  4. Introduction • If the DCT coefficients Ckt and Cpq are corrupted, the whole image will be corrupted. • Ar: reconstructed A. • Ce: error amplitude of C.

  5. Detection and Correction Algorithm for An Image Block • Aexy: error amplitude of A. • Select three reference pixels Auc, Avc, and Awc in the same column c of A. 1 2 3 Selection of three reference pixels: ★Selected by the encoder and then send to receiver with no loss. ★Selected by average of all neighboring pels. ★Selected with a fixed pixel value. e.g. 128.

  6. Detection and Correction Algorithm for An Image Block • From and • From and • k, p[0, 7]. There are 28 possible combinations of k and p. 1 2 4 3 4 5

  7. Detection and Correction Algorithm for An Image Block • Choose a suitable (u, v, w) will get 28 distinct α values satisfying . • u=2, v=4, w=7 5

  8. Detection and Correction Algorithm for An Image Block • Scenarios • Two errors occur in two rows • There is exactly one (k, p) fulfilling . • Two errors occur in the same row (k = p) • There are seven α fulfilling , but they all have the same row or column. • Errors occur in more than two rows • The algorithm fails. 5 5

  9. Detection and Correction Algorithm for An Image Block • After getting k and p, use the same approach to get t and q from the other three reference pixels Aru, Arv, Arw. • Cekt and Cepq can be obtained from • Axy = Arxy–Aexy ★t errors in a block can be corrected by 2t+1 reference pixels.

  10. Experimental Results • 512 x 512 Tank • Two-state Markov channel model • Rcv-img: no error correction. • RS: received image when RS(63,59) channel coding and interleaving with depth 128 is applied to the transmitted DCT coefficients. • BVWO: proposed algorithm with depth 128 interleaving. • BVwOnc: proposed algorithm without error concealment.

  11. Experimental Results • Time and computational complexity

More Related