Online fortune-telling system using angle difference
In this project, the biggest concern is that the time-efficiency of the matching algorithm suffers considerably when handling large data sets. We have proposed various indexing algorithms to help reduce the computational cost incurred. From the experiment results, discrete Fourier transform turne...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project (FYP) |
| Language: | English |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/39760 |
| _version_ | 1824453902890696704 |
|---|---|
| author | Tan, Zhong Ming. |
| author2 | Li Fang |
| author_facet | Li Fang Tan, Zhong Ming. |
| author_sort | Tan, Zhong Ming. |
| collection | NTU |
| description | In this project, the biggest concern is that the time-efficiency of the matching algorithm suffers considerably when handling large data sets. We have proposed various indexing algorithms to help reduce the computational cost incurred.
From the experiment results, discrete Fourier transform turned out to incur the most computational cost, therefore we used DFT as a standard in our comparisons. Out of the various indexing algorithms, FFTW[13] (a free library provided on the internet, widely used by the community) provided an approximately 577% reduction in computational cost as compared to the discrete Fourier transform that was previously employed. Following next, fast Fourier transform provided the 2nd highest amount of computational cost reduction of approximately 568% as compared to the discrete Fourier transform. This reduction in computational cost came without any reduction in the uniqueness of the output data.
Recommendations were provided, as both FFTW and FFT are the choices that users can select from. Depending on the nature of the application, both have pros and cons but at the same time maintaining similar computational cost reduction capability. The objectives of the project were well achieved.
Keywords: palm print, biometric identification, indexing algorithms, time-efficiency, fast Fourier transform, DFT(discrete Fourier transform), FFTW[13], computational cost. |
| first_indexed | 2025-02-19T03:13:48Z |
| format | Final Year Project (FYP) |
| id | ntu-10356/39760 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2025-02-19T03:13:48Z |
| publishDate | 2010 |
| record_format | dspace |
| spelling | ntu-10356/397602023-03-03T20:30:44Z Online fortune-telling system using angle difference Tan, Zhong Ming. Li Fang School of Computer Engineering Centre for Intelligent Machines DRNTU::Engineering::Computer science and engineering::Computing methodologies::Pattern recognition In this project, the biggest concern is that the time-efficiency of the matching algorithm suffers considerably when handling large data sets. We have proposed various indexing algorithms to help reduce the computational cost incurred. From the experiment results, discrete Fourier transform turned out to incur the most computational cost, therefore we used DFT as a standard in our comparisons. Out of the various indexing algorithms, FFTW[13] (a free library provided on the internet, widely used by the community) provided an approximately 577% reduction in computational cost as compared to the discrete Fourier transform that was previously employed. Following next, fast Fourier transform provided the 2nd highest amount of computational cost reduction of approximately 568% as compared to the discrete Fourier transform. This reduction in computational cost came without any reduction in the uniqueness of the output data. Recommendations were provided, as both FFTW and FFT are the choices that users can select from. Depending on the nature of the application, both have pros and cons but at the same time maintaining similar computational cost reduction capability. The objectives of the project were well achieved. Keywords: palm print, biometric identification, indexing algorithms, time-efficiency, fast Fourier transform, DFT(discrete Fourier transform), FFTW[13], computational cost. Bachelor of Engineering (Computer Engineering) 2010-06-04T01:07:54Z 2010-06-04T01:07:54Z 2010 2010 Final Year Project (FYP) http://hdl.handle.net/10356/39760 en Nanyang Technological University 64 p. application/pdf |
| spellingShingle | DRNTU::Engineering::Computer science and engineering::Computing methodologies::Pattern recognition Tan, Zhong Ming. Online fortune-telling system using angle difference |
| title | Online fortune-telling system using angle difference |
| title_full | Online fortune-telling system using angle difference |
| title_fullStr | Online fortune-telling system using angle difference |
| title_full_unstemmed | Online fortune-telling system using angle difference |
| title_short | Online fortune-telling system using angle difference |
| title_sort | online fortune telling system using angle difference |
| topic | DRNTU::Engineering::Computer science and engineering::Computing methodologies::Pattern recognition |
| url | http://hdl.handle.net/10356/39760 |
| work_keys_str_mv | AT tanzhongming onlinefortunetellingsystemusingangledifference |