SuperLectures.com

OPTIMAL STRUCTURE OF MEMORY MODELS FOR LOSSLESS COMPRESSION OF BINARY IMAGE CONTOURS

Image Coding

Full Paper at IEEE Xplore

Presented by: Ioan Tabus, Author(s): Ioan Tabus, Septimia Sarbu, Tampere University of Technology, Finland

In this paper we study various chain codes, which are representations of binary image contours, in terms of their ability to compress in the best way the contour information using memory models. We consider five chain codes, including the widely used AF8 and 3OT codes, and note that they correspond to memory models of first and second order for contour representation. In order to provide predictive distributions for the arithmetic coding, memory distribution models such as Markov models and context trees utilized in adaptive configurations are used on top of the chain codes. By additionally accounting for all side costs we obtain losslessly decodable files and find the best performer to be the context tree modeling applied to the sequence of 3OT chain codes, surpassing all results recently reported in the literature for the same data set of bilevel images.

  Speech Transcript

|

  Slides

Enlarge the slide | Show all slides in a pop-up window

0:00:16

  1. slide

0:00:45

  2. slide

0:02:25

  3. slide

0:04:23

  4. slide

0:05:38

  5. slide

0:07:09

  6. slide

0:09:02

  7. slide

0:09:49

  8. slide

0:10:10

     7. slide

0:10:27

     8. slide

0:11:18

  9. slide

0:12:27

 10. slide

0:13:21

 11. slide

0:14:29

 12. slide

0:15:31

 13. slide

0:15:47

 14. slide

0:16:40

 15. slide

0:18:11

 16. slide

0:19:13

 17. slide

0:19:39

 18. slide

0:20:04

 19. slide

0:20:35

 20. slide

0:21:25

 21. slide

0:21:32

 22. slide

0:22:20

 23. slide

0:22:44

 24. slide

  Comments

Please sign in to post your comment!

  Lecture Information

Recorded: 2011-05-24 11:55 - 12:15, Club A
Added: 18. 6. 2011 02:25
Number of views: 11
Video resolution: 1024x576 px, 512x288 px
Video length: 0:23:48
Audio track: MP3 [8.07 MB], 0:23:48