1,446 research outputs found
Hierarchical interpolative factorization for elliptic operators: differential equations
This paper introduces the hierarchical interpolative factorization for
elliptic partial differential equations (HIF-DE) in two (2D) and three
dimensions (3D). This factorization takes the form of an approximate
generalized LU/LDL decomposition that facilitates the efficient inversion of
the discretized operator. HIF-DE is based on the multifrontal method but uses
skeletonization on the separator fronts to sparsify the dense frontal matrices
and thus reduce the cost. We conjecture that this strategy yields linear
complexity in 2D and quasilinear complexity in 3D. Estimated linear complexity
in 3D can be achieved by skeletonizing the compressed fronts themselves, which
amounts geometrically to a recursive dimensional reduction scheme. Numerical
experiments support our claims and further demonstrate the performance of our
algorithm as a fast direct solver and preconditioner. MATLAB codes are freely
available.Comment: 37 pages, 13 figures, 12 tables; to appear, Comm. Pure Appl. Math.
arXiv admin note: substantial text overlap with arXiv:1307.266
Gap Filling of 3-D Microvascular Networks by Tensor Voting
We present a new algorithm which merges discontinuities in 3-D images of tubular structures presenting undesirable gaps. The application of the proposed method is mainly associated to large 3-D images of microvascular networks. In order to recover the real network topology, we need to fill the gaps between the closest discontinuous vessels. The algorithm presented in this paper aims at achieving this goal. This algorithm is based on the skeletonization of the segmented network followed by a tensor voting method. It permits to merge the most common kinds of discontinuities found in microvascular networks. It is robust, easy to use, and relatively fast. The microvascular network images were obtained using synchrotron tomography imaging at the European Synchrotron Radiation Facility. These images exhibit samples of intracortical networks. Representative results are illustrated
Hierarchical interpolative factorization for elliptic operators: integral equations
This paper introduces the hierarchical interpolative factorization for
integral equations (HIF-IE) associated with elliptic problems in two and three
dimensions. This factorization takes the form of an approximate generalized LU
decomposition that permits the efficient application of the discretized
operator and its inverse. HIF-IE is based on the recursive skeletonization
algorithm but incorporates a novel combination of two key features: (1) a
matrix factorization framework for sparsifying structured dense matrices and
(2) a recursive dimensional reduction strategy to decrease the cost. Thus,
higher-dimensional problems are effectively mapped to one dimension, and we
conjecture that constructing, applying, and inverting the factorization all
have linear or quasilinear complexity. Numerical experiments support this claim
and further demonstrate the performance of our algorithm as a generalized fast
multipole method, direct solver, and preconditioner. HIF-IE is compatible with
geometric adaptivity and can handle both boundary and volume problems. MATLAB
codes are freely available.Comment: 39 pages, 14 figures, 13 tables; to appear, Comm. Pure Appl. Mat
A skeletonization algorithm for gradient-based optimization
The skeleton of a digital image is a compact representation of its topology,
geometry, and scale. It has utility in many computer vision applications, such
as image description, segmentation, and registration. However, skeletonization
has only seen limited use in contemporary deep learning solutions. Most
existing skeletonization algorithms are not differentiable, making it
impossible to integrate them with gradient-based optimization. Compatible
algorithms based on morphological operations and neural networks have been
proposed, but their results often deviate from the geometry and topology of the
true medial axis. This work introduces the first three-dimensional
skeletonization algorithm that is both compatible with gradient-based
optimization and preserves an object's topology. Our method is exclusively
based on matrix additions and multiplications, convolutional operations, basic
non-linear functions, and sampling from a uniform probability distribution,
allowing it to be easily implemented in any major deep learning library. In
benchmarking experiments, we prove the advantages of our skeletonization
algorithm compared to non-differentiable, morphological, and
neural-network-based baselines. Finally, we demonstrate the utility of our
algorithm by integrating it with two medical image processing applications that
use gradient-based optimization: deep-learning-based blood vessel segmentation,
and multimodal registration of the mandible in computed tomography and magnetic
resonance images.Comment: Accepted at ICCV 202
- …