Graph-based deinterlacing

This article presents a new algorithm for spatial deinterlacing that could easily be integrated in a more complete deinterlacing system. The spatial interpolation process often fails to reconstruct edges that are diagonal or close to horizontal, leading to highly visible artifacts. Our solution aims...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Roussel, J., Bertolino, P.
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 900
container_issue
container_start_page 897
container_title
container_volume
creator Roussel, J.
Bertolino, P.
description This article presents a new algorithm for spatial deinterlacing that could easily be integrated in a more complete deinterlacing system. The spatial interpolation process often fails to reconstruct edges that are diagonal or close to horizontal, leading to highly visible artifacts. Our solution aims at preserving the linear structure continuity. It connects pieces of horizontal edges coming from neighboring lines to build graphs which are then simplified in branches that represent the linear structure of the scene. These branches give the exact direction in which the interpolation has to be done. For the rest of the image, a traditional directional spatial interpolation gives satisfactory results already. Although the number of pixels interpolated with this method is relatively small, the overall image quality is subjectively well improved.
doi_str_mv 10.1109/ICIP.2008.4711900
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4711900</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4711900</ieee_id><sourcerecordid>4711900</sourcerecordid><originalsourceid>FETCH-LOGICAL-i218t-dd6626cce69a50ee5716f5b6fe98846e7fd337614b03f98f5046bdc5fee8a76f3</originalsourceid><addsrcrecordid>eNpVj7tOw0AQAI-XhAn5gIiGHzhn9x57eyWySLAUiRRQR2ffHhiFKLLT8PcUpKGaYqSRRqkFQo0Icdk27bY2AFy7gBgBLtQ8BkZnnMNAzl6qylhGzd7Fq3_Ow7Wq0BujHTPcqrtp-gIwgBYrtViP6fipuzRJfswyHE4y7lM_HD7u1U1J-0nmZ87U--r5rXnRm9d12zxt9GCQTzpnIkN9LxSTBxEfkIrvqEhkdiShZGsDoevAlsjFg6Mu976IcApU7Ew9_HUHEdkdx-E7jT-786X9BS3VP-U</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Graph-based deinterlacing</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Roussel, J. ; Bertolino, P.</creator><creatorcontrib>Roussel, J. ; Bertolino, P.</creatorcontrib><description>This article presents a new algorithm for spatial deinterlacing that could easily be integrated in a more complete deinterlacing system. The spatial interpolation process often fails to reconstruct edges that are diagonal or close to horizontal, leading to highly visible artifacts. Our solution aims at preserving the linear structure continuity. It connects pieces of horizontal edges coming from neighboring lines to build graphs which are then simplified in branches that represent the linear structure of the scene. These branches give the exact direction in which the interpolation has to be done. For the rest of the image, a traditional directional spatial interpolation gives satisfactory results already. Although the number of pixels interpolated with this method is relatively small, the overall image quality is subjectively well improved.</description><identifier>ISSN: 1522-4880</identifier><identifier>ISBN: 9781424417650</identifier><identifier>ISBN: 1424417651</identifier><identifier>EISSN: 2381-8549</identifier><identifier>EISBN: 9781424417643</identifier><identifier>EISBN: 1424417643</identifier><identifier>DOI: 10.1109/ICIP.2008.4711900</identifier><language>eng</language><publisher>IEEE</publisher><subject>edge interpolation ; graph ; Image quality ; Image reconstruction ; Interpolation ; Laplace equations ; Laplacian extrema ; Layout ; Microelectronics ; Motion compensation ; Multimedia communication ; Pixel ; Plasma displays ; spatial deinterlacing</subject><ispartof>2008 15th IEEE International Conference on Image Processing, 2008, p.897-900</ispartof><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://ieeexplore.ieee.org/document/4711900$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4711900$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Roussel, J.</creatorcontrib><creatorcontrib>Bertolino, P.</creatorcontrib><title>Graph-based deinterlacing</title><title>2008 15th IEEE International Conference on Image Processing</title><addtitle>ICIP</addtitle><description>This article presents a new algorithm for spatial deinterlacing that could easily be integrated in a more complete deinterlacing system. The spatial interpolation process often fails to reconstruct edges that are diagonal or close to horizontal, leading to highly visible artifacts. Our solution aims at preserving the linear structure continuity. It connects pieces of horizontal edges coming from neighboring lines to build graphs which are then simplified in branches that represent the linear structure of the scene. These branches give the exact direction in which the interpolation has to be done. For the rest of the image, a traditional directional spatial interpolation gives satisfactory results already. Although the number of pixels interpolated with this method is relatively small, the overall image quality is subjectively well improved.</description><subject>edge interpolation</subject><subject>graph</subject><subject>Image quality</subject><subject>Image reconstruction</subject><subject>Interpolation</subject><subject>Laplace equations</subject><subject>Laplacian extrema</subject><subject>Layout</subject><subject>Microelectronics</subject><subject>Motion compensation</subject><subject>Multimedia communication</subject><subject>Pixel</subject><subject>Plasma displays</subject><subject>spatial deinterlacing</subject><issn>1522-4880</issn><issn>2381-8549</issn><isbn>9781424417650</isbn><isbn>1424417651</isbn><isbn>9781424417643</isbn><isbn>1424417643</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpVj7tOw0AQAI-XhAn5gIiGHzhn9x57eyWySLAUiRRQR2ffHhiFKLLT8PcUpKGaYqSRRqkFQo0Icdk27bY2AFy7gBgBLtQ8BkZnnMNAzl6qylhGzd7Fq3_Ow7Wq0BujHTPcqrtp-gIwgBYrtViP6fipuzRJfswyHE4y7lM_HD7u1U1J-0nmZ87U--r5rXnRm9d12zxt9GCQTzpnIkN9LxSTBxEfkIrvqEhkdiShZGsDoevAlsjFg6Mu976IcApU7Ew9_HUHEdkdx-E7jT-786X9BS3VP-U</recordid><startdate>200810</startdate><enddate>200810</enddate><creator>Roussel, J.</creator><creator>Bertolino, P.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>200810</creationdate><title>Graph-based deinterlacing</title><author>Roussel, J. ; Bertolino, P.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i218t-dd6626cce69a50ee5716f5b6fe98846e7fd337614b03f98f5046bdc5fee8a76f3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>edge interpolation</topic><topic>graph</topic><topic>Image quality</topic><topic>Image reconstruction</topic><topic>Interpolation</topic><topic>Laplace equations</topic><topic>Laplacian extrema</topic><topic>Layout</topic><topic>Microelectronics</topic><topic>Motion compensation</topic><topic>Multimedia communication</topic><topic>Pixel</topic><topic>Plasma displays</topic><topic>spatial deinterlacing</topic><toplevel>online_resources</toplevel><creatorcontrib>Roussel, J.</creatorcontrib><creatorcontrib>Bertolino, P.</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>Roussel, J.</au><au>Bertolino, P.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Graph-based deinterlacing</atitle><btitle>2008 15th IEEE International Conference on Image Processing</btitle><stitle>ICIP</stitle><date>2008-10</date><risdate>2008</risdate><spage>897</spage><epage>900</epage><pages>897-900</pages><issn>1522-4880</issn><eissn>2381-8549</eissn><isbn>9781424417650</isbn><isbn>1424417651</isbn><eisbn>9781424417643</eisbn><eisbn>1424417643</eisbn><abstract>This article presents a new algorithm for spatial deinterlacing that could easily be integrated in a more complete deinterlacing system. The spatial interpolation process often fails to reconstruct edges that are diagonal or close to horizontal, leading to highly visible artifacts. Our solution aims at preserving the linear structure continuity. It connects pieces of horizontal edges coming from neighboring lines to build graphs which are then simplified in branches that represent the linear structure of the scene. These branches give the exact direction in which the interpolation has to be done. For the rest of the image, a traditional directional spatial interpolation gives satisfactory results already. Although the number of pixels interpolated with this method is relatively small, the overall image quality is subjectively well improved.</abstract><pub>IEEE</pub><doi>10.1109/ICIP.2008.4711900</doi><tpages>4</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1522-4880
ispartof 2008 15th IEEE International Conference on Image Processing, 2008, p.897-900
issn 1522-4880
2381-8549
language eng
recordid cdi_ieee_primary_4711900
source IEEE Electronic Library (IEL) Conference Proceedings
subjects edge interpolation
graph
Image quality
Image reconstruction
Interpolation
Laplace equations
Laplacian extrema
Layout
Microelectronics
Motion compensation
Multimedia communication
Pixel
Plasma displays
spatial deinterlacing
title Graph-based deinterlacing
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T22%3A50%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=Graph-based%20deinterlacing&rft.btitle=2008%2015th%20IEEE%20International%20Conference%20on%20Image%20Processing&rft.au=Roussel,%20J.&rft.date=2008-10&rft.spage=897&rft.epage=900&rft.pages=897-900&rft.issn=1522-4880&rft.eissn=2381-8549&rft.isbn=9781424417650&rft.isbn_list=1424417651&rft_id=info:doi/10.1109/ICIP.2008.4711900&rft_dat=%3Cieee_6IE%3E4711900%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424417643&rft.eisbn_list=1424417643&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4711900&rfr_iscdi=true