Search

We consider the relativistic Vlasov-Maxwell system in three dimensions and study the limiting asymptotic behavior as $t \to \infty$ of solutions launched by small, compactly supported initial data. In particular, we prove that such solutions scatter to a modification of the free-streaming asymptotic profile. More specifically, we show that the spatial average of the particle distribution function converges to a smooth, compactly-supported limit and establish the precise, self-similar asymptotic behavior of the electric and magnetic fields, as well as, the macroscopic densities and their derivatives in terms of this limiting function. Upon constructing the limiting fields, a modified $L^\infty$ scattering result for the particle distribution function along the associated trajectories of free transport corrected by the limiting Lorentz force is then obtained. When the limiting charge density does not vanish, our estimates are sharp up to a logarithmic correction. However, when this quantity is identically zero in the limit, the limiting current density and fields may also vanish, which gives rise to decay rates that are faster than those attributed to the dispersive mechanisms in the system., Comment: 49 pages, 2 figures

This work is concerned with operators of the type A = --c$\Delta$ acting in domains $\Omega$ := $\Omega$ ' x (0, H) $\subseteq$ R^d x R ^+. The diffusion coefficient c > 0 depends on one coordinate y $\in$ (0, H) and is bounded but may be discontinuous. This corresponds to the physical model of ''layered media'', appearing in acoustics, elasticity, optical fibers... Dirichlet boundary conditions are assumed. In general, for each $\epsilon$ > 0, the set of eigenfunctions is divided into a disjoint union of three subsets : Fng (non-guided), Fg (guided) and Fres (residual). The residual set shrinks as $\epsilon$ $\rightarrow$ 0. The customary physical terminology of guided/non-guided is often replaced in the mathematical literature by concentrating/non-concentrating solutions, respectively. For guided waves, the assumption of ''layered media'' enables us to obtain rigorous estimates of their exponential decay away from concentration zones. The case of non-guided waves has attracted less attention in the literature. While it is not so closely connected to physical models, it leads to some very interesting questions concerning oscillatory solutions and their asymptotic properties. Classical asymptotic methods are available for c(y) $\in$ C 2 but a lesser degree of regularity excludes such methods. The associated eigenfunctions (in Fng) are oscillatory. However, this fact by itself does not exclude the possibility of ''flattening out'' of the solution between two consecutive zeros, leading to concentration in the complementary segment. Here we show it cannot happen when c(y) is of bounded variation, by proving a ''minimal amplitude hypothesis''. However the validity of such results when c(y) is not of bounded variation (even if it is continuous) remains an open problem.

We introduce a novel approach for gait transfer from unconstrained videos in-the-wild. In contrast to motion transfer, the objective here is not to imitate the source's motions by the target, but rather to replace the walking source with the target, while transferring the target's typical gait. Our approach can be trained only once with multiple sources and is able to transfer the gait of the target from unseen sources, eliminating the need for retraining for each new source independently. Furthermore, we propose a novel metrics for gait transfer based on gait recognition models that enable to quantify the quality of the transferred gait, and show that existing techniques yield a discrepancy that can be easily detected. We introduce Cycle Transformers GAN (CTrGAN), that consist of a decoder and encoder, both Transformers, where the attention is on the temporal domain between complete images rather than the spatial domain between patches. Using a widely-used gait recognition dataset, we demonstrate that our approach is capable of producing over an order of magnitude more realistic personalized gaits than existing methods, even when used with sources that were not available during training. As part of our solution, we present a detector that determines whether a video is real or generated by our model.

Adaptive image restoration models can restore images with different degradation levels at inference time without the need to retrain the model. We present an approach that is highly accurate and allows a significant reduction in the number of parameters. In contrast to existing methods, our approach can restore images using a single fixed-size model, regardless of the number of degradation levels. On popular datasets, our approach yields state-of-the-art results in terms of size and accuracy for a variety of image restoration tasks, including denoising, deJPEG, and super-resolution., Comment: 5 pages, 5 Figures, ICASSP 2023

This paper explores the complexity associated with solving the inverse Sturm-Liouville problem with Robin boundary conditions: given a sequence of eigenvalues and a sequence of norming constants, how many limits does a universal algorithm require to return the potential and boundary conditions? It is shown that if all but finitely many of the eigenvalues and norming constants coincide with those for the zero potential then the number of limits is zero, i.e. it is possible to retrieve the potential and boundary conditions precisely in finitely many steps. Otherwise, it is shown that this problem requires a single limit; moreover, if one has a priori control over how much the eigenvalues and norming constants differ from those of the zero-potential problem, and one knows that the average of the potential is zero, then the computation can be performed with complete error control. This is done in the spirit of the Solvability Complexity Index. All algorithms are provided explicitly along with numerical examples., Comment: 27 pages

We study the large time behavior of classical solutions to the two-dimensional Vlasov-Poisson (VP) and relativistic Vlasov-Poisson (RVP) systems launched by radially-symmetric initial data with compact support. In particular, we prove that particle positions and momenta grow unbounded as $t \to \infty$ and obtain sharp rates on the maximal values of these quantities on the support of the distribution function for each system. Furthermore, we establish nearly sharp rates of decay for the associated electric field, as well as upper and lower bounds on the decay rate of the charge density in the large time limit. We prove that, unlike (VP) in higher dimensions, smooth solutions do not scatter to their free-streaming profiles as $t \to \infty$ because nonlinear, long-range field interactions dominate the behavior of characteristics due to the exchange of energy from the potential to the kinetic term. In this way, the system may "forget" any previous configuration of particles., Comment: 27 pages

The global-in-time existence of classical solutions to the relativistic Vlasov-Maxwell (RVM) system in three space dimensions remains elusive after nearly four decades of mathematical research. In this note, a simplified ``toy model'' is presented and studied. This toy model retains one crucial aspect of the RVM system: the phase-space evolution of the distribution function is governed by a transport equation whose forcing term satisfies a wave equation with finite speed of propagation., Comment: 13 pages, final version for publication in KRM

Schr\"odinger operators with periodic (possibly complex-valued) potentials and discrete periodic operators (possibly with complex-valued entries) are considered, and in both cases the computational spectral problem is investigated: namely, under what conditions can a "one-size-fits-all" algorithm for computing their spectra be devised? It is shown that for periodic banded matrices this can be done, as well as for Schr\"odinger operators with periodic potentials that are sufficiently smooth. In both cases implementable algorithms are provided, along with examples. For certain Schr\"odinger operators whose potentials may diverge at a single point (but are otherwise well-behaved) it is shown that there does not exist such an algorithm, though it is shown that the computation is possible if one allows for two successive limits., Comment: 32 pages, 6 figures

In this paper we study global-in-time, weighted Strichartz estimates for the Dirac equation on warped product spaces in dimension $n\geq3$. In particular, we prove estimates for the dynamics restricted to eigenspaces of the Dirac operator on the compact spin manifolds defining the ambient manifold under some explicit sufficient condition on the metric, and estimates with loss of angular derivatives for general initial data in the setting of spherically symmetric and asymptotically flat manifolds., Comment: 38 pages

Existing methods for enhancing dark images captured in a very low-light environment assume that the intensity level of the optimal output image is known and already included in the training set. However, this assumption often does not hold, leading to output images that contain visual imperfections such as dark regions or low contrast. To facilitate the training and evaluation of adaptive models that can overcome this limitation, we have created a dataset of 1500 raw images taken in both indoor and outdoor low-light conditions. Based on our dataset, we introduce a deep learning model capable of enhancing input images with a wide range of intensity levels at runtime, including ones that are not seen during training. Our experimental results demonstrate that our proposed dataset combined with our model can consistently and effectively enhance images across a wide range of diverse and challenging scenarios.

The question of whether there exists an approximation procedure to compute the resonances of any Helmholtz resonator, regardless of its particular shape, is addressed. A positive answer is given, and it is shown that all that one has to assume is that the resonator chamber is bounded and that its boundary is $\mathcal C^2$. The proof is constructive, providing a universal algorithm which only needs to access the values of the characteristic function of the chamber at any requested point., Comment: 25 pages, 12 figures

Consider a conical singular space $X=C(Y)=(0,\infty)_r\times Y$ with the metric $g=\mathrm{d}r^2+r^2h$, where the cross section $Y$ is a compact $(n-1)$-dimensional closed Riemannian manifold $(Y,h)$. We study the Klein-Gordon equations with inverse-square potentials in the space $X$, proving in particular global-in-time Strichartz estimates in this setting., Comment: 44 pages. Comments are welcome

This paper addresses the issue of the formulation of weak solutions to systems of nonlinear hyperbolic conservation laws as integral balance laws. The basic idea is that the "meaningful objects" are the fluxes, evaluated across domain boundaries over time intervals. The fundamental result in this treatment is the regularity of the flux trace in the multi-dimensional setting. It implies that a weak solution indeed satisfies the balance law. In fact, it is shown that the flux is Lipschitz continuous with respect to suitable perturbations of the boundary., Comment: 8 pages. arXiv admin note: text overlap with arXiv:1902.09047

We present a novel approach for RANSAC-based computation of the fundamental matrix based on epipolar homography decomposition. We analyze the geometrical meaning of the decomposition-based representation and show that it directly induces a consecutive sampling strategy of two independent sets of correspondences. We show that our method guarantees a minimal number of evaluated hypotheses with respect to current minimal approaches, on the condition that there are four correspondences on an image line. We validate our approach on real-world image pairs, providing fast and accurate results.

The question of whether it is possible to compute scattering resonances of Schr\"odinger operators - independently of the particular potential - is addressed. A positive answer is given, and it is shown that the only information required to be known a priori is the size of the support of the potential. The potential itself is merely required to be $\mathcal{C}^1$. The proof is constructive, providing a universal algorithm which only needs to access the values of the potential at any requested point., Comment: 19 pages, 6 figures

Wavelet denoising is a classical and effective approach for reducing noise in images and signals. Suggested in 1994, this approach is carried out by rectifying the coefficients of a noisy image in the transform domain, using a set of scalar shrinkage function (SFs). A plethora of papers deals with the optimal shape of the SFs and the transform used, where it is known that applying the SFs in redundant bases provides improved results. This paper provides a complete picture of the interrelations between the transform used, the optimal shrinkage functions, and the domains in which they are optimized. In particular, we show that for subband optimization, where each SF is optimized independently for a particular band, optimizing the SFs in the spatial domain is always better than or equal to optimizing the SFs in the transform domain. For redundant bases, we provide the expected denoising gain we may achieve, relative to the unitary basis, as a function of the redundancy rate.

Discrete approximations to the equation \begin{equation*} L_{cont}u = u^{(4)} + D(x) u^{(3)} + A(x) u^{(2)} + (A'(x)+H(x)) u^{(1)} + B(x) u = f, \; x\in[0,1] \end{equation*} are considered. This is an extension of the Sturm-Liouville case $D(x)\equiv H(x)\equiv 0$ [ M. Ben-Artzi, J.-P. Croisille, D. Fishelov and R. Katzir, Discrete fourth-order Sturm-Liouville problems, IMA J. Numer. Anal. {\bf 38} (2018), 1485-1522. doi: 10.1093/imanum/drx038] to the non-self-adjoint setting. The "natural" boundary conditions in the Sturm-Liouville case are the values of the function and its derivative. The inclusion of a third-order discrete derivative entails a revision of the underlying discrete functional calculus. This revision forces evaluations of accurate discrete approximations to the boundary values of the second, third and fourth order derivatives. The resulting functional calculus provides the discrete analogs of the fundamental Sobolev properties--compactness and coercivity. It allows to obtain a general convergence theorem of the discrete approximations to the exact solution. Some representative numerical examples are presented., Comment: 4 figures

Consider the Dirichlet-Laplacian in $\Omega:= (0,L)\times (0,H)$ and choose another open set $\omega\subset \Omega$. The estimate $0C_{\omega}>0,\exists \omega, \omega\not=\emptyset$, such that $\inf R_{\omega}(u)=0$,and we wish to characterize these two sets. For two patterns we give a sufficient condition, sometimes necessary. As our operator corresponds to a layered media we can give another representation of its spectrum: i.e. a subset of points of $R\times R$ that leads to the suggested partition and others connected results: micro local interpretation, default measures,... Section 4.1 of the previous version was not correct, now it is corrected, many proofs are simplified and a new general result is added., Comment: in French, 34 pages. Rehandled version of arXiv:1911.09947 since the results of section 4.1 was false. This section becomes section 3.1 with new statement and proof. Others modifications: new Theorems, corollaries and lemmas and new numerotation. As a result, we have profoundly changed the Introduction

The one-dimensional viscous conservation law is considered on the whole line $$ u_t + f(u)_x=\eps u_{xx},\quad (x,t)\in\RR\times\overline{\RP},\quad \eps>0, $$ subject to positive measure initial data. The flux $f\in C^1(\RR)$ is assumed to satisfy a $p-$condition, a weak form of convexity. Existence and uniqueness of solutions is established. The method of proof relies on sharp decay estimates for viscous Hamilton-Jacobi equations.

This paper addresses the three concepts of \textit{ consistency, stability and convergence } in the context of compact finite volume schemes for systems of nonlinear hyperbolic conservation laws. The treatment utilizes the framework of "balance laws". Such laws express the relevant physical conservation laws in the presence of discontinuities. Finite volume approximations employ this viewpoint, and the present paper can be regarded as being in this category. It is first shown that under very mild conditions a weak solution is indeed a solution to the balance law. The schemes considered here allow the computation of several quantities per mesh cell (e.g., slopes) and the notion of consistency must be extended to this framework. Then a suitable convergence theorem is established, generalizing the classical convergence theorem of Lax and Wendroff. Finally, the limit functions are shown to be entropy solutions by using a notion of "Godunov compatibility", which serves as a substitute to the entropy condition., Comment: 27 pages

Motivated by the well-known phase-space portrait of the nonlinear pendulum, the purpose of this paper is to obtain convergence rates in the ergodic theorem for flows in the plane that have arbitrarily slow trajectories. Considering bounded periodic trajectories near the heteroclinic orbits, it is shown that despite lacking a spectral gap, there exists a functional space (which is a strict subset of $L^2$) on which time averages converge uniformly to spatial averages (with an explicit rate). The main ingredient of the proof is an estimate of the density of the spectrum of the generator of the flow near zero., Comment: 13 pages, completely revised

Von Neumann's original proof of the ergodic theorem is revisited. A uniform convergence rate is established under the assumption that one can control the density of the spectrum of the underlying self-adjoint operator when restricted to suitable subspaces. Explicit rates are obtained when the bound is polynomial, with applications to the linear Schr\"odinger and wave equations. In particular, decay estimates for time-averages of solutions are shown., Comment: 13 pages

Let $$L_0=\suml_{j=1}^nM_j^0D_j+M_0^0,\,\,\,\,D_j=\frac{1}{i}\frac{\pa}{\paxj}, \quad x\in\Rn,$$ be a constant coefficient first-order partial differential system, where the matrices $M_j^0$ are Hermitian. It is assumed that the homogeneous part is strongly propagative. In the nonhomegeneous case it is assumed that the operator is isotropic . The spectral theory of such systems and their potential perturbations is expounded, and a Limiting Absorption Principle is obtained up to thresholds. Special attention is given to a detailed study of the Dirac and Maxwell operators. The estimates of the spectral derivative near the thresholds are based on detailed trace estimates on the slowness surfaces. Two applications of these estimates are presented: \begin{itemize} \item Global spacetime estimates of the associated evolution unitary groups, that are also commonly viewed as decay estimates. In particular the Dirac and Maxwell systems are explicitly treated. \item The finiteness of the eigenvalues (in the spectral gap) of the perturbed Dirac operator is studied, under suitable decay assumptions on the potential perturbation. \end{itemize}

Smoothing (and decay) spacetime estimates are discussed for evolution groups of self-adjoint operators in an abstract setting. The basic assumption is the existence (and weak continuity) of the spectral density in a functional setting. Spectral identities for the time evolution of such operators are derived, enabling results concerning "best constants" for smoothing estimates. When combined with suitable "comparison principles" (analogous to those established in our previous work), they yield smoothing estimates for classes of functions of the operators . A important particular case is the derivation of global spacetime estimates for a perturbed operator $H+V$ on the basis of its comparison with the unperturbed operator $H.$ A number of applications are given, including smoothing estimates for fractional Laplacians, Stark Hamiltonians and Schr\"odinger operators with potentials., Comment: 16 pages

We study smooth, global-in-time solutions of the relativistic Vlasov-Maxwell system that possess arbitrarily large charge densities and electric fields. In particular, we construct spherically symmetric solutions that describe a thin shell of equally charged particles concentrating arbitrarily close to the origin and which give rise to charge densities and electric fields as large as one desires at some finite time. We show that these solutions exist even for arbitrarily small initial data or any desired mass. In the latter case, the time at which solutions concentrate can also be made arbitrarily large., Comment: 19 pages. arXiv admin note: text overlap with arXiv:1708.02307

For generators of Markov semigroups which lack a spectral gap, it is shown how bounds on the density of states near zero lead to a so-called "weak Poincar\'e inequality" (WPI), originally introduced by Liggett [Ann. Probab., 1991]. Applications to general classes of constant coefficient pseudodifferential operators are studied. Particular examples are the heat semigroup and the semigroup generated by the fractional Laplacian in the whole space, where the optimal decay rates are recovered. Moreover, the classical Nash inequality appears as a special case of the WPI for the heat semigroup., Comment: 15 pages, improved results including precise constants in the inequalities (including Nash), expanded class of examples

We study smooth, global-in-time solutions of the Vlasov-Poisson system in the plasma physical case that possess arbitrarily large charge densities and electric fields. In particular, we construct two classes of solutions with this property. The first class are spherically-symmetric solutions that initially possess arbitrarily small density and field values, but attain arbitrarily large values of these quantities at some later time. Additionally, we construct a second class of spherically-symmetric solutions that possess any desired mass and attain arbitrarily large density and field values at any later prescribed time.

We address the problem of epipolar geometry using the motion of silhouettes. Such methods match epipolar lines or frontier points across views, which are then used as the set of putative correspondences. We introduce an approach that improves by two orders of magnitude the performance over state-of-the-art methods, by significantly reducing the number of outliers in the putative matching. We model the frontier points' correspondence problem as constrained flow optimization, requiring small differences between their coordinates over consecutive frames. Our approach is formulated as a Linear Integer Program and we show that due to the nature of our problem, it can be solved efficiently in an iterative manner. Our method was validated on four standard datasets providing accurate calibrations across very different viewpoints.

The biharmonic operator plays a central role in a wide array of physical models, notably in elasticity theory and the streamfunction formulation of the Navier-Stokes equations. The need for corresponding numerical simulations has led, in recent years, to the development of a discrete biharmonic calculus. The primary object of this calculus is a high-order compact discrete biharmonic operator (DBO). The numerical results have been remarkably accurate, and have been corroborated by some rigorous proofs. However, there remained the "mystery" of the "underlying reason" for this success. This paper is a contribution in this direction, expounding the strong connection between cubic spline functions (on an interval) and the DBO. It is shown in particular that the (scaled) fourth-order distributional derivative of the cubic spline is identical to the action of the DBO on grid functions. The DBO is constructed in terms of the discrete Hermitian derivative. A remarkable fact is that the kernel of the inverse of the discrete operator is (up to scaling) equal to the grid evaluation of the kernel of $\Big[\Big(\frac{d}{dx}\Big)^4\Big]^{-1} .$ Explicit expressions are presented for both kernels. The relation between the (infinite) set of eigenvalues of the fourth-order Sturm-Liouville problem and the finite set of eigenvalues of the discrete biharmonic operator is studied, and the discrete eigenvalues are proved to converge (at an "optimal" $O(h^4)$ rate) to the continuous ones. Another remarkable consequence is the validity of a comparison principle. It is well known that there is no maximum principle for the fourth-order equation. However, a positivity result is derived, both for the continuous and the discrete biharmonic equation, showing that in both cases the kernels are order preserving.

Computing the epipolar geometry between cameras with very different viewpoints is often very difficult. The appearance of objects can vary greatly, and it is difficult to find corresponding feature points. Prior methods searched for corresponding epipolar lines using points on the convex hull of the silhouette of a single moving object. These methods fail when the scene includes multiple moving objects. This paper extends previous work to scenes having multiple moving objects by using the "Motion Barcodes", a temporal signature of lines. Corresponding epipolar lines have similar motion barcodes, and candidate pairs of corresponding epipoar lines are found by the similarity of their motion barcodes. As in previous methods we assume that cameras are relatively stationary and that moving objects have already been extracted using background subtraction.

It is known that epipolar geometry can be computed from three epipolar line correspondences but this computation is rarely used in practice since there are no simple methods to find corresponding lines. Instead, methods for finding corresponding points are widely used. This paper proposes a similarity measure between lines that indicates whether two lines are corresponding epipolar lines and enables finding epipolar line correspondences as needed for the computation of epipolar geometry. A similarity measure between two lines, suitable for video sequences of a dynamic scene, has been previously described. This paper suggests a stereo matching similarity measure suitable for images. It is based on the quality of stereo matching between the two lines, as corresponding epipolar lines yield a good stereo correspondence. Instead of an exhaustive search over all possible pairs of lines, the search space is substantially reduced when two corresponding point pairs are given. We validate the proposed method using real-world images and compare it to state-of-the-art methods. We found this method to be more accurate by a factor of five compared to the standard method using seven corresponding points and comparable to the 8-points algorithm., Comment: ICPR 2016, Cancun, Dec 2016

This paper establishes some of the fundamental barriers in the theory of computations and finally settles the long-standing computational spectral problem. That is to determine the existence of algorithms that can compute spectra $\mathrm{sp}(A)$ of classes of bounded operators $A = \{a_{ij}\}_{i,j \in \mathbb{N}} \in \mathcal{B}(l^2(\mathbb{N}))$, given the matrix elements $\{a_{ij}\}_{i,j \in \mathbb{N}}$, that are sharp in the sense that they achieve the boundary of what a digital computer can achieve. Similarly, for a Schr\"odinger operator $H = -\Delta+V$, determine the existence of algorithms that can compute the spectrum $\mathrm{sp}(H)$ given point samples of the potential function $V$. In order to solve these problems, we establish the Solvability Complexity Index (SCI) hierarchy and provide a collection of new algorithms that allow for problems that were previously out of reach. The SCI is the smallest number of limits needed in the computation, yielding a classification hierarchy for all types of problems in computational mathematics that determines the boundaries of what computers can achieve in scientific computing. In addition, the SCI hierarchy provides classifications of computational problems that can be used in computer-assisted proofs. The SCI hierarchy captures many key computational issues in the history of mathematics including the insolvability of the quintic, Smale's problem on the existence of iterative generally convergent algorithm for polynomial root finding, the computational spectral problem, inverse problems, optimisation etc.

Computing the epipolar geometry between cameras with very different viewpoints is often problematic as matching points are hard to find. In these cases, it has been proposed to use information from dynamic objects in the scene for suggesting point and line correspondences. We propose a speed up of about two orders of magnitude, as well as an increase in robustness and accuracy, to methods computing epipolar geometry from dynamic silhouettes. This improvement is based on a new temporal signature: motion barcode for lines. Motion barcode is a binary temporal sequence for lines, indicating for each frame the existence of at least one foreground pixel on that line. The motion barcodes of two corresponding epipolar lines are very similar, so the search for corresponding epipolar lines can be limited only to lines having similar barcodes. The use of motion barcodes leads to increased speed, accuracy, and robustness in computing the epipolar geometry., Comment: Update metadata

The relativistic Vlasov-Maxwell system describes the evolution of a collisionless plasma. The problem of linear instability of this system is considered in two physical settings: the so-called "one and one-half" dimensional case, and the three dimensional case with cylindrical symmetry. Sufficient conditions for instability are obtained in terms of the spectral properties of certain Schr\"odinger operators that act on the spatial variable alone (and not in full phase space). An important aspect of these conditions is that they do not require any boundedness assumptions on the domains, nor do they require monotonicity of the equilibrium., Comment: 49 pages

We introduce a simple and effective method for retrieval of videos showing a specific event, even when the videos of that event were captured from significantly different viewpoints. Appearance-based methods fail in such cases, as appearances change with large changes of viewpoints. Our method is based on a pixel-based feature, "motion barcode", which records the existence/non-existence of motion as a function of time. While appearance, motion magnitude, and motion direction can vary greatly between disparate viewpoints, the existence of motion is viewpoint invariant. Based on the motion barcode, a similarity measure is developed for videos of the same event taken from very different viewpoints. This measure is robust to occlusions common under different viewpoints, and can be computed efficiently. Event retrieval is demonstrated using challenging videos from stationary and hand held cameras.