## Kernel Methods for Higher Order Image Statistics

published: Feb. 25, 2007, recorded: February 2005, views: 11208

# Slides

# Related content

# 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**to describe your request and upload the data.**

__ticket system__*Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.*

# Description

The conditions under which natural vision systems evolved show statistical regularities determined both by the environment and by the actions of the organism. Many aspects of biological vision can be understood as evolutionary adaptations to these regularities. This is demonstrated by the recent sucess in explaining properties of retinal and cortical neurons from the statistics of natural images. At the same time, we observe an increasing interest in statistical modeling techniques in the computer vision community. Here, the motivation comes from the need for powerful image models in image processing tasks such as super-resolution or denoising. In the literature, the statistical analysis of natural images has mainly been done with linear techniques such as Principal Component Analysis (PCA) or Fourier analysis. These techniques capture only the second-order statistics of an image ensemble. A large part of the interesting image structure, however, is contained in the higher-order statistics. Unfortunately, the estimation of these statistics involves a huge number of terms which makes their explicit computation for images infeasible in practice. Kernel methods provide an implicit access to higher-order statistics that avoids this combinatorial explosion. In the course, we start with an overview of existing approaches to image statistics. The need to go beyond the usual linear, second-order techniques will lead us to the classical higher-order statistics such as Wiener series, higher-order cumulants and spectra. We will see that the exponential number of terms involved in these statistics prevents them from being applied to images. This motivates the introduction of kernel techniques. Here, we will discuss two approaches: 1. The Wiener series can be estimated implicitly via polynomial kernel regression. We will use this technique to decompose an image into components that are characterized by pixel interactions of a given order. 2. Kernel PCA of image patches provides a powerful image model that takes higher-order statistics into account. We will show applications of this model to various image processing tasks.

# Link this page

Would you like to put a link to this lecture on your homepage?

Go ahead! Copy the HTML snippet !

## Reviews and comments:

sayuri, July 3, 2008 at 7:41 a.m.:thankyou!!

musab, January 29, 2013 at 11:56 a.m.:the video of lecture 2 is not working

jaya, August 6, 2014 at 11:30 a.m.:The video lecture 2 is not working.:-(

Arman, May 16, 2015 at 10:04 a.m.:The video lecture 2 is not working. Can I find this video elsewhere?

eddie007, December 28, 2018 at 10:04 a.m.:you have to forgot your password http://windowstuts.net/remember-passw... from this platfrom you know that the all situation from you get password re back from the windows.

higher9, January 24, 2020 at 12:03 p.m.:I completely understand why projecting your data into higher dimensionality, using http://www.skypotential.co.uk/ polynomial, or gaussian

## Write your own review or comment: