Match!
Cesar Carranza
Pontifical Catholic University of Peru
ArchitectureParallel computingRadon transformComputer scienceField-programmable gate array
20Publications
6H-index
86Citations
What is this?
Publications 18
Newest
#1Cesar Carranza (PUCP: Pontifical Catholic University of Peru)H-Index: 6
#2Daniel Llamocca (Oakland University)H-Index: 9
Last. Marios S. Pattichis (UNM: University of New Mexico)H-Index: 27
view all 3 authors...
The dominant use of Convolutional Neural Networks (CNNs) in several image and video analysis tasks necessitates a careful re-evaluation of the underlying software libraries for computing them for large-scale image and video databases. We focus our attention on developing methods that can be applied to large image databases or videos of large image sizes.We develop a method that maximizes throughput through the use of vector-based memory I/O and optimized 2D FFT libraries that run on all availabl...
Source
Oct 4, 2018 in ICIP (International Conference on Image Processing)
#1Cesar Carranza (PUCP: Pontifical Catholic University of Peru)H-Index: 6
#2Marios S. Pattichis (UNM: University of New Mexico)H-Index: 27
Last. Daniel Llamocca (UR: University of Rochester)H-Index: 9
view all 3 authors...
The Discrete Periodic Radon Transform (DPRT) has many important applications in reconstructing images from their projections and has recently been used in fast and scalable architectures for computing 2D convolutions. Unfortunately, the direct computation of the DPRT involves O(N^{3})additions and memory accesses that can be very costly in single-core architectures. The current paper presents new and efficient algorithms for computing the DPRT and its inverse on multi-core CPUs and GPUs. The ...
1 CitationsSource
#1Gabriel Salvador (PUCP: Pontifical Catholic University of Peru)
#2Juan M. Chau (PUCP: Pontifical Catholic University of Peru)
Last. Cesar Carranza (PUCP: Pontifical Catholic University of Peru)H-Index: 6
view all 4 authors...
Median filtering has become a ubiquitous smoothing tool for image denoising tasks, with its complexity generally determined by the median algorithm used (usually on the order of O(n log(n)) when computing the median of n elements). Most algorithms were formulated for scalar single processor computers, with few of them successfully adapted and implemented for computers with a parallel architecture. However, the redundancy for processing neighboring pixels has not yet been fully exploited for para...
Source
#1Cesar Carranza (PUCP: Pontifical Catholic University of Peru)H-Index: 6
#2Daniel Llamocca (UR: University of Rochester)H-Index: 9
Last. Marios S. Pattichis (UNM: University of New Mexico)H-Index: 27
view all 3 authors...
The manuscript describes fast and scalable architectures and associated algorithms for computing convolutions and cross-correlations. The basic idea is to map 2D convolutions and cross-correlations to a collection of 1D convolutions and cross-correlations in the transform domain. This is accomplished through the use of the discrete periodic radon transform for general kernels and the use of singular value decomposition -LU decompositions for low-rank kernels. The approach uses scalable architect...
7 CitationsSource
#1Cesar Carranza (UNM: University of New Mexico)H-Index: 6
#2Daniel Llamocca (UR: University of Rochester)H-Index: 9
Last. Marios S. Pattichis (UNM: University of New Mexico)H-Index: 27
view all 3 authors...
The discrete periodic radon transform (DPRT) has extensively been used in applications that involve image reconstructions from projections. Beyond classic applications, the DPRT can also be used to compute fast convolutions that avoids the use of floating-point arithmetic associated with the use of the fast Fourier transform. Unfortunately, the use of the DPRT has been limited by the need to compute a large number of additions and the need for a large number of memory accesses. This paper introd...
10 CitationsSource
#1E. Simon BarrigaH-Index: 8
#2Carla Agurto RiosH-Index: 1
Last. Antonio Capone (UR: University of Rochester)H-Index: 18
view all 10 authors...
Oct 1, 2014 in ICIP (International Conference on Image Processing)
#1Cesar Carranza (PUCP: Pontifical Catholic University of Peru)H-Index: 6
#2Daniel Llamocca (UNM: University of New Mexico)H-Index: 9
Last. Marios S. Pattichis (UNM: University of New Mexico)H-Index: 27
view all 3 authors...
The Discrete Periodic Radon Transform (DPRT) has many important applications in image processing that are associated with reconstructing objects from projections (e.g., computed tomography [1]) or image restoration (e.g., [2]). Thus, there is strong interest in the development of fast algorithms and architectures for computing the DPRT. This paper introduces a scalable hardware architecture and associated algorithm for computing the DPRT for prime-sized images. For square images of size N × N, N...
2 CitationsSource
#1Carla Agurto RiosH-Index: 1
#2E. Simon Barriga (UNM: University of New Mexico)H-Index: 8
Last. Peter SolizH-Index: 17
view all 8 authors...
1 Citations
Apr 6, 2014 in SSIAI (Southwest Symposium on Image Analysis and Interpretation)
#1Cesar Carranza (UNM: University of New Mexico)H-Index: 6
#2Daniel Llamocca (UNM: University of New Mexico)H-Index: 9
Last. Marios S. Pattichis (UNM: University of New Mexico)H-Index: 27
view all 3 authors...
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 × p, p prime, the Discrete Periodic Radon Transform (DPRT) requires p2(p-1) additions for calculating image projections along a minimal number of prime directions. The proposed FDPRT architecture can compute the DPRT in p + 1 + dlog2(p)e clock cycles which represents a significant improve...
4 CitationsSource
12