Genetic motion search algorithm for video compression
A new approach to block-based motion estimation for video compression, called the genetic motion search (GMS) algorithm, is introduced. It makes use of a natural processing concept called genetic algorithm (GA). In contrast to existing fast algorithms, which rely on the assumption that the matching...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on circuits and systems for video technology 1993-12, Vol.3 (6), p.440-445 |
|---|---|
| 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 | 445 |
|---|---|
| container_issue | 6 |
| container_start_page | 440 |
| container_title | IEEE transactions on circuits and systems for video technology |
| container_volume | 3 |
| creator | Hung-Kei Chow, K. Liou, M.L. |
| description | A new approach to block-based motion estimation for video compression, called the genetic motion search (GMS) algorithm, is introduced. It makes use of a natural processing concept called genetic algorithm (GA). In contrast to existing fast algorithms, which rely on the assumption that the matching error decreases monotonically as the search point moves closer to the global optimum, the GMS algorithm is not fundamentally limited by this restriction. Experimental results demonstrate that GMS is more robust than other algorithms in locating the global optimum and is computationally simpler than the full search algorithm. GMS is also suitable for VLSI implementation because of its regularity and high architectural parallelism.< > |
| doi_str_mv | 10.1109/76.260203 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_260203</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>260203</ieee_id><sourcerecordid>28331147</sourcerecordid><originalsourceid>FETCH-LOGICAL-c306t-2d16879c872ee6677d65ebb82bc733415efab77932e15f18d291ee23a81aa2523</originalsourceid><addsrcrecordid>eNo9kE1LxDAQhoMouK4evHrqQQQPXTNJ89GjLLoKC170HNJ06kbaZk26gv_eSsueZmCe92F4CbkGugKg5YOSKyYpo_yELEAInTNGxem4UwG5ZiDOyUVKX5RCoQu1IGKDPQ7eZV0YfOizhDa6XWbbzxD9sOuyJsTsx9cYMhe6fcSURuySnDW2TXg1zyX5eH56X7_k27fN6_pxmztO5ZCzGqRWpdOKIUqpVC0FVpVmlVOcFyCwsZVSJWcIogFdsxIQGbcarGWC8SW5m7z7GL4PmAbT-eSwbW2P4ZAM05wDFGoE7yfQxZBSxMbso-9s_DVAzX8xRkkzFTOyt7PUJmfbJtre-XQM8JLT8e0Ru5kwj4jH6-z4AzPiaR0</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28331147</pqid></control><display><type>article</type><title>Genetic motion search algorithm for video compression</title><source>IEEE Electronic Library (IEL)</source><creator>Hung-Kei Chow, K. ; Liou, M.L.</creator><creatorcontrib>Hung-Kei Chow, K. ; Liou, M.L.</creatorcontrib><description>A new approach to block-based motion estimation for video compression, called the genetic motion search (GMS) algorithm, is introduced. It makes use of a natural processing concept called genetic algorithm (GA). In contrast to existing fast algorithms, which rely on the assumption that the matching error decreases monotonically as the search point moves closer to the global optimum, the GMS algorithm is not fundamentally limited by this restriction. Experimental results demonstrate that GMS is more robust than other algorithms in locating the global optimum and is computationally simpler than the full search algorithm. GMS is also suitable for VLSI implementation because of its regularity and high architectural parallelism.< ></description><identifier>ISSN: 1051-8215</identifier><identifier>EISSN: 1558-2205</identifier><identifier>DOI: 10.1109/76.260203</identifier><identifier>CODEN: ITCTEM</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Computational complexity ; Cutoff frequency ; Exact sciences and technology ; Frequency response ; Genetic algorithms ; Image converters ; Image processing ; Information, signal and communications theory ; Kernel ; Low pass filters ; Motion estimation ; Signal processing ; Telecommunications and information theory ; Transform coding ; Video compression</subject><ispartof>IEEE transactions on circuits and systems for video technology, 1993-12, Vol.3 (6), p.440-445</ispartof><rights>1994 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c306t-2d16879c872ee6677d65ebb82bc733415efab77932e15f18d291ee23a81aa2523</citedby><cites>FETCH-LOGICAL-c306t-2d16879c872ee6677d65ebb82bc733415efab77932e15f18d291ee23a81aa2523</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/260203$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/260203$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=3930168$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Hung-Kei Chow, K.</creatorcontrib><creatorcontrib>Liou, M.L.</creatorcontrib><title>Genetic motion search algorithm for video compression</title><title>IEEE transactions on circuits and systems for video technology</title><addtitle>TCSVT</addtitle><description>A new approach to block-based motion estimation for video compression, called the genetic motion search (GMS) algorithm, is introduced. It makes use of a natural processing concept called genetic algorithm (GA). In contrast to existing fast algorithms, which rely on the assumption that the matching error decreases monotonically as the search point moves closer to the global optimum, the GMS algorithm is not fundamentally limited by this restriction. Experimental results demonstrate that GMS is more robust than other algorithms in locating the global optimum and is computationally simpler than the full search algorithm. GMS is also suitable for VLSI implementation because of its regularity and high architectural parallelism.< ></description><subject>Applied sciences</subject><subject>Computational complexity</subject><subject>Cutoff frequency</subject><subject>Exact sciences and technology</subject><subject>Frequency response</subject><subject>Genetic algorithms</subject><subject>Image converters</subject><subject>Image processing</subject><subject>Information, signal and communications theory</subject><subject>Kernel</subject><subject>Low pass filters</subject><subject>Motion estimation</subject><subject>Signal processing</subject><subject>Telecommunications and information theory</subject><subject>Transform coding</subject><subject>Video compression</subject><issn>1051-8215</issn><issn>1558-2205</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1993</creationdate><recordtype>article</recordtype><recordid>eNo9kE1LxDAQhoMouK4evHrqQQQPXTNJ89GjLLoKC170HNJ06kbaZk26gv_eSsueZmCe92F4CbkGugKg5YOSKyYpo_yELEAInTNGxem4UwG5ZiDOyUVKX5RCoQu1IGKDPQ7eZV0YfOizhDa6XWbbzxD9sOuyJsTsx9cYMhe6fcSURuySnDW2TXg1zyX5eH56X7_k27fN6_pxmztO5ZCzGqRWpdOKIUqpVC0FVpVmlVOcFyCwsZVSJWcIogFdsxIQGbcarGWC8SW5m7z7GL4PmAbT-eSwbW2P4ZAM05wDFGoE7yfQxZBSxMbso-9s_DVAzX8xRkkzFTOyt7PUJmfbJtre-XQM8JLT8e0Ru5kwj4jH6-z4AzPiaR0</recordid><startdate>19931201</startdate><enddate>19931201</enddate><creator>Hung-Kei Chow, K.</creator><creator>Liou, M.L.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope></search><sort><creationdate>19931201</creationdate><title>Genetic motion search algorithm for video compression</title><author>Hung-Kei Chow, K. ; Liou, M.L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c306t-2d16879c872ee6677d65ebb82bc733415efab77932e15f18d291ee23a81aa2523</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1993</creationdate><topic>Applied sciences</topic><topic>Computational complexity</topic><topic>Cutoff frequency</topic><topic>Exact sciences and technology</topic><topic>Frequency response</topic><topic>Genetic algorithms</topic><topic>Image converters</topic><topic>Image processing</topic><topic>Information, signal and communications theory</topic><topic>Kernel</topic><topic>Low pass filters</topic><topic>Motion estimation</topic><topic>Signal processing</topic><topic>Telecommunications and information theory</topic><topic>Transform coding</topic><topic>Video compression</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hung-Kei Chow, K.</creatorcontrib><creatorcontrib>Liou, M.L.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</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>Hung-Kei Chow, K.</au><au>Liou, M.L.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Genetic motion search algorithm for video compression</atitle><jtitle>IEEE transactions on circuits and systems for video technology</jtitle><stitle>TCSVT</stitle><date>1993-12-01</date><risdate>1993</risdate><volume>3</volume><issue>6</issue><spage>440</spage><epage>445</epage><pages>440-445</pages><issn>1051-8215</issn><eissn>1558-2205</eissn><coden>ITCTEM</coden><abstract>A new approach to block-based motion estimation for video compression, called the genetic motion search (GMS) algorithm, is introduced. It makes use of a natural processing concept called genetic algorithm (GA). In contrast to existing fast algorithms, which rely on the assumption that the matching error decreases monotonically as the search point moves closer to the global optimum, the GMS algorithm is not fundamentally limited by this restriction. Experimental results demonstrate that GMS is more robust than other algorithms in locating the global optimum and is computationally simpler than the full search algorithm. GMS is also suitable for VLSI implementation because of its regularity and high architectural parallelism.< ></abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/76.260203</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1051-8215 |
| ispartof | IEEE transactions on circuits and systems for video technology, 1993-12, Vol.3 (6), p.440-445 |
| issn | 1051-8215 1558-2205 |
| language | eng |
| recordid | cdi_ieee_primary_260203 |
| source | IEEE Electronic Library (IEL) |
| subjects | Applied sciences Computational complexity Cutoff frequency Exact sciences and technology Frequency response Genetic algorithms Image converters Image processing Information, signal and communications theory Kernel Low pass filters Motion estimation Signal processing Telecommunications and information theory Transform coding Video compression |
| title | Genetic motion search algorithm for video compression |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-22T23%3A52%3A40IST&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=Genetic%20motion%20search%20algorithm%20for%20video%20compression&rft.jtitle=IEEE%20transactions%20on%20circuits%20and%20systems%20for%20video%20technology&rft.au=Hung-Kei%20Chow,%20K.&rft.date=1993-12-01&rft.volume=3&rft.issue=6&rft.spage=440&rft.epage=445&rft.pages=440-445&rft.issn=1051-8215&rft.eissn=1558-2205&rft.coden=ITCTEM&rft_id=info:doi/10.1109/76.260203&rft_dat=%3Cproquest_RIE%3E28331147%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=28331147&rft_id=info:pmid/&rft_ieee_id=260203&rfr_iscdi=true |