2012
DOI: 10.1007/978-3-642-33415-3_18
|View full text |Cite
|
Sign up to set email alerts
|

Robust MR Spine Detection Using Hierarchical Learning and Local Articulated Model

Abstract: A clinically acceptable auto-spine detection system, i.e., localization and labeling of vertebrae and inter-vertebral discs, is required to have high robustness, in particular to severe diseases (e.g. scoliosis) and imaging artifacts (e.g. metal artifacts in MR). Our method aims to achieve this goal with two novel components. First, instead of treating vertebrae/discs as either repetitive components or completely independent entities, we emulate a radiologist and use a hierarchial strategy to learn detectors d… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
28
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 43 publications
(28 citation statements)
references
References 9 publications
0
28
0
Order By: Relevance
“…Definition of such point locations (referred to as vertebral centroids, c i ) can be done automatically in CT (Dikmen et al 2008) and MR (Zhan et al 2012). Taking these locations as seed points for the segmentation, we formulated a spatially continuous min-cut problem with the objective function: S=minufalse(xfalse)false{0,1false}true∫false[false(1ufalse).D1false(xfalse)+u.D2false(xfalse)false]dx+true∫gfalse(xfalse)false|ufalse(xfalse)false|dx where u ( x ) is a membership function defining whether each pixel x lies outside ( u ( x ) = 0) or inside ( u ( x ) = 1) the vertebrae.…”
Section: B Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Definition of such point locations (referred to as vertebral centroids, c i ) can be done automatically in CT (Dikmen et al 2008) and MR (Zhan et al 2012). Taking these locations as seed points for the segmentation, we formulated a spatially continuous min-cut problem with the objective function: S=minufalse(xfalse)false{0,1false}true∫false[false(1ufalse).D1false(xfalse)+u.D2false(xfalse)false]dx+true∫gfalse(xfalse)false|ufalse(xfalse)false|dx where u ( x ) is a membership function defining whether each pixel x lies outside ( u ( x ) = 0) or inside ( u ( x ) = 1) the vertebrae.…”
Section: B Methodsmentioning
confidence: 99%
“…Automatic labeling of vertebrae in the MR image (Zhan et al 2012, Dikmen et al 2008) could be alternatively used to improve workflow.…”
Section: B Methodsmentioning
confidence: 99%
“…Klinder et al [2] used generalized Hough transform model for detecting vertebrae in CT, they extracted the 3D vertebra meshes from their detection-assisted segmentation but did not consider the geometric relations between vertebra meshes. Zhan et al [3] utilized Adaboost method for learning detectors for vertebrae on MR. They proposed a hierarchical probability model of spine and applied it in inferring vertebra locations and labels, but vertebra poses and spine shape are not involved.…”
mentioning
confidence: 99%
“…For vertebrae/disc labeling, [2]- [5] had very successful labeling on fully or partially scanned image volumes. The local vertebrae labels relied on the identification of some special landmarks detected from multiple image views, i.e., template models for axial view vertebrae [2], annotation of spinal canals [5] or anchor vertebrae [3] in axial views. The complete vertebrae labels in the input images are inferred by a probability inference model, i.e., a graph model [13] [14], Hidden Markov Model (HMM) [4], or hierarchical model [15] [3].…”
mentioning
confidence: 99%
See 1 more Smart Citation