Theoretic derivation of directed acyclic subgraph algorithm and comparisons with message passing algorithm
SCIE
SCOPUS
- Title
- Theoretic derivation of directed acyclic subgraph algorithm and comparisons with message passing algorithm
- Authors
- Ha, J; Jeong, H
- Date Issued
- 2016-07
- Publisher
- SPIE
- 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. (C) 2016 SPIE and IS&T
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/37519
- DOI
- 10.1117/1.JEI.25.4.043016
- ISSN
- 1017-9909
- Article Type
- Article
- Citation
- Journal of Electronic Imaging, vol. 25, no. 4, 2016-07
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.