Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Michele Sasdelli

dblp:198/1378 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
5since 2021 · last 2024
0000-0003-1021-6369ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 6 · 4 since 2021Artificial intelligence and machine learning · 5 · 4 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Mathematical optimization · 57% Quantum computing and quantum information · 43%
Artificial intelligence
1 paper
3D vision · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Emerging computing paradigms · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization › statistical estimation › regression
robust regression
0.812024
Robust Fitting on a Gate Quantum Computer · ECCV (1) 2024
Computer vision › 3D vision › geometric estimation
geometric model fitting
0.612022
A Hybrid Quantum-Classical Algorithm for Robust Fitting · CVPR 2022
Computer vision › 3D vision › geometric estimation › geometric model fitting
robust model fitting
0.612022
A Hybrid Quantum-Classical Algorithm for Robust Fitting · CVPR 2022
Quantum computing and quantum information › quantum algorithms
quantum-classical hybrid algorithm
0.612022
A Hybrid Quantum-Classical Algorithm for Robust Fitting · CVPR 2022
Emerging computing paradigms
quantum computer architecture
0.212024
Robust Fitting on a Gate Quantum Computer · ECCV (1) 2024

Methods — techniques the papers use, named apart from their topics

quantum computing · 1.5quantum annealing · 1.1integer programming · 1.1
YearPublicationVenuePosition
2024 Projected Stochastic Gradient Descent with Quantum Annealed Binary Gradients
Maximilian Krahn, Michele Sasdelli, Frances Fengyi Yang, Vladislav Golyanik, Juho Kannala, Tat-Jun Chin, Tolga Birdal
BMVC2
2024 Robust Fitting on a Gate Quantum Computer
Frances Fengyi Yang, Michele Sasdelli, Tat-Jun Chin
ECCV (1)2
2022 A Hybrid Quantum-Classical Algorithm for Robust Fitting
abstract
Fitting geometric models onto outlier contaminated data is provably intractable. Many computer vision systems rely on random sampling heuristics to solve robust fitting, which do not provide optimality guarantees and error bounds. It is therefore critical to develop novel approaches that can bridge the gap between exact solutions that are costly, and fast heuristics that offer no quality assurances. In this paper, we propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs and terminates with a global solution or an error bound. The combinatorial subproblems are amenable to a quantum annealer, which helps to tighten the bound efficiently. While our usage of quantum computing does not surmount the fundamental intractability of robust fitting, by providing error bounds our algorithm is a practical improvement over randomised heuristics. Moreover, our work represents a concrete application of quantum computing in computer vision. We present results obtained using an actual quantum computer (D-Wave Advantage) and via simulation11Source code: https://github.com/dadung/HQC-robust-fitting.
Anh-Dzung Doan, Michele Sasdelli, David Suter, Tat-Jun Chin
CVPR2
2022 Physical Adversarial Attacks on an Aerial Imagery Object Detector
abstract
Deep neural networks (DNNs) have become essential for processing the vast amounts of aerial imagery collected using earth-observing satellite platforms. However, DNNs are vulnerable towards adversarial examples, and it is expected that this weakness also plagues DNNs for aerial imagery. In this work, we demonstrate one of the first efforts on physical adversarial attacks on aerial imagery, whereby adversarial patches were optimised, fabricated and installed on or near target objects (cars) to significantly reduce the efficacy of an object detector applied on overhead images. Physical adversarial attacks on aerial images, particularly those captured from satellite platforms, are challenged by atmospheric factors (lighting, weather, seasons) and the distance between the observer and target. To investigate the effects of these challenges, we devised novel experiments and metrics to evaluate the efficacy of physical adversarial attacks against object detectors in aerial scenes. Our results indicate the palpable threat posed by physical adversarial attacks towards DNNs for processing satellite imagery1.
Andrew Du, Bo Chen 0009, Tat-Jun Chin, Yee Wei Law, Michele Sasdelli, Ramesh Rajasegaran, Dillon Campbell
WACV5
2021 LOW: Training deep neural networks by learning optimal sample weights
Carlos Santiago, Catarina Barata, Michele Sasdelli, Gustavo Carneiro 0001, Jacinto C. Nascimento
Pattern Recognit.3
2020 Augmentation Network for Generalised Zero-Shot Learning
Rafael Felix, Michele Sasdelli, Ian D. Reid 0001, Gustavo Carneiro 0001
ACCV (4)2
2019 Real-time Tracker with Fast Recovery from Target Loss
abstract
In this paper, we introduce a variation of a state-of-the-art real-time tracker (CFNet), which adds to the original algorithm robustness to target loss without a significant computational overhead. The new method is based on the assumption that the feature map can be used to estimate the tracking confidence more accurately. When the confidence is low, we avoid updating the object's position through the feature map; instead, the tracker passes to a single-frame failure mode, during which the patch's low-level visual content is used to swiftly update the object's position, before recovering from the target loss in the next frame. The experimental evidence provided by evaluating the method on several tracking datasets validates both the theoretical assumption that the feature map is associated to tracking confidence, and that the proposed implementation can achieve target recovery in multiple scenarios, without compromising the real-time performance.
Alessandro Bay, Panagiotis Sidiropoulos, Eduard Vazquez, Michele Sasdelli
ICASSP4