Antonio Robles-Kelly
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Antonio Robles-Kelly has a total of 176 co-authors. Here are the top co-authors by number of shared publications:
- Edwin Robert Hancock
Department of Computer Science, University of York, York, U.K.
39 shared publications - Jun Zhou
Griffith University
16 shared publications Cong Phuoc Huynh
12 shared publications- Xuequan Lu
The University of Western Australia, Perth, Australia
9 shared publications - Wei Luo
Deakin University
8 shared publications Zhouyu Fu
8 shared publications
Latest Publications
- Open Access
ConSeg: Contextual Backdoor Attack Against Semantic Segmentation
Despite significant advancements in computer vision, semantic segmentation models may be susceptible to backdoor attacks. These attacks, involving hidden triggers, aim to cause the models to misclassify instances of the victim class as the target class when triggers are present, posing serious threats to the reliability of these models. To further explore the field of backdoor attacks against semantic segmentation, in this paper, we propose a simple yet effective backdoor attack called Contextual Segmentation Backdoor Attack (ConSeg). ConSeg leverages the contextual information inherent in semantic segmentation models to enhance backdoor performance. Our method is motivated by an intriguing observation, i.e., when the target class is set as the `co-occurring' class of the victim class, the victim class can be more easily `mis-segmented'. Building upon this insight, ConSeg mimics the contextual information of the target class and rebuilds it in the victim region to establish the contextual relationship between the target class and the victim class, making the attack easier. Our experiments reveal that ConSeg achieves improvements in Attack Success Rate (ASR) with increases of 15.55\%, compared to existing methods, while exhibiting resilience against state-of-the-art backdoor defenses.
Open AccessConSeg: Contextual Backdoor Attack Against Semantic Segmentation
Despite significant advancements in computer vision, semantic segmentation models may be susceptible to backdoor attacks. These attacks, involving hidden triggers, aim to cause the models to misclassify instances of the victim class as the target class when triggers are present, posing serious threats to the reliability of these models. To further explore the field of backdoor attacks against semantic segmentation, in this paper, we propose a simple yet effective backdoor attack called Contextual Segmentation Backdoor Attack (ConSeg). ConSeg leverages the contextual information inherent in semantic segmentation models to enhance backdoor performance. Our method is motivated by an intriguing observation, i.e., when the target class is set as the `co-occurring' class of the victim class, the victim class can be more easily `mis-segmented'. Building upon this insight, ConSeg mimics the contextual information of the target class and rebuilds it in the victim region to establish the contextual relationship between the target class and the victim class, making the attack easier. Our experiments reveal that ConSeg achieves improvements in Attack Success Rate (ASR) with increases of 15.55\%, compared to existing methods, while exhibiting resilience against state-of-the-art backdoor defenses.
- Open Access
- 3 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Point Cloud Normal Estimation via Representation Learning on Height Maps
- 3 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessPoint Cloud Normal Estimation via Representation Learning on Height Maps
- Open Access
- 21 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 5370-5374
Covid19-twitter: A Twitter-based Dataset for Discourse Analysis in Sentence-level Sentiment Classification
For the sentence-level sentiment classification task, learning Contrastive Discourse Relations (CDRs) like a-but-b is difficult for Deep Neural Networks (DNNs) via purely data-driven training. Several methods exist in the literature for dissemination of CDR information with DNNs, but there is no dedicated dataset available to effectively test their dissemination performance. In this paper, we propose a new large-scale dataset for this purpose called Covid19-twitter, which contains around 100k tweets symmetrically divided into various categories. Instead of manual annotation, we used a combination of an Emoji analysis and a lexicon-based tool called Valence Aware Dictionary and sEntiment Reasoner (VADER) to perform automatic labelling of the tweets, while also ensuring high accuracy of the annotation process through some quality checks. We also provide benchmark performances of several baselines on our dataset for both the sentiment classification and CDR dissemination tasks. We believe that this dataset will be valuable for discourse analysis research in sentiment classification.
- 21 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 5370-5374
Open AccessCovid19-twitter: A Twitter-based Dataset for Discourse Analysis in Sentence-level Sentiment Classification
For the sentence-level sentiment classification task, learning Contrastive Discourse Relations (CDRs) like a-but-b is difficult for Deep Neural Networks (DNNs) via purely data-driven training. Several methods exist in the literature for dissemination of CDR information with DNNs, but there is no dedicated dataset available to effectively test their dissemination performance. In this paper, we propose a new large-scale dataset for this purpose called Covid19-twitter, which contains around 100k tweets symmetrically divided into various categories. Instead of manual annotation, we used a combination of an Emoji analysis and a lexicon-based tool called Valence Aware Dictionary and sEntiment Reasoner (VADER) to perform automatic labelling of the tweets, while also ensuring high accuracy of the annotation process through some quality checks. We also provide benchmark performances of several baselines on our dataset for both the sentiment classification and CDR dissemination tasks. We believe that this dataset will be valuable for discourse analysis research in sentiment classification.
- Open Access
StraightPCF: Straight Point Cloud Filtering
Point cloud filtering is a fundamental 3D vision task, which aims to remove noise while recovering the underlying clean surfaces. State-of-the-art methods remove noise by moving noisy points along stochastic trajectories to the clean surfaces. These methods often require regularization within the training objective and/or during post-processing, to ensure fidelity. In this paper, we introduce StraightPCF, a new deep learning based method for point cloud filtering. It works by moving noisy points along straight paths, thus reducing discretization errors while ensuring faster convergence to the clean surfaces. We model noisy patches as intermediate states between high noise patch variants and their clean counterparts, and design the VelocityModule to infer a constant flow velocity from the former to the latter. This constant flow leads to straight filtering trajectories. In addition, we introduce a DistanceModule that scales the straight trajectory using an estimated distance scalar to attain convergence near the clean surface. Our network is lightweight and only has $\sim530K$ parameters, being 17% of IterativePFN (a most recent point cloud filtering network). Extensive experiments on both synthetic and real-world data show our method achieves state-of-the-art results. Our method also demonstrates nice distributions of filtered points without the need for regularization. The implementation code can be found at: https://github.com/ddsediri/StraightPCF.Open AccessStraightPCF: Straight Point Cloud Filtering
Point cloud filtering is a fundamental 3D vision task, which aims to remove noise while recovering the underlying clean surfaces. State-of-the-art methods remove noise by moving noisy points along stochastic trajectories to the clean surfaces. These methods often require regularization within the training objective and/or during post-processing, to ensure fidelity. In this paper, we introduce StraightPCF, a new deep learning based method for point cloud filtering. It works by moving noisy points along straight paths, thus reducing discretization errors while ensuring faster convergence to the clean surfaces. We model noisy patches as intermediate states between high noise patch variants and their clean counterparts, and design the VelocityModule to infer a constant flow velocity from the former to the latter. This constant flow leads to straight filtering trajectories. In addition, we introduce a DistanceModule that scales the straight trajectory using an estimated distance scalar to attain convergence near the clean surface. Our network is lightweight and only has $\sim530K$ parameters, being 17% of IterativePFN (a most recent point cloud filtering network). Extensive experiments on both synthetic and real-world data show our method achieves state-of-the-art results. Our method also demonstrates nice distributions of filtered points without the need for regularization. The implementation code can be found at: https://github.com/ddsediri/StraightPCF. - Open Access
Deep Point Cloud Normal Estimation via Triplet Learning
Normal estimation on 3D point clouds is a fundamental problem in 3D vision and graphics. Current methods often show limited accuracy in predicting normals at sharp features (e.g., edges and corners) and less robustness to noise. In this paper, we propose a novel normal estimation method for point clouds. It consists of two phases: (a) feature encoding which learns representations of local patches, and (b) normal estimation that takes the learned representation as input and regresses the normal vector. We are motivated that local patches on isotropic and anisotropic surfaces have similar or distinct normals, and that separable features or representations can be learned to facilitate normal estimation. To realise this, we first construct triplets of local patches on 3D point cloud data, and design a triplet network with a triplet loss for feature encoding. We then design a simple network with several MLPs and a loss function to regress the normal vector. Despite having a smaller network size compared to most other methods, experimental results show that our method preserves sharp features and achieves better normal estimation results on CAD-like shapes.
Open AccessDeep Point Cloud Normal Estimation via Triplet Learning
Normal estimation on 3D point clouds is a fundamental problem in 3D vision and graphics. Current methods often show limited accuracy in predicting normals at sharp features (e.g., edges and corners) and less robustness to noise. In this paper, we propose a novel normal estimation method for point clouds. It consists of two phases: (a) feature encoding which learns representations of local patches, and (b) normal estimation that takes the learned representation as input and regresses the normal vector. We are motivated that local patches on isotropic and anisotropic surfaces have similar or distinct normals, and that separable features or representations can be learned to facilitate normal estimation. To realise this, we first construct triplets of local patches on 3D point cloud data, and design a triplet network with a triplet loss for feature encoding. We then design a simple network with several MLPs and a loss function to regress the normal vector. Despite having a smaller network size compared to most other methods, experimental results show that our method preserves sharp features and achieves better normal estimation results on CAD-like shapes.
- 28 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 30, 478-485
Robust quantification of prediction uncertainty by inducing heterogeneity in deep ensembles
Deep ensemble models have garnered attention for their capacity to yield robust predictions along with well-calibrated uncertainty estimates. Empirical evidence suggests that augmenting the number of models within deep ensembles fosters greater diversity in the functional space, enabling the exploration of multiple local optima effectively. This leads to more robust uncertainty estimates in the model. In this paper, we introduce a novel methodology to substantially enhance model diversity by inducing model heterogeneity through controlled perturbation of input images, thereby de-correlating individual models based on their local bias. Drawing inspiration from the bias-variance trade-off, our approach incorporates pre-generated masks during the training process to further refine model performance. To validate the efficacy of our technique in providing more robust estimates under dataset shift, we evaluate model diversity and predictive uncertainty on test samples from both familiar and unfamiliar distributions. Our results demonstrate that our proposed method outperforms recent approaches in detecting out-of-distribution samples, establishing its superiority within the existing literature.
- 28 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 30, 478-485
Robust quantification of prediction uncertainty by inducing heterogeneity in deep ensembles
Deep ensemble models have garnered attention for their capacity to yield robust predictions along with well-calibrated uncertainty estimates. Empirical evidence suggests that augmenting the number of models within deep ensembles fosters greater diversity in the functional space, enabling the exploration of multiple local optima effectively. This leads to more robust uncertainty estimates in the model. In this paper, we introduce a novel methodology to substantially enhance model diversity by inducing model heterogeneity through controlled perturbation of input images, thereby de-correlating individual models based on their local bias. Drawing inspiration from the bias-variance trade-off, our approach incorporates pre-generated masks during the training process to further refine model performance. To validate the efficacy of our technique in providing more robust estimates under dataset shift, we evaluate model diversity and predictive uncertainty on test samples from both familiar and unfamiliar distributions. Our results demonstrate that our proposed method outperforms recent approaches in detecting out-of-distribution samples, establishing its superiority within the existing literature.
- 28 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 325-331
A Bottom-Up Capsule Network for Hierarchical Image Classification
Hierarchical image classification is an arduous task in deep learning and computer vision. It requires classifying multiple image classes following a taxonomy or data hierarchy. This paper introduces a bottom-up hierarchical capsule network (BUH-CapsNet) designed to address hierarchical multi-label classification. The hierarchical structure of BUH-CapsNet allows it to build a tree-like structure for classification problems, making use of the data hierarchy. This structure enables the network to learn more complex relationships in the taxonomy by balancing the hierarchical levels and following the fine-to-coarse paradigm, leading to more accurate classification results. Furthermore, the bottom-up architecture of the BUH-CapsNet enforces hierarchical consistency, using the hierarchical structure of the datasets. We trained our BUH-CapsNet considering the hierarchical level weights that keep a balance between the levels. Experiments on six widely available datasets show that BUH-CapsNet achieves better results than existing multi-label classification methods and performs better when handling hierarchical labels.
- 28 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 325-331
A Bottom-Up Capsule Network for Hierarchical Image Classification
Hierarchical image classification is an arduous task in deep learning and computer vision. It requires classifying multiple image classes following a taxonomy or data hierarchy. This paper introduces a bottom-up hierarchical capsule network (BUH-CapsNet) designed to address hierarchical multi-label classification. The hierarchical structure of BUH-CapsNet allows it to build a tree-like structure for classification problems, making use of the data hierarchy. This structure enables the network to learn more complex relationships in the taxonomy by balancing the hierarchical levels and following the fine-to-coarse paradigm, leading to more accurate classification results. Furthermore, the bottom-up architecture of the BUH-CapsNet enforces hierarchical consistency, using the hierarchical structure of the datasets. We trained our BUH-CapsNet considering the hierarchical level weights that keep a balance between the levels. Experiments on six widely available datasets show that BUH-CapsNet achieves better results than existing multi-label classification methods and performs better when handling hierarchical labels.
- 5 November 2023
- Published by Springer Nature
- p. 408-422
A Hessian-Based Federated Learning Approach to Tackle Statistical Heterogeneity
- 5 November 2023
- Published by Springer Nature
- p. 408-422
A Hessian-Based Federated Learning Approach to Tackle Statistical Heterogeneity
- Open Access
- 30 August 2023
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 83 (9) , 27193-27215
Single-stage object detector with attention mechanism for squamous cell carcinoma feature detection using histopathological images
Squamous cell carcinoma is the most common type of cancer that occurs in squamous cells of epithelial tissue. Histopathological evaluation of tissue samples is the gold standard approach used for carcinoma diagnosis. SCC detection based on various histopathological features often employs traditional machine learning approaches or pixel-based deep CNN models. This study aims to detect keratin pearl, the most prominent SCC feature, by implementing RetinaNet one-stage object detector. Further, we enhance the model performance by incorporating an attention module. The proposed method is more efficient in detection of small keratin pearls. This is the first work detecting keratin pearl resorting to the object detection technique to the extent of our knowledge. We conducted a comprehensive assessment of the model both quantitatively and qualitatively. The experimental results demonstrate that the proposed approach enhanced the mAP by about 4% compared to default RetinaNet model.
- 30 August 2023
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 83 (9) , 27193-27215
Open AccessSingle-stage object detector with attention mechanism for squamous cell carcinoma feature detection using histopathological images
Squamous cell carcinoma is the most common type of cancer that occurs in squamous cells of epithelial tissue. Histopathological evaluation of tissue samples is the gold standard approach used for carcinoma diagnosis. SCC detection based on various histopathological features often employs traditional machine learning approaches or pixel-based deep CNN models. This study aims to detect keratin pearl, the most prominent SCC feature, by implementing RetinaNet one-stage object detector. Further, we enhance the model performance by incorporating an attention module. The proposed method is more efficient in detection of small keratin pearls. This is the first work detecting keratin pearl resorting to the object detection technique to the extent of our knowledge. We conducted a comprehensive assessment of the model both quantitatively and qualitatively. The experimental results demonstrate that the proposed approach enhanced the mAP by about 4% compared to default RetinaNet model.