Nath, R. (2017) Sparse hierarchical models of vision. PhD thesis, University of Reading
Preview |
Text
- Thesis
· Please see our End User Agreement before downloading. 8MB |
|
Text
- Thesis Deposit Form
· Restricted to Repository staff only · The Copyright of this document has not been checked yet. This may affect its availability. 1MB |
It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.
Abstract/Summary
In recent years, deep convolutional neural networks (CNNs), which are based on the hierarchical structure of the visual cortex has found remarkable accuracy rates in object classification. One of its drawbacks is the requirement of a large collection of labelled data for training. Therefore, unsupervised hierarchical networks are more suited for a more biologically plausible model. For a classification accuracy to be closer towards CNNs, the invariance and selectivity of the extracted features need to be improved. One of the standard methods for learning invariant features is to apply non-linearity functions to the data which has been implemented in both CNNs and HMAX models. Based on these principles, an extended form of the HMAX model is proposed which applies two different types of non-linear pooling operations. The extension is designed with the help of sparsity based algorithms such as Independent Subspace Analysis (ISA) and Topographic Independent Component Analysis(TICA). Aside from an improved classification accuracy compared to previous unsupervised hierarchical models, it also reduces the data dimensions within the layers.
| Item Type: | Thesis (PhD) |
|---|---|
| Thesis Supervisor: | Manjunathaiah, M. |
| Thesis/Report Department: | School of Mathematical, Physical and Computational Sciences |
| Identification Number/DOI: | |
| Divisions: | Science > School of Mathematical, Physical and Computational Sciences > Department of Computer Science |
| ID Code: | 80277 |
| Date on Title Page: | 2016 |
Downloads
Downloads per month over past year
University Staff: Request a correction | Centaur Editors: Update this record
Lists
Lists