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

Hector Basevi

dblp:190/2115 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
4since 2021 · last 2024
0009-0008-6910-8024ORCID · corroborated

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

Artificial intelligence and machine learning · 5 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 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.

Computer graphics and multimedia
1 paper
Image and video processing · 61% Computational photography and imaging · 39%
Artificial intelligence
1 paper
3D vision · 87% Reinforcement learning · 13%

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

TopicWeightPapersLastEvidence papers
Image and video processing › image restoration
denoising
0.812024
bit2bit: 1-bit quanta video reconstruction via self-supervised photon prediction · NeurIPS 2024
Image and video processing › image restoration › image denoising › non-gaussian noise removal
poisson noise removal
0.812024
bit2bit: 1-bit quanta video reconstruction via self-supervised photon prediction · NeurIPS 2024
Computational photography and imaging
single-photon imaging
0.812024
bit2bit: 1-bit quanta video reconstruction via self-supervised photon prediction · NeurIPS 2024
Computer vision › 3D vision › 3d scene understanding
3d scene parsing
0.312018
Learning to Exploit Stability for 3D Scene Parsing · NeurIPS 2018
Computer vision › 3D vision › 3d scene understanding › physical scene understanding
physics-based scene understanding
0.312018
Learning to Exploit Stability for 3D Scene Parsing · NeurIPS 2018
Computational photography and imaging › event-based vision
high-speed video reconstruction
0.212024
bit2bit: 1-bit quanta video reconstruction via self-supervised photon prediction · NeurIPS 2024
Machine learning › Reinforcement learning › policy optimization › policy gradient
REINFORCE
0.112018
Learning to Exploit Stability for 3D Scene Parsing · NeurIPS 2018

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

self-supervised learning · 0.8masked loss · 0.8bernoulli lattice process · 0.8synthetic-to-real transfer · 0.3physics engine · 0.3REINFORCE · 0.3
YearPublicationVenuePosition
2024 bit2bit: 1-bit quanta video reconstruction via self-supervised photon prediction
abstract
Quanta image sensors, such as SPAD arrays, are an emerging sensor technology, producing 1-bit arrays representing photon detection events over exposures as short as a few nanoseconds. In practice, raw data are post-processed using heavy spatiotemporal binning to create more useful and interpretable images at the cost of degrading spatiotemporal resolution. In this work, we propose bit2bit, a new method for reconstructing high-quality image stacks at the original spatiotemporal resolution from sparse binary quanta image data. Inspired by recent work on Poisson denoising, we developed an algorithm that creates a dense image sequence from sparse binary photon data by predicting the photon arrival location probability distribution. However, due to the binary nature of the data, we show that the assumption of a Poisson distribution is inadequate. Instead, we model the process with a Bernoulli lattice process from the truncated Poisson. This leads to the proposal of a novel self-supervised solution based on a masked loss function. We evaluate our method using both simulated and real data. On simulated data from a conventional video, we achieve 34.35 mean PSNR with extremely photon-sparse binary input (<0.06 photons per pixel per frame). We also present a novel dataset containing a wide range of real SPAD high-speed videos under various challenging imaging conditions. The scenes cover strong/weak ambient light, strong motion, ultra-fast events, etc., which will be made available to the community, on which we demonstrate the promise of our approach. Both reconstruction quality and throughput substantially surpass the state-of-the-art methods (e.g., Quanta Burst Photography (QBP)). Our approach significantly enhances the visualization and usability of the data, enabling the application of existing analysis techniques.
Yehe Liu, Alexander Krull, Hector Basevi, Ales Leonardis, Michael W. Jenkins
NeurIPS3
2024 Image Denoising and the Generative Accumulation of Photons
abstract
We present a fresh perspective on shot noise corrupted images and noise removal. By viewing image formation as the sequential accumulation of photons on a detector grid, we show that a network trained to predict where the next photon could arrive is in fact solving the minimum mean square error (MMSE) denoising task. This new perspective allows us to make three contributions: i. We present a new strategy for self-supervised denoising, ii. We present a new method for sampling from the posterior of possible solutions by iteratively sampling and adding small numbers of photons to the image. iii. We derive a full generative model by starting this process from an empty canvas. We call this approach generative accumulation of photons (GAP). We evaluate our method quantitatively and qualitatively on 4 new fluorescence microscopy datasets, which will be made available to the community. We find that it outperforms its baselines or performs on-par.
Alexander Krull, Hector Basevi, Benjamin Salmon, Andre Zeug, Franziska Müller 0004, Samuel Tonks, Leela Muppala, Ales Leonardis
WACV2
2022 Imagining Hidden Supporting Objects using Volumetric Conditional GANs and Differentiable Stability Scores
Hector Basevi, Ales Leonardis
BMVC1
2022 Conditional Patch-Based Domain Randomization: Improving Texture Domain Randomization Using Natural Image Patches
abstract
Using Domain Randomized synthetic data for training deep learning systems is a promising approach for addressing the data and the labeling requirements for supervised techniques to bridge the gap between simulation and the real world. We propose a novel approach for generating and applying class-specific Domain Randomization textures by using randomly cropped image patches from real-world data. In evaluation against the current Domain Randomization texture application techniques, our approach outperforms the highest performing technique by 4.94 AP and 6.71 AP when solving object detection and semantic segmentation tasks on the YCB-M [1] real-world robotics dataset. Our approach is a fast and inexpensive way of generating Domain Randomized textures while avoiding the need to handcraft texture distributions currently being used.
Mohammad Ani, Hector Basevi, Ales Leonardis
IROS2
2020 Quantifying the Use of Domain Randomization
abstract
Synthetic image generation provides the ability to efficiently produce large quantities of labeled data, which addresses both the data volume requirements of state-of-the-art vision systems and the expense of manually labeling data. However, systems trained on synthetic data typically under-perform systems trained on realistic data due to mismatch between the synthetic and realistic data distributions. Domain Randomization (DR) is a method of broadening a synthetic data distribution to encompass a realistic data distribution and provides better performance when the exact characteristics of the realistic data distribution are not known or cannot be simulated. However, there is no consensus in the literature on the best method of performing DR. We propose a novel method of ranking DR methods by directly measuring the difference between realistic and DR data distributions. This avoids the need to measure task-specific performance and the associated expense of training and evaluation. We compare different methods for measuring distribution differences, including the Wasserstein and Fréchet Inception distances. We also examine the effect of performing this evaluation directly on images and features generated by an image classification backbone. Finally, we show that the ranking generated by our method is reflected in actual task performance.
Mohammad Ani, Hector Basevi, Ales Leonardis
ICPR2
2020 PointPoseNet: Point Pose Network for Robust 6D Object Pose Estimation
abstract
In this paper, we propose a novel pipeline to estimate 6D object pose from RGB-D images of known objects present in complex scenes. The pipeline directly operates on raw point clouds extracted from RGB-D scans. Specifically, our method takes the point cloud as input and regresses the point-wise unit vectors pointing to the 3D keypoints. We then use these vectors to generate keypoint hypotheses from which the 6D object pose hypotheses are computed. Finally, we select the best 6D object pose from the hypotheses based on a proposed scoring mechanism with geometry constraints. Extensive experiments show that the proposed method is robust against the variety in object shape and appearance as well as occlusions between objects, and that our method outperforms the state-of-the-art methods on the LINEMOD and Occlusion LINEMOD datasets.
Wei Chen 0092, Jinming Duan 0001, Hector Basevi, Hyung Jin Chang, Ales Leonardis
WACV3
2018 Learning to Exploit Stability for 3D Scene Parsing
abstract
Human scene understanding uses a variety of visual and non-visual cues to perform inference on object types, poses, and relations. Physics is a rich and universal cue which we exploit to enhance scene understanding. We integrate the physical cue of stability into the learning process using a REINFORCE approach coupled to a physics engine, and apply this to the problem of producing the 3D bounding boxes and poses of objects in a scene. We first show that applying physics supervision to an existing scene understanding model increases performance, produces more stable predictions, and allows training to an equivalent performance level with fewer annotated training examples. We then present a novel architecture for 3D scene parsing named Prim R-CNN, learning to predict bounding boxes as well as their 3D size, translation, and rotation. With physics supervision, Prim R-CNN outperforms existing scene understanding approaches on this problem. Finally, we show that applying physics supervision on unlabeled real images improves real domain transfer of models training on synthetic data.
Yilun Du, Hector Basevi, Ales Leonardis, William T. Freeman, Josh Tenenbaum, Jiajun Wu 0001
NeurIPS3