Koziol, Scott M.Eustice, Dylan Scott, 1992-Baylor University.2014-06-022014-06-0220142014-06-02http://hdl.handle.net/2104/9015The Scale Invariant Feature Transform (SIFT) is a useful algorithm for describing local features in an image. This research successfully demonstrates a model for optimizing SIFT using a Field Programmable Analog Array (FPAA). A method is presented which theoretically can reduce SIFT run time by nearly 50% by greatly limiting the image area required to search for SIFT features. Block convolution is a simplified, non-overlapping method of convolution which is computed with the FPAA. The block convolution between the input image and a specially designed kernel is used to determine potential regions of interest. The performance of several different types of kernels will be compared, most of which were produced using an evolutionary search algorithm. A threshold is then applied to the filtered image produced by the FPAA and regions which are unlikely to produce matches are masked. By removing the necessity to search in areas of the image where a match is unlikely to be found, we see a more efficient implementation of SIFT that also demonstrates the usefulness of new FPAA technology.en-USBaylor University projects are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. Contact libraryquestions@baylor.edu for inquiries about permission.Evolutionary computingReconfigureable computingComputer visionThesisWorldwide access.Access changed 3/2/2017.