NEFI: Network Extraction From Images
Open Access
- 2 November 2015
- journal article
- Published by Springer Nature in Scientific Reports
- Vol. 5 (1) , 15669
Abstract
Networks are amongst the central building blocks of many systems. Given a graph of a network, methods from graph theory enable a precise investigation of its properties. Software for the analysis of graphs is widely available and has been applied to study various types of networks. In some applications, graph acquisition is relatively simple. However, for many networks data collection relies on images where graph extraction requires domain-specific solutions. Here we introduce NEFI, a tool that extracts graphs from images of networks originating in various domains. Regarding previous work on graph extraction, theoretical results are fully accessible only to an expert audience and ready-to-use implementations for non-experts are rarely available or insufficiently documented. NEFI provides a novel platform allowing practitioners to easily extract graphs from images by combining basic tools from image processing, computer vision and graph theory. Thus, NEFI constitutes an alternative to tedious manual graph extraction and special purpose tools. We anticipate NEFI to enable time-efficient collection of large datasets. The analysis of these novel datasets may open up the possibility to gain new insights into the structure and function of various networks. NEFI is open source and available at http://nefi.mpi-inf.mpg.de.Keywords
This publication has 16 references indexed in Scilit:
- Fast retinal vessel analysisJournal of Real-Time Image Processing, 2013
- A bioimage informatics approach to automatically extract complex fungal networksBioinformatics, 2012
- Contrast independent detection of branching points in network-like structures2012
- A review of coronary vessel segmentation algorithmsJournal of Medical Signals & Sensors, 2011
- Extracting Plane Graphs from Images2010
- Detection, Extraction, and Analysis of The Vein Network of The Slime Mould Physarum PolycephalumJournal of Computational Interdisciplinary Sciences, 2010
- "GrabCut"ACM Transactions on Graphics, 2004
- The Structure and Function of Complex NetworksSIAM Review, 2003
- Parallel thinning with two-subiteration algorithmsCommunications of the ACM, 1989
- A fast parallel algorithm for thinning digital patternsCommunications of the ACM, 1984