Searcharxiv⌕ Search

arXiv subjects

João Santos

Publications and source records attributed to João Santos.

12 recordsLinked to original sources

Face inpainting with Identity Preserving Latent Diffusion Models

Face inpainting techniques recover missing or occluded facial regions in a visually realistic manner, but preserving the identity in the final output remains a fundamental challenge. Identity consistency is crucial for downstream applications such as face recognition, digital forensics, and human-computer interaction, where even subtle identity distortions can significantly degrade performance or trust. Although diffusion-based generative models have recently achieved remarkable progress in image inpainting, they often struggle to faithfully retain individual-specific facial characteristics. On the other hand, existing identity-aware methods typically rely on costly fine-tuning, auxiliary supervision, or exhibit limited robustness to diverse occlusions, poses, and facial variations. To address these limitations, we propose ID-ControlNet, an identity-preserving face inpainting framework built upon latent diffusion models. Based on ControlNet architecture, our approach conditions the diffusion process on facial identity embeddings extracted from a pretrained face recognition network. This design enables reconstruction of occluded facial regions while maintaining global facial coherence and identity fidelity. Furthermore, we introduce an identity consistency and triplet loss training strategy that explicitly enforces alignment between the generated face and the target identity representation. Extensive experiments on CelebA-HQ, FFHQ, and on a new E-Mask dataset demonstrate that ID-ControlNet significantly improves identity preservation over standard diffusion-based inpainting methods, achieving performance comparable to SOTA identity-aware approaches.

cs.CV↗

Monte Carlo Simulation and Dosimetric Analysis of Gold Nanoparticles (AuNPs) in Breast Tissue

Precise radiation delivery is critical for effective radiotherapy, and gold nanoparticles (AuNPs) have emerged as promising tools to enhance local dose deposition while sparing the surrounding healthy tissue. In this study, the PENELOPE Monte Carlo code was used to investigate the dosimetry of AuNPs under different conditions and models. The Dose Enhancement Ratio (DER) was studied in water and breast tissue with spherical shapes and in agreement with previously published results. To further analyse the physical interactions of the particles around the AuNP, a Phase Space File (PSF) in a volume around the AuNPs was created. This showed that larger AuNPs lead to increased doses, as expected, yielding DER values exceeding 100 times. Finally, results reveal that in the volume surrounding the AuNP, 80% of emitted electrons originate from photoelectric absorption, leading to Auger electron emission cascades which were analysed in detail. It was also possible to establish a direct relation between number of secondaries and the particle volumes. The Local Effect Model (LEM) was used to determine survival curves in AuNPs of different sizes at different gold concentrations. The last part of this work consisted in analysing a distribution of AuNPs within a flattened cell typical of clonogenic assays where a log-normal distribution of dose was observed. This led to the development of a new, mechanistic, Local Effect Model which, if further validated, can have further applications in-vitro and in-silico.

physics.med-ph↗

Blockchain Oracles for Real Estate Rental

Blockchain technology has seen adoption across various industries and the real estate sector is no exception. The traditional property leasing process guarantees no trust between parties, uses insecure communication channels, and forces participants who are not familiar with the process to perform contracts. Blockchain technology emerges as a solution to simplify the traditional property leasing process. This work proposes the use of two blockchain oracles to handle, respectively, maintenance issues and automate rent payments in the context of property rental. These two components are introduced in a blockchain-based property rental platform.

cs.CR↗

TS40K: a 3D Point Cloud Dataset of Rural Terrain and Electrical Transmission System

Research on supervised learning algorithms in 3D scene understanding has risen in prominence and witness great increases in performance across several datasets. The leading force of this research is the problem of autonomous driving followed by indoor scene segmentation. However, openly available 3D data on these tasks mainly focuses on urban scenarios. In this paper, we propose TS40K, a 3D point cloud dataset that encompasses more than 40,000 Km on electrical transmission systems situated in European rural terrain. This is not only a novel problem for the research community that can aid in the high-risk mission of power-grid inspection, but it also offers 3D point clouds with distinct characteristics from those in self-driving and indoor 3D data, such as high point-density and no occlusion. In our dataset, each 3D point is labeled with 1 out of 22 annotated classes. We evaluate the performance of state-of-the-art methods on our dataset concerning 3D semantic segmentation and 3D object detection. Finally, we provide a comprehensive analysis of the results along with key challenges such as using labels that were not originally intended for learning tasks.

cs.CV↗

Optimizing PatchCore for Few/many-shot Anomaly Detection

Few-shot anomaly detection (AD) is an emerging sub-field of general AD, and tries to distinguish between normal and anomalous data using only few selected samples. While newly proposed few-shot AD methods do compare against pre-existing algorithms developed for the full-shot domain as baselines, they do not dedicatedly optimize them for the few-shot setting. It thus remains unclear if the performance of such pre-existing algorithms can be further improved. We address said question in this work. Specifically, we present a study on the AD/anomaly segmentation (AS) performance of PatchCore, the current state-of-the-art full-shot AD/AS algorithm, in both the few-shot and the many-shot settings. We hypothesize that further performance improvements can be realized by (I) optimizing its various hyperparameters, and by (II) transferring techniques known to improve few-shot supervised learning to the AD domain. Exhaustive experiments on the public VisA and MVTec AD datasets reveal that (I) significant performance improvements can be realized by optimizing hyperparameters such as the underlying feature extractor, and that (II) image-level augmentations can, but are not guaranteed, to improve performance. Based on these findings, we achieve a new state of the art in few-shot AD on VisA, further demonstrating the merit of adapting pre-existing AD/AS methods to the few-shot setting. Last, we identify the investigation of feature extractors with a strong inductive bias as a potential future research direction for (few-shot) AD/AS.

cs.CV↗

Evaluating Post-hoc Interpretability with Intrinsic Interpretability

Despite Convolutional Neural Networks having reached human-level performance in some medical tasks, their clinical use has been hindered by their lack of interpretability. Two major interpretability strategies have been proposed to tackle this problem: post-hoc methods and intrinsic methods. Although there are several post-hoc methods to interpret DL models, there is significant variation between the explanations provided by each method, and it a difficult to validate them due to the lack of ground-truth. To address this challenge, we adapted the intrinsical interpretable ProtoPNet for the context of histopathology imaging and compared the attribution maps produced by it and the saliency maps made by post-hoc methods. To evaluate the similarity between saliency map methods and attribution maps we adapted 10 saliency metrics from the saliency model literature, and used the breast cancer metastases detection dataset PatchCamelyon with 327,680 patches of histopathological images of sentinel lymph node sections to validate the proposed approach. Overall, SmoothGrad and Occlusion were found to have a statistically bigger overlap with ProtoPNet while Deconvolution and Lime have been found to have the least.

cs.CV↗

Simplifying Multilingual News Clustering Through Projection From a Shared Space

The task of organizing and clustering multilingual news articles for media monitoring is essential to follow news stories in real time. Most approaches to this task focus on high-resource languages (mostly English), with low-resource languages being disregarded. With that in mind, we present a much simpler online system that is able to cluster an incoming stream of documents without depending on language-specific features. We empirically demonstrate that the use of multilingual contextual embeddings as the document representation significantly improves clustering quality. We challenge previous crosslingual approaches by removing the precondition of building monolingual clusters. We model the clustering process as a set of linear classifiers to aggregate similar documents, and correct closely-related multilingual clusters through merging in an online fashion. Our system achieves state-of-the-art results on a multilingual news stream clustering dataset, and we introduce a new evaluation for zero-shot news clustering in multiple languages. We make our code available as open-source.

cs.CL↗

Patterns for Documenting Open Source Frameworks

Documenting frameworks provides its users and maintainers useful information on that software's architecture, design, and customization. Despite documentation's importance, the process of creating and maintaining it is considered to imply considerable effort, to be tedious, and expensive. In this work, we mine patterns from open source frameworks to uncover good solutions used to document them that had not yet been described as patterns. This process resulted in four new patterns. "Contribution Guidelines" helps developers to become contributors to a project, helping them follow the good practices that have been adopted by its maintainers. "Documentation Versioning" consists of having separate documentation for older versions of the framework, to answer needs of the users on such versions. "Migration Handbook" helps users migrating from previous versions of the framework to newer ones. "Multi-language Support" allows translated documents in several languages to support a wider range of users for the framework.

cs.SE↗

DClaims: A Censorship Resistant Web Annotations System using IPFS and Ethereum

The proliferation of unreliable and biased information is a significant problem on the Internet. To assess the credibility of the information retrieved from news websites and other sources, users often resort to social platforms looking for confirmation with trustworthy parties. However, users may be faced with considerable obstacles posed by the platform provider, who can prevent access to certain content. This paper presents DClaims, a system that provides a censorship-resistant distributed service for the exchange of information over the Internet using web annotations. DClaims' fully decentralized architecture relies on Inter-Planetary File System (IPFS) and Ethereum blockchain, both of which offer desirable censorship resistant properties. DClaims is implemented as a web annotations browser extension which allows for the classification of news articles, on news websites. From our evaluation of the system, we conclude that a large scale implementation of the system is practical and economically viable.

cs.CR↗

Holomorphic bundles on the blown-up plane and the bar construction

We study the moduli space $\mathfrak M_k^r(\tilde{\mathbb P}^2_{\!q})$ of rank $r$ holomorphic bundles with trivial determinant and second Chern class $c_2=k$, over the blowup $\tilde{\mathbb P}^2_{\!q}$ of the projective plane at $q$ points, trivialized on a rational curve. We show that, for $k=1,2$, we have a homotopy equivalence between $\mathfrak M_k^r(\tilde{\mathbb P}^2_{\!q})$ and the degree $k$ component of the bar construction $\mathrm{B}\bigl(\mathfrak M^r\mathbb P^2,(\mathfrak M^r\mathbb P^2)^{q},(\mathfrak M^r\tilde{\mathbb P}_{\!1}^2)^{q}\bigr)$. The space $\mathfrak M_k^r(\tilde{\mathbb P}^2_{\!q})$ is isomorphic to the moduli space $\mathfrak M\mathcal I_k^r(X_q)$ of charge $k$ based $SU(r)$ instantons on a connected sum $X_q$ of $q$ copies of $\overline{\mathbb P^2}$ and we show that, for $k=1,2$, we have a homotopy equivalence between $\mathfrak M\mathcal I_k^r(X_q\# X_s)$ and the degree $k$ component of $\mathrm{B}\bigl(\mathfrak M\mathcal I^r(X_q),\mathfrak M\mathcal I^r(S^4),\mathfrak M\mathcal I^r(X_s)\bigr)$. Analogous results hold in the limit when $k\to\infty$. As an application we obtain upper bounds for the cokernel of the Atiyah-Jones map in homology, in the rank-stable limit.

math.AT↗

On the Implementation of an Or-Parallel Prolog System for Clusters of Multicores

Nowadays, clusters of multicores are becoming the norm and, although, many or-parallel Prolog systems have been developed in the past, to the best of our knowledge, none of them was specially designed to explore the combination of shared and distributed memory architectures. In recent work, we have proposed a novel computational model specially designed for such combination which introduces a layered model with two scheduling levels, one for workers sharing memory resources, which we named a team of workers, and another for teams of workers (not sharing memory resources). In this work, we present a first implementation of such model and for that we revive and extend the YapOr system to exploit or-parallelism between teams of workers. We also propose a new set of built-in predicates that constitute the syntax to interact with an or-parallel engine in our platform. Experimental results show that our implementation is able to increase speedups as we increase the number of workers per team, thus taking advantage of the maximum number of cores in a machine, and to increase speedups as we increase the number of teams, thus taking advantage of adding more computer nodes to a cluster. We thus argue that our platform is an efficient and viable alternative for exploiting implicit or-parallelism in the currently available clusters of low cost multicore architectures.

cs.DC↗

Efficient Support for Mode-Directed Tabling in the YapTab Tabling System

Mode-directed tabling is an extension to the tabling technique that supports the definition of mode operators for specifying how answers are inserted into the table space. In this paper, we focus our discussion on the efficient support for mode directed-tabling in the YapTab tabling system. We discuss 7 different mode operators and explain how we have extended and optimized YapTab's table space organization to support them. Initial experimental results show that our implementation compares favorably with the B-Prolog and XSB state-of-the-art Prolog tabling systems.

cs.PL↗