Formal extraction of biomedical objects by subgraph matching in attributed hierarchical region adjacency graphs

Extraction of objects from biomedical images is the fundamental task for many high level applications in medical image processing such as cytometry or diagnostic decision support. Therefore, a formal specification of sought objects is required along with an extraction procedure. On the basis of a hierarchical image decomposition objects are described by image regions of characteristic shape, texture, and visual context. For example, a cell consists of a circular core, a surrounding body containing organelles, which is in turn surrounded by the nutrition agent, and other cells. This is modeled by hierarchical graph representation of the region topology as nodes and the region properties as node attributes. In a hierarchical region representation, an object is described by subregions which again may contain subregions, thus object extraction becomes the matching of the respective region nodes. Obviously, graph matching is a NP-complete problem and therefore, it requires heuristics to become computable. This even holds for subtree matching. We propose a new approach which makes strongly use of the inclusion property of regions in a hierarchical image decomposition along with the visually descriptive attributes. The algorithm iterates a top-down bottom-up sequence over the region hierarchy to restrict the search space. Hence at each step, a layer of tree-node attributes must be compared to the attributes of the sought objects root node description. The bottom-up analysis is only invoked for the subtree depending on those nodes. Thus, each node is visited according to the topology of its visual occurrence in an image

Das Projekt "Gratwanderung - ein Rhythm Act"

Das Mädchenprojekt "Gratwanderung - ein Rhythm Act" versucht die Gipfel und Wege des Lebens von Mädchen und jungen Frauen zu beschreiben. Mittels einer Inszenierung aus Perkussion, Stepptanz, Rhythmus-Elementen, Tanz, Gesang, Theaterelementen und Videoimpressionen sollen die verschiedenen Lebenswelten und "Welten" der Mädchen verbunden werden. Traum und Vision werden rhythmisch in die Pflichten des Alltags integriert

A cooperative fruit fly optimization algorithm for energy-efficient scheduling of distributed permutation flow-shop with limited buffers

The scheduling problem of distributed permutation flow shop with limited buffer aiming at production efficiency measures has attracted widespread attention due to its closer alignment with real manufacturing environments. However, the energy efficiency metric is often ignored. The Energy-efficient Scheduling of Distributed Permutation Flow shop with Limited Buffer (EEDPFSP-LB) with the objectives of Makespan (Cmax) and Total Energy Consumption (TEC) is studied, and a Cooperative Fruit Fly Optimization Algorithm (CFOA) is proposed in this paper. First, the critical path of EEDPFSP-LB is identified, and energy-efficient operation are applied to non-critical paths to reduce the system’s energy consumption. Second, five acceptance criteria for multi-objective optimization are introduced to enhance the diversity of the population. Third, to select a superior next-generation population, a new congestion calculation method is introduced to resolve the issue of indeterminate positional relationships among non-dominated solutions with identical crowding distances at the same dominance level. Finally, CFOA is extensively tested and compared with state-of-the-art algorithms across 360 instances, demonstrating CFOA’s strong competitiveness in solving EEDPFSP-LB