SearcharxivSearch

arXiv subjects

Bruno Weber

Publications and source records attributed to Bruno Weber.

4 recordsLinked to original sources

Parallel kinetic schemes for conservation laws, with large time steps

We propose a new parallel Discontinuous Galerkin method for the approximation of hyperbolic systems of conservation laws. The method remains stable with large time steps, while keeping the complexity of an explicit scheme: it does not require the assembly and resolution of large linear systems for the time iterations. The approach is based on a kinetic representation of the system of conservation laws previously investigated by the authors. In this paper, the approach is extended with a subdomain strategy that improves the parallel scaling of the method on computers with distributed memory.

math.NA

Wiener Guided DIP for Unsupervised Blind Image Deconvolution

Blind deconvolution is an ill-posed problem arising in various fields ranging from microscopy to astronomy. The ill-posed nature of the problem requires adequate priors to arrive to a desirable solution. Recently, it has been shown that deep learning architectures can serve as an image generation prior during unsupervised blind deconvolution optimization, however often exhibiting a performance fluctuation even on a single image. We propose to use Wiener-deconvolution to guide the image generator during optimization by providing it a sharpened version of the blurry image using an auxiliary kernel estimate starting from a Gaussian. We observe that the high-frequency artifacts of deconvolution are reproduced with a delay compared to low-frequency features. In addition, the image generator reproduces low-frequency features of the deconvolved image faster than that of a blurry image. We embed the computational process in a constrained optimization framework and show that the proposed method yields higher stability and performance across multiple datasets. In addition, we provide the code.

cs.CV

DeepVesselNet: Vessel Segmentation, Centerline Prediction, and Bifurcation Detection in 3-D Angiographic Volumes

We present DeepVesselNet, an architecture tailored to the challenges faced when extracting vessel networks or trees and corresponding features in 3-D angiographic volumes using deep learning. We discuss the problems of low execution speed and high memory requirements associated with full 3-D convolutional networks, high-class imbalance arising from the low percentage of vessel voxels, and unavailability of accurately annotated training data - and offer solutions as the building blocks of DeepVesselNet. First, we formulate 2-D orthogonal cross-hair filters which make use of 3-D context information at a reduced computational burden. Second, we introduce a class balancing cross-entropy loss function with false positive rate correction to handle the high-class imbalance and high false positive rate problems associated with existing loss functions. Finally, we generate synthetic dataset using a computational angiogenesis model capable of generating vascular trees under physiological constraints on local network structure and topology and use these data for transfer learning. DeepVesselNet is optimized for segmenting and analyzing vessels, and we test the performance on a range of angiographic volumes including clinical MRA data of the human brain, as well as X-ray tomographic microscopy scans of the rat brain. Our experiments show that, by replacing 3-D filters with cross-hair filters in our network, we achieve over 23% improvement in speed, lower memory footprint, lower network complexity which prevents overfitting and comparable accuracy (with a Cox-Wilcoxon paired sample significance test p-value of 0.07 when compared to full 3-D filters). Our class balancing metric is crucial for training the network and transfer learning with synthetic data is an efficient, robust, and very generalizable approach leading to a network that excels in a variety of angiography segmentation tasks.

cs.CV

Noise in laser speckle correlation and imaging techniques

We study the noise of the intensity variance and of the intensity correlation and structure functions measured in light scattering from a random medium in the case when these quantities are obtained by averaging over a finite number N of pixels of a digital camera. We show that the noise scales as 1/N in all cases and that it is sensitive to correlations of signals corresponding to adjacent pixels as well as to the effective time averaging (due to the finite sampling time) and spatial averaging (due to the finite pixel size). Our results provide a guide to estimation of noise level in such applications as the multi-speckle dynamic light scattering, time-resolved correlation spectroscopy, speckle visibility spectroscopy, laser speckle imaging etc.

physics.optics