Detection of curved lines with B-COSFIRE filters: A case study on crack delineation

The detection of curvilinear structures is an important step for various computer vision applications, ranging from medical image analysis for segmentation of blood vessels, to remote sensing for the identification of roads and rivers, and to biometrics and robotics, among others. %The visual system of the brain has remarkable abilities to detect curvilinear structures in noisy images. This is a nontrivial task especially for the detection of thin or incomplete curvilinear structures surrounded with noise. We propose a general purpose curvilinear structure detector that uses the brain-inspired trainable B-COSFIRE filters. It consists of four main steps, namely nonlinear filtering with B-COSFIRE, thinning with non-maximum suppression, hysteresis thresholding and morphological closing. We demonstrate its effectiveness on a data set of noisy images with cracked pavements, where we achieve state-of-the-art results (F-measure=0.865). The proposed method can be employed in any computer vision methodology that requires the delineation of curvilinear and elongated structures.Comment: Accepted at Computer Analysis of Images and Patterns (CAIP) 201

Study of interpolation methods for high-accuracy computations on overlapping grids

Overset strategy can be an efficient way to keep high-accuracy discretization by decomposing a complex geometry in topologically simple subdomains. Apart from the grid assembly algorithm, the key point of overset technique lies in the interpolation processes which ensure the communications between the overlapping grids. The family of explicit Lagrange and optimized interpolation schemes is studied. The a priori interpolation error is analyzed in the Fourier space, and combined with the error of the chosen discretization to highlight the modification of the numerical error. When high-accuracy algorithms are used an optimization of the interpolation coefficients can enhance the resolvality, which can be useful when high-frequency waves or small turbulent scales need to be supported by a grid. For general curvilinear grids in more than one space dimension, a mapping in a computational space followed by a tensorization of 1-D interpolations is preferred to a direct evaluation of the coefficient in the physical domain. A high-order extension of the isoparametric mapping is accurate and robust since it avoids the inversion of a matrix which may be ill-conditioned. A posteriori error analyses indicate that the interpolation stencil size must be tailored to the accuracy of the discretization scheme. For well discretized wavelengthes, the results show that the choice of a stencil smaller than the stencil of the corresponding finite-difference scheme can be acceptable. Besides the gain of optimization to capture high-frequency phenomena is also underlined. Adding order constraints to the optimization allows an interesting trade-off when a large range of scales is considered. Finally, the ability of the present overset strategy to preserve accuracy is illustrated by the diffraction of an acoustic source by two cylinders, and the generation of acoustic tones in a rotor–stator interaction. Some recommandations are formulated in the closing section

Comparison of Global and Local Adaptive Coordinates for Density Functional Calculations

A globally-adaptive curvilinear coordinate formalism is shown to be easily convertible to a class of curvilinear transformations locally optimized around atom sites by a few parameters. Parameter transferability is established for a demanding test case, and the results of the two methods are shown to be comparable. Computational efficiencies realized in the local method are discussed.Comment: 21 pages, 4 figure

Grid generation for the solution of partial differential equations

A general survey of grid generators is presented with a concern for understanding why grids are necessary, how they are applied, and how they are generated. After an examination of the need for meshes, the overall applications setting is established with a categorization of the various connectivity patterns. This is split between structured grids and unstructured meshes. Altogether, the categorization establishes the foundation upon which grid generation techniques are developed. The two primary categories are algebraic techniques and partial differential equation techniques. These are each split into basic parts, and accordingly are individually examined in some detail. In the process, the interrelations between the various parts are accented. From the established background in the primary techniques, consideration is shifted to the topic of interactive grid generation and then to adaptive meshes. The setting for adaptivity is established with a suitable means to monitor severe solution behavior. Adaptive grids are considered first and are followed by adaptive triangular meshes. Then the consideration shifts to the temporal coupling between grid generators and PDE-solvers. To conclude, a reflection upon the discussion, herein, is given

HARES: an efficient method for first-principles electronic structure calculations of complex systems

We discuss our new implementation of the Real-space Electronic Structure method for studying the atomic and electronic structure of infinite periodic as well as finite systems, based on density functional theory. This improved version which we call HARES (for High-performance-fortran Adaptive grid Real-space Electronic Structure) aims at making the method widely applicable and efficient, using high performance Fortran on parallel architectures. The scaling of various parts of a HARES calculation is analyzed and compared to that of plane-wave based methods. The new developments that lead to enhanced performance, and their parallel implementation, are presented in detail. We illustrate the application of HARES to the study of elemental crystalline solids, molecules and complex crystalline materials, such as blue bronze and zeolites.Comment: 17 two-column pages, including 9 figures, 5 tables. To appear in Computer Physics Communications. Several minor revisions based on feedbac

Computational fluid dynamics for aerospace propulsion systems: an approach based on discontinuous finite elements

The purpose of this work is the development of a numerical tool devoted to the study of the flow field in the components of aerospace propulsion systems. The goal is to obtain a code which can efficiently deal with both steady and unsteady problems, even in the presence of complex geometries. Several physical models have been implemented and tested, starting from Euler equations up to a three equations RANS model. Numerical results have been compared with experimental data for several real life applications in order to understand the range of applicability of the code. Performance optimization has been considered with particular care thanks to the participation to two international Workshops in which the results were compared with other groups from all over the world. As far as the numerical aspect is concerned, state-of-art algorithms have been implemented in order to make the tool competitive with respect to existing softwares. The features of the chosen discretization have been exploited to develop adaptive algorithms (p, h and hp adaptivity) which can automatically refine the discretization. Furthermore, two new algorithms have been developed during the research activity. In particular, a new technique (Feedback filtering [1]) for shock capturing in the framework of Discontinuous Galerkin methods has been introduced. It is based on an adaptive filter and can be efficiently used with explicit time integration schemes. Furthermore, a new method (Enhance Stability Recovery [2]) for the computation of diffusive fluxes in Discontinuous Galerkin discretizations has been developed. It derives from the original recovery approach proposed by van Leer and Nomura [3] in 2005 but it uses a different recovery basis and a different approach for the imposition of Dirichlet boundary conditions. The performed numerical comparisons showed that the ESR method has a larger stability limit in explicit time integration with respect to other existing methods (BR2 [4] and original recovery [3]). In conclusion, several well known test cases were studied in order to evaluate the behavior of the implemented physical models and the performance of the developed numerical schemes

Comparison of Subgrid-scale Viscosity Models and Selective Filtering Strategy for Large-eddy Simulations

Explicitly filtered large-eddy simulations (LES), combining high-accuracy schemes with the use of a selective filtering without adding an explicit subgrid-scales (SGS) model, are carried out for the Taylor-Green-vortex and the supersonic-boundary-layer cases. First, the present approach is validated against direct numerical simulation (DNS) results. Subsequently, several SGS models are implemented in order to investigate if they can improve the initial filter-based methodology. It is shown that the most accurate results are obtained when the filtering is used alone as an implicit model, and for a minimal cost. Moreover, the tests for the Taylor-Green vortex indicate that the discretization error from the numerical methods, notably the dissipation error from the high-order filtering, can have a greater influence than the SGS models

A moving control volume approach to computing hydrodynamic forces and torques on immersed bodies

We present a moving control volume (CV) approach to computing hydrodynamic forces and torques on complex geometries. The method requires surface and volumetric integrals over a simple and regular Cartesian box that moves with an arbitrary velocity to enclose the body at all times. The moving box is aligned with Cartesian grid faces, which makes the integral evaluation straightforward in an immersed boundary (IB) framework. Discontinuous and noisy derivatives of velocity and pressure at the fluid-structure interface are avoided and far-field (smooth) velocity and pressure information is used. We re-visit the approach to compute hydrodynamic forces and torques through force/torque balance equation in a Lagrangian frame that some of us took in a prior work (Bhalla et al., J Comp Phys, 2013). We prove the equivalence of the two approaches for IB methods, thanks to the use of Peskin's delta functions. Both approaches are able to suppress spurious force oscillations and are in excellent agreement, as expected theoretically. Test cases ranging from Stokes to high Reynolds number regimes are considered. We discuss regridding issues for the moving CV method in an adaptive mesh refinement (AMR) context. The proposed moving CV method is not limited to a specific IB method and can also be used, for example, with embedded boundary methods