Please use this identifier to cite or link to this item:
http://arks.princeton.edu/ark:/88435/dsp01ms35tc06r
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor | Verma, Naveen | - |
dc.contributor.advisor | Ramadge, Peter | - |
dc.contributor.author | Hancock, Brannan | - |
dc.date.accessioned | 2016-06-23T15:38:00Z | - |
dc.date.available | 2016-06-23T15:38:00Z | - |
dc.date.created | 2016-05-02 | - |
dc.date.issued | 2016-06-23 | - |
dc.identifier.uri | http://arks.princeton.edu/ark:/88435/dsp01ms35tc06r | - |
dc.description.abstract | This report documents the process of creating a Convolutional Neural Network from basis in Matlab. Convolution, Fully Connected, Average Pooling, Max Pooling, Rectifying, Softmax and Cross Entropy Layers were implemented as Object Classes. This allows construction of Convolutional Neural Networks with arbitrary topology comprised of such layers. Experiments verifying that the features learnt by the Convolutional Neural Networks are what allows them to improve upon Neural Network Classifiers were carried out and detailed. The redundancy in the output of the Convolutional Neural Network was examined, and revealed that reducing such a Networks output to as few as eight of its principle components still contains enough information to correctly classify handwritten digits with a precision of 92.09%. Finally the effect of choosing between Average and Max pooling was explored, revealing Max Pooling tends to lead to more precise classifiers. | en_US |
dc.format.extent | 152 pages | en_US |
dc.language.iso | en_US | en_US |
dc.title | An Investigation of Convolutional Neural Networks | en_US |
dc.type | Princeton University Senior Theses | - |
pu.date.classyear | 2016 | en_US |
pu.department | Electrical Engineering | en_US |
pu.pdf.coverpage | SeniorThesisCoverPage | - |
Appears in Collections: | Electrical Engineering, 1932-2020 |
Files in This Item:
File | Size | Format | |
---|---|---|---|
Brannan_Hancock_Thesis.pdf | 1.53 MB | Adobe PDF | Request a copy |
Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.