Show simple item record

dc.contributor.authorLi, Shiying
dc.date.accessioned2020-12-10T19:28:28Z
dc.date.available2020-12-10T19:28:28Z
dc.date.issued2020-12-09
dc.identifier.citationLi, Shiying. Accelerating Computation of Zernike and Pseudo-Zernike Moments with a GPU Algorithm; A thesis submitted to the Faculty of Graduate Studies in partial fulfillment of the requirements for the Master of Science degree, Department of Applied Computer Science, The University of Winnipeg. Winnipeg, Manitoba, Canada: The University of Winnipeg, December 2020. DOI: 10.36939/ir.202012101337.en_US
dc.identifier.urihttps://hdl.handle.net/10680/1869
dc.description.abstractAlthough Zernike and pseudo-Zernike moments have some advanced properties, the computation process is generally very time-consuming, which has limited their practical applications. To improve the computational efficiency of Zernike and pseudo-Zernike moments, in this research, we have explored the use of GPU to accelerate moments computation, and proposed a GPUaccelerated algorithm. The newly developed algorithm is implemented in Python and CUDA C++ with optimizations based on symmetric properties and k × k sub-region scheme. The experimental results are encouraging and have shown that our GPU-accelerated algorithm is able to compute Zernike moments up to order 700 for an image sized at 512 × 512 in 1.7 seconds and compute pseudo-Zernike moments in 3.1 seconds. We have also verified the accuracy of our GPU algorithm by performing image reconstructions from the higher orders of Zernike and pseudo-Zernike moments. For an image sized at 512 × 512, with the maximum order of 700 and k = 11, the PSNR (Peak Signal to Noise Ratio) values of its reconstructed versions from Zernike and pseudo-Zernike moments are 44.52 and 46.29 separately. We have performed image reconstructions from partial sets of Zernike and pseudo-Zernike moments with various order n and different repetition m. Experimental results of both Zernike and pseudo-Zernike moments show that the images reconstructed from the moments of lower and higher orders preserve the principle contents and details of the original image respectively, while moments of positive and negative m result in identical images. Lastly, we have proposed a set of feature vectors based on pseudo-Zernike moments for Chinese character recognition. Three different feature vectors are composed of different parts of four selected lower pseudo-Zernike moments. Experiments on a set of 6,762 Chinese characters show that this method performs well to recognize similar-shaped Chinese characters.en_US
dc.description.sponsorshipen_US
dc.language.isoenen_US
dc.publisherUniversity of Winnipegen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectZernike momentsen_US
dc.subjectPseudo-Zernike momentsen_US
dc.subjectGraphic processing units (GPUs)en_US
dc.titleAccelerating Computation of Zernike and Pseudo-Zernike Moments with a GPU Algorithmen_US
dc.typeThesisen_US
dc.description.degreeMaster of Science in Applied Computer Scienceen_US
dc.publisher.grantorUniversity of Winnipegen_US
dc.identifier.doi10.36939/ir.202012101337
thesis.degree.disciplineApplied Computer Science
thesis.degree.levelmasters
thesis.degree.nameMaster of Science in Applied Computer Science
thesis.degree.grantorUniversity of Winnipeg


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record