Efficient Computation of 3-D Moments in Terms of an Object's Partition

Authors:
Juan Humberto Sossa Azuela;Francisco Cuevas de la Rosa;Héctor Benitez
Affiliations:
-;-;-
Venue:
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Year:
2002

Citing 5
Cited 0

3-D Moment Forms: Their Construction and Application to Object Identification and Positioning

IEEE Transactions on Pattern Analysis and Machine Intelligence
Pascal triangle transform approach to the calculation of 3D moments

CVGIP: Graphical Models and Image Processing
Fast computation of three-dimensional geometric moments using a discrete divergence theorem and a generalization to higher dimensions

Graphical Models and Image Processing
Mathematical Morphology Based on Linear Combined MetricSpaces on Z2 (Part I): Fast Distance Transforms

Journal of Mathematical Imaging and Vision
Refined moment calculation using image block representation

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The method here proposed is based on the idea that the object of interest is first decomposed in a set of cubes under d8. This decomposition is known to form a partition. The required moments are computed as a sum of the moments of the partition. The moments of each cube can be computed in terms of a set of very simple expressions using the center of the cube and its radio. The method provides integral accuracy by applying the exact definition of moments over each cube of the partition. One interesting feature of our proposal is that once the partition is obtained, moment computation is faster than with earlier methods.