1995
DOI: 10.1117/12.206349
|View full text |Cite
|
Sign up to set email alerts
|

<title>ISO-IEC MPEG-2 software video codec</title>

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
37
0

Year Published

2002
2002
2015
2015

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 74 publications
(37 citation statements)
references
References 0 publications
0
37
0
Order By: Relevance
“…Some algorithms attempt to reduce the number of searching positions in block matching, e.g., three-step search [9], new three-step search [10], four-step search [11], diamond search [12], [13], cross-diamond search [14], kite cross-diamond search [15], and others. Some others seek to reduce the number of pixels used in the matching distortion calculations, e.g., partial distortion search (PDS) [16], alternative sub-sampling search algorithm [17], normalized PDS [18], adjustable PDS [19], dynamic search window adjustment [20], and others. There are also some hybrid methods combining multiple techniques, e.g., motion vector field adaptive search technique (MVFAST) [21], predictive MVFAST [22], UMHS [4], [5], and EPZS [1], [6].…”
Section: ) Traditional Motion Estimation Algorithmsmentioning
confidence: 99%
“…Some algorithms attempt to reduce the number of searching positions in block matching, e.g., three-step search [9], new three-step search [10], four-step search [11], diamond search [12], [13], cross-diamond search [14], kite cross-diamond search [15], and others. Some others seek to reduce the number of pixels used in the matching distortion calculations, e.g., partial distortion search (PDS) [16], alternative sub-sampling search algorithm [17], normalized PDS [18], adjustable PDS [19], dynamic search window adjustment [20], and others. There are also some hybrid methods combining multiple techniques, e.g., motion vector field adaptive search technique (MVFAST) [21], predictive MVFAST [22], UMHS [4], [5], and EPZS [1], [6].…”
Section: ) Traditional Motion Estimation Algorithmsmentioning
confidence: 99%
“…1 In order to solve this problem, many fast algorithms have been developed, and partial difference elimination ͑PDE͒ algorithms [1][2][3][4] are good examples. PDE algorithms reduce computations by eliminating impossible candidates before the complete matching error calculation between matching and candidate blocks.…”
Section: Introductionmentioning
confidence: 99%
“…PDE algorithms reduce computations by eliminating impossible candidates before the complete matching error calculation between matching and candidate blocks. PDE algorithms have also been improved by selecting a low initial block matching error 1,2 or arranging the line/sub-block matching order in a candidate block. 3,4 In this letter, we propose a fast PDE algorithm for reducing additional computational costs based on the property of block matching error.…”
Section: Introductionmentioning
confidence: 99%
“…However, the computational complexity of FSA is always too high for real-time implementation. Therefore, many fast motion estimation algorithms to reduce the computation of the FSA have been proposed over the past few decades [1][2][3][4][5][6][7][8]. These fast motion estimation using BMAs can be classified into two groups.…”
Section: Introductionmentioning
confidence: 99%
“…One is the lossy motion estimation algorithm, and the other is the lossless one. The lossy motion estimation (e.g., NTSS [1], DS [2] and HEXBS [3]) has some degradation of predicted images compared with the conventional FSA, and the lossless motion estimation obtains no degradation of predicted images compared with the conventional FSA (e.g., SEA [4], PDE [5] and ASSA [6]). Recently, the improved versions [7][8][9] for lossy motion estimation using partial distortion elimination algorithm (PDE) have been proposed for more accurate prediction.…”
Section: Introductionmentioning
confidence: 99%