Alexandre Xavier Falcao

Alexandre Xavier Falcao

Auto-generated profile, based on publicly available information

Alexandre Xavier Falcao

UNICAMP

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 December 2022 in Nature Communications
Verified
Journal Article
Open access
PDF file
SPSarthak Pati
Sarthak Pati
Ujjwal BaidUjjwal Baid
Ujjwal Baid
BEBrandon Edwards
Brandon Edwards
MSMicah Sheller
Micah Sheller
SWShih-Han Wang
Shih-Han Wang
Spyridon BakasSpyridon Bakas
Spyridon Bakas
Although machine learning (ML) has shown promise across disciplines, out-of-sample generalizability is concerning. This is currently addressed by sharing multi-site data, but such centralization is challenging/infeasible to scale due to various limitations. Federated ML (FL) provides an alternative paradigm for accurate and generalizable ML, by only sharing numerical model updates. Here we present the largest FL study to-date, involving data from 71 sites across 6 continents, to generate an automatic tumor boundary detector for the rare disease of glioblastoma, reporting the largest such dataset in the literature (n = 6, 314). We demonstrate a 33% delineation improvement for the surgically targetable tumor, and 23% for the complete tumor extent, over a publicly trained model. We anticipate our study to: 1) enable more healthcare studies informed by large diverse data, ensuring meaningful results for rare diseases and underrepresented populations, 2) facilitate further analyses for glioblastoma by releasing our consensus model, and 3) demonstrate the FL effectiveness at such scale and task-complexity as a paradigm shift for multi-site collaborations, alleviating the need for data-sharing.

14 June 2004 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
AFA.X. Falcao
A.X. Falcao
JSJ. Stolfi
J. Stolfi
RLR. de Alencar Lotufo
R. de Alencar Lotufo
The image foresting transform (IFT) is a graph-based approach to the design of image processing operators based on connectivity. It naturally leads to correct and efficient implementations and to a better understanding of how different operators relate to each other. We give here a precise definition of the IFT, and a procedure to compute it-a generalization of Dijkstra's algorithm-with a proof of correctness. We also discuss implementation issues and illustrate the use of the IFT in a few applications.

13 May 2009 in International Journal of Imaging Systems and Technology
Verified
Journal Article
Closed access
PDF file
JPJ. P. Papa
J. P. Papa
AFA. X. Falcão
A. X. Falcão
CSCelso Suzuki
Celso Suzuki

17 June 2020 in IEEE Geoscience and Remote Sensing Magazine
Verified
Journal Article
Closed access
JVJohn E. Vargas-Munoz
John E. Vargas-Munoz
SSShivangi Srivastava
Shivangi Srivastava
DTDevis Tuia
Devis Tuia
AFAlexandre X. Falcao
Alexandre X. Falcao

13 May 2009 in International Journal of Imaging Systems and Technology
Verified
Journal Article
Closed access
PDF file
LRLeonardo Marques Rocha
Leonardo Marques Rocha
FCFábio A. M. Cappabianco
Fábio A. M. Cappabianco
AFAlexandre Xavier Falcão
Alexandre Xavier Falcão

6 February 2019 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
JVJohn E. Vargas-Munoz
John E. Vargas-Munoz
ACAnanda S. Chowdhury
Ananda S. Chowdhury
EAEduardo B. Alexandre
Eduardo B. Alexandre
FGFelipe L. Galvao
Felipe L. Galvao
PMPaulo A. Vechiatto Miranda
Paulo A. Vechiatto Miranda
AFAlexandre X. Falcao
Alexandre X. Falcao
Superpixel segmentation has emerged as an important research problem in the areas of image processing and computer vision. In this paper, we propose a framework, namely Iterative Spanning Forest (ISF), in which improved sets of connected superpixels (supervoxels in 3D) can be generated by a sequence of image foresting transforms. In this framework, one can choose the most suitable combination of ISF components for a given application-i.e., 1) a seed sampling strategy; 2) a connectivity function; 3) an adjacency relation; and 4) a seed pixel recomputation procedure. The superpixels in ISF structurally correspond to spanning trees rooted at those seeds. We present five ISF-based methods to illustrate different choices for those components. These methods are compared with a number of state-of-the-art approaches with respect to effectiveness and efficiency. Experiments are carried out on several datasets containing 2D and 3D objects with distinct texture and shape properties, including a high-level application, named sky image segmentation. The theoretical properties of ISF are demonstrated in the supplementary material and the results show ISF-based methods rank consistently among the best for all datasets.