Bicriteria Shapes: Hierarchical Grouping and Aggregation of Polygons with an Efficient Graph-Cut Approach-Reference-Cited by-同舟云学术

Bicriteria Shapes: Hierarchical Grouping and Aggregation of Polygons with an Efficient Graph-Cut Approach

Published:2022-10-11 Issue: Volume: Page:
ISSN:
Container-title:
language:
Short-container-title:

Author:

Rottmann Peter¹,Driemel Anne¹,Haverkort Herman¹,Röglin Heiko¹,Haunert Jan-Henrik¹

Affiliation:

1. University of Bonn

Abstract

Abstract An important task of pattern recognition and map generalization is to partition a set of polygons into groups and to aggregate the polygons within each group to a representative output polygon. We introduce a new method for this task called bicritria shapes. Following a classical approach, we define the output polygons by merging the input polygons with a set of triangles that we select from a conforming Delaunay triangulation of the input polygons’ exterior. The innovation is that we control the selection of triangles with a bicriteria optimization model that is efficiently solved via graph cuts. In particular, we minimize a weighted sum that combines the total area of the output polygons and their total perimeter. In a basic problem, we ask for a single solution that is optimal for a preset parameter value. In a second problem, we ask for a set containing an optimal solution for every possible value of the parameter. We discuss how this set can be approximated with few solutions and show that it is hierarchically nested. Hence, the output is a hierarchical clustering that can be used to obtain multiple levels of detail. An evaluation with building footprints as input concludes the article.

Publisher

Research Square Platform LLC

Reference43 articles.

1. Anders, Karl-Heinrich and Sester, Monika (2000) Parameter-free cluster detection in spatial databases and its application to typification. 75--83, 33, International Archives of Photogrammetry and Remote Sensing, Proc. 19th ISPRS Congress

2. Michael Bleyer and Margrit Gelautz (2007) Graph-cut-based stereo matching using image segmentation with symmetrical treatment of occlusions. Signal Processing: Image Communication 22(2): 127-143 https://doi.org/10.1016/j.image.2006.11.012, This paper describes a dense stereo matching algorithm for epipolar rectified images. The method applies colour segmentation on the reference image. Our basic assumptions are that disparity varies smoothly inside a segment, while disparity boundaries coincide with the segment borders. The use of these assumptions makes the algorithm capable of handling large untextured regions, estimating precise depth boundaries and propagating disparity information to occluded regions, which are challenging tasks for conventional stereo methods. We model disparity inside a segment by a planar equation. Initial disparity segments are clustered to form a set of disparity layers, which are planar surfaces that are likely to occur in the scene. Assignments of segments to disparity layers are then derived by minimization of a global cost function. This cost function is based on the observation that occlusions cannot be dealt with in the domain of segments. Therefore, we propose a novel cost function that is defined on two levels, one representing the segments and the other corresponding to pixels. The basic idea is that a pixel has to be assigned to the same disparity layer as its segment, but can as well be occluded. The cost function is then effectively minimized via graph-cuts. In the experimental results, we show that our method produces good-quality results, especially in regions of low texture and close to disparity boundaries. Results obtained for the Middlebury test set indicate that the proposed method is able to compete with the best-performing state-of-the-art algorithms., Stereo matching, Segmentation-based matching, Graph-cuts, Occlusion problem, 0923-5965

3. B{\"o}kler, Fritz and Mutzel, Petra (2015) Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems. 978-3-662-48350-3, This paper studies output-sensitive algorithms for enumeration problems in multiobjective combinatorial optimization (MOCO). We develop two methods for enumerating the extreme points of the Pareto-frontier of MOCO problems. The first method is based on a dual variant of Benson's algorithm, which has been originally proposed for multiobjective linear optimization problems. We prove that the algorithm runs in output polynomial time for every fixed number of objectives if the weighted-sum scalarization can be solved in polynomial time. Hence, we propose the first algorithm which solves this general problem in output polynomial time. We also propose a new lexicographic version of the dual Benson algorithm that runs in incremental polynomial time in the case that the lexicographic optimization variant can be solved in polynomial time. As a consequence, the extreme points of the Pareto-frontier of the multiobjective spanning tree problem as well as the multiobjective global min-cut problem can be computed in polynomial time for a fixed number of objectives. Our computational experiments show the practicability of our improved algorithm: We present the first computational study for computing the extreme points of the multiobjective version of the assignment problem with five and more objectives. We also empirically investigate the running time behavior of our new lexicographic version compared to the original algorithm., 10.1007/978-3-662-48350-3_25, 288--299, Proc. 23rd Annual European Symposium on Algorithms (ESA '15)

4. Bonerath, Annika and Niedermann, Benjamin and Haunert, Jan-Henrik (2019) Retrieving $$\alpha$$-shapes and schematic polygonal approximations for sets of points within queried temporal ranges. 10.1145/3347146.3359087, 249--258, Proc. 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL GIS '19)

5. Boykov, Yuri and Veksler, Olga Graph cuts in vision and graphics: Theories and applications. Handbook of Mathematical Models in Computer Vision, read, read, Aggregation, :aggregation/boykov2006graph.pdf:PDF, 10.1007/0-387-28831-7_5, 79--96, 2006, Boston, MA, USA, Springer, 5