CS 766 Assignment 3: Locality-constrained Linear Coding for Scene Classification

Saikat R. Gomes (saikat@cs.wisc.edu) & Stephen Lazzaro (slazzaro@cs.wisc.edu)

Contents

  1. Introduction
  2. Hard Code Word
    1. Results
  3. Locality-constrained Linear
    1. Results
  4. Grid Search
  5. Sequential Hierarchy Classifier
    1. Manually assigned clusters
      1. Results
    2. Clusters from K-means
      1. Results
  6. Other Dataset Evaluation
    1. Birds
    2. Butterflies
  7. Other Experiments
    1. Results
  8. Scene Datasets
  9. Code
  10. Git Logs
  11. References

Sequential Hierarchy Classifier

We tried to implement a simple multi-level classifier and evaluate its performance.
The dataset is first assigned in two classes then sequential classification is done.

The motivation for this approach is that certain scenes are inherently very different from others;
hence if we can initally separate them in diffrent bags and drill down to the fewer possible classes may be we can reduce our errors.

Two approaches were employed for the level come classification:
  1. Manually assigning clusters
  2. Using K-means to find 2 categories