Image data compression for interactive applications

A compression method and apparatus are provided for use in image data processing where two-dimensional pixel images have respective absolute depth values specified per pixel, and that depth data is required to be compressed prior to transmission or storage with the image data. The process of compres...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: WALKER, DAVID P
Format: Patent
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator WALKER
DAVID P
description A compression method and apparatus are provided for use in image data processing where two-dimensional pixel images have respective absolute depth values specified per pixel, and that depth data is required to be compressed prior to transmission or storage with the image data. The process of compressing the depth data per image begins by determining patches of adjoining pixels of the image (90), which pixels of a patch have the same or similar depth values, and assigning a common depth value to all pixels of the patch. Next, pixel patches having the same or similar common pixel depth values are grouped together (92), and a common depth value is assigned to all pixels of the patches so grouped, following which for each discrete pixel depth value, a determination is made (94) as to the area or number of pixels of the image having that depth value. For the smallest of these areas, the depth value of each of those pixels concerned is modified (100) to the nearest existing discrete depth value. The determination of smallest area and consequent reassignment of depth value is then repeated until only a predetermined number N (for example 16 or 32) of discrete depth values remain. The reassignment of depth values with reference to the depths of adjoining pixels means that the depth data reduced to the N discrete levels may then be run-length coded to achieve a substantial reduction in depth data volume.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US6104837A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US6104837A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US6104837A3</originalsourceid><addsrcrecordid>eNrjZDD2zE1MT1VISSxJVEjOzy0oSi0uzszPU0jLL1LIzCtJLUpMLsksS1VILCjIyUxOLAHKFfMwsKYl5hSn8kJpbgZ5N9cQZw_d1IL8-NTigsTk1LzUkvjQYDNDAxMLY3NHY8IqAHo_LDk</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Image data compression for interactive applications</title><source>esp@cenet</source><creator>WALKER; DAVID P</creator><creatorcontrib>WALKER; DAVID P</creatorcontrib><description>A compression method and apparatus are provided for use in image data processing where two-dimensional pixel images have respective absolute depth values specified per pixel, and that depth data is required to be compressed prior to transmission or storage with the image data. The process of compressing the depth data per image begins by determining patches of adjoining pixels of the image (90), which pixels of a patch have the same or similar depth values, and assigning a common depth value to all pixels of the patch. Next, pixel patches having the same or similar common pixel depth values are grouped together (92), and a common depth value is assigned to all pixels of the patches so grouped, following which for each discrete pixel depth value, a determination is made (94) as to the area or number of pixels of the image having that depth value. For the smallest of these areas, the depth value of each of those pixels concerned is modified (100) to the nearest existing discrete depth value. The determination of smallest area and consequent reassignment of depth value is then repeated until only a predetermined number N (for example 16 or 32) of discrete depth values remain. The reassignment of depth values with reference to the depths of adjoining pixels means that the depth data reduced to the N discrete levels may then be run-length coded to achieve a substantial reduction in depth data volume.</description><edition>7</edition><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRICITY ; IMAGE DATA PROCESSING OR GENERATION, IN GENERAL ; PHYSICS ; PICTORIAL COMMUNICATION, e.g. TELEVISION</subject><creationdate>2000</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20000815&amp;DB=EPODOC&amp;CC=US&amp;NR=6104837A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25543,76294</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20000815&amp;DB=EPODOC&amp;CC=US&amp;NR=6104837A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>WALKER; DAVID P</creatorcontrib><title>Image data compression for interactive applications</title><description>A compression method and apparatus are provided for use in image data processing where two-dimensional pixel images have respective absolute depth values specified per pixel, and that depth data is required to be compressed prior to transmission or storage with the image data. The process of compressing the depth data per image begins by determining patches of adjoining pixels of the image (90), which pixels of a patch have the same or similar depth values, and assigning a common depth value to all pixels of the patch. Next, pixel patches having the same or similar common pixel depth values are grouped together (92), and a common depth value is assigned to all pixels of the patches so grouped, following which for each discrete pixel depth value, a determination is made (94) as to the area or number of pixels of the image having that depth value. For the smallest of these areas, the depth value of each of those pixels concerned is modified (100) to the nearest existing discrete depth value. The determination of smallest area and consequent reassignment of depth value is then repeated until only a predetermined number N (for example 16 or 32) of discrete depth values remain. The reassignment of depth values with reference to the depths of adjoining pixels means that the depth data reduced to the N discrete levels may then be run-length coded to achieve a substantial reduction in depth data volume.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRICITY</subject><subject>IMAGE DATA PROCESSING OR GENERATION, IN GENERAL</subject><subject>PHYSICS</subject><subject>PICTORIAL COMMUNICATION, e.g. TELEVISION</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2000</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZDD2zE1MT1VISSxJVEjOzy0oSi0uzszPU0jLL1LIzCtJLUpMLsksS1VILCjIyUxOLAHKFfMwsKYl5hSn8kJpbgZ5N9cQZw_d1IL8-NTigsTk1LzUkvjQYDNDAxMLY3NHY8IqAHo_LDk</recordid><startdate>20000815</startdate><enddate>20000815</enddate><creator>WALKER; DAVID P</creator><scope>EVB</scope></search><sort><creationdate>20000815</creationdate><title>Image data compression for interactive applications</title><author>WALKER; DAVID P</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US6104837A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2000</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRICITY</topic><topic>IMAGE DATA PROCESSING OR GENERATION, IN GENERAL</topic><topic>PHYSICS</topic><topic>PICTORIAL COMMUNICATION, e.g. TELEVISION</topic><toplevel>online_resources</toplevel><creatorcontrib>WALKER; DAVID P</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>WALKER; DAVID P</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Image data compression for interactive applications</title><date>2000-08-15</date><risdate>2000</risdate><abstract>A compression method and apparatus are provided for use in image data processing where two-dimensional pixel images have respective absolute depth values specified per pixel, and that depth data is required to be compressed prior to transmission or storage with the image data. The process of compressing the depth data per image begins by determining patches of adjoining pixels of the image (90), which pixels of a patch have the same or similar depth values, and assigning a common depth value to all pixels of the patch. Next, pixel patches having the same or similar common pixel depth values are grouped together (92), and a common depth value is assigned to all pixels of the patches so grouped, following which for each discrete pixel depth value, a determination is made (94) as to the area or number of pixels of the image having that depth value. For the smallest of these areas, the depth value of each of those pixels concerned is modified (100) to the nearest existing discrete depth value. The determination of smallest area and consequent reassignment of depth value is then repeated until only a predetermined number N (for example 16 or 32) of discrete depth values remain. The reassignment of depth values with reference to the depths of adjoining pixels means that the depth data reduced to the N discrete levels may then be run-length coded to achieve a substantial reduction in depth data volume.</abstract><edition>7</edition><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US6104837A
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
PHYSICS
PICTORIAL COMMUNICATION, e.g. TELEVISION
title Image data compression for interactive applications
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T20%3A35%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=WALKER;%20DAVID%20P&rft.date=2000-08-15&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS6104837A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true