نتایج جستجو برای: pseudo zernike moments

تعداد نتایج: 85252  

Journal: :International Journal of Pattern Recognition and Artificial Intelligence 2003

2014
Min HUANG Qiuping GONG

Zernike moments are complex moments with the orthogonal Zernike polynomials as kernel function, compared with other moments; Zernike moments have greater advantages in image rotation and low noise sensitivity. Because of the Zernike moments have image rotation invariance, and can construct arbitrary high order moments, it can be used for target recognition. In this paper, the Zernike moment alg...

2001
R. MUKUNDAN

Zernike moments are widely used in several pattern recognition applications, as invariant descriptors of the image shape. Zernike moments have proved to be superior than other moment functions in terms of their feature representation capabilities. The major drawback with Zernike moments is the computational complexity. This paper presents a fast algorithm for the computation of Zernike moments ...

The goal of multi-frame Super Resolution (SR) is to fuse multiple Low Resolution (LR) images to produce one High Resolution (HR) image. The major challenge of classic SR approaches is accurate motion estimation between the frames. To handle this challenge, fuzzy motion estimation method has been proposed that replaces value of each pixel using the weighted averaging all its neighboring pixels i...

Journal: :Pattern Recognition 2006
Sun-Kyoo Hwang Whoi-Yul Kim

This paper presents a novel approach to the fast computation of Zernike moments from a digital image. Most existing fast methods for computing Zernike moments have focused on the reduction of the computational complexity of the Zernike 1-D radial polynomials by introducing their recurrence relations. Instead, in our proposed method, we focus on the reduction of the complexity of the computation...

Journal: :IEEE transactions on image processing : a publication of the IEEE Signal Processing Society 2003
Pew-Thian Yap Raveendran Paramesran Seng-Huat Ong

In this paper, a new set of orthogonal moments based on the discrete classical Krawtchouk polynomials is introduced. The Krawtchouk polynomials are scaled to ensure numerical stability, thus creating a set of weighted Krawtchouk polynomials. The set of proposed Krawtchouk moments is then derived from the weighted Krawtchouk polynomials. The orthogonality of the proposed moments ensures minimal ...

2002
Yunlong Sheng Lixin Shen

Received July 7, 1993; revised manuscript received November 22, 1993; accepted December 14, 1993 We propose orthogonal Fourier-Mellin moments, which are more suitable than Zernike moments, for scaleand rotation-invariant pattern recognition. The new orthogonal radial polynomials have more zeros than do the Zernike radial polynomials in the region of small radial distance. The orthogonal Fourier...

2010
C.Lakshmi Deepika A Kandaswamy C. Vimal B. Sathish

To represent the large amount of data in the biometric images an efficient feature extraction method is needed. Further biometric image acquisition is subject to deforming processes such as rotation, translation and scaling. Hence it is also required that the image representation be invariant to the deformations and sustain the discriminating features. Considering the trade off between the disc...

2011
Saptadi Nugroho Darmawan Utomo

The Zernike moment algorithm and R-Tree algorithm are known as state of the art in the recognition of images and in the multimedia database respectively. The methods of storing the images and retrieving the similar images based on a query image automatically are the problems in the image database. This paper proposes the method to combine the Zernike moments algorithm and the R–tree algorithm i...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید