paper-with-me

홈 › Papers

Detection Selection Algorithm: A Likelihood based Optimization Method to Perform Post Processing for Object Detection

2022-12-12 · Angzhi Fan, Benjamin Ticknor, Yali Amit

In object detection, post-processing methods like Non-maximum Suppression (NMS) are widely used. NMS can substantially reduce the number of false positive detections but may still keep some detections with low objectness scores. In order to find the exact number of objects and their labels in the image, we propose a post processing method called Detection Selection Algorithm (DSA) which is used after NMS or related methods. DSA greedily selects a subset of detected bounding boxes, together with full object reconstructions that give the interpretation of the whole image with highest likelihood, taking into account object occlusions. The algorithm consists of four components. First, we add an occlusion branch to Faster R-CNN to obtain occlusion relationships between objects. Second, we develop a single reconstruction algorithm which can reconstruct the whole appearance of an object given its visible part, based on the optimization of latent variables of a trained generative network which we call the decoder. Third, we propose a whole reconstruction algorithm which generates the joint reconstruction of all objects in a hypothesized interpretation, taking into account occlusion ordering. Finally we propose a greedy algorithm that incrementally adds or removes detections from a list to maximize the likelihood of the corresponding interpretation. DSA with NMS or Soft-NMS can achieve better results than NMS or Soft-NMS themselves, as is illustrated in our experiments on synthetic images with mutiple 3d objects.

📄 PDF Abstract BibTeX arXiv:2212.05706

Code (0)

등록된 구현이 없습니다.

Tasks

Objectobject-detectionObject Detection

Methods 이 논문이 사용한 방법론

Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
RoIPool 설명 없음
RPN A Region Proposal Network, or RPN, is a fully convolutional network that simultaneously predicts object bounds and objectness scores at each position. The RPN is trained…
Faster R-CNN Faster R-CNN is an object detection model that improves on Fast R-CNN by utilising a region proposal network…
Soft-NMS Non-maximum suppression is an integral part of the object detection pipeline. First, it sorts all detection boxes on the basis of their scores. The detection box $M$ with the…

Similar Papers 제목 키워드 기반

Knot Selection in Sparse Gaussian Processes

2020-02-21 · Nathaniel Garton, Jarad Niemi, Alicia Carriquiry

Knot-based, sparse Gaussian processes have enjoyed considerable success as scalable approximations to full Gaussian processes. Problems can occur, however, when knot selection is done by optimizing the marginal likelihoo…

Bayesian OptimizationGaussian Processes

On the safe use of prior densities for Bayesian model selection

2022-06-10 · F. Llorente, L. Martino, E. Curbelo, J. Lopez-Santiago 외

The application of Bayesian inference for the purpose of model selection is very popular nowadays. In this framework, models are compared through their marginal likelihoods, or their quotients, called Bayes factors. Howe…

Bayesian InferenceModel Selectionparameter estimation

Optimization Methods for Sparse Pseudo-Likelihood Graphical Model Selection

2014-09-12 · NeurIPS 2014 12 · Sang-Yun Oh, Onkar Dalal, Kshitij Khare, Bala Rajaratnam

Sparse high dimensional graphical model selection is a popular topic in contemporary machine learning. To this end, various useful approaches have been proposed in the context of $\ell_1$-penalized estimation in the Gaus…

BIG-bench Machine LearningModel Selection

Quantum Algorithm for Higher-Order Unconstrained Binary Optimization and MIMO Maximum Likelihood Detection

2022-05-31 · Masaya Norimoto, Ryuhei Mori, Naoki Ishikawa

In this paper, we propose a quantum algorithm that supports a real-valued higher-order unconstrained binary optimization (HUBO) problem. This algorithm is based on the Grover adaptive search that originally supported HUB…

Two provably consistent divide and conquer clustering algorithms for large networks

2017-08-18 · Soumendu Sundar Mukherjee, Purnamrita Sarkar, Peter J. Bickel

In this article, we advance divide-and-conquer strategies for solving the community detection problem in networks. We propose two algorithms which perform clustering on a number of small subgraphs and finally patches the…

ClusteringCommunity DetectionVocal Bursts Valence Prediction