Search arXivSearch

arXiv subjects

Alexandre Lopes

Publications and source records attributed to Alexandre Lopes.

9 recordsLinked to original sources

Model-Based Lookahead Reinforcement Learning for in-hand manipulation

In-Hand Manipulation, as many other dexterous tasks, remains a difficult challenge in robotics by combining complex dynamic systems with the capability to control and manoeuvre various objects using its actuators. This work presents the application of a previously developed hybrid Reinforcement Learning (RL) Framework to In-Hand Manipulation task, verifying that it is capable of improving the performance of the task. The model combines concepts of both Model-Free and Model-Based Reinforcement Learning, by guiding a trained policy with the help of a dynamic model and value-function through trajectory evaluation, as done in Model Predictive Control. This work evaluates the performance of the model by comparing it with the policy that will be guided. To fully explore this, various tests are performed using both fully-actuated and under-actuated simulated robotic hands to manipulate different objects for a given task. The performance of the model will also be tested for generalization tests, by changing the properties of the objects in which both the policy and dynamic model were trained, such as density and size, and additionally by guiding a trained policy in a certain object to perform the same task in a different one. The results of this work show that, given a policy with high average reward and an accurate dynamic model, the hybrid framework improves the performance of in-hand manipulation tasks for most test cases, even when the object properties are changed. However, this improvement comes at the expense of increasing the computational cost, due to the complexity of trajectory evaluation.

cs.RO

CCNeXt: An Effective Self-Supervised Stereo Depth Estimation Approach

Depth Estimation plays a crucial role in recent applications in robotics, autonomous vehicles, and augmented reality. These scenarios commonly operate under constraints imposed by computational power. Stereo image pairs offer an effective solution for depth estimation since it only needs to estimate the disparity of pixels in image pairs to determine the depth in a known rectified system. Due to the difficulty in acquiring reliable ground-truth depth data across diverse scenarios, self-supervised techniques emerge as a solution, particularly when large unlabeled datasets are available. We propose a novel self-supervised convolutional approach that outperforms existing state-of-the-art Convolutional Neural Networks (CNNs) and Vision Transformers (ViTs) while balancing computational cost. The proposed CCNeXt architecture employs a modern CNN feature extractor with a novel windowed epipolar cross-attention module in the encoder, complemented by a comprehensive redesign of the depth estimation decoder. Our experiments demonstrate that CCNeXt achieves competitive metrics on the KITTI Eigen Split test data while being 10.18$\times$ faster than the current best model and achieves state-of-the-art results in all metrics in the KITTI Eigen Split Improved Ground Truth and Driving Stereo datasets when compared to recently proposed techniques. To ensure complete reproducibility, our project is accessible at \href{https://github.com/alelopes/CCNext}{\texttt{https://github.com/alelopes/CCNext}}.

cs.CV

Computer Vision Model Compression Techniques for Embedded Systems: A Survey

Deep neural networks have consistently represented the state of the art in most computer vision problems. In these scenarios, larger and more complex models have demonstrated superior performance to smaller architectures, especially when trained with plenty of representative data. With the recent adoption of Vision Transformer (ViT) based architectures and advanced Convolutional Neural Networks (CNNs), the total number of parameters of leading backbone architectures increased from 62M parameters in 2012 with AlexNet to 7B parameters in 2024 with AIM-7B. Consequently, deploying such deep architectures faces challenges in environments with processing and runtime constraints, particularly in embedded systems. This paper covers the main model compression techniques applied for computer vision tasks, enabling modern models to be used in embedded systems. We present the characteristics of compression subareas, compare different approaches, and discuss how to choose the best technique and expected variations when analyzing it on various embedded devices. We also share codes to assist researchers and new practitioners in overcoming initial implementation challenges for each subarea and present trends for Model Compression. Case studies for compression models are available at \href{https://github.com/venturusbr/cv-model-compression}{https://github.com/venturusbr/cv-model-compression}.

cs.CV

A Survey on RGB-D Datasets

RGB-D data is essential for solving many problems in computer vision. Hundreds of public RGB-D datasets containing various scenes, such as indoor, outdoor, aerial, driving, and medical, have been proposed. These datasets are useful for different applications and are fundamental for addressing classic computer vision tasks, such as monocular depth estimation. This paper reviewed and categorized image datasets that include depth information. We gathered 203 datasets that contain accessible data and grouped them into three categories: scene/objects, body, and medical. We also provided an overview of the different types of sensors, depth applications, and we examined trends and future directions of the usage and creation of datasets containing depth data, and how they can be applied to investigate the development of generalizable machine learning models in the monocular depth estimation field.

cs.CV

Multi-Coil MRI Reconstruction Challenge -- Assessing Brain MRI Reconstruction Models and their Generalizability to Varying Coil Configurations

Deep-learning-based brain magnetic resonance imaging (MRI) reconstruction methods have the potential to accelerate the MRI acquisition process. Nevertheless, the scientific community lacks appropriate benchmarks to assess MRI reconstruction quality of high-resolution brain images, and evaluate how these proposed algorithms will behave in the presence of small, but expected data distribution shifts. The Multi-Coil Magnetic Resonance Image (MC-MRI) Reconstruction Challenge provides a benchmark that aims at addressing these issues, using a large dataset of high-resolution, three-dimensional, T1-weighted MRI scans. The challenge has two primary goals: 1) to compare different MRI reconstruction models on this dataset and 2) to assess the generalizability of these models to data acquired with a different number of receiver coils. In this paper, we describe the challenge experimental design, and summarize the results of a set of baseline and state of the art brain MRI reconstruction models. We provide relevant comparative information on the current MRI reconstruction state-of-the-art and highlight the challenges of obtaining generalizable models that are required prior to broader clinical adoption. The MC-MRI benchmark data, evaluation code and current challenge leaderboard are publicly available. They provide an objective performance assessment for future developments in the field of brain MRI reconstruction.

eess.IV

Lite Training Strategies for Portuguese-English and English-Portuguese Translation

Despite the widespread adoption of deep learning for machine translation, it is still expensive to develop high-quality translation models. In this work, we investigate the use of pre-trained models, such as T5 for Portuguese-English and English-Portuguese translation tasks using low-cost hardware. We explore the use of Portuguese and English pre-trained language models and propose an adaptation of the English tokenizer to represent Portuguese characters, such as diaeresis, acute and grave accents. We compare our models to the Google Translate API and MarianMT on a subset of the ParaCrawl dataset, as well as to the winning submission to the WMT19 Biomedical Translation Shared Task. We also describe our submission to the WMT20 Biomedical Translation Shared Task. Our results show that our models have a competitive performance to state-of-the-art models while being trained on modest hardware (a single 8GB gaming GPU for nine days). Our data, models and code are available at https://github.com/unicamp-dl/Lite-T5-Translation.

cs.CL

Implications of pinned occupation numbers for natural orbital expansions. II: Rigorous derivation and extension to non-fermionic systems

We have explained and comprehensively illustrated in Part I that the generalized Pauli constraints suggest a natural extension of the concept of active spaces. In the present Part II, we provide rigorous derivations of the theorems involved therein. This will offer in particular deeper insights into the underlying mathematical structure and will explain why the saturation of generalized Pauli constraints implies a specific simplified structure of the corresponding many-fermion quantum state. Moreover, we extend the results of Part I to non-fermionic multipartite quantum systems, revealing that extremal single-body information has always strong implications for the multipartite quantum state. In that sense, our work also confirms that pinned quantum systems define new physical entities and the presence of pinnings reflect the existence of (possibly hidden) ground state symmetries.

quant-ph

Implications of pinned occupation numbers for natural orbital expansions. I: Generalizing the concept of active spaces

The concept of active spaces simplifies the description of interacting quantum many-body systems by restricting to a neighbourhood of active orbitals around the Fermi level. The respective wavefunction ansatzes which involve all possible electron configurations of active orbitals can be characterized by the saturation of a certain number of Pauli constraints $0 \leq n_i \leq 1$, identifying the occupied core orbitals ($n_i=1$) and the inactive virtual orbitals ($n_j=0$). In Part I, we generalize this crucial concept of active spaces by referring to the generalized Pauli constraints. To be more specific, we explain and illustrate that the saturation of any such constraint on fermionic occupation numbers characterizes a distinctive set of active electron configurations. A converse form of this selection rule establishes the basis for corresponding multiconfigurational wavefunction ansatzes. In Part II, we provide rigorous derivations of those findings. Moroever, we extend our results to non-fermionic multipartite quantum systems, revealing that extremal single-body information has always strong implications for the multipartite quantum state. In that sense, our work also confirms that pinned quantum systems define new physical entities and the presence of pinnings reflect the existence of (possibly hidden) ground state symmetries.

quant-ph

Generalized Pauli constraints in small atoms

The natural occupation numbers of fermionic systems are subject to non-trivial constraints, which include and extend the original Pauli principle. A recent mathematical breakthrough has clarified their mathematical structure and has opened up the possibility of a systematic analysis. Early investigations have found evidence that these constraints are exactly saturated in several physically relevant systems, e.g., in a certain electronic state of the Beryllium atom. It has been suggested that in such cases, the constraints, rather than the details of the Hamiltonian, dictate the system's qualitative behaviour. Here, we revisit this question with state-of-the-art numerical methods for small atoms. We find that the constraints are, in fact, not exactly saturated, but that they lie much closer to the surface defined by the constraints than the geometry of the problem would suggest. While the results seem incompatible with the statement that the generalized Pauli constraints drive the behaviour of these systems, they suggest that the qualitatively correct wave-function expansions can in some systems already be obtained on the basis of a limited number of Slater determinants, which is in line with numerical evidence from quantum chemistry.

quant-ph