2013
DOI: 10.1007/s00138-013-0497-x
|View full text |Cite
|
Sign up to set email alerts
|

3D segmentation of abdominal CT imagery with graphical models, conditional random fields and learning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
4
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 23 publications
(5 citation statements)
references
References 37 publications
0
4
0
Order By: Relevance
“…Whereas GPU greatly speeds up tasks that involve many relatively small computations, CPU can perform more complex tasks that require larger memory (Hockney and Jesshope (1981); Owens et al (2008); Yu et al (2014)). Another technique is to replace the Gibbs sampler by a faster algorithm for calculating MAP (maximum a posteriori) estimates of the states; see Greig, Porteous and Seheult (1989), Boykov and Kolmogorov (2004), Ravikumar and Lafferty (2006), Kumar and Zilberstein (2011), and Bhole et al (2014). For example, Greig, Porteous and Seheult (1989), Boykov and Kolmogorov (2004) and Bhole et al (2014) reformulate MAP estimation as the solution to a minimum-cut/maximum-flow algorithm on a graph, whose computational complexity in computing the MAP estimates of the states in the H n K n blocks in Section 3 is O ( n 4 / (H n K n ) 3 ) .…”
Section: Discussionmentioning
confidence: 99%
“…Whereas GPU greatly speeds up tasks that involve many relatively small computations, CPU can perform more complex tasks that require larger memory (Hockney and Jesshope (1981); Owens et al (2008); Yu et al (2014)). Another technique is to replace the Gibbs sampler by a faster algorithm for calculating MAP (maximum a posteriori) estimates of the states; see Greig, Porteous and Seheult (1989), Boykov and Kolmogorov (2004), Ravikumar and Lafferty (2006), Kumar and Zilberstein (2011), and Bhole et al (2014). For example, Greig, Porteous and Seheult (1989), Boykov and Kolmogorov (2004) and Bhole et al (2014) reformulate MAP estimation as the solution to a minimum-cut/maximum-flow algorithm on a graph, whose computational complexity in computing the MAP estimates of the states in the H n K n blocks in Section 3 is O ( n 4 / (H n K n ) 3 ) .…”
Section: Discussionmentioning
confidence: 99%
“…An effective strategy to bring high-level information into graph-based models has been the incorporation of probabilistic atlases (Freedman and Zhang, 2005;Linguraru et al, 2012;Park et al, 2010;Song et al, 2006). Bhole et al (Bhole et al, 2014) used Gaussian mixture models (GMMs) to encode high level semantic information into different graph-based models, including MRFs, Conditional random fields (CRFs) and kernel CRFs.. In (Linguraru et al, 2012), Linguraru et al used abdominal probabilistic atlases and Parzen shape windows (Parzen, 1962) to encode, respectively, spatial and shape constraints directly into the 4D graph-cut-based segmentation framework, as new terms of the energy function.…”
Section: Graph-based Modelsmentioning
confidence: 99%
“…There has been a large amount of interest in applying CRFs to many different problems. Successful applications have included text processing (Settles, 2005), bioinformatics (Zhihui & Zhaoming & Wenjie & Bader, 2010), and computer vision (Lu & Ji, 2015;Scharstein & Pal, 2007;Delaye &Adrien, 2014;Roscher & Herzog & Kunkel, 2014;Karimaghaloo & Arnold & Arbel, 2015;Bhole &Pal, 2014). Although early applications of CRFs used linear chains, recent applications of CRFs have also used more general graphical structures.…”
Section: Figure 1 Face Image Segmentationmentioning
confidence: 99%