DiversePathsJ

• Verfasst von: Uhlmann, Virginie [VerfasserIn]
• Verfasst von: Haubold, Carsten [VerfasserIn]
• Verfasst von: Hamprecht, Fred [VerfasserIn]
• Titel: DiversePathsJ
• Titelzusatz: diverse shortest paths for bioimage analysis
• Verf.angabe: Virginie Uhlmann, Carsten Haubold, Fred A Hamprecht and Michael Unser
• Jahr: 2018
• Jahr des Originals: 2017
• Umfang: 3 S.
• Fussnoten: Gesehen am 31.08.2018 ; Advance access publication date: 27 September 2017
• Titel Quelle: Enthalten in: Bioinformatics
• Ort Quelle: Oxford : Oxford Univ. Press, 1985
• Jahr Quelle: 2018
• Band/Heft Quelle: 34(2018), 3, Seite 538-540
• ISSN Quelle: 1367-4811
• DOI: doi:10.1093/bioinformatics/btx621
• Datenträger: Online-Ressource
• Sprache: eng
• K10plus-PPN: 1580574513

Abstract

Motivation: We introduce a formulation for the general task of finding diverse shortest paths between two end-points. Our approach is not linked to a specific biological problem and can be applied to a large variety of images thanks to its generic implementation as a user-friendly ImageJ/Fiji plugin. It relies on the introduction of additional layers in a Viterbi path graph, which requires slight modifications to the standard Viterbi algorithm rules. This layered graph construction allows for the specification of various constraints imposing diversity between solutions. Results: The software allows obtaining a collection of diverse shortest paths under some user-defined constraints through a convenient and user-friendly interface. It can be used alone or be integrated into larger image analysis pipelines. Availability and implementation: http://bigwww.epfl.ch/algorithms/diversepathsj. Supplementary information: are available at Bioinformatics online.