Search results for "methodologies"
showing 10 items of 2106 documents
Lightfield microscopy, an emerging tool for real-time 3D imaging
2020
Integral, or lightfield, microscopy offers the possibility of capturing and processing in real time multiple views of 3D fluorescent samples captured with a single shot. In this contribution we review the recent advances in lightfield microscopy and enunciate the forthcoming challenges.
Resolution enhancement in integral microscopy by physical interpolation
2015
Integral-imaging technology has demonstrated its capability for computing depth images from the microimages recorded after a single shot. This capability has been shown in macroscopic imaging and also in microscopy. Despite the possibility of refocusing different planes from one snap-shot is crucial for the study of some biological processes, the main drawback in integral imaging is the substantial reduction of the spatial resolution. In this contribution we report a technique, which permits to increase the two-dimensional spatial resolution of the computed depth images in integral microscopy by a factor of √2. This is made by a double-shot approach, carried out by means of a rotating glass…
Optoelectronic morphological image processor.
2009
A morphological optoelectronic image processor based on the threshold decomposition concept is described and demonstrated. Binary slices of a gray-scale input image are optically convolved with a binary structuring element of arbitrary size and shape in a noncoherent convolver. The slices are displayed on a liquid-crystal spatial light modulator of 320 × 264 pixels. The kernels are implemented as modifications of the system impulse response. The processor’s convolution patterns are recorded with a CCD camera and fed into a PC by a frame grabber. Subsequent elementary morphological operations are looped. Examples of processing an input image of 256 × 256 pixels and 16 gray levels with kernel…
Variational multiframe restoration of images degraded by noisy (stochastic) blur kernels
2013
This article introduces and explores a class of degradation models in which an image is blurred by a noisy (stochastic) point spread function (PSF). The aim is to restore a sharper and cleaner image from the degraded one. Due to the highly ill-posed nature of the problem, we propose to recover the image given a sequence of several observed degraded images or multiframes. Thus we adopt the idea of the multiframe approach introduced for image super-resolution, which reduces distortions appearing in the degraded images. Moreover, we formulate variational minimization problems with the robust (local or nonlocal) L^1 edge-preserving regularizing energy functionals, unlike prior works dealing wit…
Characterization of Orlicz–Sobolev space
2007
We give a new characterization of the Orlicz–Sobolev space W1,Ψ(Rn) in terms of a pointwise inequality connected to the Young function Ψ. We also study different Poincaré inequalities in the metric measure space.
Matroid optimization problems with monotone monomials in the objective
2022
Abstract In this paper we investigate non-linear matroid optimization problems with polynomial objective functions where the monomials satisfy certain monotonicity properties. Indeed, we study problems where the set of non-linear monomials consists of all non-linear monomials that can be built from a given subset of the variables. Linearizing all non-linear monomials we study the respective polytope. We present a complete description of this polytope. Apart from linearization constraints one needs appropriately strengthened rank inequalities. The separation problem for these inequalities reduces to a submodular function minimization problem. These polyhedral results give rise to a new hiera…
Locally tame plane polynomial automorphisms
2010
Abstract For automorphisms of a polynomial ring in two variables over a domain R , we show that local tameness implies global tameness provided that every 2-generated locally free R -module of rank 1 is free. We give examples illustrating this property.
A Characterization of Quintic Helices
2005
A polynomial curve of degree 5, @a, is a helix if and only if both @[email protected]^'@? and @[email protected]^'@[email protected]^''@? are polynomial functions.
A New Set of Quartic Trivariate Polynomial Equations for Stratified Camera Self-calibration under Zero-Skew and Constant Parameters Assumptions
2012
This paper deals with the problem of self-calibrating a moving camera with constant parameters. We propose a new set of quartic trivariate polynomial equations in the unknown coordinates of the plane at infinity derived under the no-skew assumption. Our new equations allow to further enforce the constancy of the principal point across all images while retrieving the plane at infinity. Six such polynomials, four of which are independent, are obtained for each triplet of images. The proposed equations can be solved along with the so-called modulus constraints and allow to improve the performance of existing methods.
Exact Voronoi diagram of smooth convex pseudo-circles: General predicates, and implementation for ellipses
2013
International audience; We examine the problem of computing exactly the Voronoi diagram (via the dual Delaunay graph) of a set of, possibly intersecting, smooth convex \pc in the Euclidean plane, given in parametric form. Pseudo-circles are (convex) sites, every pair of which has at most two intersecting points. The Voronoi diagram is constructed incrementally. Our first contribution is to propose robust and efficient algorithms, under the exact computation paradigm, for all required predicates, thus generalizing earlier algorithms for non-intersecting ellipses. Second, we focus on \kcn, which is the hardest predicate, and express it by a simple sparse $5\times 5$ polynomial system, which a…