[1992] Proceedings of the International Conference on Application Specific Array Processors
DOI: 10.1109/asap.1992.218545
|View full text |Cite
|
Sign up to set email alerts
|

Parallel architecture for a pel-recursive motion estimation algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 7 publications
0
4
0
Order By: Relevance
“…In this case, the interpolation is made by using the information coming from the image block. A more complex approach has been used for defining a linear array of processors by Frimout et al [47].…”
Section: Pel-recursive Approaches (Pra's)mentioning
confidence: 99%
“…In this case, the interpolation is made by using the information coming from the image block. A more complex approach has been used for defining a linear array of processors by Frimout et al [47].…”
Section: Pel-recursive Approaches (Pra's)mentioning
confidence: 99%
“…When data are distributed among PEc, the data access mechanism is derived from the system proposed in [8]. A request manager is assigned to each PEc.…”
Section: Real-time Performancementioning
confidence: 99%
“…Pel-Recursive Algorithm (PRA) implementations are difficult to compare since they consider different algorithms and target different architecture styles. Brofferio et al [5] proposed a sequential architecture whereas Frimout et al [8] derived a systolic network. The Kim and Lee architecture [12] is a pipelined linear network of operators.…”
mentioning
confidence: 99%
“…Since the algorithms of the first group have acceptable performance and demand lower computational complexity they are commonly used in video compression standards. We can name pel recursive algorithm [2], affine based algorithm [3], mesh based algorithm [4] and block-based ME algorithms like [5][6][7][8][9][10][11][12][13][14][15] from the first category. In the block-based ME algorithms, the current frame is divided into non-overlapped blocks and a search window is defined in the reference frame.…”
Section: Introductionmentioning
confidence: 99%