Efficient Graph-Based Image Segmentation
TLDR
An efficient segmentation algorithm is developed based on a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image and it is shown that although this algorithm makes greedy decisions it produces segmentations that satisfy global properties.Abstract:
This paper addresses the problem of segmenting an image into regions. We define a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develop an efficient segmentation algorithm based on this predicate, and show that although this algorithm makes greedy decisions it produces segmentations that satisfy global properties. We apply the algorithm to image segmentation using two different kinds of local neighborhoods in constructing the graph, and illustrate the results with both real and synthetic images. The algorithm runs in time nearly linear in the number of graph edges and is also fast in practice. An important characteristic of the method is its ability to preserve detail in low-variability image regions while ignoring detail in high-variability regions.read more
Citations
More filters
Journal ArticleDOI
Improving image segmentation quality through effective region merging using a hierarchical social metaheuristic
TL;DR: This paper proposes a new evolutionary region merging method in order to efficiently improve segmentation quality results, and efficiently applied the proposed approach to brightness segmentation on different standard test images, with good visual and objective segmentationquality results.
Journal ArticleDOI
“Let me explain!”: exploring the potential of virtual agents in explainable AI interaction design
TL;DR: It is found that increased human-likeness of and interaction with the virtual agent are the two most common mention points on how to improve the proposed XAI interaction design.
Journal ArticleDOI
FLIC: Fast linear iterative clustering with active search
TL;DR: In this article, a novel search algorithm called active search is proposed, which explicitly considers neighbor continuity and designs a back-and-forth traversal strategy and a joint assignment and update step to speed up the algorithm.
Journal ArticleDOI
Unsupervised semantic and instance segmentation of forest point clouds
TL;DR: This work proposes an unsupervised pipeline based on a structure called superpoint graph, to simultaneously perform two tasks: single tree isolation and leaf-wood classification, and provides the entire framework as an open-source tool with an end-user interface.
Journal ArticleDOI
Modeling leaf growth of rosette plants using infrared stereo image sequences
Eren Erdal Aksoy,Alexey Abramov,Florentin Wörgötter,Hanno Scharr,Andreas Fischbach,Babette Dellen +5 more
TL;DR: A novel multi-level procedure for finding and tracking leaves of a rosette plant, in this case up to 3 weeks old tobacco plants, during early growth from infrared-image sequences, which allows measuring important plant parameters, e.g. leaf growth rates, in an automatic and non-invasive manner.
References
More filters
Book
Introduction to Algorithms
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Proceedings ArticleDOI
Normalized cuts and image segmentation
Jianbo Shi,Jitendra Malik +1 more
TL;DR: This work treats image segmentation as a graph partitioning problem and proposes a novel global criterion, the normalized cut, for segmenting the graph, which measures both the total dissimilarity between the different groups as well as the total similarity within the groups.
Journal ArticleDOI
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
TL;DR: A family of graph-theoretical algorithms based on the minimal spanning tree are capable of detecting several kinds of cluster structure in arbitrary point sets; description of the detected clusters is possible in some cases by extensions of the method.