7,920 research outputs found

    An improved rotation-invariant thinning algorithm

    Get PDF
    Ahmed & Ward have recently presented an elegant, rule-based rotation-invariant thinning algorithm to produce a single-pixel wide skeleton from a binary image. We show examples where this algorithm fails on two-pixel wide lines and propose a modified method which corrects this shortcoming based on graph connectivity

    Lattice Boltzmann simulations of a viscoelastic shear-thinning fluid

    Full text link
    We present a hybrid lattice Boltzmann algorithm for the simulation of flow glass-forming fluids, characterized by slow structural relaxation, at the level of the Navier-Stokes equation. The fluid is described in terms of a nonlinear integral constitutive equation, relating the stress tensor locally to the history of flow. As an application, we present results for an integral nonlinear Maxwell model that combines the effects of (linear) viscoelasticity and (nonlinear) shear thinning. We discuss the transient dynamics of velocities, shear stresses, and normal stress differences in planar pressure-driven channel flow, after switching on (startup) and off (cessation) of the driving pressure. This transient dynamics depends nontrivially on the channel width due to an interplay between hydrodynamic momentum diffusion and slow structural relaxation

    Correcting curvature-density effects in the Hamilton-Jacobi skeleton

    Get PDF
    The Hainilton-Jacobi approach has proven to be a powerful and elegant method for extracting the skeleton of two-dimensional (2-D) shapes. The approach is based on the observation that the normalized flux associated with the inward evolution of the object boundary at nonskeletal points tends to zero as the size of the integration area tends to zero, while the flux is negative at the locations of skeletal points. Nonetheless, the error in calculating the flux on the image lattice is both limited by the pixel resolution and also proportional to the curvature of the boundary evolution front and, hence, unbounded near endpoints. This makes the exact location of endpoints difficult and renders the performance of the skeleton extraction algorithm dependent on a threshold parameter. This problem can be overcome by using interpolation techniques to calculate the flux with subpixel precision. However, here, we develop a method for 2-D skeleton extraction that circumvents the problem by eliminating the curvature contribution to the error. This is done by taking into account variations of density due to boundary curvature. This yields a skeletonization algorithm that gives both better localization and less susceptibility to boundary noise and parameter choice than the Hamilton-Jacobi method
    • …
    corecore