Image and Video Processing

Slides:



Advertisements
Similar presentations
Object Specific Compressed Sensing by minimizing a weighted L2-norm A. Mahalanobis.
Advertisements

AGC DSP AGC DSP Professor A G Constantinides©1 Modern Spectral Estimation Modern Spectral Estimation is based on a priori assumptions on the manner, the.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Newton’s Method Application to LMS Recursive Least Squares Exponentially-Weighted.
December 5, 2013Computer Vision Lecture 20: Hidden Markov Models/Depth 1 Stereo Vision Due to the limited resolution of images, increasing the baseline.
Tracking Features with Large Motion. Abstract Problem: When frame-to-frame motion is too large, KLT feature tracker does not work. Solution: Estimate.
A New Block Based Motion Estimation with True Region Motion Field Jozef Huska & Peter Kulla EUROCON 2007 The International Conference on “Computer as a.
Ljubomir Jovanov Aleksandra Piˇzurica Stefan Schulte Peter Schelkens Adrian Munteanu Etienne Kerre Wilfried Philips Combined Wavelet-Domain and Motion-Compensated.
CMPT-884 Jan 18, 2010 Error Concealment Presented by: Cameron Harvey CMPT 820 October
Mahmoud S. Hamid, Neal R. Harvey, and Stephen Marshall IEEE Transactions on Circuits and Systems for Video Technology, 2003 Genetic Algorithm Optimization.
1 © 2010 Cengage Learning Engineering. All Rights Reserved. 1 Introduction to Digital Image Processing with MATLAB ® Asia Edition McAndrew ‧ Wang ‧ Tseng.
Digital Image Processing
Optical Flow Methods 2007/8/9.
Probabilistic video stabilization using Kalman filtering and mosaicking.
MSU CSE 803 Stockman Linear Operations Using Masks Masks are patterns used to define the weights used in averaging the neighbors of a pixel to compute.
Image Analysis Preprocessing Arithmetic and Logic Operations Spatial Filters Image Quantization.
MSU CSE 803 Linear Operations Using Masks Masks are patterns used to define the weights used in averaging the neighbors of a pixel to compute some result.
Xinqiao LiuRate constrained conditional replenishment1 Rate-Constrained Conditional Replenishment with Adaptive Change Detection Xinqiao Liu December 8,
Chapter 5 Image Restoration. Preview Goal: improve an image in some predefined sense. Image enhancement: subjective process Image restoration: objective.
Adaptive Signal Processing
Image Denoising using Wavelet Thresholding Techniques Submitted by Yang
1 Chapter 8: Image Restoration 8.1 Introduction Image restoration concerns the removal or reduction of degradations that have occurred during the acquisition.
© by Yu Hen Hu 1 ECE533 Digital Image Processing Image Restoration.
Computer Vision - Restoration Hanyang University Jong-Il Park.
Motion-Compensated Noise Reduction of B &W Motion Picture Films EE392J Final Project ZHU Xiaoqing March, 2002.
Deconvolution, Deblurring and Restoration T , Biomedical Image Analysis Seminar Presentation Seppo Mattila & Mika Pollari.
High-Resolution Interactive Panoramas with MPEG-4 발표자 : 김영백 임베디드시스템연구실.
Chapter 21 R(x) Algorithm a) Anomaly Detection b) Matched Filter.
December 9, 2014Computer Vision Lecture 23: Motion Analysis 1 Now we will talk about… Motion Analysis.
Adv DSP Spring-2015 Lecture#9 Optimum Filters (Ch:7) Wiener Filters.
Digital Image Processing Lecture 10: Image Restoration March 28, 2005 Prof. Charlene Tsai.
Image Restoration.
23 November Md. Tanvir Al Amin (Presenter) Anupam Bhattacharjee Department of Computer Science and Engineering,
Digital Image Processing Lecture 10: Image Restoration
8-1 Chapter 8: Image Restoration Image enhancement: Overlook degradation processes, deal with images intuitively Image restoration: Known degradation processes;
Optical Flow. Distribution of apparent velocities of movement of brightness pattern in an image.
Segmentation of Vehicles in Traffic Video Tun-Yu Chiang Wilson Lau.
3.7 Adaptive filtering Joonas Vanninen Antonio Palomino Alarcos.
Course14 Dynamic Vision. Biological vision can cope with changing world Moving and changing objects Change illumination Change View-point.
Tracking with dynamics
Chapter 5 Image Restoration.
CSSE463: Image Recognition Day 29 This week This week Today: Surveillance and finding motion vectors Today: Surveillance and finding motion vectors Tomorrow:
6. Population Codes Presented by Rhee, Je-Keun © 2008, SNU Biointelligence Lab,
: Chapter 5: Image Filtering 1 Montri Karnjanadecha ac.th/~montri Image Processing.
Geology 6600/7600 Signal Analysis 26 Oct 2015 © A.R. Lowry 2015 Last time: Wiener Filtering Digital Wiener Filtering seeks to design a filter h for a linear.
Image Restoration. Image restoration vs. image enhancement Enhancement:  largely a subjective process  Priori knowledge about the degradation is not.
Lecture 22 Image Restoration. Image restoration Image restoration is the process of recovering the original scene from the observed scene which is degraded.
Matte-Based Restoration of Vintage Video 指導老師 : 張元翔 主講人員 : 鄭功運.
Lecture 10 Chapter 5: Image Restoration. Image restoration Image restoration is the process of recovering the original scene from the observed scene which.
Chapter 7. Classification and Prediction
12. Principles of Parameter Estimation
Digital Image Processing Lecture 10: Image Restoration
Degradation/Restoration Model
Conversion of Standard Broadcast Video Signals for HDTV Compatibility
Elementary Statistics
Dynamical Statistical Shape Priors for Level Set Based Tracking
Image Analysis Image Restoration.
Range Imaging Through Triangulation
Vehicle Segmentation and Tracking in the Presence of Occlusions
Modern Spectral Estimation
Digital Image Processing
CSSE463: Image Recognition Day 30
CSSE463: Image Recognition Day 29
Linear Operations Using Masks
CSSE463: Image Recognition Day 30
CSSE463: Image Recognition Day 29
CSSE463: Image Recognition Day 30
CSSE463: Image Recognition Day 29
12. Principles of Parameter Estimation
Fundamentals of Spatial Filtering
Presentation transcript:

Image and Video Processing

3.11 Video Enhancement and Restoration

1. Introduction Video enhancement and restoration has always been important, not only to improve the visual quality but also to increase the performance of subsequent tasks such as analysis and interpretation. applications one encounters in astronomy, forensic sciences, and medical imaging preserving motion pictures and videotapes recorded over the last century : reusing old film and video material

1. Introduction

2. Spatiotemporal Noise Filtering the ideal uncorrupted image sequence f(n, k). The recorded image sequence g(n, k) corrupted by noise w(n, k) is then given by (1) where n = (n1, n2) refers to the spatial coordinates and k to the frame number in the image sequence.

2. Spatiotemporal Noise Filtering 2.1 Linear Filters 2.2 Order-Statistic Filters 2.3 Multiresolution Filters

2.1 Linear Filters Temporally Averaging Filters Temporally Recursive Filters

2.1 Linear Filters Temporally Averaging Filters the restored image sequence is obtained by (2) Here h(l) are the temporal filter coefficients used to weight 2K+l consecutive frames.

2.1 Linear Filters Temporally Averaging Filters the filter coefficients can be optimized in a minimum mean-squared error fashion, yielding the well-known temporal Wiener filtering solution:

2.1 Linear Filters Temporally Averaging Filters The motion artifacts can greatly be reduced by operating the filter, along the picture elements (pixels) that lie on the same motion trajectory .

2.1 Linear Filters Temporally Averaging Filters Equation (2) then becomes a motion-compensated temporal filter. Here 𝑑 𝑛;𝑘,𝑙 = (𝑑 𝑥 𝑛 1 , 𝑛 2 ;𝑘,𝑙 , 𝑑 𝑦 ( 𝑛 1 , 𝑛 2 ;𝑘,𝑙)) is the motion vector for spatial coordinate ( 𝑛 1 , 𝑛 2 )estimated between the frames k andl .

2.1 Linear Filters Temporally Averaging Filters Filter (2) can be extended with a spatial filtering part. The most straightforward extension of Eq. (2) is the following 3-D weighted averaging filter: Here S is the spatiotemporal support or window of the 3-D filter (see Fig. 3).

2.1 Linear Filters Temporally Averaging Filters Here S is the spatiotemporal support or window of the 3-D filter (see Fig. 3).

2.1 Linear Filters Temporally Averaging Filters Disadvantages with the 3-D Wiener filter: The requirement that the 3-D autocorrelation function for the original image sequence is known a priori. The 3-D wide-sense stationarity assumptions, which are virtually never true because of moving objects and scene changes.

2.1 Linear Filters Temporally Averaging Filters Simpler ways of choosing the 3-D filter coefficients are usually preferred, one such choice for adaptive filter coefficients is the following:

2.1 Linear Filters Temporally Recursive Filters The general form of a recursive temporal filter is as follows: (2) Here 𝑓 𝑏 n,k is the prediction of the original kth frame on the basis of previously filtered frames, and α n,k is the filter gain for updating this prediction with the observed kth frame.

2.1 Linear Filters Temporally Recursive Filters A popular choice for the prediction 𝑓 𝑏 n,k is the previously restored frame, either in direct form or in motion-compensated form:

2.1 Linear Filters Temporally Recursive Filters A switching filter is obtained if the gain takes on the values a and 1, depending on the difference between the prediction 𝑓 𝑏 n,k and the actually observed signal value g(n, k):

2.1 Linear Filters Temporally Recursive Filters A finer adaptation is obtained if the prediction gain is optimized to minimize the mean-squared restoration error , yielding Here is an estimate of the image sequence variance in a local spatiotemporal neighborhood of (n, k).

2.2 Order-Statistic Filters Order-statistic (OS) filters are nonlinear variants of weighted averaging filters. The distinction is that in OS filters the observed noisy data, usually taken from a small spatiotemporal window, are ordered before being used.

2.2 Order-Statistic Filters The general structure of an OS restoration filter is as follows: 𝑔 𝑟 (𝑛,𝑘) : the ordered intensities, or ranks, of the corrupted image sequence; |S| : the number of intensities in this window. The objective is to choose appropriate filter coefficients ℎ 𝑟 (𝑛,𝑘) for the ranks.

2.2 Order-Statistic Filters The most simple order-statistic filter is a straightforward temporal median, for instance taken over three frames: the multistage median filter (MMF):

2.2 Order-Statistic Filters an example of the spatiotemporal supports of the multistage median filter

2.2 Order-Statistic Filters If the coefficients are optimized in the mean-squared error sense, the following general solution for the restored image sequence is obtained :

2.2 Order-Statistic Filters The overall filter structure thus obtained is shown in Fig. 5.

3. Blotch Detection and Removal

3. Blotch Detection and Removal A model for blotch is the following: The overall blotch detection and removal scheme :

3.1 Blotch Detection three characteristic properties: blotches are temporally independent and therefore hardly ever occur at the same spatial location in successive frames. the intensity of a blotch is significantly different from its neighboring uncorrupted intensities. blotches form coherent regions in a frame, as opposed to, for instance, spatiotemporal shot noise.

3.1 Blotch Detection pixel-based blotch detector : the spike-detector index (SDI) A blotch pixel is detected if SDI(n,k) exceeds a threshold:

3.1 Blotch Detection order-statistic-based detector : the rank order difference (ROD) detector A blotch pixel is detected if any of the rank order differences exceeds a specific threshold Ti:

3.1 Blotch Detection

3.1 Blotch Detection

3.1 Blotch Detection postprocessing the blotch mask in two ways: removing small blotches completing partially detected blotches: hysteresis thresholding

3.1 Blotch Detection

3.2 Motion Vector Repair and Interpolating Corrupted Intensities Two strategies in recovering motion vectors: take an average of surrounding motion vectors validate the corrected motion vectors using intensity information directly neighboring the blotched area

3.2 Motion Vector Repair and Interpolating Corrupted Intensities In a multistage median interpolation filter, five interpolated results are computed by using the (motion-compensated) spatiotemporal neighborhoods.

3.2 Motion Vector Repair and Interpolating Corrupted Intensities Each of the five interpolated results is computed as the median over the corresponding neighborhood Si: The final result is computed as the median over the five intermediate results:

3.2 Motion Vector Repair and Interpolating Corrupted Intensities

3.2 Motion Vector Repair and Interpolating Corrupted Intensities Result of the blotch-corrected frame:

4. Intensity Flicker Correction Intensity flicker is defined as unnatural temporal fluctuations of frame intensities that do not originate from the original scene.

4. Intensity Flicker Correction A model describing the intensity flicker: Here , and are the multiplicative and additive unknown flicker parameters, is an independent noise term.

4.1 Flicker Parameter Estimation If the flicker parameters were known, then one could form an estimate of the original intensity from a corrupted intensity by using the following straightforward linear estimator:

In order to obtain estimates for the coefficients , the mean-squared error between and is minimized, yielding the following optimal solution:

4.1 Flicker Parameter Estimation If the observed image sequence does not contain any noise, then:

4.1 Flicker Parameter Estimation In practice, the true values for the intensity-flicker parameters α(n, k) and β(n, k) are unknown and have to be estimated from the corrupted image sequence itself. Since the flicker parameters are spatially smooth functions, we assume that they are locally constant: where Sm indicates a small frame region.

4.1 Flicker Parameter Estimation By computing the averages and variances of both sides of one can obtain:

4.2 Estimation on Sequences with Motion We assume that the image sequence intensities do not change significantly over time previously. Clearly, this is an incorrect assumption if motion occurs. Because of the intensity flicker this assumption is violated heavily. The only motion that can be estimated with sufficient reliability is global motion such as camera panning or zooming.

4.2 Estimation on Sequences with Motion There are various approaches for detecting local motion the detection of large differences between the current and previously (corrected) frame compare the estimated intensity-flicker parameters to threshold values

4.2 Estimation on Sequences with Motion For frame regions S, where the flicker parameters could not be estimated reliably from the observed image sequence, the parameters are estimated on the basis of the results in spatially neighboring regions. For the regions in which the flicker parameters could be estimated, a smoothing post processing step has to be applied to avoid sudden parameter changes that lead to visible artifacts in the corrected image sequence.

4.2 Estimation on Sequences with Motion

Conclude This chapter has described methods for enhancing and restoring corrupted video and film sequences. Although the focus has been on noise removal, blotch detection and correction, and flicker removal, the approaches and tools described in this chapter are of a more general nature, and they can be used for developing enhancement and restoration methods for other types of degradation.