2011
DOI: 10.1007/978-3-642-24319-6_12
|View full text |Cite
|
Sign up to set email alerts
|

Segmentation Based Features for Lymph Node Detection from 3-D Chest CT

Abstract: Abstract. Lymph nodes routinely need to be considered in clinical practice in all kinds of oncological examinations. Automatic detection of lymph nodes from chest CT data is however challenging because of low contrast and clutter. Sliding window detectors using traditional features easily get confused by similar structures like muscles and vessels. It recently has been proposed to combine segmentation and detection to improve the detection performance. Features extracted from a segmentation that is initialized… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 12 publications
0
3
0
Order By: Relevance
“…In the second approach, known as the continuous convex relaxation method, the image is treated in a continuous domain, and the optimal labeling minimization problem, initially nonconvex, is relaxed to obtain an equivalent convex minimization problem, which is solved via continuous max-flow formulation. The scientific literature shows how these types of mathematical models have been used to segment different tumors, mainly in the lungs [4,26,27,42,44,48], liver [29], lymph nodes [5,13,16,17,54], prostate [20,25,31], brain [12] and breast [49]. Some studies used level-set and active contour methods [13,20,25,26,34,44,48], while others were based on the graph-cut method [4,7,12,16,17,27,31,42,54].…”
Section: Introductionmentioning
confidence: 99%
“…In the second approach, known as the continuous convex relaxation method, the image is treated in a continuous domain, and the optimal labeling minimization problem, initially nonconvex, is relaxed to obtain an equivalent convex minimization problem, which is solved via continuous max-flow formulation. The scientific literature shows how these types of mathematical models have been used to segment different tumors, mainly in the lungs [4,26,27,42,44,48], liver [29], lymph nodes [5,13,16,17,54], prostate [20,25,31], brain [12] and breast [49]. Some studies used level-set and active contour methods [13,20,25,26,34,44,48], while others were based on the graph-cut method [4,7,12,16,17,27,31,42,54].…”
Section: Introductionmentioning
confidence: 99%
“…However, the process involves lack of efficiency in learning process prior to perform segmentation. Such problems of learning were addressed in the work of Feulner et al [23], [24] by using discriminative approach for segmenting lymph node. The authors have utilized graph cut algorithm for carrying out segmentation.…”
Section: Related Workmentioning
confidence: 99%
“…In [24], a graph cut with locally adaptive energy dealt with spatially varying distributions of LN parenchyma and fat caused by in-homogeneous acoustic attenuation. In [25], a segmenting blob-like structure using the graph cut method was adapted and an Ada-Boost classier was trained with features extracted from the segmentation to the 3D chest CT LNs. In [26,27], the authors used a new method based on integrating segmentation with a learning-based detector.…”
Section: Introductionmentioning
confidence: 99%