Loading…

Highly Scalable Coding of Depth Maps with Arc Breakpoints

Recent work highlights the importance of incorporating geometry information into the compression of depth maps. For many applications, features such as resolution scalability and embedded coding are also highly desirable. JPEG 2000 offers these scalability features but suffers from poor compression...

Full description

Saved in:
Bibliographic Details
Main Authors: Mathew, R., Zanuttigh, P., Taubman, D.
Format: Conference Proceeding
Language:English
Subjects:
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 51
container_issue
container_start_page 42
container_title
container_volume
creator Mathew, R.
Zanuttigh, P.
Taubman, D.
description Recent work highlights the importance of incorporating geometry information into the compression of depth maps. For many applications, features such as resolution scalability and embedded coding are also highly desirable. JPEG 2000 offers these scalability features but suffers from poor compression performance in the vicinity of strong discontinuities. We propose a novel compression strategy for depth maps that incorporates geometry information while retaining the highly scalable coding properties of JPEG 2000. Our scheme involves two separate image pyramid structures, one for arc breakpoints and other for sub-band samples produced by a breakpoint-adaptive transform. Breakpoints capture geometric attributes and are also amenable to scalable coding. We develop an R-D optimization framework for the breakpoint data. We also use a variation of the EBCOT scheme to produce embedded bit-streams for both the breakpoint and sub-band data, allowing them to be independently and incrementally sequenced based on R-D considerations.
doi_str_mv 10.1109/DCC.2012.12
format conference_proceeding
fullrecord <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_6189235</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6189235</ieee_id><sourcerecordid>6189235</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-60ede424b4a882b89fd34105dd65ba8698bbf3585d485331bf641cb883a856923</originalsourceid><addsrcrecordid>eNotjMtKw0AUQAcfYFtduXQzP5B477xyZ1nTaoWKC3VdZjKTdjQ2IQlI_96Ars6BA4exW4QcEez9qixzAShyFGdsJmShM5DanrM5KlNIKFAXF2yGYGgKqK7YfBg-AQSAwRmzm7Q_NCf-VrnG-Sbysg3puOdtzVexGw_8xXUD_0mTLfuKP_TRfXVtOo7DNbusXTPEm38u2Mfj-r3cZNvXp-dyuc0SFnrMDMQQlVBeOSLhydZBKgQdgtHekbHkfS016aBIS4m-NgorTyQdaWOFXLC7v2-KMe66Pn27_rQzSFPT8heR7UUh</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Highly Scalable Coding of Depth Maps with Arc Breakpoints</title><source>IEEE Xplore All Conference Series</source><creator>Mathew, R. ; Zanuttigh, P. ; Taubman, D.</creator><creatorcontrib>Mathew, R. ; Zanuttigh, P. ; Taubman, D.</creatorcontrib><description>Recent work highlights the importance of incorporating geometry information into the compression of depth maps. For many applications, features such as resolution scalability and embedded coding are also highly desirable. JPEG 2000 offers these scalability features but suffers from poor compression performance in the vicinity of strong discontinuities. We propose a novel compression strategy for depth maps that incorporates geometry information while retaining the highly scalable coding properties of JPEG 2000. Our scheme involves two separate image pyramid structures, one for arc breakpoints and other for sub-band samples produced by a breakpoint-adaptive transform. Breakpoints capture geometric attributes and are also amenable to scalable coding. We develop an R-D optimization framework for the breakpoint data. We also use a variation of the EBCOT scheme to produce embedded bit-streams for both the breakpoint and sub-band data, allowing them to be independently and incrementally sequenced based on R-D considerations.</description><identifier>ISSN: 1068-0314</identifier><identifier>ISBN: 1467307157</identifier><identifier>ISBN: 9781467307154</identifier><identifier>EISSN: 2375-0359</identifier><identifier>DOI: 10.1109/DCC.2012.12</identifier><language>eng</language><publisher>IEEE</publisher><subject>Encoding ; Geometry ; Image edge detection ; Interpolation ; Scalability ; Transform coding ; Transforms</subject><ispartof>2012 Data Compression Conference, 2012, p.42-51</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/6189235$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2056,27923,54553,54918,54930</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6189235$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Mathew, R.</creatorcontrib><creatorcontrib>Zanuttigh, P.</creatorcontrib><creatorcontrib>Taubman, D.</creatorcontrib><title>Highly Scalable Coding of Depth Maps with Arc Breakpoints</title><title>2012 Data Compression Conference</title><addtitle>dcc</addtitle><description>Recent work highlights the importance of incorporating geometry information into the compression of depth maps. For many applications, features such as resolution scalability and embedded coding are also highly desirable. JPEG 2000 offers these scalability features but suffers from poor compression performance in the vicinity of strong discontinuities. We propose a novel compression strategy for depth maps that incorporates geometry information while retaining the highly scalable coding properties of JPEG 2000. Our scheme involves two separate image pyramid structures, one for arc breakpoints and other for sub-band samples produced by a breakpoint-adaptive transform. Breakpoints capture geometric attributes and are also amenable to scalable coding. We develop an R-D optimization framework for the breakpoint data. We also use a variation of the EBCOT scheme to produce embedded bit-streams for both the breakpoint and sub-band data, allowing them to be independently and incrementally sequenced based on R-D considerations.</description><subject>Encoding</subject><subject>Geometry</subject><subject>Image edge detection</subject><subject>Interpolation</subject><subject>Scalability</subject><subject>Transform coding</subject><subject>Transforms</subject><issn>1068-0314</issn><issn>2375-0359</issn><isbn>1467307157</isbn><isbn>9781467307154</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotjMtKw0AUQAcfYFtduXQzP5B477xyZ1nTaoWKC3VdZjKTdjQ2IQlI_96Ars6BA4exW4QcEez9qixzAShyFGdsJmShM5DanrM5KlNIKFAXF2yGYGgKqK7YfBg-AQSAwRmzm7Q_NCf-VrnG-Sbysg3puOdtzVexGw_8xXUD_0mTLfuKP_TRfXVtOo7DNbusXTPEm38u2Mfj-r3cZNvXp-dyuc0SFnrMDMQQlVBeOSLhydZBKgQdgtHekbHkfS016aBIS4m-NgorTyQdaWOFXLC7v2-KMe66Pn27_rQzSFPT8heR7UUh</recordid><startdate>201204</startdate><enddate>201204</enddate><creator>Mathew, R.</creator><creator>Zanuttigh, P.</creator><creator>Taubman, D.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201204</creationdate><title>Highly Scalable Coding of Depth Maps with Arc Breakpoints</title><author>Mathew, R. ; Zanuttigh, P. ; Taubman, D.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-60ede424b4a882b89fd34105dd65ba8698bbf3585d485331bf641cb883a856923</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Encoding</topic><topic>Geometry</topic><topic>Image edge detection</topic><topic>Interpolation</topic><topic>Scalability</topic><topic>Transform coding</topic><topic>Transforms</topic><toplevel>online_resources</toplevel><creatorcontrib>Mathew, R.</creatorcontrib><creatorcontrib>Zanuttigh, P.</creatorcontrib><creatorcontrib>Taubman, D.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE/IET Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Mathew, R.</au><au>Zanuttigh, P.</au><au>Taubman, D.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Highly Scalable Coding of Depth Maps with Arc Breakpoints</atitle><btitle>2012 Data Compression Conference</btitle><stitle>dcc</stitle><date>2012-04</date><risdate>2012</risdate><spage>42</spage><epage>51</epage><pages>42-51</pages><issn>1068-0314</issn><eissn>2375-0359</eissn><isbn>1467307157</isbn><isbn>9781467307154</isbn><abstract>Recent work highlights the importance of incorporating geometry information into the compression of depth maps. For many applications, features such as resolution scalability and embedded coding are also highly desirable. JPEG 2000 offers these scalability features but suffers from poor compression performance in the vicinity of strong discontinuities. We propose a novel compression strategy for depth maps that incorporates geometry information while retaining the highly scalable coding properties of JPEG 2000. Our scheme involves two separate image pyramid structures, one for arc breakpoints and other for sub-band samples produced by a breakpoint-adaptive transform. Breakpoints capture geometric attributes and are also amenable to scalable coding. We develop an R-D optimization framework for the breakpoint data. We also use a variation of the EBCOT scheme to produce embedded bit-streams for both the breakpoint and sub-band data, allowing them to be independently and incrementally sequenced based on R-D considerations.</abstract><pub>IEEE</pub><doi>10.1109/DCC.2012.12</doi><tpages>10</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1068-0314
ispartof 2012 Data Compression Conference, 2012, p.42-51
issn 1068-0314
2375-0359
language eng
recordid cdi_ieee_primary_6189235
source IEEE Xplore All Conference Series
subjects Encoding
Geometry
Image edge detection
Interpolation
Scalability
Transform coding
Transforms
title Highly Scalable Coding of Depth Maps with Arc Breakpoints
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T15%3A33%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Highly%20Scalable%20Coding%20of%20Depth%20Maps%20with%20Arc%20Breakpoints&rft.btitle=2012%20Data%20Compression%20Conference&rft.au=Mathew,%20R.&rft.date=2012-04&rft.spage=42&rft.epage=51&rft.pages=42-51&rft.issn=1068-0314&rft.eissn=2375-0359&rft.isbn=1467307157&rft.isbn_list=9781467307154&rft_id=info:doi/10.1109/DCC.2012.12&rft_dat=%3Cieee_CHZPO%3E6189235%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-60ede424b4a882b89fd34105dd65ba8698bbf3585d485331bf641cb883a856923%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6189235&rfr_iscdi=true