Orthogonal polynomial embedded image kernel

Preprocessing operations of images and video frame sequences are beneficial in computer vision algorithms. For example, smoothing frames is used to eliminate noise; while computing frame gradient in x-direction and y-direction is used for frame feature extraction or for finding frame edges. Such operations involve convolving operators (image kernels) with an image precomputing moments will add extra computation cost to computer vision algorithm. In case of video, the computational time accumulatively increased because of the convolution operation for each frame is performed. To overcome this problem, a mathematical model is established for computing preprocessed frame moments via embedding the operator (image kernel) in the orthogonal polynomial (OP) functions. The experimental results show that the computation time for feature extraction using the proposed method is noticeably reduced in the both trends: image size and moment selection order. The average speed up ratio of the proposed method to traditional method is 3x, 5x, 8x, and 40x for moment selection ratio 100%, 25%, 10%, and 5%, respectively. In addition, the percentage reduction in processing time for small image size is ~ 99% and for large image size is ~ 40%.

[1]  Wujie Zhou,et al.  Local gradient patterns (LGP): An effective local-statistical-feature extraction scheme for no-reference image quality assessment , 2017, Inf. Sci..

[2]  P. Yap,et al.  Local watermarks based on Krawtchouk moments , 2004, 2004 IEEE Region 10 Conference TENCON 2004..

[4]  Syed Abdul Rahman Al-Haddad,et al.  Signal compression and enhancement using a new orthogonal-polynomial-based discrete transform , 2017, IET Signal Process..

[5]  Franz L. Alt,et al.  Digital Pattern Recognition by Moments , 1962, JACM.

[6]  Abd. Rahman Ramli,et al.  Image edge detection operators based on orthogonal polynomials , 2017 .

[7]  Rachid Benouini,et al.  Image classification using separable invariants moments based on Racah polynomials , 2018 .

[8]  M. Iqbal Saripan,et al.  A New Hybrid form of Krawtchouk and Tchebichef Polynomials: Design and Application , 2018, Journal of Mathematical Imaging and Vision.

[9]  Syed Abdul Rahman Al-Haddad,et al.  Low-Distortion MMSE Speech Enhancement Estimator Based on Laplacian Prior , 2017, IEEE Access.

[10]  P. Kanungo,et al.  A motion and illumination resilient framework for automatic shot boundary detection , 2017, Signal, Image and Video Processing.

[11]  M. N. S. Swamy,et al.  Tchebichef and Adaptive Steerable-Based Total Variation Model for Image Denoising , 2019, IEEE Transactions on Image Processing.

[12]  Sim Heng Ong,et al.  Image Analysis by Tchebichef Moments , 2001, IEEE Trans. Image Process..

[13]  Yanyang Zi,et al.  An adaptive sparse deconvolution method for distinguishing the overlapping echoes of ultrasonic guided waves for pipeline crack inspection , 2017 .

[14]  M. Iqbal Saripan,et al.  Methods and Challenges in Shot Boundary Detection: A Review , 2018, Entropy.

[15]  Khalid M. Hosny,et al.  Face Recognition Using Exact Gaussian-Hermit Moments , 2018, Recent Advances in Computer Vision.

[16]  Syed Abdul Rahman Al-Haddad,et al.  On Computational Aspects of Tchebichef Polynomials for Higher Polynomial Order , 2017, IEEE Access.

[17]  Qingjie Zhao,et al.  Blind image quality assessment by relative gradient statistics and adaboosting neural network , 2016, Signal Process. Image Commun..

[18]  Syed Abdul Rahman Al-Haddad,et al.  Fast Recursive Computation of Krawtchouk Polynomials , 2018, Journal of Mathematical Imaging and Vision.

[19]  M. Iqbal Saripan,et al.  Shot boundary detection based on orthogonal polynomial , 2019, Multimedia Tools and Applications.