New Frame Rate Up-Conversion Algorithms With Low Computational Complexity
This paper proposes a new frame rate up-conversion (FRUC) algorithm to reduce the computational complexity and to improve the peak signal-to-noise ratio (PSNR) performance. The proposed FRUC algorithm includes prediction-based motion vector smoothing (PMOS), partial average-based motion compensation...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on circuits and systems for video technology 2014-03, Vol.24 (3), p.384-393 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 393 |
|---|---|
| container_issue | 3 |
| container_start_page | 384 |
| container_title | IEEE transactions on circuits and systems for video technology |
| container_volume | 24 |
| creator | Kim, Un Seob Sunwoo, Myung Hoon |
| description | This paper proposes a new frame rate up-conversion (FRUC) algorithm to reduce the computational complexity and to improve the peak signal-to-noise ratio (PSNR) performance. The proposed FRUC algorithm includes prediction-based motion vector smoothing (PMOS), partial average-based motion compensation (PAMC), and intrapredicted hole interpolation (IPHI). PMVS can efficiently remove outliers using motion vectors of neighboring blocks and PAMC performs motion compensation with the region-based partial average to reduce blocking artifacts of the interpolated frames. For hole interpolation, IPHI uses intraprediction of H.264/AVC to eliminate blurring and also uses the fixed weights implemented using only shift operations, which result in low computational complexity. Compared to the existing algorithms, which use bilateral motion estimation, the proposed algorithm improves the average PSNR of the interpolated frames by 3.44 dB and lowers PSNR performance only by 0.13 dB than the existing algorithm that employs unilateral ME; however, it can significantly reduce the computational complexity of FRUC about 89.3% based on the absolute difference. |
| doi_str_mv | 10.1109/TCSVT.2013.2278142 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_pascalfrancis_primary_28403941</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6578124</ieee_id><sourcerecordid>1520965431</sourcerecordid><originalsourceid>FETCH-LOGICAL-c358t-9e540634fab412817c9fce937d2e772625e5de63ee432f83e7e43e6deb1e381a3</originalsourceid><addsrcrecordid>eNpdkE9Lw0AQxYMoWKtfQC8BEbyk7t_s7lGC1UJR0FaPYZtONCXJxt3E2m_vpi09eJoZ5vcejxcElxiNMEbqbpa8vc9GBGE6IkRIzMhRMMCcy4gQxI_9jjiOJMH8NDhzboUQZpKJQTB5hnU4trqC8FW3EM6bKDH1D1hXmDq8Lz-NLdqvyoUffoRTsw4TUzVdq1v_1-X2KuG3aDfnwUmuSwcX-zkM5uOHWfIUTV8eJ8n9NMool22kgDMUU5brBcNEYpGpPANFxZKAECQmHPgSYgrAKMklBeEXiJewwEAl1nQY3O58G2u-O3BtWhUug7LUNZjOpZgTpGLOKPbo9T90ZTrrY_cU4kgoxZWnyI7KrHHOQp42tqi03aQYpX276bbdtG833bfrRTd7a-0yXeZW11nhDkoiGaKK9RGudlwBAId3zL0LYfQP5tqB-A</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1505079959</pqid></control><display><type>article</type><title>New Frame Rate Up-Conversion Algorithms With Low Computational Complexity</title><source>IEEE Electronic Library (IEL)</source><creator>Kim, Un Seob ; Sunwoo, Myung Hoon</creator><creatorcontrib>Kim, Un Seob ; Sunwoo, Myung Hoon</creatorcontrib><description>This paper proposes a new frame rate up-conversion (FRUC) algorithm to reduce the computational complexity and to improve the peak signal-to-noise ratio (PSNR) performance. The proposed FRUC algorithm includes prediction-based motion vector smoothing (PMOS), partial average-based motion compensation (PAMC), and intrapredicted hole interpolation (IPHI). PMVS can efficiently remove outliers using motion vectors of neighboring blocks and PAMC performs motion compensation with the region-based partial average to reduce blocking artifacts of the interpolated frames. For hole interpolation, IPHI uses intraprediction of H.264/AVC to eliminate blurring and also uses the fixed weights implemented using only shift operations, which result in low computational complexity. Compared to the existing algorithms, which use bilateral motion estimation, the proposed algorithm improves the average PSNR of the interpolated frames by 3.44 dB and lowers PSNR performance only by 0.13 dB than the existing algorithm that employs unilateral ME; however, it can significantly reduce the computational complexity of FRUC about 89.3% based on the absolute difference.</description><identifier>ISSN: 1051-8215</identifier><identifier>EISSN: 1558-2205</identifier><identifier>DOI: 10.1109/TCSVT.2013.2278142</identifier><identifier>CODEN: ITCTEM</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Algorithm design and analysis ; Algorithms ; Applied sciences ; Complexity ; Computation ; Computational complexity ; Detection, estimation, filtering, equalization, prediction ; Exact sciences and technology ; Frame interpolation ; frame rate up-conversion ; Frames ; H264/AVC ; High Efficiency Video Coding (HEVC) ; Image processing ; Information, signal and communications theory ; Interpolation ; Mathematical analysis ; Motion compensation ; motion estimation ; Noise levels ; Prediction algorithms ; PSNR ; Signal and communications theory ; Signal processing ; Signal, noise ; Smoothing methods ; Telecommunications and information theory ; Vectors</subject><ispartof>IEEE transactions on circuits and systems for video technology, 2014-03, Vol.24 (3), p.384-393</ispartof><rights>2015 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Mar 2014</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c358t-9e540634fab412817c9fce937d2e772625e5de63ee432f83e7e43e6deb1e381a3</citedby><cites>FETCH-LOGICAL-c358t-9e540634fab412817c9fce937d2e772625e5de63ee432f83e7e43e6deb1e381a3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6578124$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6578124$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=28403941$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Kim, Un Seob</creatorcontrib><creatorcontrib>Sunwoo, Myung Hoon</creatorcontrib><title>New Frame Rate Up-Conversion Algorithms With Low Computational Complexity</title><title>IEEE transactions on circuits and systems for video technology</title><addtitle>TCSVT</addtitle><description>This paper proposes a new frame rate up-conversion (FRUC) algorithm to reduce the computational complexity and to improve the peak signal-to-noise ratio (PSNR) performance. The proposed FRUC algorithm includes prediction-based motion vector smoothing (PMOS), partial average-based motion compensation (PAMC), and intrapredicted hole interpolation (IPHI). PMVS can efficiently remove outliers using motion vectors of neighboring blocks and PAMC performs motion compensation with the region-based partial average to reduce blocking artifacts of the interpolated frames. For hole interpolation, IPHI uses intraprediction of H.264/AVC to eliminate blurring and also uses the fixed weights implemented using only shift operations, which result in low computational complexity. Compared to the existing algorithms, which use bilateral motion estimation, the proposed algorithm improves the average PSNR of the interpolated frames by 3.44 dB and lowers PSNR performance only by 0.13 dB than the existing algorithm that employs unilateral ME; however, it can significantly reduce the computational complexity of FRUC about 89.3% based on the absolute difference.</description><subject>Algorithm design and analysis</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Complexity</subject><subject>Computation</subject><subject>Computational complexity</subject><subject>Detection, estimation, filtering, equalization, prediction</subject><subject>Exact sciences and technology</subject><subject>Frame interpolation</subject><subject>frame rate up-conversion</subject><subject>Frames</subject><subject>H264/AVC</subject><subject>High Efficiency Video Coding (HEVC)</subject><subject>Image processing</subject><subject>Information, signal and communications theory</subject><subject>Interpolation</subject><subject>Mathematical analysis</subject><subject>Motion compensation</subject><subject>motion estimation</subject><subject>Noise levels</subject><subject>Prediction algorithms</subject><subject>PSNR</subject><subject>Signal and communications theory</subject><subject>Signal processing</subject><subject>Signal, noise</subject><subject>Smoothing methods</subject><subject>Telecommunications and information theory</subject><subject>Vectors</subject><issn>1051-8215</issn><issn>1558-2205</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpdkE9Lw0AQxYMoWKtfQC8BEbyk7t_s7lGC1UJR0FaPYZtONCXJxt3E2m_vpi09eJoZ5vcejxcElxiNMEbqbpa8vc9GBGE6IkRIzMhRMMCcy4gQxI_9jjiOJMH8NDhzboUQZpKJQTB5hnU4trqC8FW3EM6bKDH1D1hXmDq8Lz-NLdqvyoUffoRTsw4TUzVdq1v_1-X2KuG3aDfnwUmuSwcX-zkM5uOHWfIUTV8eJ8n9NMool22kgDMUU5brBcNEYpGpPANFxZKAECQmHPgSYgrAKMklBeEXiJewwEAl1nQY3O58G2u-O3BtWhUug7LUNZjOpZgTpGLOKPbo9T90ZTrrY_cU4kgoxZWnyI7KrHHOQp42tqi03aQYpX276bbdtG833bfrRTd7a-0yXeZW11nhDkoiGaKK9RGudlwBAId3zL0LYfQP5tqB-A</recordid><startdate>20140301</startdate><enddate>20140301</enddate><creator>Kim, Un Seob</creator><creator>Sunwoo, Myung Hoon</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20140301</creationdate><title>New Frame Rate Up-Conversion Algorithms With Low Computational Complexity</title><author>Kim, Un Seob ; Sunwoo, Myung Hoon</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c358t-9e540634fab412817c9fce937d2e772625e5de63ee432f83e7e43e6deb1e381a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Algorithm design and analysis</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Complexity</topic><topic>Computation</topic><topic>Computational complexity</topic><topic>Detection, estimation, filtering, equalization, prediction</topic><topic>Exact sciences and technology</topic><topic>Frame interpolation</topic><topic>frame rate up-conversion</topic><topic>Frames</topic><topic>H264/AVC</topic><topic>High Efficiency Video Coding (HEVC)</topic><topic>Image processing</topic><topic>Information, signal and communications theory</topic><topic>Interpolation</topic><topic>Mathematical analysis</topic><topic>Motion compensation</topic><topic>motion estimation</topic><topic>Noise levels</topic><topic>Prediction algorithms</topic><topic>PSNR</topic><topic>Signal and communications theory</topic><topic>Signal processing</topic><topic>Signal, noise</topic><topic>Smoothing methods</topic><topic>Telecommunications and information theory</topic><topic>Vectors</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kim, Un Seob</creatorcontrib><creatorcontrib>Sunwoo, Myung Hoon</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on circuits and systems for video technology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Kim, Un Seob</au><au>Sunwoo, Myung Hoon</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>New Frame Rate Up-Conversion Algorithms With Low Computational Complexity</atitle><jtitle>IEEE transactions on circuits and systems for video technology</jtitle><stitle>TCSVT</stitle><date>2014-03-01</date><risdate>2014</risdate><volume>24</volume><issue>3</issue><spage>384</spage><epage>393</epage><pages>384-393</pages><issn>1051-8215</issn><eissn>1558-2205</eissn><coden>ITCTEM</coden><abstract>This paper proposes a new frame rate up-conversion (FRUC) algorithm to reduce the computational complexity and to improve the peak signal-to-noise ratio (PSNR) performance. The proposed FRUC algorithm includes prediction-based motion vector smoothing (PMOS), partial average-based motion compensation (PAMC), and intrapredicted hole interpolation (IPHI). PMVS can efficiently remove outliers using motion vectors of neighboring blocks and PAMC performs motion compensation with the region-based partial average to reduce blocking artifacts of the interpolated frames. For hole interpolation, IPHI uses intraprediction of H.264/AVC to eliminate blurring and also uses the fixed weights implemented using only shift operations, which result in low computational complexity. Compared to the existing algorithms, which use bilateral motion estimation, the proposed algorithm improves the average PSNR of the interpolated frames by 3.44 dB and lowers PSNR performance only by 0.13 dB than the existing algorithm that employs unilateral ME; however, it can significantly reduce the computational complexity of FRUC about 89.3% based on the absolute difference.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TCSVT.2013.2278142</doi><tpages>10</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1051-8215 |
| ispartof | IEEE transactions on circuits and systems for video technology, 2014-03, Vol.24 (3), p.384-393 |
| issn | 1051-8215 1558-2205 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_28403941 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithm design and analysis Algorithms Applied sciences Complexity Computation Computational complexity Detection, estimation, filtering, equalization, prediction Exact sciences and technology Frame interpolation frame rate up-conversion Frames H264/AVC High Efficiency Video Coding (HEVC) Image processing Information, signal and communications theory Interpolation Mathematical analysis Motion compensation motion estimation Noise levels Prediction algorithms PSNR Signal and communications theory Signal processing Signal, noise Smoothing methods Telecommunications and information theory Vectors |
| title | New Frame Rate Up-Conversion Algorithms With Low Computational Complexity |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-05T13%3A17%3A05IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=New%20Frame%20Rate%20Up-Conversion%20Algorithms%20With%20Low%20Computational%20Complexity&rft.jtitle=IEEE%20transactions%20on%20circuits%20and%20systems%20for%20video%20technology&rft.au=Kim,%20Un%20Seob&rft.date=2014-03-01&rft.volume=24&rft.issue=3&rft.spage=384&rft.epage=393&rft.pages=384-393&rft.issn=1051-8215&rft.eissn=1558-2205&rft.coden=ITCTEM&rft_id=info:doi/10.1109/TCSVT.2013.2278142&rft_dat=%3Cproquest_RIE%3E1520965431%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1505079959&rft_id=info:pmid/&rft_ieee_id=6578124&rfr_iscdi=true |