Diverse M-Best Solutions by Dynamic Programming

03/15/2018
by   Carsten Haubold, et al.
0

Many computer vision pipelines involve dynamic programming primitives such as finding a shortest path or the minimum energy solution in a tree-shaped probabilistic graphical model. In such cases, extracting not merely the best, but the set of M-best solutions is useful to generate a rich collection of candidate proposals that can be used in downstream processing. In this work, we show how M-best solutions of tree-shaped graphical models can be obtained by dynamic programming on a special graph with M layers. The proposed multi-layer concept is optimal for searching M-best solutions, and so flexible that it can also approximate M-best diverse solutions. We illustrate the usefulness with applications to object detection, panorama stitching and centerline extraction. Note: We have observed that an assumption in section 4 of our paper is not always fulfilled, see the attached corrigendum for details.

READ FULL TEXT

page 9

page 10

page 16

research
06/28/2023

New Dynamic Programming Algorithm for the Multiobjective Minimum Spanning Tree Problem

The Multiobjective Minimum Spanning Tree (MO-MST) problem is a variant o...
research
09/11/2018

Massively Parallel Dynamic Programming on Trees

Dynamic programming is a powerful technique that is, unfortunately, ofte...
research
04/29/2019

Composing dynamic programming tree-decomposition-based algorithms

Given two integers ℓ and p as well as ℓ graph classes H_1,...,H_ℓ, the p...
research
03/25/2023

Orbits, schemes and dynamic programming procedures for the TSP 4-OPT neighborhood

We discuss the way to group all 25 possible 4-OPT moves into 7 orbits of...
research
03/18/2019

Diversity in Combinatorial Optimization

When modeling an application of practical relevance as an instance of a ...
research
03/07/2019

Using DP Towards A Shortest Path Problem-Related Application

The detection of curved lanes is still challenging for autonomous drivin...
research
03/10/2021

A Lattice Linear Predicate Parallel Algorithm for the Dynamic Programming Problems

It has been shown that the parallel Lattice Linear Predicate (LLP) algor...

Please sign up or login with your details

Forgot password? Click here to reset