arXiv subjects

Verena Schmid

Publications and source records attributed to Verena Schmid.

4 recordsLinked to original sources

arXiv2022

MISm: A Medical Image Segmentation Metric for Evaluation of weak labeled Data

Performance measures are an important tool for assessing and comparing different medical image segmentation algorithms. Unfortunately, the current measures have their weaknesses when it comes to assessing certain edge cases. These limitations arouse when images with a very small region of interest or without a region of interest at all are assessed. As a solution for these limitations, we propose a new medical image segmentation metric: MISm. To evaluate MISm, the popular metrics in the medical image segmentation and MISm were compared using images of magnet resonance tomography from several scenarios. In order to allow application in the community and reproducibility of experimental results, we included MISm in the publicly available evaluation framework MISeval: https://github.com/frankkramer-lab/miseval/tree/master/miseval

cs.CV↗

arXiv2016

A large neighbourhood based heuristic for two-echelon routing problems

In this paper, we address two optimisation problems arising in the context of city logistics and two-level transportation systems. The two-echelon vehicle routing problem and the two-echelon location routing problem seek to produce vehicle itineraries to deliver goods to customers, with transits through intermediate facilities. To efficiently solve these problems, we propose a hybrid metaheuristic which combines enumerative local searches with destroy-and-repair principles, as well as some tailored operators to optimise the selections of intermediate facilities. We conduct extensive computational experiments to investigate the contribution of these operators to the search performance, and measure the performance of the method on both problem classes. The proposed algorithm finds the current best known solutions, or better ones, for 95% of the two-echelon vehicle routing problem benchmark instances. Overall, for both problems, it achieves high-quality solutions within short computing times. Finally, for future reference, we resolve inconsistencies between different versions of benchmark instances, document their differences, and provide them all online in a unified format.

cs.DS↗

arXiv2014

Detached topological charge on capillary bridges

We numerically investigate crystalline order on negative Gaussian curvature capillary bridges. In agreement with the experimental results in [W. Irvine et al., Nature, "Pleats in crystals on curved surfaces", 2010, (468), 947]} we observe for decreasing integrated Gaussian curvature a sequence of transitions, from no defects to isolated dislocations, pleats, scars and isolated sevenfold disclinations. We especially focus on the dependency of the detached topological charge on the integrated Gaussian curvature, for which we observe, again in agreement with the experimental results, no net disclination for an integrated curvature down to -10, and a linear behaviour from there on until the disclinations match the integrated curvature of -12. The results are obtained using a phase field crystal approach on catenoid-like surfaces and are highly sensitive to the initialization.

cond-mat.soft↗

arXiv2012

On Solving the Oriented Two-Dimensional Bin Packing Problem under Free Guillotine Cutting: Exploiting the Power of Probabilistic Solution Construction

Two-dimensional bin packing problems are highly relevant combinatorial optimization problems. They find a large number of applications, for example, in the context of transportation or warehousing, and for the cutting of different materials such as glass, wood or metal. In this work we deal with the oriented two-dimensional bin packing problem under free guillotine cutting. In this specific problem a set of oriented rectangular items is given which must be packed into a minimum number of bins of equal size. The first algorithm proposed in this work is a randomized multi-start version of a constructive one-pass heuristic from the literature. Additionally we propose the use of this randomized one-pass heuristic within an evolutionary algorithm. The results of the two proposed algorithms are compared to the best approaches from the literature. In particular the evolutionary algorithm compares very favorably to current state-of-the-art approaches. The optimal solution for 4 previously unsolved instances could be found.

cs.AI↗