Refine
Year of publication
Document Type
- Article (7)
- ZIB-Report (7)
- In Proceedings (1)
Language
- English (15)
Is part of the Bibliography
- no (15)
Keywords
- linear programming (2)
- mixed-integer semidefinite programming (2)
- Branch-and-cut (1)
- Branch-and-price (1)
- Column generation (1)
- Constraint integer programming (1)
- LP solver (1)
- Linear programming (1)
- MINLP solver (1)
- MIP solver (1)
Institute
- Mathematical Optimization (5)
- Mathematical Optimization Methods (5)
- Visual and Data-centric Computing (4)
- Visual Data Analysis (3)
- AI in Society, Science, and Technology (2)
- Image Analysis in Biology and Materials Science (2)
- Applied Algorithmic Intelligence Methods (1)
- Computational Nano Optics (1)
- Modeling and Simulation of Complex Processes (1)
- Numerical Mathematics (1)
We present a software-assisted workflow for the alignment and matching of filamentous structures across a 3D stack of serial images. This is achieved by combining automatic methods, visual validation, and interactive correction. After an initial alignment, the user can continuously improve the result by interactively correcting landmarks or matches of filaments. Supported by a visual quality assessment of regions that have been already inspected, this allows a trade-off between quality and manual labor. The software tool was developed to investigate cell division by quantitative 3D analysis of microtubules (MTs) in both mitotic and meiotic spindles. For this, each spindle is cut into a series of semi-thick physical sections, of which electron tomograms are acquired. The serial tomograms are then stitched and non-rigidly aligned to allow tracing and connecting of MTs across tomogram boundaries. In practice, automatic stitching alone provides only an incomplete solution, because large physical distortions and a low signal-to-noise ratio often cause experimental difficulties. To derive 3D models of spindles despite the problems related to sample preparation and subsequent data collection, semi-automatic validation and correction is required to remove stitching mistakes. However, due to the large number of MTs in spindles (up to 30k) and their resulting dense spatial arrangement, a naive inspection of each MT is too time consuming. Furthermore, an interactive visualization of the full image stack is hampered by the size of the data (up to 100 GB). Here, we present a specialized, interactive, semi-automatic solution that considers all requirements for large-scale stitching of filamentous structures in serial-section image stacks. The key to our solution is a careful design of the visualization and interaction tools for each processing step to guarantee real-time response, and an optimized workflow that efficiently guides the user through datasets.
In this paper, we present a software-assisted workflow for the alignment and matching of filamentous structures across a stack of 3D serial image sections. This is achieved by a combination of automatic methods, visual validation, and interactive correction. After an initial alignment, the user can continuously improve the result by interactively correcting landmarks or matches of filaments. This is supported by a quality assessment that visualizes regions that have been already inspected and, thus, allows a trade-off between quality and manual labor.
The software tool was developed in collaboration with biologists who investigate microtubule-based spindles during cell division. To quantitatively understand the structural organization of such spindles, a 3D reconstruction of the numerous microtubules is essential. Each spindle is cut into a series of semi-thick physical sections, of which electron tomograms are acquired. The sections then need to be stitched, i.e. non-rigidly aligned; and the microtubules need to be traced in each section and connected across section boundaries. Experiments led to the conclusion that automatic methods for stitching alone provide only an incomplete solution to practical analysis needs. Automatic methods may fail due to large physical distortions, a low signal-to-noise ratio of the images, or other unexpected experimental difficulties. In such situations, semi-automatic validation and correction is required to rescue as much information as possible to derive biologically meaningful results despite of some errors related to data collection.
Since the correct stitching is visually not obvious due to the number of microtubules (up to 30k) and their dense spatial arrangement, these are difficult tasks. Furthermore, a naive inspection of each microtubule is too time consuming. In addition, interactive visualization is hampered by the size of the image data (up to 100 GB). Based on the requirements of our collaborators, we present a practical solution for the semi-automatic stitching of serial section image stacks with filamentous structures.
Packing rings into a minimum number of rectangles is an optimization problem which appears naturally in the logistics operations of the tube industry. It encompasses two major difficulties, namely the positioning of rings in rectangles and the recursive packing of rings into other rings. This problem is known as the Recursive Circle Packing Problem (RCPP). We present the first dedicated method for solving RCPP that provides strong dual bounds based on an exact Dantzig–Wolfe reformulation of a nonconvex mixed-integer nonlinear programming formulation. The key idea of this reformulation is to break symmetry on each recursion level by enumerating one-level packings, i.e., packings of circles into other circles, and by dynamically generating packings of circles into rectangles. We use column generation techniques to design a “price-and-verify” algorithm that solves this reformulation to global optimality. Extensive computational experiments on a large test set show that our method not only computes tight dual bounds, but often produces primal solutions better than those computed by heuristics from the literature.
We present a software-assisted workflow for the alignment and matching of filamentous structures across a three-dimensional (3D) stack of serial images. This is achieved by combining automatic methods, visual validation, and interactive correction. After the computation of an initial automatic matching, the user can continuously improve the result by interactively correcting landmarks or matches of filaments. Supported by a visual quality assessment of regions that have been already inspected, this allows a trade-off between quality and manual labor. The software tool was developed in an interdisciplinary collaboration between computer scientists and cell biologists to investigate cell division by quantitative 3D analysis of microtubules (MTs) in both mitotic and meiotic spindles. For this, each spindle is cut into a series of semi-thick physical sections, of which electron tomograms are acquired. The serial tomograms are then stitched and non-rigidly aligned to allow tracing and connecting of MTs across tomogram boundaries. In practice, automatic stitching alone provides only an incomplete solution, because large physical distortions and a low signal-to-noise ratio often cause experimental difficulties. To derive 3D models of spindles despite dealing with imperfect data related to sample preparation and subsequent data collection, semi-automatic validation and correction is required to remove stitching mistakes. However, due to the large number of MTs in spindles (up to 30k) and their resulting dense spatial arrangement, a naive inspection of each MT is too time-consuming. Furthermore, an interactive visualization of the full image stack is hampered by the size of the data (up to 100 GB). Here, we present a specialized, interactive, semi-automatic solution that considers all requirements for large-scale stitching of filamentous structures in serial-section image stacks. To the best of our knowledge, it is the only currently available tool which is able to process data of the type and size presented here. The key to our solution is a careful design of the visualization and interaction tools for each processing step to guarantee real-time response, and an optimized workflow that efficiently guides the user through datasets. The final solution presented here is the result of an iterative process with tight feedback loops between the involved computer scientists and cell biologists.
The SCIP Optimization Suite is a powerful collection of optimization software that consists of the branch-cut-and-price framework and mixed-integer programming solver SCIP, the linear programming solver SoPlex, the modeling language Zimpl, the parallelization framework UG, and the generic branch-cut-and-price solver GCG. Additionally, it features the extensions SCIP-Jack for solving Steiner tree problems, PolySCIP for solving multi-objective problems, and SCIP-SDP for solving mixed-integer semidefinite programs. The SCIP Optimization Suite has been continuously developed and has now reached version 4.0. The goal of this report is to present the recent changes to the collection. We not only describe the theoretical basis, but focus on implementation aspects and their computational consequences.
The SCIP Optimization Suite is a software toolbox for generating and solving various classes of mathematical optimization problems. Its major components are the modeling language ZIMPL, the linear programming solver SoPlex, the constraint integer programming framework and mixed-integer linear and nonlinear programming solver SCIP, the UG framework for parallelization of branch-and-bound-based solvers, and the generic branch-cut-and-price solver GCG. It has been used in many applications from both academia and industry and is one of the leading non-commercial solvers.
This paper highlights the new features of version 3.2 of the SCIP Optimization Suite. Version 3.2 was released in July 2015. This release comes with new presolving steps, primal heuristics, and branching rules within SCIP. In addition, version 3.2 includes a reoptimization feature and improved handling of quadratic constraints and special ordered sets. SoPlex can now solve LPs exactly over the rational number and performance improvements have been achieved by exploiting sparsity in more situations. UG has been tested successfully on 80,000 cores. A major new feature of UG is the functionality to parallelize a customized SCIP solver. GCG has been enhanced with a new separator, new primal heuristics, and improved column management. Finally, new and improved extensions of SCIP are presented, namely solvers for multi-criteria optimization, Steiner tree problems, and mixed-integer semidefinite programs.