# Diverse M-Best Solutions by Dynamic Programming

Source: [Diverse M-Best Solutions by Dynamic Programming](<https://www.sota2.com/research/paper/68fa64241e209131cea02cb9>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T20:57:11.341Z

Authors: Carsten Haubold, Virginie Uhlmann, Michael Unser, Fred A. Hamprecht

Published: 2018-03-15T13:52:01.000Z

## Abstract

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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1803.05748>)

[PDF](<https://arxiv.org/pdf/1803.05748.pdf>)
