Efficient Computation of Three-dimensional Geometric Moments Based on Object Partition

We present a method for computing the three-dimensionalmoments of an object. The method is based on the idea thatthe object of interest is first decomposed in a set of cubesunder d . This decomposition is known to form a partition.The required moments are computed as a sum of the momentsof the eleme...

Descripción completa

Detalles Bibliográficos
Autores: Héctor Benítez, Humberto Sossa
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2005
País:México
Institución:Instituto Politécnico Nacional
Repositorio:Redalyc-IPN
OAI Identifier:oai:redalyc.org:61490405
Acceso en línea:https://www.redalyc.org/articulo.oa?id=61490405
Access Level:acceso abierto
Palabra clave:Ingeniería
distance transform
D geometric moments
mathematical morphology
Descripción
Sumario:We present a method for computing the three-dimensionalmoments of an object. The method is based on the idea thatthe object of interest is first decomposed in a set of cubesunder d . This decomposition is known to form a partition.The required moments are computed as a sum of the momentsof the elements of the partition. The moments of each cubecan be calculated in terms of a set of very simple formulausing the center of the cube and its radio. The methodprovides integral accuracy by applying the exact definitionof moments. The desired partition is obtained both bymorphological erosions and the distance transformation ofthe image. Both variants are compared, showing that the oneusing the distance transform is much faster, making itcomparable to other traditional sequential approaches.Another interesting feature of the proposed idea to computethe geometric moments of a 3-D object is that once thepartition is obtained, moment computation is much fasterthan earlier methods. Its complexity is in fact of O(N).