A fast block-matching algorithm using smooth motion vector field adaptive search technique
In many video standards based on inter-frame compression such as H.26x and MPEG, block-matching algorithm has been widely adopted as the method for motion estimation because of its simplicity and effectiveness. Nevertheless, since motion estimation is very complex in computing. Fast algorithm for mo...
Gespeichert in:
| Veröffentlicht in: | Journal of computer science and technology 2003-01, Vol.18 (1), p.14-21 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 21 |
|---|---|
| container_issue | 1 |
| container_start_page | 14 |
| container_title | Journal of computer science and technology |
| container_volume | 18 |
| creator | Li, Bo Li, Wei Tu, YaMing |
| description | In many video standards based on inter-frame compression such as H.26x and MPEG, block-matching algorithm has been widely adopted as the method for motion estimation because of its simplicity and effectiveness. Nevertheless, since motion estimation is very complex in computing. Fast algorithm for motion estimation has always been an, important and attractive topic in video compression. From the viewpoint of making motion vector field smoother, this paper proposes a new algorithm SMVFAST. On the basis of motion correlation, it predicts the starting point by neighboring motion vectors according to their SADs. Adaptive search modes are used in its search process through simply classifying motion activity. After discovering the ubiquitous ratio between the SADs of the collocated blocks in the consecutive frames, the paper proposes an effective half-stop criterion that can quickly stop the search process with good enough results. Experiments show that SMVFAST obtains almost the same results as the full search at very low compuration cost, and outperforms MVFAST and PMVFAST in speed and quality, which are adopted by MPEG-4. |
| doi_str_mv | 10.1007/BF02946646 |
| format | Article |
| fullrecord | <record><control><sourceid>wanfang_jour_proqu</sourceid><recordid>TN_cdi_wanfang_journals_jsjkxjsxb_e200301002</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><wanfj_id>jsjkxjsxb_e200301002</wanfj_id><sourcerecordid>jsjkxjsxb_e200301002</sourcerecordid><originalsourceid>FETCH-LOGICAL-c325t-1cbf6bdb185de596180842abb038fc4b70990c2604a5a8001ee0645d5925509b3</originalsourceid><addsrcrecordid>eNpdkctKxDAUhosoqKMbnyC4EcTqaZqkyVIHbyC40Y2bkKTptLVtxiQz6tsbGVFwcy7w8Z_Ln2VHBZwXANXF1Q1gQRgjbCvbKziDnFREbKcaAHKRwm62H0IPUFZAyF72cokaFSLSgzOv-aiiabtpgdSwcL6L7YhW4bsPo3OxRaOLnZvQ2proPGo6O9RI1WoZu7VFwSpvWhStaafubWUPsp1GDcEe_uRZ9nxz_TS_yx8eb-_nlw-5KTGNeWF0w3StC05rSwUrOHCCldZQ8sYQXYEQYDADoqjiAIW1wAitqcCUgtDlLDvb6L6rqVHTQvZu5ac0Ufahf_3ow4eWFqeLIT0BJ_xkgy-9S1uGKMcuGDsMarJuFaTADHNc0TKRx__IX2XOSQU0kQk63UDGuxC8beTSd6Pyn7IA-e2J_POk_AIJDH1j</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>884705262</pqid></control><display><type>article</type><title>A fast block-matching algorithm using smooth motion vector field adaptive search technique</title><source>Alma/SFX Local Collection</source><source>SpringerLink Journals - AutoHoldings</source><creator>Li, Bo ; Li, Wei ; Tu, YaMing</creator><creatorcontrib>Li, Bo ; Li, Wei ; Tu, YaMing</creatorcontrib><description>In many video standards based on inter-frame compression such as H.26x and MPEG, block-matching algorithm has been widely adopted as the method for motion estimation because of its simplicity and effectiveness. Nevertheless, since motion estimation is very complex in computing. Fast algorithm for motion estimation has always been an, important and attractive topic in video compression. From the viewpoint of making motion vector field smoother, this paper proposes a new algorithm SMVFAST. On the basis of motion correlation, it predicts the starting point by neighboring motion vectors according to their SADs. Adaptive search modes are used in its search process through simply classifying motion activity. After discovering the ubiquitous ratio between the SADs of the collocated blocks in the consecutive frames, the paper proposes an effective half-stop criterion that can quickly stop the search process with good enough results. Experiments show that SMVFAST obtains almost the same results as the full search at very low compuration cost, and outperforms MVFAST and PMVFAST in speed and quality, which are adopted by MPEG-4.</description><identifier>ISSN: 1000-9000</identifier><identifier>EISSN: 1860-4749</identifier><identifier>DOI: 10.1007/BF02946646</identifier><language>eng</language><publisher>Beijing: Springer Nature B.V</publisher><subject>Adaptive search techniques ; Algorithms ; Blocking ; Fields (mathematics) ; Matching ; Mathematical analysis ; Motion simulation ; MPEG encoders ; Search process ; Searching ; Vectors (mathematics) ; Video compression</subject><ispartof>Journal of computer science and technology, 2003-01, Vol.18 (1), p.14-21</ispartof><rights>Science Press, Beijing China and Allerton Press Inc. 2003.</rights><rights>Copyright © Wanfang Data Co. Ltd. All Rights Reserved.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c325t-1cbf6bdb185de596180842abb038fc4b70990c2604a5a8001ee0645d5925509b3</citedby><cites>FETCH-LOGICAL-c325t-1cbf6bdb185de596180842abb038fc4b70990c2604a5a8001ee0645d5925509b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://www.wanfangdata.com.cn/images/PeriodicalImages/jsjkxjsxb-e/jsjkxjsxb-e.jpg</thumbnail><link.rule.ids>314,780,784,4022,27922,27923,27924</link.rule.ids></links><search><creatorcontrib>Li, Bo</creatorcontrib><creatorcontrib>Li, Wei</creatorcontrib><creatorcontrib>Tu, YaMing</creatorcontrib><title>A fast block-matching algorithm using smooth motion vector field adaptive search technique</title><title>Journal of computer science and technology</title><description>In many video standards based on inter-frame compression such as H.26x and MPEG, block-matching algorithm has been widely adopted as the method for motion estimation because of its simplicity and effectiveness. Nevertheless, since motion estimation is very complex in computing. Fast algorithm for motion estimation has always been an, important and attractive topic in video compression. From the viewpoint of making motion vector field smoother, this paper proposes a new algorithm SMVFAST. On the basis of motion correlation, it predicts the starting point by neighboring motion vectors according to their SADs. Adaptive search modes are used in its search process through simply classifying motion activity. After discovering the ubiquitous ratio between the SADs of the collocated blocks in the consecutive frames, the paper proposes an effective half-stop criterion that can quickly stop the search process with good enough results. Experiments show that SMVFAST obtains almost the same results as the full search at very low compuration cost, and outperforms MVFAST and PMVFAST in speed and quality, which are adopted by MPEG-4.</description><subject>Adaptive search techniques</subject><subject>Algorithms</subject><subject>Blocking</subject><subject>Fields (mathematics)</subject><subject>Matching</subject><subject>Mathematical analysis</subject><subject>Motion simulation</subject><subject>MPEG encoders</subject><subject>Search process</subject><subject>Searching</subject><subject>Vectors (mathematics)</subject><subject>Video compression</subject><issn>1000-9000</issn><issn>1860-4749</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNpdkctKxDAUhosoqKMbnyC4EcTqaZqkyVIHbyC40Y2bkKTptLVtxiQz6tsbGVFwcy7w8Z_Ln2VHBZwXANXF1Q1gQRgjbCvbKziDnFREbKcaAHKRwm62H0IPUFZAyF72cokaFSLSgzOv-aiiabtpgdSwcL6L7YhW4bsPo3OxRaOLnZvQ2proPGo6O9RI1WoZu7VFwSpvWhStaafubWUPsp1GDcEe_uRZ9nxz_TS_yx8eb-_nlw-5KTGNeWF0w3StC05rSwUrOHCCldZQ8sYQXYEQYDADoqjiAIW1wAitqcCUgtDlLDvb6L6rqVHTQvZu5ac0Ufahf_3ow4eWFqeLIT0BJ_xkgy-9S1uGKMcuGDsMarJuFaTADHNc0TKRx__IX2XOSQU0kQk63UDGuxC8beTSd6Pyn7IA-e2J_POk_AIJDH1j</recordid><startdate>20030101</startdate><enddate>20030101</enddate><creator>Li, Bo</creator><creator>Li, Wei</creator><creator>Tu, YaMing</creator><general>Springer Nature B.V</general><general>Digital Media Laboratory, Department of Computer Science and Engineering Beijing University of Aeronautics and Astronautics, Beijing 100083, P.R. China</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>2B.</scope><scope>4A8</scope><scope>92I</scope><scope>93N</scope><scope>PSX</scope><scope>TCJ</scope></search><sort><creationdate>20030101</creationdate><title>A fast block-matching algorithm using smooth motion vector field adaptive search technique</title><author>Li, Bo ; Li, Wei ; Tu, YaMing</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c325t-1cbf6bdb185de596180842abb038fc4b70990c2604a5a8001ee0645d5925509b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Adaptive search techniques</topic><topic>Algorithms</topic><topic>Blocking</topic><topic>Fields (mathematics)</topic><topic>Matching</topic><topic>Mathematical analysis</topic><topic>Motion simulation</topic><topic>MPEG encoders</topic><topic>Search process</topic><topic>Searching</topic><topic>Vectors (mathematics)</topic><topic>Video compression</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Li, Bo</creatorcontrib><creatorcontrib>Li, Wei</creatorcontrib><creatorcontrib>Tu, YaMing</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering 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>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><collection>Wanfang Data Journals - Hong Kong</collection><collection>WANFANG Data Centre</collection><collection>Wanfang Data Journals</collection><collection>万方数据期刊 - 香港版</collection><collection>China Online Journals (COJ)</collection><collection>China Online Journals (COJ)</collection><jtitle>Journal of computer science and technology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Li, Bo</au><au>Li, Wei</au><au>Tu, YaMing</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A fast block-matching algorithm using smooth motion vector field adaptive search technique</atitle><jtitle>Journal of computer science and technology</jtitle><date>2003-01-01</date><risdate>2003</risdate><volume>18</volume><issue>1</issue><spage>14</spage><epage>21</epage><pages>14-21</pages><issn>1000-9000</issn><eissn>1860-4749</eissn><abstract>In many video standards based on inter-frame compression such as H.26x and MPEG, block-matching algorithm has been widely adopted as the method for motion estimation because of its simplicity and effectiveness. Nevertheless, since motion estimation is very complex in computing. Fast algorithm for motion estimation has always been an, important and attractive topic in video compression. From the viewpoint of making motion vector field smoother, this paper proposes a new algorithm SMVFAST. On the basis of motion correlation, it predicts the starting point by neighboring motion vectors according to their SADs. Adaptive search modes are used in its search process through simply classifying motion activity. After discovering the ubiquitous ratio between the SADs of the collocated blocks in the consecutive frames, the paper proposes an effective half-stop criterion that can quickly stop the search process with good enough results. Experiments show that SMVFAST obtains almost the same results as the full search at very low compuration cost, and outperforms MVFAST and PMVFAST in speed and quality, which are adopted by MPEG-4.</abstract><cop>Beijing</cop><pub>Springer Nature B.V</pub><doi>10.1007/BF02946646</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1000-9000 |
| ispartof | Journal of computer science and technology, 2003-01, Vol.18 (1), p.14-21 |
| issn | 1000-9000 1860-4749 |
| language | eng |
| recordid | cdi_wanfang_journals_jsjkxjsxb_e200301002 |
| source | Alma/SFX Local Collection; SpringerLink Journals - AutoHoldings |
| subjects | Adaptive search techniques Algorithms Blocking Fields (mathematics) Matching Mathematical analysis Motion simulation MPEG encoders Search process Searching Vectors (mathematics) Video compression |
| title | A fast block-matching algorithm using smooth motion vector field adaptive search technique |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-12T00%3A30%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-wanfang_jour_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20fast%20block-matching%20algorithm%20using%20smooth%20motion%20vector%20field%20adaptive%20search%20technique&rft.jtitle=Journal%20of%20computer%20science%20and%20technology&rft.au=Li,%20Bo&rft.date=2003-01-01&rft.volume=18&rft.issue=1&rft.spage=14&rft.epage=21&rft.pages=14-21&rft.issn=1000-9000&rft.eissn=1860-4749&rft_id=info:doi/10.1007/BF02946646&rft_dat=%3Cwanfang_jour_proqu%3Ejsjkxjsxb_e200301002%3C/wanfang_jour_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=884705262&rft_id=info:pmid/&rft_wanfj_id=jsjkxjsxb_e200301002&rfr_iscdi=true |