Pasar al contenido principal

ANALISIS DE IMAGENES DE ALTO RENDIMIENTO MEDIANTE MODELOS ESTADISTICOS DE FORMA, APARIENCIA Y DEFORMACION

TIN2009-14536-C02-01

•
Nombre agencia financiadora Ministerio de Ciencia e Innovación
Acrónimo agencia financiadora MICINN
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2009
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Subdirección General de Proyectos de Investigación
Centro beneficiario UNIVERSITAT POMPEU FABRA CCT
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

Resultados totales (Incluyendo duplicados): 2
Encontrada(s) 1 página(s)

Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Efficient 3D Geometric and Zernike moments computation from unstructured surface meshes

  • Pozo Soler, José Ma. (José María)
  • Villa-Uriol, Maria-Cruz
  • Frangi Caregnato, Alejandro
This paper introduces and evaluates a fast exact algorithm and a series of faster approximate algorithms for the computation of 3D geometric moments from an unstructured surface mesh of triangles. Being based on the object surface reduces the computational complexity of these algorithms with respect to volumetric grid-based algorithms. In contrast, it can only be applied for the computation of geometric moments of homogeneous objects. This advantage and restriction is shared with other proposed algorithms based on the object boundary. The proposed exact algorithm reduces the computational complexity for computing geometric moments up to order N with respect to previously proposed exact algorithms, from N 9 to N 6 . The approximate series algorithm appears as a power series on the rate between triangle size and object size, which can be truncated at any desired degree. The higher the number and quality of the triangles, the better the approximation. This approximate algorithm reduces the computational complexity to N 3 . In addition, the paper introduces a fast algorithm for the computation of 3D Zernike moments from the computed geometric moments, with a computational complexity N 4 , while the previously proposed algorithm is of order N 6 . The error introduced by the proposed approximate algorithms is evaluated in different shapes and the cost-benefit ratio in terms of error, and computational time is analyzed for different moment orders., This work was partially supported by Philips Healthcare (Best, The Netherlands), the @neurIST Integrated Project (co-financed by the European Commission through the contract no. IST-027703), the CDTI CENIT-CDTEAM grant funded by the Spanish Ministry of Industry and the research project STIMATH (TIN2009-14536-C02-01) funded by the Spanish Ministry of Science and Innovation (MICINN) and the European Regional Development Fund (ERDF)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Efficient 3D Geometric and Zernike moments computation from unstructured surface meshes

  • Pozo Soler, José Ma. (José María)
  • Villa-Uriol, Maria-Cruz
  • Frangi Caregnato, Alejandro
This paper introduces and evaluates a fast exact algorithm and a series of faster approximate algorithms for the computation of 3D geometric moments from an unstructured surface mesh of triangles. Being based on the object surface reduces the computational complexity of these algorithms with respect to volumetric grid-based algorithms. In contrast, it can only be applied for the computation of geometric moments of homogeneous objects. This advantage and restriction is shared with other proposed algorithms based on the object boundary. The proposed exact algorithm reduces the computational complexity for computing geometric moments up to order N with respect to previously proposed exact algorithms, from N 9 to N 6 . The approximate series algorithm appears as a power series on the rate between triangle size and object size, which can be truncated at any desired degree. The higher the number and quality of the triangles, the better the approximation. This approximate algorithm reduces the computational complexity to N 3 . In addition, the paper introduces a fast algorithm for the computation of 3D Zernike moments from the computed geometric moments, with a computational complexity N 4 , while the previously proposed algorithm is of order N 6 . The error introduced by the proposed approximate algorithms is evaluated in different shapes and the cost-benefit ratio in terms of error, and computational time is analyzed for different moment orders., This work was partially supported by Philips Healthcare (Best, The Netherlands), the @neurIST Integrated Project (co-financed by the European Commission through the contract no. IST-027703), the CDTI CENIT-CDTEAM grant funded by the Spanish Ministry of Industry and the research project STIMATH (TIN2009-14536-C02-01) funded by the Spanish Ministry of Science and Innovation (MICINN) and the European Regional Development Fund (ERDF)