Location: EU Supported » PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning » Subspace, Latent Structure and Feature Selection techniques: Statistical and Optimisation perspectives workshop 2005 - Bohinj

A simple feature extraction for high dimensional image representations

author:Amit Gruber, The Hebrew University of Jerusalem
published: Feb. 25, 2007,   recorded: February 2005,   views: 181
Categories
You might be experiencing some problems with Your Video player.

See Also:

Launch Windows Media PlayerLaunch in a standalone WM Player

WMedia PlayerSwitch to Windows Media Player

Help icon Streaming Video Help

WebLink icon Windows Media Player Firefox Plugin - Download

Related content

Visitors who watched this lecture also watched...
04:59:19
Machine Learning, Probability and Graphical Models
18387 views - Sam Roweis, 2006
28:39
Image Analysis
1255 views - Christos Faloutsos, 2006
02:27:37
Feature extraction & content description I
984 views - Nicu Sebe, 2006
03:54:31
Support Vector Machines
12722 views - Chih-Jen Lin, 2006
01:00:47
Gaussian Process Basics
12584 views - David MacKay, 2006
59:10
Hidden Topic Markov Models
257 views - Amit Gruber, 2007
01:01:24
Semisupervised Learning Approaches
5998 views - Tom Mitchell, 2006
57:16
Introduction to feature selection
2764 views - Isabelle Guyon, 2007
25:34
What is the Optimal Number of Features? A learning theoretic perspective
157 views - Amir Navot, 2005
04:16:53
Learning with Kernels
3763 views - Bernhard Schölkopf, 2003

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.
Lecture popularity: You need to login to cast your vote.

Description

We investigate a method to find local clusters in low dimensional subspaces of high dimensional data, e.g. in high dimensional image descriptions. Using cluster centers instead of the full set of data will speed up the performance of learning algorithms for object recognition, and will possibly also improve performance because overfitting might be avoided.

Link this page  

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: