2010
DOI: 10.1007/978-3-642-15705-9_36
|View full text |Cite
|
Sign up to set email alerts
|

Reconstructing Geometrically Consistent Tree Structures from Noisy Images

Abstract: Abstract. We present a novel approach to fully automated reconstruction of tree structures in noisy 2D images. Unlike in earlier approaches, we explicitly handle crossovers and bifurcation points, and impose geometric constraints while optimizing a global cost function. We use manually annotated retinal scans to evaluate our method and demonstrate that it brings about a very substantial improvement.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
5
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 12 publications
1
5
0
Order By: Relevance
“…The SCN shows the least results while the ANN and the CCN method shows better performance as compared with the other techniques. This shows that precision obtained in this work is comparable with those reported in the literature [6][7][8][9]. Fig.…”
Section: Tablesupporting
confidence: 82%
See 1 more Smart Citation
“…The SCN shows the least results while the ANN and the CCN method shows better performance as compared with the other techniques. This shows that precision obtained in this work is comparable with those reported in the literature [6][7][8][9]. Fig.…”
Section: Tablesupporting
confidence: 82%
“…Some improvement has been done for efficient detection of bifurcation and crossover points in [7].Thus in this work, the bifurcation points were sampled so that the over counting pixels were resolved.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Neurite tracing methods connect paths of maximum neuriteness voxels locally between sets of seed points to extract the global neurite structure. A common drawback of existing methods is their dependence on seed points [2]. Often, manual intervention is required to select the optimal seed points.…”
Section: Introductionmentioning
confidence: 99%
“…González et al [2] has proposed a K-minimum spanning based approach for tracing filamentary structure. In the follow up research work E. Türetken et al [43,44,45,46] has proposed a quadratic mixed integer programming formulation for solving the K-MST problem. But none of their reserach work has addressed the problem of crossover.…”
Section: The Joint Winner Of the Challenge B Roysham's Team Has Propmentioning
confidence: 99%
“…Soares et al [52] adopt eighteen dimensional Gabor response feature to train two Gaussian Mixture Models (GMM), which are further employed to produce a binary probability map for a test image. The tracking-based methods [57,58,59,60,61,41,62,43,44,45,46], on the other hand, usually start with a seed and track the intended vessel based on local intensity or texture information. The authors of [58] divide the image into non-overlapping grid and considered each grid separately for seed finding, which are followed by the tracking procedure to uncover the vessel network structure.…”
Section: Literature Review Of Retinal Blood Vessel Tracingmentioning
confidence: 99%