| 摘要 |
<P>PROBLEM TO BE SOLVED: To solve the problems that it is easy to fall into a local solution when applying a sequential search method if the method is applied to an interlace image, there is a drawback that the method is weak against motion in an oblique direction conventionally when the number of search times is designated, so that a computation time is elongated when a search range is increased to compensate the drawback. <P>SOLUTION: A motion vector candidate generation section 15 generates, as a vector candidate, a position of a pixel in a nearly circular search range comprising a total of eight pixels composed of one pixel at a search center point of a motion vector on a reference image and seven pixels near the search center point. A motion compensation section 13 generates a prediction block where the motion vector candidate is arranged at a prescribed position from a reference image. Similarity calculators 11a-11h calculate similarly between a block to be coded and a prediction block for each motion vector candidate for each prediction block. A search control section 14 determines a prescribed pixel position in the prediction block indicating the calculation result of the highest similarity as a next search center point in the motion vector candidate generation section 15. <P>COPYRIGHT: (C)2008,JPO&INPIT |
