1 code implementation • 21 Nov 2018 • Raghavendra Selvan, Thomas Kipf, Max Welling, Antonio Garcia-Uceda Juarez, Jesper H. Pedersen, Jens Petersen, Marleen de Bruijne
Graph refinement, or the task of obtaining subgraphs of interest from over-complete graphs, can have many varied applications.
no code implementations • 23 Jun 2018 • Raghavendra Selvan, Jens Petersen, Jesper H. Pedersen, Marleen de Bruijne
We propose to use statistical ranking of local hypotheses in constructing the MHT tree, which yields a probabilistic interpretation of scores across scales and helps alleviate the scale-dependence of MHT parameters.
no code implementations • 12 Apr 2018 • Raghavendra Selvan, Thomas Kipf, Max Welling, Jesper H. Pedersen, Jens Petersen, Marleen de Bruijne
We present extraction of tree structures, such as airways, from image data as a graph refinement task.
no code implementations • 10 Apr 2018 • Raghavendra Selvan, Max Welling, Jesper H. Pedersen, Jens Petersen, Marleen de Bruijne
Performance of the method is compared with two methods: the first uses probability images from a trained voxel classifier with region growing, which is similar to one of the best performing methods at EXACT'09 airway challenge, and the second method is based on Bayesian smoothing on these probability images.
no code implementations • 7 Aug 2017 • Raghavendra Selvan, Jens Petersen, Jesper H. Pedersen, Marleen de Bruijne
The evolution of individual branches is modelled using a process model and the observed data is incorporated into the update step of the Bayesian smoother using a measurement model that is based on a multi-scale blob detector.
no code implementations • 24 Nov 2016 • Raghavendra Selvan, Jens Petersen, Jesper H. Pedersen, Marleen de Bruijne
The results show improvements in performance when compared to the original method and region growing on intensity images.