Share Email Print

Journal of Electronic Imaging

Theoretic derivation of directed acyclic subgraph algorithm and comparisons with message passing algorithm
Author(s): Jeongmok Ha; Hong Jeong
Format Member Price Non-Member Price
PDF $20.00 $25.00

Paper Abstract

This study investigates the directed acyclic subgraph (DAS) algorithm, which is used to solve discrete labeling problems much more rapidly than other Markov-random-field-based inference methods but at a competitive accuracy. However, the mechanism by which the DAS algorithm simultaneously achieves competitive accuracy and fast execution speed, has not been elucidated by a theoretical derivation. We analyze the DAS algorithm by comparing it with a message passing algorithm. Graphical models, inference methods, and energy-minimization frameworks are compared between DAS and message passing algorithms. Moreover, the performances of DAS and other message passing methods [sum-product belief propagation (BP), max-product BP, and tree-reweighted message passing] are experimentally compared.

Paper Details

Date Published: 21 July 2016
PDF: 15 pages
J. Electron. Imaging. 25(4) 043016 doi: 10.1117/1.JEI.25.4.043016
Published in: Journal of Electronic Imaging Volume 25, Issue 4
Show Author Affiliations
Jeongmok Ha, Pohang Univ. of Science and Technology (Korea, Republic of)
Hong Jeong, Pohang Univ. of Science and Technology (Republic of Korea)

© SPIE. Terms of Use
Back to Top