3 papers
quant-ph2026
PUBO Formulation for MST and Application to Optimum-Path Forest
Guilherme E. L. Pexe, Lucas A. M. Rattighieri, Leandro A. Passos +5
The Optimum-Path Forest is a graph-based framework for designing classifiers that exploit inter-sample connectivity. A particular variant constructs decision boundaries based on pr…
quant-ph2026
FALQON-MST: A Fully Quantum Framework for Graph Optimization in Vision Systems
Guilherme E. L. Pexe, Lucas A. M. Rattighieri, Leandro A. Passos +4
Finding the minimum spanning tree (MST) of a graph is an important task in computer vision, as it enables a sparse and low-cost representation of connectivity among elements (such…
cs.CV2024
BioNeRF: Biologically Plausible Neural Radiance Fields for View Synthesis
Leandro A. Passos, Douglas Rodrigues, Danilo Jodas +3
This paper presents BioNeRF, a biologically plausible architecture that models scenes in a 3D representation and synthesizes new views through radiance fields. Since NeRF relies on…