Discrete orthogonal moments in image analysis
SPPR'07 Proceedings of the Fourth conference on IASTED International Conference: Signal Processing, Pattern Recognition, and Applications
Discrete orthogonal moments in image analysis
SPPRA '07 Proceedings of the Fourth IASTED International Conference on Signal Processing, Pattern Recognition, and Applications
Fast computation of tchebichef moments for binary and grayscale images
IEEE Transactions on Image Processing
A fast algorithm for computing moments of gray images based on NAM and extended shading approach
Frontiers of Computer Science in China
A fast zigzag-pruned 4×4 DTT algorithm for image compression
WSEAS Transactions on Signal Processing
The fast recursive computation of Tchebichef moment and its inverse transform based on Z-transform
Digital Signal Processing
| Hi-index | 0.00 |
Chebyshev moments were recently proposed to address problems of moments of continuous orthogonal basis. They are moments of a discrete basis and are orthogonal in the domain of the image coordinate space, a feature which presents a number of advantages over moments of continuous orthogonal basis. No effort has been devoted yet to the efficiency of their calculation. In this paper, we present a hardware architecture which enables real-time processing of binary and grayscale images of up to 4 Mpixels. This architecture is realized in a field-programmable gate array of typical clock frequency of 100 MHz