1 / 15

Adaptive Context-Based Arithmetic Coding of Arbitrary Contour Maps

Adaptive Context-Based Arithmetic Coding of Arbitrary Contour Maps. Armando J. Pinho IEEE SIGNAL PROCESSING LETTERS, VOL. 8, NO. 1,JANUARY 2001. Outline. Contour Map Differential Chain-Coding Transition Point Experimental Results Conclusion. Contour Map. DIFFERENTIAL CHAIN-CODING.

Download Presentation

Adaptive Context-Based Arithmetic Coding of Arbitrary Contour Maps

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. Adaptive Context-Based Arithmetic Coding of Arbitrary Contour Maps Armando J. Pinho IEEE SIGNAL PROCESSING LETTERS, VOL. 8, NO. 1,JANUARY 2001

  2. Outline • Contour Map • Differential Chain-Coding • Transition Point • Experimental Results • Conclusion

  3. Contour Map

  4. DIFFERENTIAL CHAIN-CODING • r1 , c1 , s11 , s12,…, s1n1 , … , rk , ck , sk1 , sk2,…, sknk • (ri , ci) denotes a pair of image coordinates marking the start of a chain • sij represent the construction of the chains

  5. DIFFERENTIAL CHAIN-CODING (con’t) • Two type of Contour map : Closed and Open • Closed Contours • There are four instructions of sij : • A (go-Ahead) • L (turn-left) • R (trun-right) • + (ramification)

  6. DIFFERENTIAL CHAIN-CODING (con’t) • Example: • 0,1,L,R,+,A,A,R,+,A,L,L,+,L,A,A,L,R, 3,3,+,A,A,L,R,A

  7. DIFFERENTIAL CHAIN-CODING (con’t) • Open Contours • An additional instruction is required indicating end-of-chain • A (go-Ahead) • L (turn-left) • R (trun-right) • + (ramification) • - (end of chain)

  8. DIFFERENTIAL CHAIN-CODING (con’t) • Example: • 0,2,A,+,A,+,R,-,+,A,A,L,R,L,+,R,A,L,A,A,2,0,-

  9. TRANSITION POINT • Four symbols {V,H,C,} =>

  10. TRANSITION POINT(con’t) • At beginning of each row or column,the pen is up • While moving across a row,the pen changes state (up to down or down to up) if it encounters a corner or a horizontal transaction point (C or H) • While moving across a column,the pen changes state (up to down or down to up) if it encounters a corner or a horizontal vertical point (C or V)

  11. TRANSITION POINT(con’t) • Adaptive CAE(context-based arithmetic encoder) compression methods : (a) Context are calculated in the domain of transition point (Ar-Tr),there are 46 possible contexts (b) Context are calculated in the domain of contour map (Ar-Ct), there are 28 possible contexts

  12. EXPERIMENTAL RESULTS • “couple “ image into 9327 regions(55519 active contour elements)

  13. EXPERIMENTAL RESULTS(con’t) 20 40 60 Number of active contour elements(x1000)

  14. EXPERIMENTAL RESULTS(con’t) Number of active contour elements(x1000)

  15. Conclusion • The proposed method behaves better than differential chain code or on the MPEG-4 shape coder. • Compression efficiency increases when the contour complexity increases.

More Related