1990
DOI: 10.1016/0923-5965(90)90012-7
|View full text |Cite
|
Sign up to set email alerts
|

Time-recursive deinterlacing for IDTV and pyramid coding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

1994
1994
2006
2006

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 51 publications
(5 citation statements)
references
References 5 publications
0
5
0
Order By: Relevance
“…Two interesting algorithms for motion estimation and de-interlacing of Wang et al [3] and Vandendorpe et al [2] have been compared. The TGST was found to be superior (in terms of MSE i ) for sequences with uniform motion, whereas the recursive algorithm of Wang was found to be superior for sequences with non-uniform motion.…”
Section: Discussionmentioning
confidence: 99%
See 4 more Smart Citations
“…Two interesting algorithms for motion estimation and de-interlacing of Wang et al [3] and Vandendorpe et al [2] have been compared. The TGST was found to be superior (in terms of MSE i ) for sequences with uniform motion, whereas the recursive algorithm of Wang was found to be superior for sequences with non-uniform motion.…”
Section: Discussionmentioning
confidence: 99%
“…In [3], a time-recursive de-interlacing algorithm is proposed in which the interpolated pixels are determined by motion compensating the previously found de-interlaced output signal:…”
Section: The Tr De-interlacermentioning
confidence: 99%
See 3 more Smart Citations