2008
DOI: 10.1007/s11554-007-0070-9
|View full text |Cite
|
Sign up to set email alerts
|

A real-time motion estimation FPGA architecture

Abstract: A motion estimation architecture allowing the execution of a variety of block-matching search techniques is presented in this paper. The ability to choose the most efficient search technique with respect to speeding up the process and locating the best matching target block leads to the improvement of the quality of service and the performance of the video encoding. The proposed architecture is pipelined to efficiently support a large set of currently used block-matching algorithms including Diamond Search, 3-… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0
5

Year Published

2009
2009
2017
2017

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 21 publications
(21 citation statements)
references
References 20 publications
0
16
0
5
Order By: Relevance
“…Hence, we can utilize the rich results from the research on the block matching problem. Furthermore, a block matching problem can be computed using hardware such as VLSI [33], FPGA [34], or GPU [35]. This gives our algorithm a great potential in improving its speed.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Hence, we can utilize the rich results from the research on the block matching problem. Furthermore, a block matching problem can be computed using hardware such as VLSI [33], FPGA [34], or GPU [35]. This gives our algorithm a great potential in improving its speed.…”
Section: Related Workmentioning
confidence: 99%
“…A block matching problem can be addressed using existing hardware [33][34][35] or a simple pixel shifting method because we know the orientation of each block in the aligned image coordinates. Here, we focus on the shifting-based method.…”
Section: Cell-based Image Alignmentmentioning
confidence: 99%
“…When 8×8 partition sizes are used (8) with no Lagrangian optimization (points having no l in the label), the bit rate is actually worse than when no sub-block partitions are used, indicating that Lagrangian optimization is essential when using sub-block partitions. Lagrangian optimization has the advantage of both reducing the bit rate and increasing the processing speed in all the cases.…”
Section: Analysis Of Motion Estimation Algorithmsmentioning
confidence: 99%
“…Processors with instruction set architectures (ISA) similar to the proposed work, tailored for block-matching search algorithms, are presented in [7] and [8]. Xilinx have a motion estimation engine [9] that computes the sum of absolute differences (SAD) for a set of 120 search locations within a 112 × 128 search window in parallel.…”
Section: Introductionmentioning
confidence: 99%
“…Fast ME algorithms [1], [2], reduce the complexity and keep the resulting QoS close to that of the Full Search algorithm. Designers of ME architectures concentrate on solving the problem of real-time performance and also on optimizing the hardware resources of Full Search architectures [3], [4], [5], specific fast ME implementations [6], [7], or programmable organizations [8], [9], [10] allowing the choice of the most suitable ME algorithm to each application.…”
Section: Introductionmentioning
confidence: 99%