Context-based coding of bilevel images enhanced by digital straight line analysis

A new efficient compression scheme for bilevel images containing locally straight edges is presented. This paper is especially focused on lossless (intra) coding of binary shapes for image and video objects, but other images with similar characteristics such as line drawings, layers of digital maps,...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1997. - 15(2006), 8 vom: 10. Aug., Seite 2120-30
1. Verfasser: Aghito, Shankar Manuel (VerfasserIn)
Weitere Verfasser: Forchhammer, Søren
Format: Aufsatz
Sprache:English
Veröffentlicht: 2006
Zugriff auf das übergeordnete Werk:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
Schlagworte:Evaluation Study Journal Article
LEADER 01000caa a22002652 4500
001 NLM164698973
003 DE-627
005 20250207130651.0
007 tu
008 231223s2006 xx ||||| 00| ||eng c
028 5 2 |a pubmed25n0549.xml 
035 |a (DE-627)NLM164698973 
035 |a (NLM)16900670 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Aghito, Shankar Manuel  |e verfasserin  |4 aut 
245 1 0 |a Context-based coding of bilevel images enhanced by digital straight line analysis 
264 1 |c 2006 
336 |a Text  |b txt  |2 rdacontent 
337 |a ohne Hilfsmittel zu benutzen  |b n  |2 rdamedia 
338 |a Band  |b nc  |2 rdacarrier 
500 |a Date Completed 12.09.2006 
500 |a Date Revised 10.12.2019 
500 |a published: Print 
500 |a Citation Status MEDLINE 
520 |a A new efficient compression scheme for bilevel images containing locally straight edges is presented. This paper is especially focused on lossless (intra) coding of binary shapes for image and video objects, but other images with similar characteristics such as line drawings, layers of digital maps, or segmentation maps are also encoded efficiently. The algorithm is not targeted at document images with text, which can be coded efficiently with dictionary-based techniques as in JBIG2. The scheme is based on a local analysis of the digital straightness of the causal part of the object boundary, which is used in the context definition for arithmetic encoding. Tested on individual images of standard TV resolution binary shapes and the binary layers of a digital map, the proposed algorithm outperforms PWC, JBIG, JBIG2, and MPEG-4 CAE. On the binary shapes, the code lengths are reduced by 21%, 27%, 28%, and 41%, respectively. On the map layers, the reductions are 31%, 34%, 32%, and 64%, respectively. The algorithm is also more efficient on the test material than the state-of-the-art generic bilevel image coder free tree 
650 4 |a Evaluation Study 
650 4 |a Journal Article 
700 1 |a Forchhammer, Søren  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society  |d 1997  |g 15(2006), 8 vom: 10. Aug., Seite 2120-30  |w (DE-627)NLM09821456X  |x 1057-7149  |7 nnns 
773 1 8 |g volume:15  |g year:2006  |g number:8  |g day:10  |g month:08  |g pages:2120-30 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 15  |j 2006  |e 8  |b 10  |c 08  |h 2120-30