MeganckSajdakWu: Difference between revisions

From Psych 221 Image Systems Engineering
Jump to navigation Jump to search
imported>Projects221
imported>Projects221
Line 21: Line 21:


The particular flavor of SVM chosen for this investigation is C-support vector classification (C-SVC) and the kernel trick was employed using a radial basis function (RBF) kernel to allow for interpretation of higher-dimensional features aside from the individual cone absorptions.  This method required the tuning of two parameters:
The particular flavor of SVM chosen for this investigation is C-support vector classification (C-SVC) and the kernel trick was employed using a radial basis function (RBF) kernel to allow for interpretation of higher-dimensional features aside from the individual cone absorptions.  This method required the tuning of two parameters:
  * C-SVC cost parameter.  This controls the number of misclassified examples allowed when processing the training data to maximize the margin.  This allows the system to ignore outliers if they exist.
* C-SVC cost parameter.  This controls the number of misclassified examples allowed when processing the training data to maximize the margin.  This allows the system to ignore outliers if they exist.
  * RBF <math>\gamma</math> parameter.  This controls the scale of the kernel function.
* RBF <math>\gamma</math> parameter.  This controls the scale of the kernel function.


Parameter tuning graphs.
Parameter tuning graphs.

Revision as of 06:32, 9 March 2014

Predicting Human Performance Using ISETBIO. Ryan Meganck, Adam Sajdak, Stephen Wu.

Introduction

Modern displays have benefited heavily from the technological advances surrounding the manufacture and design of transistors. Display designers have been able to package an increasing amount of transistors in a given display to yield stunning images while also improving the energy efficiency of the displays. In a vacuum, the goal of these display designers would be to strive for an infinite number of pixels in a display, but in all pipelines, there is a bottleneck for performance. In this case, the pipeline consists not only of display, but the observer watching the display. The observer is limited by non-idealities in the eye as well as the image processing portion of the brain.

At very low display resolutions, it is expected that a human observer would be able to notice an increase resolution or pixel count. Conversely at high resolutions, there is a point where the resolution of the display is no longer the limiting factor and the human observer can no longer resolve higher resolutions.

The purpose of this project is to determine the critical point for display performance in the visual pipeline. In other words, to find the critical resolution at various viewing distances where the observer is no longer able to discern a discern two different images.

Methods

Data

Test scenes were generated in MATLAB using [].

The feature vector for our experiment is constructed by reshaping the cone-absorption matrix to a single vector in row(column?)-major order form.

1-Nearest Neighbor

Support Vector Machine

One approach uses a support vector machine to classify test images. Given a training dataset, this is achieved by calculating the separating hyperplane which yields the largest functional margin between the two classes. Test inputs are then classified based on which side of the hyperplane they fall on.

The particular flavor of SVM chosen for this investigation is C-support vector classification (C-SVC) and the kernel trick was employed using a radial basis function (RBF) kernel to allow for interpretation of higher-dimensional features aside from the individual cone absorptions. This method required the tuning of two parameters:

  • C-SVC cost parameter. This controls the number of misclassified examples allowed when processing the training data to maximize the margin. This allows the system to ignore outliers if they exist.
  • RBF γ parameter. This controls the scale of the kernel function.

Parameter tuning graphs.

Results

1-Nearest Neighbor

Support Vector Machine

Conclusions

References

Paper paper paper

Appendix I

Source code Result images

Appendix II: Work Breakdown