2014
Authors
Pernes, D; Cardoso, JS; Oliveira, HP;
Publication
2014 IEEE INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICINE (BIBM)
Abstract
Breast cancer is one of the most mediated malignant diseases, because of its high incidence and prevalence, but principally due to its physical and psychological invasiveness. Surgeons and patients have often many options to consider for undergoing the procedure. The ability to visualise the potential outcomes of the surgery and make decisions on their surgical options is, therefore, very important for patients and surgeons. In this paper we investigate the fitting of a 3d point cloud of the breast to a parametric model usable in surgery planning, obtaining very promising results with real data. © 2014 IEEE.
2019
Authors
Pernes, D; Fernande, K; Cardoso, JS;
Publication
APPLIED SCIENCES-BASEL
Abstract
Several phenomena are represented by directional-angular or periodic-data; from time references on the calendar to geographical coordinates. These values are usually represented as real values restricted to a given range (e.g., [0, 2p)), hiding the real nature of this information. In order to handle these variables properly in supervised classification tasks, alternatives to the naive Bayes classifier and logistic regression were proposed in the past. In this work, we propose directional-aware support vector machines. We address several realizations of the proposed models, studying their kernelized counterparts and their expressiveness. Finally, we validate the performance of the proposed Support Vector Machines (SVMs) against the directional naive Bayes and directional logistic regression with real data, obtaining competitive results. © 2019 by the authors.
2021
Authors
Ferreira, PM; Pernes, D; Rebelo, A; Cardoso, JS;
Publication
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS
Abstract
2019
Authors
Perues, D; Cardoso, JS;
Publication
2019 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN)
Abstract
We propose a framework to model the distribution of sequential data coming from a set of entities connected in a graph with a known topology. The method is based on a mixture of shared hidden Markov models (HMMs), which are jointly trained in order to exploit the knowledge of the graph structure and in such a way that the obtained mixtures tend to be sparse. Experiments in different application domains demonstrate the effectiveness and versatility of the method. © 2019 IEEE.
2019
Authors
Ferreira, PM; Sequeira, AF; Pernes, D; Rebelo, A; Cardoso, JS;
Publication
2019 International Conference of the Biometrics Special Interest Group, BIOSIG 2019 - Proceedings
Abstract
Despite the high performance of current presentation attack detection (PAD) methods, the robustness to unseen attacks is still an under addressed challenge. This work approaches the problem by enforcing the learning of the bona fide presentations while making the model less dependent on the presentation attack instrument species (PAIS). The proposed model comprises an encoder, mapping from input features to latent representations, and two classifiers operating on these underlying representations: (i) the task-classifier, for predicting the class labels (as bona fide or attack); and (ii) the species-classifier, for predicting the PAIS. In the learning stage, the encoder is trained to help the task-classifier while trying to fool the species-classifier. Plus, an additional training objective enforcing the similarity of the latent distributions of different species is added leading to a 'PAI-species'-independent model. The experimental results demonstrated that the proposed regularisation strategies equipped the neural network with increased PAD robustness. The adversarial model obtained better loss and accuracy as well as improved error rates in the detection of attack and bona fide presentations. © 2019 Gesellschaft fuer Informatik.
2020
Authors
Ferreira, PM; Pernes, D; Rebelo, A; Cardoso, JS;
Publication
TWELFTH INTERNATIONAL CONFERENCE ON MACHINE VISION (ICMV 2019)
Abstract
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.