← Search

Anton Milan

9 accepted papers

2025

Kaputt: A Large-Scale Dataset for Visual Defect Detection

ICCV 2025poster

We present a novel large-scale dataset for defect detection in a logistics setting. Recent work on industrial anomaly detection has primarily focused on manufacturing scenarios with highly controlled poses and a limited number of object categories. Existing benchmarks like MVTec-AD (Bergmann et al.,…

Cited by 0SourcePDFScholar
2018

PoseTrack: A Benchmark for Human Pose Estimation and Tracking

CVPR 2018poster

Existing systems for video-based pose estimation and tracking struggle to perform well on realistic videos with multiple people and often fail to output body-pose trajectories consistent over time. To address this shortcoming this paper introduces PoseTrack which is a new large-scale benchmark for v…

Cited by 621SourcePDFScholar
2017

DeepSetNet: Predicting Sets With Deep Neural Networks

ICCV 2017spotlight

This paper addresses the task of set prediction using deep learning. This is important because the output of many computer vision tasks, including image tagging and object detection, are naturally expressed as sets of entities rather than vectors. As opposed to a vector, the size of a set is not fix…

Cited by 56PDFScholar
2017

NimbRo picking: Versatile part handling for warehouse automation

ICRA 2017poster

Part handling in warehouse automation is challenging if a large variety of items must be accommodated and items are stored in unordered piles. To foster research in this domain, Amazon holds picking challenges. We present our system which achieved second and third place in the Amazon Picking Challen…

Cited by 108SourceScholar
2017

RefineNet: Multi-Path Refinement Networks for High-Resolution Semantic Segmentation

CVPR 2017poster

Recently, very deep convolutional neural networks (CNNs) have shown outstanding performance in object recognition and have also been the first choice for dense classification problems such as semantic segmentation. However, repeated subsampling operations like pooling or convolution striding in deep…

Cited by 4039PDFcodeScholar
2016

Joint Probabilistic Matching Using m-Best Solutions

CVPR 2016oral

Matching between two sets of objects is typically approached by finding the object pairs that collectively maximize the joint matching score. In this paper, we argue that this single solution does not necessarily lead to the optimal matching accuracy and that general one-to-one assignment problems c…

Cited by 41PDFScholar
2015

Joint Probabilistic Data Association Revisited

ICCV 2015poster

In this paper, we revisit the joint probabilistic data association (JPDA) technique and propose a novel solution based on recent developments in finding the m-best solutions to an integer linear program. The key advantage of this approach is that it makes JPDA computationally tractable in applicatio…

Cited by 454PDFcodeScholar