Marta Mejail
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Marta Mejail has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Andrés Almansa
CNRS UNIVERSITE PARIS CITE
2 shared publications - Matias Nitsche
University of Buenos Aires
2 shared publications - Pablo Musé
Universidad de la República
2 shared publications - Tomáš Krajník
Faculty of Electrical Engineering, Czech Technical University in Prague, Prague, Czechia
2 shared publications - Alejandro C. Frery
Victoria University of Wellington
1 shared publication - Alvaro Pardo
Universidad Católica del Uruguay, Montevideo, Uruguay
1 shared publication
Latest Publications
- 10 September 2022
- Published by Springer Nature
- p. 149-164
Early Computer-Aided Diagnose in Medical Environments: A Deep Learning Based Lightweight Solution
- 10 September 2022
- Published by Springer Nature
- p. 149-164
Early Computer-Aided Diagnose in Medical Environments: A Deep Learning Based Lightweight Solution
- 25 October 2015
- Published by Springer Nature
- p. 236-244
Two Applications of RGB-D Descriptors in Computer Vision
- 25 October 2015
- Published by Springer Nature
- p. 236-244
Two Applications of RGB-D Descriptors in Computer Vision
- 24 April 2014
- Published by Springer Nature in Journal of Intelligent & Robotic Systems
- Vol. 76 (3-4) , 539-562
A Practical Multirobot Localization System
- 24 April 2014
- Published by Springer Nature in Journal of Intelligent & Robotic Systems
- Vol. 76 (3-4) , 539-562
A Practical Multirobot Localization System
- 1 January 2014
- Published by Elsevier in Pattern Recognition
- Vol. 47 (1) , 72-79
Finding contrasted and regular edges by a contrario detection of periodic subsequences
- 1 January 2014
- Published by Elsevier in Pattern Recognition
- Vol. 47 (1) , 72-79
Finding contrasted and regular edges by a contrario detection of periodic subsequences
- 22 June 2013
- Published by Springer Nature in Journal of Real-Time Image Processing
- Vol. 11 (2) , 335-348
Real-time monocular image-based path detection
- 22 June 2013
- Published by Springer Nature in Journal of Real-Time Image Processing
- Vol. 11 (2) , 335-348
Real-time monocular image-based path detection
- Open Access
Boruvka Meets Nearest Neighbors
Computing the minimum spanning tree (MST) is a common task in the pattern recognition and the computer vision fields. However, little work has been done on efficient general methods for solving the problem on large datasets where graphs are complete and edge weights are given implicitly by a distance between vertex attributes. In this work we propose a generic algorithm that extends the classical Boruvka's algorithm by using nearest neighbors search structures to reduce significantly time and memory performances. The algorithm can also compute in a straightforward way approximate MSTs thus further improving speed. Experiments show that the proposed method outperforms classical algorithms on large low-dimensional datasets by several orders of magnitude. Finally, to illustrate the usefulness of the proposed algorithm, we focus on a classical computer vision problem: image segmentation. We modify a state-of-the-art local graph-based clustering algorithm, thus permitting a global scene analysis.
Open AccessBoruvka Meets Nearest Neighbors
Computing the minimum spanning tree (MST) is a common task in the pattern recognition and the computer vision fields. However, little work has been done on efficient general methods for solving the problem on large datasets where graphs are complete and edge weights are given implicitly by a distance between vertex attributes. In this work we propose a generic algorithm that extends the classical Boruvka's algorithm by using nearest neighbors search structures to reduce significantly time and memory performances. The algorithm can also compute in a straightforward way approximate MSTs thus further improving speed. Experiments show that the proposed method outperforms classical algorithms on large low-dimensional datasets by several orders of magnitude. Finally, to illustrate the usefulness of the proposed algorithm, we focus on a classical computer vision problem: image segmentation. We modify a state-of-the-art local graph-based clustering algorithm, thus permitting a global scene analysis.
- 11 September 2007
- Published by Springer Nature in Statistics and Computing
- Vol. 18 (1) , 15-26
Accuracy of edge detection methods with local information in speckled imagery
- 11 September 2007
- Published by Springer Nature in Statistics and Computing
- Vol. 18 (1) , 15-26
Accuracy of edge detection methods with local information in speckled imagery