Some Computational Aspects of Discrete Orthonormal Moments
نویسندگان
چکیده
منابع مشابه
Improving Image Reconstruction Accuracy Using Discrete Orthonormal Moments
− Several pattern recognition applications use orthogonal moments to capture independent shape characteristics of an image, with minimum amount of information redundancy in a feature set. Legendre, Zernike, and Pseudo-Zernike moments are examples of such orthogonal feature descriptors. An image can also be reconstructed from a sufficiently large number of orthogonal moments. Discrete orthogonal...
متن کاملA Comparative Study on Discrete Orthonormal Chebyshev Moments and Legendre Moments for Representation of Printed Characters
Moment functions are widely used in image analysis as feature descriptors. Compared to geometric moments, orthogonal moments have become more popular in image analysis for their better representation capabilities. In comparison to continuous orthogonal moments discrete orthogonal moments provide a more accurate description of the image features. This paper compares the performance of discrete o...
متن کاملSome Computational Aspects
The only thing that is certain and absolute about Nature is its patchiness. Patchiness is ubiquitous, occurring across systems, organizational levels, and spatio-temporal scales. Traditional modeling approaches in ecology often fail to recognize spatial patchiness because they usually assume spatial homogeneity. A landscape may be viewed as a hierarchical mosaic system of patches that are diffe...
متن کاملComputational Aspects of Discrete Minimal Surfaces
In differential geometry the study of smooth submanifolds with distinguished curvature properties has a long history and belongs to the central themes of this Þeld. Modern work on smooth submanifolds, and on surfaces in particular, relies heavily on geometric and analytic machinery which has evolved over hundreds of years. However, non-smooth surfaces are also natural mathematical objects, even...
متن کاملSome Computational Aspects of Helly-type Theorems
In this paper, we prove that, for a given positive number d, if every n + 1 of a collection of compact convex sets in IE contain a set of width d (a set of constant width d, respectively) simultaneously, then all members of this collection contain a set of constant width d1 simultaneously, where d1 = d/ √ n if n is odd and d1 = d √ n+ 2/ (n+ 1) if n is even (d1 = 2d− d √ 2n/(n+ 1), respectively...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Image Processing
سال: 2004
ISSN: 1057-7149
DOI: 10.1109/tip.2004.828430