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

Agastya Kalra

dblp:194/3098 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
3since 2021 · last 2024
0009-0004-6288-3037ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 4 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 4 first-author · 3 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author · 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.

Artificial intelligence
4 papers
3D vision · 34% Probabilistic and Bayesian machine learning · 27% Image recognition and object detection · 21%
Computer graphics and multimedia
2 papers
Computational photography and imaging · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
object pose estimation
0.812024
Towards Co-Evaluation of Cameras, HDR, and Algorithms for Industrial-Grade 6DoF Pose Estimation · CVPR 2024
Computer vision › 3D vision
pose estimation
0.812024
Towards Co-Evaluation of Cameras, HDR, and Algorithms for Industrial-Grade 6DoF Pose Estimation · CVPR 2024
Computational photography and imaging
light field imaging
0.812024
A Plentoptic 3D Vision System · SIGGRAPH Asia 2024
Computer vision › Image recognition and object detection › object detection › rotation-aware object detection
rotation-invariant object detection
0.512021
Towards Rotation Invariance in Object Detection · ICCV 2021
Computer vision › Segmentation and scene understanding
instance segmentation
0.412020
Deep Polarization Cues for Transparent Object Segmentation · CVPR 2020
Computer vision › Segmentation and scene understanding › object segmentation
transparent object segmentation
0.412020
Deep Polarization Cues for Transparent Object Segmentation · CVPR 2020
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models
0.312018
Online Structure Learning for Feed-Forward and Recurrent Sum-Product Networks · NeurIPS 2018
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
structure learning
0.312018
Online Structure Learning for Feed-Forward and Recurrent Sum-Product Networks · NeurIPS 2018
Machine learning › Probabilistic and Bayesian machine learning › tractable probabilistic model
sum-product networks
0.312018
Online Structure Learning for Feed-Forward and Recurrent Sum-Product Networks · NeurIPS 2018
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference
tractable inference
0.312018
Online Structure Learning for Feed-Forward and Recurrent Sum-Product Networks · NeurIPS 2018
Computational photography and imaging
high dynamic range imaging
0.212024
Towards Co-Evaluation of Cameras, HDR, and Algorithms for Industrial-Grade 6DoF Pose Estimation · CVPR 2024
Computer vision › 3D vision
depth and reconstruction
0.112020
Deep Polarization Cues for Transparent Object Segmentation · CVPR 2020

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

structured light · 1.5polarization imaging · 1.5uncertainty loss · 0.5rotation augmentation · 0.5differentiable label approximation · 0.5polarization camera · 0.4deep learning · 0.4online structure learning · 0.3
YearPublicationVenuePosition
2024 Towards Co-Evaluation of Cameras, HDR, and Algorithms for Industrial-Grade 6DoF Pose Estimation
abstract
6DoF Pose estimation has been gaining increased importance in vision for over a decade, however it does not yet meet the reliability and accuracy standards for mass deployment in industrial robotics. To this effect, we present the Industrial Plenoptic Dataset (IPD): the first dataset for the co-evaluation of cameras, HDR, and algorithms targeted at reliable, high-accuracy industrial automation. Specifically, we capture 2,300 physical scenes of 20 industrial parts covering a 1m × 1m × 0.5m working volume, resulting in over 100,000 distinct object views. Each scene is captured with 13 well-calibrated multi-modal cameras including polarization and high-resolution structured light. In terms of lighting, we capture each scene at 4 exposures and in 3 challenging lighting conditions ranging from 100 lux to 100,000 lux. We also present, validate, and analyze robot consistency, an evaluation method targeted at scalable, high accuracy evaluation. We hope that vision systems that succeed on this dataset will have direct industry impact. The dataset and evaluation code are available at https://github.com/intrinsic-ai/ipd.
Agastya Kalra, Guy Stoppi, Dmitrii Marin, Vage Taamazyan, Aarrushi Shandilya, Rishav Agarwal, Anton Boykov, Tze Hao Chong, Michael Stark 0003
CVPR1
2024 A Plentoptic 3D Vision System
Agastya Kalra, Vage Taamazyan, Alberto Dall'olio, Raghav Khanna, Tomas Gerlich, Georgia Giannopolou, Guy Stoppi, Daniel Baxter, Abhijit Ghosh, Richard Szeliski, Kartik Venkataraman
SIGGRAPH Asia1
2021 Towards Rotation Invariance in Object Detection
abstract
Rotation augmentations generally improve a model’s in-variance/equivariance to rotation - except in object detection. In object detection the shape is not known, therefore rotation creates a label ambiguity. We show that the de-facto method for bounding box label rotation, the Largest Box Method, creates very large labels, leading to poor performance and in many cases worse performance than using no rotation at all. We propose a new method of rotation augmentation that can be implemented in a few lines of code. First, we create a differentiable approximation of label accuracy and show that axis-aligning the bounding box around an ellipse is optimal. We then introduce Rotation Uncertainty (RU) Loss, allowing the model to adapt to the uncertainty of the labels. On five different datasets (including COCO, PascalVOC, and Transparent Object Bin Picking), this approach improves the rotational invariance of both one-stage and two-stage architectures when measured with AP, AP50, and AP75.
Agastya Kalra, Guy Stoppi, Bradley Brown, Rishav Agarwal, Achuta Kadambi
ICCV1
2020 Deep Polarization Cues for Transparent Object Segmentation
abstract
Segmentation of transparent objects is a hard, open problem in computer vision. Transparent objects lack texture of their own, adopting instead the texture of scene background. This paper reframes the problem of transparent object segmentation into the realm of light polarization, i.e., the rotation of light waves. We use a polarization camera to capture multi-modal imagery and couple this with a unique deep learning backbone for processing polarization input data. Our method achieves instance segmentation on cluttered, transparent objects in various scene and background conditions, demonstrating an improvement over traditional image-based approaches. As an application we use this for robotic bin picking of transparent objects.
Agastya Kalra, Vage Taamazyan, Supreeth Krishna Rao, Kartik Venkataraman, Ramesh Raskar, Achuta Kadambi
CVPR1
2018 Online Structure Learning for Feed-Forward and Recurrent Sum-Product Networks
abstract
Sum-product networks have recently emerged as an attractive representation due to their dual view as a special type of deep neural network with clear semantics and a special type of probabilistic graphical model for which inference is always tractable. Those properties follow from some conditions (i.e., completeness and decomposability) that must be respected by the structure of the network. As a result, it is not easy to specify a valid sum-product network by hand and therefore structure learning techniques are typically used in practice. This paper describes a new online structure learning technique for feed-forward and recurrent SPNs. The algorithm is demonstrated on real-world datasets with continuous features for which it is not clear what network architecture might be best, including sequence datasets of varying length.
Agastya Kalra, Abdullah Rashwan, Wei-Shou Hsu, Pascal Poupart, Prashant Doshi, George Trimponias
NeurIPS1