2014 IEEE Conference on Computer Vision and Pattern Recognition 2014
DOI: 10.1109/cvpr.2014.177
|View full text |Cite
|
Sign up to set email alerts
|

Higher-Order Clique Reduction without Auxiliary Variables

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
28
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
3
2
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 25 publications
(28 citation statements)
references
References 28 publications
0
28
0
Order By: Relevance
“…Some algorithms to convert the function of any order to that of the first order have been proposed [5,7]. This enables us to use any higher-order energy to describe more complicated conditions.…”
Section: Higher-order Energymentioning
confidence: 99%
See 1 more Smart Citation
“…Some algorithms to convert the function of any order to that of the first order have been proposed [5,7]. This enables us to use any higher-order energy to describe more complicated conditions.…”
Section: Higher-order Energymentioning
confidence: 99%
“…A class of the minimization problem can effectively solved by graph-cut based methods. Although the order of energy function in the class, which describes the degree of dependency among voxels, has been limited to 1, this limitation has been overcome in recent works [5,6,7] that convert a higher-order energy to the second-order one. A higher-order energy enables us to express complex constraints among multiple organs or widely spanning structure [8].…”
Section: Introductionmentioning
confidence: 99%
“…This allows reduction of higher order terms either by: A) addition of auxiliary variables (for example by reducing a triplet to three pairwise terms [11]; or B) by reconfiguration of the polynomial form of the MRF energy, until the high-order function can be replaced by a single quadratic [12]. We present results using the latter version, known as Excludable Local Configuration (ELC).…”
Section: Optimisationmentioning
confidence: 99%
“…In order to account for triplet terms we adopt the approach of [11,12]. This allows reduction of higher order terms either by: A) addition of auxiliary variables (for example by reducing a triplet to three pairwise terms [11]; or B) by reconfiguration of the polynomial form of the MRF energy, until the high-order function can be replaced by a single quadratic [12].…”
Section: Optimisationmentioning
confidence: 99%
“…Further, it is not possible to optimally weight isotropic and anisotropic distortions. We therefore required a method for considering higher-order deformations, through comparing displacements of triplets of points; for this we implemented a method for higher-order discrete optimisation through clique reduction (Ishikawa, 2009(Ishikawa, , 2014, which has already been successfully applied to 2D registration in (Glocker et al, 2010) A prototype of this framework proved fundamental to the methods used during developed of the HCP's multi-modal parcellation (Glasser et al, 2016b,a). For (Glasser et al, 2016a), we proposed an triplet-based angular deviation penalty, that penalised change in the angles of each triangular mesh face.…”
Section: Introductionmentioning
confidence: 99%