The Fast Discrete Periodic Radon Transform for prime sized images: Algorithm, architecture, and VLSI/FPGA implementation

Cesar Carranza, Daniel Llamocca, Marios Pattichis

Producción científica: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

3 Citas (Scopus)

Resumen

The paper introduces the Fast Discrete Periodic Radon Transform (FDPRT) which represents a new algorithm and associated architecture for computing Discrete Periodic Radon Transforms. For square images of size p x p, p prime, the Discrete Periodic Radon Transform (DPRT) requires p2(p1) additions for calculating image projections along a minimal number of prime directions. The proposed FDPRT architecture can compute the DPRT in p + 1 + ⌈log2(p)⌉ clock cycles which represents a significant improvement over p2 + p + 1 clock cycles that corresponds to the fastest, previously-reported implementation. The VHDL code of the FDPRT IP core is available under the reconfigurable computer architecture research link from ivpcl.org.

Idioma originalInglés
Título de la publicación alojada2014 IEEE Southwest Symposium on Image Analysis and Interpretation, SSIAI 2014 - Proceedings
EditorialInstitute of Electrical and Electronics Engineers Inc.
Páginas169-172
Número de páginas4
ISBN (versión impresa)9781479940530
DOI
EstadoPublicada - 2014
Publicado de forma externa
Evento2014 IEEE Southwest Symposium on Image Analysis and Interpretation, SSIAI 2014 - San Diego, CA, Estados Unidos
Duración: 6 abr. 20148 abr. 2014

Serie de la publicación

NombreProceedings of the IEEE Southwest Symposium on Image Analysis and Interpretation

Conferencia

Conferencia2014 IEEE Southwest Symposium on Image Analysis and Interpretation, SSIAI 2014
País/TerritorioEstados Unidos
CiudadSan Diego, CA
Período6/04/148/04/14

Huella

Profundice en los temas de investigación de 'The Fast Discrete Periodic Radon Transform for prime sized images: Algorithm, architecture, and VLSI/FPGA implementation'. En conjunto forman una huella única.

Citar esto