MOTION SEARCHING METHOD
PROBLEM TO BE SOLVED: To provide a motion searching method capable of reducing a computing complexity for motion searching in comparison with the full searching method. SOLUTION: The motion searching method includes: a step SP1 of establishing a rough searching block G1 and a fine searching block G2...
Gespeichert in:
Hauptverfasser: | , , , , , |
---|---|
Format: | Patent |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | PROBLEM TO BE SOLVED: To provide a motion searching method capable of reducing a computing complexity for motion searching in comparison with the full searching method. SOLUTION: The motion searching method includes: a step SP1 of establishing a rough searching block G1 and a fine searching block G2, wherein the fine searching block G2 is set as a searching block resulting from dividing the rough searching block G1 into a plurality of blocks so as to be included in the rough searching block G1; a step SP2 of establishing a coarse interpolation image I1 and a dense interpolation image I2; a step SP3 of executing searching by using the rough searching block G1 established in the step SP1 and the coarse interpolation image I1 established in the step SP2; and a step SP4 of executing searching by using the rough searching block G1 established in the step SP1 and the dense interpolation image I2 established in the step SP2, wherein searching is applied to peripheral regions of optimum points P1 to P3 obtained in the step SP3 with respect to the searching blocks BL4 to BL7 belonging to the fine searching block G2. COPYRIGHT: (C)2007,JPO&INPIT |
---|