MOTION SEARCH METHOD
A motion search method the computational complexity of which is lower than the full search method. At step (SP1), a coarse search block (G1) and a fine search block (G2) are set. The fine search block (G2) is so set as a search block which is one of divided parts of the coarse search block (G1) so t...
Saved in:
Main Authors | , , , , , |
---|---|
Format | Patent |
Language | English French Japanese |
Published |
05.04.2007
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | A motion search method the computational complexity of which is lower than the full search method. At step (SP1), a coarse search block (G1) and a fine search block (G2) are set. The fine search block (G2) is so set as a search block which is one of divided parts of the coarse search block (G1) so that the fine search block (G1) is included in the coarse search block (G1). At step (SP2), a thin interpolation image (I1) and a dense interpolation image (I2) are set. At step (SP3), a search is carried out using the coarse search block (G1) and thin interpolation image (I1). At step (SP4), a search is carried out using the coarse search block (G1) and the dense interpolation image (I2). For search blocks (BL4 to BL7) belonging to the fine search block (G2), a search of the peripheral regions of the optimum points (P1 to P3) found at step (SP3) is carried out.
La présente invention concerne un procédé de recherche de mouvement dont la complexité de calcul est inférieure au procédé de recherche complet. A l'étape (SP1), un bloc de recherche grossière (G1) et un bloc de recherche fine (G2) sont fixés. Le bloc de recherche fine (G2) est fixé comme un bloc de recherche qui est un bloc de parties de division du bloc de recherche grossière (G1) de sorte que ce bloc de recherche fine ( G2) soit inclu dans le bloc de recherche grossière (G1). A l'étape (SP2), une image d'interpellation faible (I1) et une image d'interpolation forte (I2) sont fixées. A l'étape (SP3), une recherche est effectuée au moyen du bloc de recherche grossière (G1) et de l'image d'interpolation faible (I1). A l'étape (SP4) une recherche est effectuée au moyen du bloc de recherche grossière (G1) et de l'image d'interpolation forte (I2). Pour les blocs de recherche (BL4 à BL7) appartenant au bloc de recherche fine (G2), une recherche des régions périphériques des points optimum (P1 à P3) trouvés à l'étape (SP3) est effectuée. |
---|---|
AbstractList | A motion search method the computational complexity of which is lower than the full search method. At step (SP1), a coarse search block (G1) and a fine search block (G2) are set. The fine search block (G2) is so set as a search block which is one of divided parts of the coarse search block (G1) so that the fine search block (G1) is included in the coarse search block (G1). At step (SP2), a thin interpolation image (I1) and a dense interpolation image (I2) are set. At step (SP3), a search is carried out using the coarse search block (G1) and thin interpolation image (I1). At step (SP4), a search is carried out using the coarse search block (G1) and the dense interpolation image (I2). For search blocks (BL4 to BL7) belonging to the fine search block (G2), a search of the peripheral regions of the optimum points (P1 to P3) found at step (SP3) is carried out.
La présente invention concerne un procédé de recherche de mouvement dont la complexité de calcul est inférieure au procédé de recherche complet. A l'étape (SP1), un bloc de recherche grossière (G1) et un bloc de recherche fine (G2) sont fixés. Le bloc de recherche fine (G2) est fixé comme un bloc de recherche qui est un bloc de parties de division du bloc de recherche grossière (G1) de sorte que ce bloc de recherche fine ( G2) soit inclu dans le bloc de recherche grossière (G1). A l'étape (SP2), une image d'interpellation faible (I1) et une image d'interpolation forte (I2) sont fixées. A l'étape (SP3), une recherche est effectuée au moyen du bloc de recherche grossière (G1) et de l'image d'interpolation faible (I1). A l'étape (SP4) une recherche est effectuée au moyen du bloc de recherche grossière (G1) et de l'image d'interpolation forte (I2). Pour les blocs de recherche (BL4 à BL7) appartenant au bloc de recherche fine (G2), une recherche des régions périphériques des points optimum (P1 à P3) trouvés à l'étape (SP3) est effectuée. |
Author | OKUMURA, MAYUMI HAMAMOTO, MASAKI YOSHIMOTO, MASAHIKO MURACHI, YUICHIRO MIYAKOSHI, JUNICHI MATSUNO, TETSURO |
Author_xml | – fullname: YOSHIMOTO, MASAHIKO – fullname: HAMAMOTO, MASAKI – fullname: OKUMURA, MAYUMI – fullname: MATSUNO, TETSURO – fullname: MIYAKOSHI, JUNICHI – fullname: MURACHI, YUICHIRO |
BookMark | eNrjYmDJy89L5WQQ8fUP8fT3Uwh2dQxy9lDwdQ3x8HfhYWBNS8wpTuWF0twMym6uIc4euqkF-fGpxQWJyal5qSXx4f5GBgbmBsbmBqbGjobGxKkCALqYISw |
ContentType | Patent |
DBID | EVB |
DatabaseName | esp@cenet |
DatabaseTitleList | |
Database_xml | – sequence: 1 dbid: EVB name: esp@cenet url: http://worldwide.espacenet.com/singleLineSearch?locale=en_EP sourceTypes: Open Access Repository |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Medicine Chemistry Sciences Physics |
DocumentTitleAlternate | PROCEDE DE RECHERCHE DE MOUVEMENT |
ExternalDocumentID | WO2007037053A1 |
GroupedDBID | EVB |
ID | FETCH-epo_espacenet_WO2007037053A13 |
IEDL.DBID | EVB |
IngestDate | Fri Jul 19 15:21:16 EDT 2024 |
IsOpenAccess | true |
IsPeerReviewed | false |
IsScholarly | false |
Language | English French Japanese |
LinkModel | DirectLink |
MergedId | FETCHMERGED-epo_espacenet_WO2007037053A13 |
Notes | Application Number: WO2006JP312980 |
OpenAccessLink | https://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20070405&DB=EPODOC&CC=WO&NR=2007037053A1 |
ParticipantIDs | epo_espacenet_WO2007037053A1 |
PublicationCentury | 2000 |
PublicationDate | 20070405 |
PublicationDateYYYYMMDD | 2007-04-05 |
PublicationDate_xml | – month: 04 year: 2007 text: 20070405 day: 05 |
PublicationDecade | 2000 |
PublicationYear | 2007 |
RelatedCompanies | MEGACHIPS LSI SOLUTIONS INC OKUMURA, MAYUMI HAMAMOTO, MASAKI YOSHIMOTO, MASAHIKO NATIONAL UNIVERSITY CORPORATION KOBE UNIVERSITY MURACHI, YUICHIRO MIYAKOSHI, JUNICHI MATSUNO, TETSURO |
RelatedCompanies_xml | – name: OKUMURA, MAYUMI – name: MEGACHIPS LSI SOLUTIONS INC – name: NATIONAL UNIVERSITY CORPORATION KOBE UNIVERSITY – name: HAMAMOTO, MASAKI – name: MURACHI, YUICHIRO – name: YOSHIMOTO, MASAHIKO – name: MATSUNO, TETSURO – name: MIYAKOSHI, JUNICHI |
Score | 2.7722223 |
Snippet | A motion search method the computational complexity of which is lower than the full search method. At step (SP1), a coarse search block (G1) and a fine search... |
SourceID | epo |
SourceType | Open Access Repository |
SubjectTerms | BASIC ELECTRONIC CIRCUITRY CALCULATING CODE CONVERSION IN GENERAL CODING COMPUTING COUNTING DECODING ELECTRIC COMMUNICATION TECHNIQUE ELECTRICITY IMAGE DATA PROCESSING OR GENERATION, IN GENERAL PHYSICS PICTORIAL COMMUNICATION, e.g. TELEVISION |
Title | MOTION SEARCH METHOD |
URI | https://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20070405&DB=EPODOC&locale=&CC=WO&NR=2007037053A1 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwY2BQSTFLMTE1MTPTTTJKNtY1STIz0bVMNjUCpmVDg7TEREtgpwQ0oO_rZ-YRauIVYRrBxJAD2wsDPie0HHw4IjBHJQPzewm4vC5ADGK5gNdWFusnZQKF8u3dQmxd1GC9Y3NgmjRVc3GydQ3wd_F3VnN2Bvbb1PyCIHLG5sAk5wjsK7GCGtKgk_Zdw5xA-1IKkCsVN0EGtgCgeXklQgxMWYnCDJzOsLvXhBk4fKFT3sIM7OA1msnFQEFoPiwWYRDx9QcNLSlAJnsUfF1DPPxdRBmU3VxDnD10gRbFw_0VH-6P7CpjMQYWYI8_VYJBIRnYLLFIARZDSSkmJubJRhZJRikphgYWyebAxphhoqUkgww-k6TwS0szcEEGKE10DUxlGFhKikpTZYE1a0mSHDhAALtXdwg |
link.rule.ids | 230,309,786,891,25594,76906 |
linkProvider | European Patent Office |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1ZS8NAEB5KPeqbpopH1YCSt2COzfVQxOYgapMUidq3kt2toIgWE_HvO9k02qe-zsJezOzO983sLMAltzmxiG2r1GCmSqhNVI9ZBuqyrr0UhYegpCb0k9SOH8nd1Jp24L19CyPqhP6I4ohoUQztvRLn9eKfxApEbmV5RV9R9Hkd5cNAadGxgzppKcFoGE6yIPMV30fcpqQPTZvpoMrdIFbacOr6vLXz9DSq36UsVi-VaBc2J9jfR7UHnbdCgp7f_r0mwXayDHlLsCVyNFmJwqUdln3oJ1lNLclNsEdOwjzOgn24iMLcj1UcaPa3rtlztjor8wC6iPjnhyAzdEtcjscQ5YQ4zHCpwbmuucxBZ0wvvCMYrOvpeH3zOfTiPBnPxrfp_QnsNGQlUTVrAN3q63t-irdsRc_E5vwCdEF59Q |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Apatent&rft.title=MOTION+SEARCH+METHOD&rft.inventor=YOSHIMOTO%2C+MASAHIKO&rft.inventor=HAMAMOTO%2C+MASAKI&rft.inventor=OKUMURA%2C+MAYUMI&rft.inventor=MATSUNO%2C+TETSURO&rft.inventor=MIYAKOSHI%2C+JUNICHI&rft.inventor=MURACHI%2C+YUICHIRO&rft.date=2007-04-05&rft.externalDBID=A1&rft.externalDocID=WO2007037053A1 |