Fast computation of Jacobi-Fourier moments for invariant image recognition. Issue 5 (May 2015)

• Record Type: Journal Article
• Authors: Upneja, Rahul; Singh, Chandan
• Is Part Of: Pattern recognition. Volume 48:Issue 5(2015:May)
• Page Start: 1836
• Page End: 1843
• Publication Date: 2015-05
• Subjects: Pattern perception -- Periodicals; Perception des structures -- Périodiques; Patroonherkenning; 006.4
• DOI: 10.1016/j.patcog.2014.11.012
• Languages: English
• ISSNs: 0031-3203

Abstract

<abstract abstract-type="author" id="ab0005"> <title id="sect0005">Abstract</title> <sec> <p id="sp0050">The Jacobi-Fourier moments (JFMs) provide a wide class of orthogonal rotation invariant moments (ORIMs) which are useful for many image processing, pattern recognition and computer vision applications. They, however, suffer from high time complexity and numerical instability at high orders of moment. In this paper, a fast method based on the recursive computation of radial kernel function of JFMs is proposed which not only reduces time complexity but also improves their numerical stability.</p> </sec> </abstract>