2008 Congress on Image and Signal Processing 2008
DOI: 10.1109/cisp.2008.659
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Directional Interpolation for Block Recovery Using Difference Values of Border Pixels

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2010
2010
2011
2011

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 19 publications
0
1
0
Order By: Relevance
“…Aign & Fazel (1995) proposed to interpolate lost pixel values from the boundary pixels of the four neighboring MBs. In addition, Kwok & Sun (1993), Zeng & Liu (1999), Zhang et al (2004), Kung et al (2006), Hyun et al (2008), Luo et al (2009) used different algorithms to detect the edges within the lost MBs and directionally interpolate the lost pixels along the edges. A more complex approach called coarse-to-fine block replenishment (CFBR) (Belfiore et al, 2002) performed the interpolation by first recovering the smooth large-scale patterns, then the large-scale structures, and finally the local edges in the lost MB.…”
Section: Related Workmentioning
confidence: 99%
“…Aign & Fazel (1995) proposed to interpolate lost pixel values from the boundary pixels of the four neighboring MBs. In addition, Kwok & Sun (1993), Zeng & Liu (1999), Zhang et al (2004), Kung et al (2006), Hyun et al (2008), Luo et al (2009) used different algorithms to detect the edges within the lost MBs and directionally interpolate the lost pixels along the edges. A more complex approach called coarse-to-fine block replenishment (CFBR) (Belfiore et al, 2002) performed the interpolation by first recovering the smooth large-scale patterns, then the large-scale structures, and finally the local edges in the lost MB.…”
Section: Related Workmentioning
confidence: 99%