Volodymyr Fedak - PowerPoint PPT Presentation

1 / 13
About This Presentation
Title:

Volodymyr Fedak

Description:

ringing. blurring. flickering. What is the problem? F - 2. F - 1. F. F ... Wavelet-based de-blocking and de-ringing algorithm proposed by Alan and Liew. Steps: ... – PowerPoint PPT presentation

Number of Views:17
Avg rating:3.0/5.0
Slides: 14
Provided by: Fed59
Category:

less

Transcript and Presenter's Notes

Title: Volodymyr Fedak


1
Artifacts suppression in images and video
  • Volodymyr Fedak

2
Introduction
  • What is the problem?
  • Why is it important?
  • What did I do?
  • What are the results?
  • So what next?

3
What is the problem?
  • blocking
  • ringing
  • blurring
  • flickering

4
What is the problem?
F - 2
F - 1
F
F 1
F 2
Intra-frame processing
Inter-frame processing
5
Why is it important ?
Postprocessing techniques
  • motion-compensated algorithms iterative
    approaches based on the theory of projections
    onto convex set
  • spatial-temporal algorithmsalgorithms that
    transform signal to frequency domain

6
What did I do ?
  • Analyse modern postprocessing techniques
  • Implement most encouraging methods
  • Compare results of mentioned algorithms
  • Propose approaches for optimization

7
Wavelet-based de-blocking and de-ringing
algorithm proposed by Alan and Liew
  • Steps
  • Detection of Block Discontinuities
  • Threshold Maps Generation at Different Wavelet
    Scales
  • low frequency filtering

8
Non-Local Means
NLM is an improvement of Bilateral filtering
C(y, x) - geometric relationship S(I(y), I(x)) -
luminance ratio I(y) pixel luminance

9
Non-Local Means
N(x) - window surrounding pixel x Q(x) is a
search window around pixel x
10
Non-Local Means Parameters
  • h - determines the amount of averaging (h
    increases amount of blocking artifacts decrease).
  • N (x) the match window/patch when N(x)
    increases, blocking artifacts of the processed
    sequence decreases very slowly
  • Q(x) the search window/patch when Q(x)
    increases, artifacts of the processed sequence
    decreases very slowly for an increasing value of
    the search window size, and we have a large
    amount of computation time.


11
(No Transcript)
12
Possible ways for optimization
  • Extended NLM to the temporal domain . Use
    together with motion-compensation algorithm but
    apply some quality coefficient to the motion
    vector.
  • Add smart patch/search window size choosing
    algorithm.
  • Use Hierarchical block matching algorithm to find
    similar windows for speeding-up NLM


13
Any questions ?
Write a Comment
User Comments (0)
About PowerShow.com