Control of a mechanical aeration process via topological sensitivity analysis

The topological sensitivity analysis method gives the variation of a criterion with respect to the creation of a small hole in the domain. In this paper, we use this method to control the mechanical aeration process in eutrophic lakes. A simplified model based on incompressible Navier–Stokes equations is used, only considering the liquid phase, which is the dominant one. The injected air is taken into account through local boundary conditions for the velocity, on the injector holes. A 3D numerical simulation of the aeration effects is proposed using a mixed finite element method. In order to generate the best motion in the fluid for aeration purposes, the optimization of the injector location is considered. The main idea is to carry out topological sensitivity analysis with respect to the insertion of an injector. Finally, a topological optimization algorithm is proposed and some numerical results, showing the efficiency of our approach, are presented.     

Weighted fusion graphs: Merging properties and watersheds

This paper deals with the mathematical properties of watersheds in weighted graphs linked to region merging methods, as used in image analysis.In a graph, a cleft (or a binary watershed) is a set of vertices that cannot be reduced, by point removal, without changing the number of regions (connected components) of its complement. To obtain a watershed adapted to morphological region merging, it has been shown that one has to use the topological thinnings introduced by M. Couprie and G. Bertrand. Unfortunately, topological thinnings do not always produce thin clefts.Therefore, we introduce a new transformation on vertex weighted graphs, called C-watershed, that always produces a cleft. We present the class of perfect fusion graphs, for which any two neighboring regions can be merged, while preserving all other regions, by removing from the cleft the points adjacent to both. An important theorem of this paper states that, on these graphs, the C-watersheds are topological thinnings and the corresponding divides are thin clefts. We propose a linear-time immersion-like algorithm to compute C-watersheds on perfect fusion graphs, whereas, in general, a linear-time topological thinning algorithm does not exist. Furthermore, we prove that this algorithm is monotone in the sense that the vertices are processed in increasing order of weight. Finally, we derive some characterizations of perfect fusion graphs based on the thinness properties of both C-watersheds and topological watersheds.     

The hard Lefschetz property for Hamiltonian GKM manifolds

We introduce characteristic numbers of a graph and demonstrate that they are a combinatorial analogue of topological Betti numbers. We then use characteristic numbers and related tools to study Hamiltonian GKM manifolds whose moment maps are in general position. We study the connectivity properties of GKM graphs and give an upper bound on the second Betti number of a GKM manifold. When the manifold has dimension at most 10, we use this bound to conclude that the manifold has nondecreasing even Betti numbers up to half the dimension, which is a weak version of the Hard Lefschetz Property.     

Betti numbers of random manifolds

Betti numbers of configuration spaces of mechanical linkages (known also as polygon spaces) depend on a large number of parameters – the lengths of the bars of the linkage. Motivated by applications in topological robotics, statistical shape theory and molecular biology, we view these lengths as random variables and study asymptotic values of the average Betti numbers as the number of links n tends to infinity. We establish a surprising fact that for a reasonably ample class of sequences of probability measures the asymptotic values of the average Betti numbers are independent of the choice of the measure. The main results of the paper apply to planar linkages as well as for linkages in R ³. We also prove results about higher moments of Betti numbers. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Different Bounds on the Different Betti Numbers of Semi-Algebraic Sets

Abstract. A classic result in real algebraic geometry due to Oleinik—Petrovskii, Thom and Milnor, bounds the topological complexity (the sum of the Betti numbers) of basic semi-algebraic sets. This bound is tight as one can construct examples having that many connected components. However, till now no significantly better bounds were known on the individual higher Betti numbers. We prove better bounds on the individual Betti numbers of basic semi-algebraic sets, as well as arrangements of algebraic hypersurfaces. As a corollary we obtain a polynomial bound on the highest Betti numbers of basic semi-algebraic sets defined by quadratic inequalities.     

Multiphase mixing quantification by computational homology and imaging analysis

The purpose of this study is to introduce a new technique for quantifying the efficiency of multiphase mixing. This technique based on algebraic topology is illustrated by using the hydraulic modeling of gas agitated reactors stirred by top lance gas injection and image analysis. The zeroth Betti numbers are used to estimate the numbers of pieces in the patterns, leading to a useful parameter to characterize the mixture homogeneity. The first Betti numbers are introduced to characterize the nonhomogeneity of the mixture. The mixing efficiency can be characterized by the Betti numbers for binary images of the patterns. This novel method may be applied for studying a variety of multiphase mixing problems in which multiphase components or tracers are visually distinguishable.     

Different Bounds on the Different Betti Numbers of Semi-Algebraic Sets

   Abstract. A classic result in real algebraic geometry due to Oleinik—Petrovskii, Thom and Milnor, bounds the topological complexity (the sum of the Betti numbers) of basic semi-algebraic sets. This bound is tight as one can construct examples having that many connected components. However, till now no significantly better bounds were known on the individual higher Betti numbers. We prove better bounds on the individual Betti numbers of basic semi-algebraic sets, as well as arrangements of algebraic hypersurfaces. As a corollary we obtain a polynomial bound on the highest Betti numbers of basic semi-algebraic sets defined by quadratic inequalities.     

A fast and efficient mesh segmentation method based on improved region growing

Mesh segmentation is one of the important issues in digital geometry processing. Region growing method has been proven to be a efficient method for 3D mesh segmentation. However, in mesh segmentation, feature line extraction algorithm is computationally costly, and the over-segmentation problem still exists during region merging processing. In order to tackle these problems, a fast and efficient mesh segmentation method based on improved region growing is proposed in this paper. Firstly, the dihedral angle of each non-boundary edge is defined and computed simply, then the sharp edges are detected and feature lines are extracted. After region growing process is finished, an improved region merging method will be performed in two steps by considering some geometric criteria. The experiment results show the feature line extraction algorithm can obtain the same geometric information fast with less computational costs and the improved region merging method can solve over-segmentation well.     

Optimal shape design for fluid flow using topological perturbation technique

This paper is concerned with an optimal shape design problem in fluid mechanics. The fluid flow is governed by the Stokes equations. The theoretical analysis and the numerical simulation are discussed in two and three-dimensional cases. The proposed approach is based on a sensitivity analysis of a design function with respect to the insertion of a small obstacle in the fluid flow domain. An asymptotic expansion is derived for a large class of cost functions using small topological perturbation technique. A fast and accurate numerical algorithm is proposed. The efficiency of the method is illustrated by some numerical examples.     

Homotopy types of group lattices

In this article, we study group lattices using the ideas of K. S. Brown and D. Quillen of associating a certain topological space to a partially ordered set. We determine the exact homotopy type for the subgroup lattice of PSL(2, 7), find a connection between different group lattices, and obtain some estimates for the Betti numbers of these lattices using the spectral sequence method.     

Betti numbers in multidimensional persistent homology are stable functions

Multidimensional persistence mostly studies topological features of shapes by analyzing the lower level sets of vector‐valued functions, called filtering functions. As is well known, in the case of scalar‐valued filtering functions, persistent homology groups can be studied through their persistent Betti numbers, that is, the dimensions of the images of the homomorphisms induced by the inclusions of lower level sets into each other. Whenever such inclusions exist for lower level sets of vector‐valued filtering functions, we can consider the multidimensional analog of persistent Betti numbers. Varying the lower level sets, we obtain that persistent Betti numbers can be seen as functions taking pairs of vectors to the set of non‐negative integers. In this paper, we prove stability of multidimensional persistent Betti numbers. More precisely, we prove that small changes of the vector‐valued filtering functions imply only small changes of persistent Betti numbers functions. This result can be obtained by assuming the filtering functions to be just continuous. Multidimensional stability opens the way to a stable shape comparison methodology based on multidimensional persistence. In order to obtain our stability theorem, some other new results are proved for continuous filtering functions. They concern the finiteness of persistent Betti numbers for vector‐valued filtering functions and the representation via persistence diagrams of persistent Betti numbers, as well as their stability, in the case of scalar‐valued filtering functions. Finally, from the stability of multidimensional persistent Betti numbers, we obtain a lower bound for the natural pseudo‐distance. Copyright © 2013 John Wiley & Sons, Ltd.     

Resolutions of letterplace ideals of posets

We investigate resolutions of letterplace ideals of posets. We develop topological results to compute their multigraded Betti numbers, and to give structural results on these Betti numbers. If the poset is a union of no more than c chains, we show that the Betti numbers may be computed from simplicial complexes of no more than c vertices. We also give a recursive procedure to compute the Betti diagrams when the Hasse diagram of P has tree structure.     

Digital topological method for computing genus and the Betti numbers

This paper concerns with computation of topological invariants such as genus and the Betti numbers. We design a linear time algorithm that determines such invariants for digital spaces in 3D. These computations could have applications in medical imaging as they can be used to identify patterns in 3D image.Our method is based on cubical images with direct adjacency, also called (6,26)-connectivity images in discrete geometry. There are only six types of local surface points in such a digital surface. Two mathematical ingredients are used. First, we use the Gauss-Bonnett Theorem in differential geometry to determine the genus of 2-dimensional digital surfaces. This is done by counting the contribution for each of the six types of local surface points. The new formula derived in this paper that calculates genus is g=1+(|M₅|+2⋅|M₆|−|M₃|)/8 where Mi indicates the set of surface-points each of which has i adjacent points on the surface. Second, we apply the Alexander duality to express the homology groups of a 3D manifold in the usual 3D space in terms of the homology groups of its boundary surface.While our result is stated for digital spaces, the same idea can be applied to simplicial complexes in 3D or more general cell complexes.     

基于颜色和方向特征区域对比度的显著性检测模型

视觉显著性检测是很多计算机视觉任务的重要步骤,提出了一种基于颜色、方向特征和空间位置关系相结合的区域对比显著性检测算法.首先用基于图论的算法将图像分割成若干区域,结合区域间颜色特征和空间对比度计算出颜色显著图.同时采用基于纹理特征的算法分割图像,通过方向特征和空间对比度得到方向显著图.最后将二者结合得到最终显著图.在国际现有公开测试集上进行仿真实验,并与其它显著性检测方法进行对比,检测结果更加准确、合理,证明此算法切实可行.     

Topological classification of continuous selections of five linear functions

Continuous selections of linear functions play an important role in Morse theory for piecewise C ²-functions. In this article, the topological properties of continuous selections of linear functions are investigated in detail. These are then utilized to provide a complete classification of all continuous selections of five linear functions. This is done by showing that the first four Betti numbers of a simplicial complex induced by such a function fully determine that function up to topological equivalence. The number of different topological types of continuous selections of linear functions has been known only in the case of four or less selection functions so far. The main result of this article now states that there are exactly 26 different topological types of continuous selections of five linear functions.     

Rationally smooth algebraic monoids

A reductive monoid M is called rationally smooth if it has sufficiently mild singularities as a topological space. We characterize this class of monoids in combinatorial terms. We then use our results to calculate the Betti numbers of certain projective, rationally smooth group embeddings using the “monoid BB-decomposition”.     

Necessary conditions for discontinuities of multidimensional persistent Betti numbers

Topological persistence has proven to be a promising framework for dealing with problems concerning the analysis of data. In this context, it was originally introduced by taking into account 1‐dimensional properties of data, modeled by real‐valued functions. More recently, topological persistence has been generalized to consider multidimensional properties of data, coded by vector‐valued functions. This extension enables the study of multidimensional persistent Betti numbers, which provide a representation of data based on the properties under examination. In this contribution, we establish a new link between multidimensional topological persistence and Pareto optimality, proving that discontinuities of multidimensional persistent Betti numbers are necessarily pseudocritical or special values of the considered functions. Copyright © 2014 John Wiley & Sons, Ltd.     

Delaunay triangulation and 3D adaptive mesh generation

Delaunay triangulation and its complementary structure the Voronoi polyhedra form two of the most fundamental constructs of computational geometry. Delaunay triangulation offers an efficient method for generating high-quality triangulations. However, the generation of Delaunay triangulations in 3D with Watson's algorithm, leads to the appearance of silver tetrahedra, in a relatively large percentage. A different method for generating high-quality tetrahedralizations, based on Delaunay triangulation and not presenting the problem of sliver tetrahedra, is presented. The method consists in a tetrahedra division procedure and an efficient method for optimizing tetrahedral meshes, based on the application of a set of topological Delaunay transformations for tetrahedra and a technique for node repositioning. The method is robust and can be applied to arbitrary unstructured tetrahedral meshes, having as a result the generation of high-quality adaptive meshes with varying density, totally eliminating the appearance of sliver elements. In this way it offers a convenient and highly flexible algorithm for implementation in a general purpose 3D adaptive finite element analysis system. Applications to various engineering problems are presented