Francisco Alejandro Madera-Ramírez
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Francisco Alejandro Madera-Ramírez has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- José Luis López Martínez
Facultad de Matemáticas Universidad Autónoma de Yucatán Mérida México
4 shared publications - Joel Antonio Trejo-Sánchez
Conacyt-Centro de Investigacion en Matematicas
3 shared publications - Víctor Hugo Menéndez-Domínguez
Universidad Autonoma de Yucatan
3 shared publications - Jorge Rios-Martinez
Universidad Autonoma de Yucatan
2 shared publications - Alejandro Flores Lamas
Department of Computer Sciences, Royal Holloway University of London, Egham Hill, United Kingdom
1 shared publication - Amílcar Pérez-Canto
Universidad Autonoma de Yucatan
1 shared publication
Latest Publications
- 12 April 2026
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 38 (8)
A Hough Transform Algorithm Implementation Using Dynamic Parallelism With CUDA
The Compute Unified Device Architecture (CUDA) parallel programming model has become very popular in image processing methods for detecting shapes. Dynamic parallelism with CUDA allows nesting and recursion algorithms to be implemented by using multiple child kernels created dynamically from their parent kernels. This technique allows the computational resources associated with the Graphics Processing Units (GPUs) to be used more efficiently, providing homogeneous workloads between threads and blocks. This paper proposes the use of dynamic parallelism applied to the image decomposition of the Hough transform to detect straight lines. The comparison results with another parallel algorithm published in the literature, which does not use dynamic parallelism, are presented in terms of time, reducing the total execution time and obtaining a performance of up to 1.7 times faster.
- 12 April 2026
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 38 (8)
A Hough Transform Algorithm Implementation Using Dynamic Parallelism With CUDA
The Compute Unified Device Architecture (CUDA) parallel programming model has become very popular in image processing methods for detecting shapes. Dynamic parallelism with CUDA allows nesting and recursion algorithms to be implemented by using multiple child kernels created dynamically from their parent kernels. This technique allows the computational resources associated with the Graphics Processing Units (GPUs) to be used more efficiently, providing homogeneous workloads between threads and blocks. This paper proposes the use of dynamic parallelism applied to the image decomposition of the Hough transform to detect straight lines. The comparison results with another parallel algorithm published in the literature, which does not use dynamic parallelism, are presented in terms of time, reducing the total execution time and obtaining a performance of up to 1.7 times faster.
- 1 March 2026
- Published by IATED Academy in INTED Proceedings
- Vol. 1, 1613
EXTENDING OPEN JOURNAL SYSTEMS WITH A HYBRID ARTICLE RECOMMENDATION MODULE
- 1 March 2026
- Published by IATED Academy in INTED Proceedings
- Vol. 1, 1613
EXTENDING OPEN JOURNAL SYSTEMS WITH A HYBRID ARTICLE RECOMMENDATION MODULE
- 1 November 2023
- Published by IATED Academy in ICERI Proceedings
- p. 6623-6628
VTEACHER: A TOOL FOR THE EDUCATIONAL USE OF AVATARS IN VIRTUAL CLASSROOMS
- 1 November 2023
- Published by IATED Academy in ICERI Proceedings
- p. 6623-6628
VTEACHER: A TOOL FOR THE EDUCATIONAL USE OF AVATARS IN VIRTUAL CLASSROOMS
- Top Cited PapersOpen Access
Machine Learning-Based Sensor Data Fusion for Animal Monitoring: Scoping Review
The development of technology, such as the Internet of Things and artificial intelligence, has significantly advanced many fields of study. Animal research is no exception, as these technologies have enabled data collection through various sensing devices. Advanced computer systems equipped with artificial intelligence capabilities can process these data, allowing researchers to identify significant behaviors related to the detection of illnesses, discerning the emotional state of the animals, and even recognizing individual animal identities. This review includes articles in the English language published between 2011 and 2022. A total of 263 articles were retrieved, and after applying inclusion criteria, only 23 were deemed eligible for analysis. Sensor fusion algorithms were categorized into three levels: Raw or low (26%), Feature or medium (39%), and Decision or high (34%). Most articles focused on posture and activity detection, and the target species were primarily cows (32%) and horses (12%) in the three levels of fusion. The accelerometer was present at all levels. The findings indicate that the study of sensor fusion applied to animals is still in its early stages and has yet to be fully explored. There is an opportunity to research the use of sensor fusion for combining movement data with biometric sensors to develop animal welfare applications. Overall, the integration of sensor fusion and machine learning algorithms can provide a more in-depth understanding of animal behavior and contribute to better animal welfare, production efficiency, and conservation efforts.
Top Cited PapersOpen AccessMachine Learning-Based Sensor Data Fusion for Animal Monitoring: Scoping Review
The development of technology, such as the Internet of Things and artificial intelligence, has significantly advanced many fields of study. Animal research is no exception, as these technologies have enabled data collection through various sensing devices. Advanced computer systems equipped with artificial intelligence capabilities can process these data, allowing researchers to identify significant behaviors related to the detection of illnesses, discerning the emotional state of the animals, and even recognizing individual animal identities. This review includes articles in the English language published between 2011 and 2022. A total of 263 articles were retrieved, and after applying inclusion criteria, only 23 were deemed eligible for analysis. Sensor fusion algorithms were categorized into three levels: Raw or low (26%), Feature or medium (39%), and Decision or high (34%). Most articles focused on posture and activity detection, and the target species were primarily cows (32%) and horses (12%) in the three levels of fusion. The accelerometer was present at all levels. The findings indicate that the study of sensor fusion applied to animals is still in its early stages and has yet to be fully explored. There is an opportunity to research the use of sensor fusion for combining movement data with biometric sensors to develop animal welfare applications. Overall, the integration of sensor fusion and machine learning algorithms can provide a more in-depth understanding of animal behavior and contribute to better animal welfare, production efficiency, and conservation efforts.
- 19 May 2023
- Published by Springer Nature
- p. 331-340
The Mayan Culture Video Game—“La Casa Maya”
- 2 May 2023
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 38 (6) , 1142-1162
Crossing edge minimization in radial outerplanar layered graphs using segment paths
Crossing minimization is a natural problem in graph drawing, which consists of drawing it in the plane with a minimum number of crossings on the edges. We present an algorithm to minimize the crossing edges in radial layered graphs. The algorithm determines the optimal location of nodes in their corresponding circle layer and consists of two phases. In the first phase, a counterclockwise rotation of concentric circles is performed; in the next phase, edges are converted into segment paths. Unlike other algorithms with circular drawings, our algorithm does not require the insertion or removal of nodes and edges; only rotation and path construction operations are utilized. Two versions of the algorithm were created; the exhaustive version tests all the possible paths, while the random version tests a few number of paths. The goal is to minimize the crossing edges to obtain a clear visualization using three criteria: rotation, crossing edge detection and segment path construction. The algorithm has been successfully implemented in 30 instances of graphs with 20, 35 and 50 layers, where crossings are minimized in 86–93%, 93–96% and 95–97%, respectively.
- 2 May 2023
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 38 (6) , 1142-1162
Crossing edge minimization in radial outerplanar layered graphs using segment paths
Crossing minimization is a natural problem in graph drawing, which consists of drawing it in the plane with a minimum number of crossings on the edges. We present an algorithm to minimize the crossing edges in radial layered graphs. The algorithm determines the optimal location of nodes in their corresponding circle layer and consists of two phases. In the first phase, a counterclockwise rotation of concentric circles is performed; in the next phase, edges are converted into segment paths. Unlike other algorithms with circular drawings, our algorithm does not require the insertion or removal of nodes and edges; only rotation and path construction operations are utilized. Two versions of the algorithm were created; the exhaustive version tests all the possible paths, while the random version tests a few number of paths. The goal is to minimize the crossing edges to obtain a clear visualization using three criteria: rotation, crossing edge detection and segment path construction. The algorithm has been successfully implemented in 30 instances of graphs with 20, 35 and 50 layers, where crossings are minimized in 86–93%, 93–96% and 95–97%, respectively.
- 11 October 2022
- Published by Springer Nature in Optimization Letters
- Vol. 17 (6) , 1435-1454
A fast approximation algorithm for the maximum 2-packing set problem on planar graphs
- 11 October 2022
- Published by Springer Nature in Optimization Letters
- Vol. 17 (6) , 1435-1454
A fast approximation algorithm for the maximum 2-packing set problem on planar graphs
- 19 October 2021
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 78 (5) , 6448-6460
CPU–GPU buffer communication using compute shader to fill volumes with spheres
- 19 October 2021
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 78 (5) , 6448-6460
CPU–GPU buffer communication using compute shader to fill volumes with spheres