Progressive lossless image coding via self-referential partitions
In a given binary image, we identify two disjoint sets of image subblocks of varying size which we call range blocks and domain blocks. The range blocks form a partition of the image called a self-referential partition because each range block is represented via a pointer to a matching domain block....
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 502 vol.1 |
|---|---|
| container_issue | |
| container_start_page | 498 |
| container_title | |
| container_volume | 1 |
| creator | Kieffer, J.C. Park, T.H. Xu, Y. Yakowitz, S.J. |
| description | In a given binary image, we identify two disjoint sets of image subblocks of varying size which we call range blocks and domain blocks. The range blocks form a partition of the image called a self-referential partition because each range block is represented via a pointer to a matching domain block. The encoder transmits encoded versions of these pointers together with one pixel from each domain block. This information, when decoded, allows progressive reconstruction of the image. On several archival images, our progressive lossless image coder gave better compression performance than that provided by the 2-D Lempel-Ziv (1986) algorithm, multi-window quadtree coding, and Huffman coding of runlengths. The progressive image coder is fast and has a worst-case redundancy performance better than the best currently known worst-case redundancy upper bound for the 2-D Lempel-Ziv algorithm. |
| doi_str_mv | 10.1109/ICIP.1998.723544 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_723544</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>723544</ieee_id><sourcerecordid>723544</sourcerecordid><originalsourceid>FETCH-LOGICAL-i104t-63ca334f61e85656638f4deae20be29ea1eb405f7983b630d3aa85c192e3b6063</originalsourceid><addsrcrecordid>eNotj8tqwzAURAWl0DbNvnSlH7Crq7eWwfRhCCSLdh1k-8qoqHaQTKB_X0M6m5mzGWYIeQJWAzD30jbtsQbnbG24UFLekAdmwWprOcAd2ZbyzVZZbowz92R3zPOYsZR4QZrmUtKaafzxI9J-HuI00kv0tGAKVcaAGacl-kTPPi9xifNUHslt8Kng9t835Ovt9bP5qPaH97bZ7asITC6VFr0XQgYNaJVWWgsb5IAeOeuQO_SAnWQqGGdFpwUbhPdW9eA4rsy02JDna29ExNM5rxvz7-l6UvwBS3tIQg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Progressive lossless image coding via self-referential partitions</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Kieffer, J.C. ; Park, T.H. ; Xu, Y. ; Yakowitz, S.J.</creator><creatorcontrib>Kieffer, J.C. ; Park, T.H. ; Xu, Y. ; Yakowitz, S.J.</creatorcontrib><description>In a given binary image, we identify two disjoint sets of image subblocks of varying size which we call range blocks and domain blocks. The range blocks form a partition of the image called a self-referential partition because each range block is represented via a pointer to a matching domain block. The encoder transmits encoded versions of these pointers together with one pixel from each domain block. This information, when decoded, allows progressive reconstruction of the image. On several archival images, our progressive lossless image coder gave better compression performance than that provided by the 2-D Lempel-Ziv (1986) algorithm, multi-window quadtree coding, and Huffman coding of runlengths. The progressive image coder is fast and has a worst-case redundancy performance better than the best currently known worst-case redundancy upper bound for the 2-D Lempel-Ziv algorithm.</description><identifier>ISBN: 0818688211</identifier><identifier>ISBN: 9780818688218</identifier><identifier>DOI: 10.1109/ICIP.1998.723544</identifier><language>eng</language><publisher>IEEE</publisher><subject>Decoding ; Huffman coding ; Image coding ; Image reconstruction ; Image resolution ; Operations research ; Pixel ; Upper bound</subject><ispartof>Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269), 1998, Vol.1, p.498-502 vol.1</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/723544$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,4036,4037,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/723544$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Kieffer, J.C.</creatorcontrib><creatorcontrib>Park, T.H.</creatorcontrib><creatorcontrib>Xu, Y.</creatorcontrib><creatorcontrib>Yakowitz, S.J.</creatorcontrib><title>Progressive lossless image coding via self-referential partitions</title><title>Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)</title><addtitle>ICIP</addtitle><description>In a given binary image, we identify two disjoint sets of image subblocks of varying size which we call range blocks and domain blocks. The range blocks form a partition of the image called a self-referential partition because each range block is represented via a pointer to a matching domain block. The encoder transmits encoded versions of these pointers together with one pixel from each domain block. This information, when decoded, allows progressive reconstruction of the image. On several archival images, our progressive lossless image coder gave better compression performance than that provided by the 2-D Lempel-Ziv (1986) algorithm, multi-window quadtree coding, and Huffman coding of runlengths. The progressive image coder is fast and has a worst-case redundancy performance better than the best currently known worst-case redundancy upper bound for the 2-D Lempel-Ziv algorithm.</description><subject>Decoding</subject><subject>Huffman coding</subject><subject>Image coding</subject><subject>Image reconstruction</subject><subject>Image resolution</subject><subject>Operations research</subject><subject>Pixel</subject><subject>Upper bound</subject><isbn>0818688211</isbn><isbn>9780818688218</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1998</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj8tqwzAURAWl0DbNvnSlH7Crq7eWwfRhCCSLdh1k-8qoqHaQTKB_X0M6m5mzGWYIeQJWAzD30jbtsQbnbG24UFLekAdmwWprOcAd2ZbyzVZZbowz92R3zPOYsZR4QZrmUtKaafzxI9J-HuI00kv0tGAKVcaAGacl-kTPPi9xifNUHslt8Kng9t835Ovt9bP5qPaH97bZ7asITC6VFr0XQgYNaJVWWgsb5IAeOeuQO_SAnWQqGGdFpwUbhPdW9eA4rsy02JDna29ExNM5rxvz7-l6UvwBS3tIQg</recordid><startdate>1998</startdate><enddate>1998</enddate><creator>Kieffer, J.C.</creator><creator>Park, T.H.</creator><creator>Xu, Y.</creator><creator>Yakowitz, S.J.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>1998</creationdate><title>Progressive lossless image coding via self-referential partitions</title><author>Kieffer, J.C. ; Park, T.H. ; Xu, Y. ; Yakowitz, S.J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i104t-63ca334f61e85656638f4deae20be29ea1eb405f7983b630d3aa85c192e3b6063</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1998</creationdate><topic>Decoding</topic><topic>Huffman coding</topic><topic>Image coding</topic><topic>Image reconstruction</topic><topic>Image resolution</topic><topic>Operations research</topic><topic>Pixel</topic><topic>Upper bound</topic><toplevel>online_resources</toplevel><creatorcontrib>Kieffer, J.C.</creatorcontrib><creatorcontrib>Park, T.H.</creatorcontrib><creatorcontrib>Xu, Y.</creatorcontrib><creatorcontrib>Yakowitz, S.J.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Kieffer, J.C.</au><au>Park, T.H.</au><au>Xu, Y.</au><au>Yakowitz, S.J.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Progressive lossless image coding via self-referential partitions</atitle><btitle>Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)</btitle><stitle>ICIP</stitle><date>1998</date><risdate>1998</risdate><volume>1</volume><spage>498</spage><epage>502 vol.1</epage><pages>498-502 vol.1</pages><isbn>0818688211</isbn><isbn>9780818688218</isbn><abstract>In a given binary image, we identify two disjoint sets of image subblocks of varying size which we call range blocks and domain blocks. The range blocks form a partition of the image called a self-referential partition because each range block is represented via a pointer to a matching domain block. The encoder transmits encoded versions of these pointers together with one pixel from each domain block. This information, when decoded, allows progressive reconstruction of the image. On several archival images, our progressive lossless image coder gave better compression performance than that provided by the 2-D Lempel-Ziv (1986) algorithm, multi-window quadtree coding, and Huffman coding of runlengths. The progressive image coder is fast and has a worst-case redundancy performance better than the best currently known worst-case redundancy upper bound for the 2-D Lempel-Ziv algorithm.</abstract><pub>IEEE</pub><doi>10.1109/ICIP.1998.723544</doi></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 0818688211 |
| ispartof | Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269), 1998, Vol.1, p.498-502 vol.1 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_723544 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Decoding Huffman coding Image coding Image reconstruction Image resolution Operations research Pixel Upper bound |
| title | Progressive lossless image coding via self-referential partitions |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-06T13%3A56%3A19IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Progressive%20lossless%20image%20coding%20via%20self-referential%20partitions&rft.btitle=Proceedings%201998%20International%20Conference%20on%20Image%20Processing.%20ICIP98%20(Cat.%20No.98CB36269)&rft.au=Kieffer,%20J.C.&rft.date=1998&rft.volume=1&rft.spage=498&rft.epage=502%20vol.1&rft.pages=498-502%20vol.1&rft.isbn=0818688211&rft.isbn_list=9780818688218&rft_id=info:doi/10.1109/ICIP.1998.723544&rft_dat=%3Cieee_6IE%3E723544%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=723544&rfr_iscdi=true |