Invention Grant
- Patent Title: Effective motion estimation for hierarchical search
- Patent Title (中): 分层搜索的有效运动估计
-
Application No.: US09846153Application Date: 2001-04-30
-
Publication No.: US06850569B2Publication Date: 2005-02-01
- Inventor: Seong-Mo Park , Ju-Hyun Park , Jin-Jong Cha , Han-Jin Cho
- Applicant: Seong-Mo Park , Ju-Hyun Park , Jin-Jong Cha , Han-Jin Cho
- Applicant Address: KR Taejon
- Assignee: Electronics and Telecommunications Research Institute
- Current Assignee: Electronics and Telecommunications Research Institute
- Current Assignee Address: KR Taejon
- Agency: Seed IP Law Group PLLC
- Priority: KR2000-79534 20001221
- Main IPC: H04N7/32
- IPC: H04N7/32 ; G06T7/20 ; H04N5/14 ; H04N7/26 ; H04N7/12

Abstract:
In the present invention, a reference block data within a current image from which a motion vector will be obtained and corresponding search region data within reproduced previous image are stored in a reference block and a search region data memory, respectively. A motion vector of two pixels unit is performed using the reference block and the search region data stored in the memory, thus resulting in obtained a motion vector of two pixels unit. At this time, the reference block and the search region data are used by performing 2:1 sampling in a horizontal direction and a vertical direction, respectively and the search range is −7˜+7. The structure of the motion search is consisted of a memory for storing a reference block (8×8) of current images and a memory (24×8) for storing a search region storing reproduced previous images. The structure further includes a processing element (PE) array block for obtaining SAD (sum of absolute difference) among candidate blocks within the search region and a block for obtaining the smallest motion vector among the candidate SADs. If hardware is implemented using the two-step search algorithm among the motion estimation of the present invention, a lot of data bandwidth of the reference memory and a memory having a large size are required. The down sampling scheme and the bandwidth of the reference memory has a structure in which a slice is previously downloaded before a pipeline when it downloads from the external memory. In an actual pipeline operation, it is implemented by the bandwidth of ⅓. Also, as it has independent memories, it can operate even at low frequency without degrading the performance.
Public/Granted literature
- US20020080880A1 Effective motion estimation for hierarchical search Public/Granted day:2002-06-27
Information query