ABSTRACT:

Inspired by fast Jacket transforms, we propose simple factorization and construction algorithms for the M-dimensional discrete Fourier transform (DFT) matrices underlying generalized Chinese remainder theorem (CRT) index mappings. Based on successive coprime-order DFT matrices with respect to the CRT with recursive relations, the proposed algorithms are presented with simplicity and clarity on the basis of the yielded sparse matrices. The results indicate that our algorithms compare favorably with the direct-computation approach.


Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here


PROJECT TITLE : Deep Guided Learning for Fast Multi-Exposure Image Fusion ABSTRACT: MEF-Net is a rapid multi-exposure image fusion (MEF) approach for static image sequences of adjustable spatial resolution and exposure number
PROJECT TITLE : Fast Adaptive Bilateral Filtering ABSTRACT: For edge-preserving smoothing, a fixed Gaussian range kernel and a spatial kernel are employed in the bilateral filter. It is possible to generalise this filter by allowing
PROJECT TITLE : Fast High-Dimensional Bilateral and Nonlocal Means Filtering ABSTRACT: Currently available rapid methods for bilateral and nonlocal means filtering are limited to grayscale images. High-dimensional data, such as
PROJECT TITLE : On-Device Scalable Image-Based Localization via Prioritized Cascade Search and Fast One-Many RANSAC ABSTRACT: We describe a complete on-device solution for large-scale image-based urban localisation. Compact image
PROJECT TITLE : Fast Fault Diagnosis Method for Hall Sensors in Brushless DC Motor Drives ABSTRACT: Because of their simplicity and low cost, brushless direct current motors with Hall sensors are frequently employed in a wide

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry