2008
DOI: 10.1117/12.770914
|View full text |Cite
|
Sign up to set email alerts
|

Joint detection and localization of multiple anatomical landmarks through learning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
7
0

Year Published

2008
2008
2020
2020

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(7 citation statements)
references
References 0 publications
0
7
0
Order By: Relevance
“…Other algorithms solve specific landmark detection problems by carefully studying the appearance characteristics of shape priors of the landmarks. Although these methods display robustness to common image distortions and have a low computational complexity, they demonstrate a lack of potential to be extended to other studies using different landmarks, different joints or different MR scans . Another widely used method for landmark detection is a boosting cascade of simple detectors .…”
mentioning
confidence: 99%
“…Other algorithms solve specific landmark detection problems by carefully studying the appearance characteristics of shape priors of the landmarks. Although these methods display robustness to common image distortions and have a low computational complexity, they demonstrate a lack of potential to be extended to other studies using different landmarks, different joints or different MR scans . Another widely used method for landmark detection is a boosting cascade of simple detectors .…”
mentioning
confidence: 99%
“…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%
“…Thus, in our implementation, we constrain B 1 to be same across all the voxels of an image as well as across images. An automatic module for the nipple detection in [1] was used. The technique was tested over a population comprising 40 data sets, each from a different patient.…”
Section: Implementation and Experimentsmentioning
confidence: 99%