Deducing Local Influence Neighbourhoods With Application to Edge-Preserving Image Denoising
Description
Traditional image models enforce global smoothness, and more recently Markovian Field priors. Unfortunately global models are inadequate to represent the spatially varying nature of most images, which are much better modeled as piecewise smooth. This paper advocates the concept of local influence neighbourhoods (LINs). The influence neighbourhood of a pixel is defined as the set of neighbouring pixels which have a causal influence on it. LINs can therefore be used as a part of the prior model for Bayesian denoising, deblurring and restoration. Using LINs in prior models can be superior to pixel-based statistical models since they provide higher order information about the local image statistics. LINs are also useful as a tool for higher level tasks like image segmentation. We propose a fast graph cut based algorithm for obtaining optimal influence neighbourhoods, and show how to use them for local filtering operations. Then we present a new expectation-maximization algorithm to perform locally optimal Bayesian denoising. Our results compare favourably with existing denoising methods.
| Slides | |
| 0:00 | Deducing Local Influence Neighbourhoods in Images Using Graph Cuts |
| 0:20 | San Francisco, CA |
| 0:30 | Overview |
| 1:57 | Local neighbourhoods as intermediate image structures |
| 3:47 | Outline |
| 4:26 | Local Influence Neighbourhoods |
| 6:21 | Example: Binary image denoising |
| 6:42 | Problem Constraints |
| 7:47 | Example of box vs. smoothness (1) |
| 8:33 | Example of box vs. smoothness (2) |
| 8:37 | A Better neighbourhood criterion |
| 10:00 | A) Closeness criterion in action |
| 10:29 | B) Contiguity and smoothness |
| 12:52 | Markov Random Field Priors |
| 13:29 | Bottomline |
| 14:03 | Graph Cut based Energy Minimization |
| 14:07 | How to minimize E? |
| 14:55 | Minimum cut problem |
| 16:02 | Graph construction |
| 17:25 | Table1: Edge costs of induced graph |
| 17:43 | Graph Algorithm |
| 18:09 | Table1: Edge costs of induced graph |
| 18:13 | Graph construction |
| 18:31 | Graph Algorithm |
| 18:45 | Examples of Detected LINs |
| 19:00 | Results: Most Popular LINs |
| 19:18 | Filtering with LINs |
| 20:07 | Maximum filter using LINs |
| 20:49 | Median filter using LINs |
| 21:13 | EM-style Denoising algorithm |
| 22:41 | Bayesian (Maximum a Posteriori) Estimate |
| 22:53 | EM-style image denoising |
| 24:17 | Results: LIN-based Image Denoising |
| 24:45 | Results: Bike image |
| 25:19 | Table1: Denoising Results |
| 25:36 | Other Applications of LINs |
| 26:38 | Hierarchical segmentation |
| 27:01 | How to measure Fractal Dimension using LINs? |
| 27:20 | FD using LINs |
| 29:02 | Possible advantages of LIN over current techniques |
| 29:34 | Possible Discriminators of Neurodegeneration |
| 30:36 | Summary |
| 31:02 | Contact |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
SEE ALSO:
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !






I am certain that anyone in this field would appreciate your work. Nice job with the slides and the informative talk. Overall, very nice Presentation!