Related papers: Using wave packet decompositions to construct func…
We show that the Hardy spaces for Fourier integral operators form natural spaces of initial data when applying $\ell^{p}$-decoupling inequalities to local smoothing for the wave equation. This yields new local smoothing estimates which, in…
Signal decomposition and multiscale signal analysis provide many useful tools for time-frequency analysis. We proposed a random feature method for analyzing time-series data by constructing a sparse approximation to the spectrogram. The…
We develop a new envelope-function formalism to describe electrons in slowly-varying inhomogeneously strained semiconductor crystals. A coordinate transformation is used to map a deformed crystal back to geometrically undeformed structure…
This work aims to estimate 6Dof (6D) object pose in background clutter. Considering the strong occlusion and background noise, we propose to utilize the spatial structure for better tackling this challenging task. Observing that the 3D mesh…
Algorithmicists are well-aware that fast dynamic programming algorithms are very often the correct choice when computing on compositional (or even recursive) graphs. Here we initiate the study of how to generalize this folklore intuition to…
In this paper, we propose a functional analysis of a set of individual space-speed profiles corresponding to speed as function of the distance traveled by the vehicle from an initial point. This functional analysis begins with a functional…
Phase unwrapping is a key problem in many coherent imaging systems, such as synthetic aperture radar (SAR) interferometry. A general formulation for redundant integration of finite differences for phase unwrapping (Costantini et al., 2010)…
Some recent methods for lossy signal and image compression store only a few selected pixels and fill in the missing structures by inpainting with a partial differential equation (PDE). Suitable operators include the Laplacian, the…
Any homogeneous polynomial $P(x, y, z)$ of degree $d$, being restricted to a unit sphere $S^2$, admits essentially a unique representation of the form $\lambda_0 + \sum_{k = 1}^d \lambda_k [\prod_{j = 1}^k L_{kj}]$, where $L_{kj}$'s are…
This paper describes a novel approach to neighbour-finding in Smoothed Particle Hydrodynamics (SPH) simulations with large dynamic range in smoothing length. This approach is based on hierarchical cell decompositions, sorted interactions,…
Order parameters based on spherical harmonics and Fourier coefficients already play a significant role in condensed matter research in the context of systems of spherical or point particles. Here, we extend these types of order parameter to…
When dealing with concrete problems in a function space on R^n, it is sometimes helpful to have a dense subspace consisting of functions of a particular type, adapted to the problem under consideration. We give a theorem that allows one to…
How can I decompose a nonstationary signal? What are the advantages of using the most recent methods available in the literature versus using classical methods like (short time) Fourier transform or wavelet transform? This paper tries to…
The p-median problem is a classic discrete location problem with several applications. It aims to open p sites while minimizing the sum of the distances of each client to its nearest open site. We study a Benders decomposition of the most…
We survey recent results about composition operators induced by analytic self-maps of the unit disk in the complex plane on various Banach spaces of analytic functions taking values in infinite-dimensional Banach spaces. We mostly…
This study presents a divide-and-conquer (DC) approach based on feature space decomposition for classification. When large-scale datasets are present, typical approaches usually employed truncated kernel methods on the feature space or DC…
This chapter studies the problem of decomposing a tensor into a sum of constituent rank one tensors. While tensor decompositions are very useful in designing learning algorithms and data analysis, they are NP-hard in the worst-case. We will…
Single encoder-decoder methodologies for semantic segmentation are reaching their peak in terms of segmentation quality and efficiency per number of layers. To address these limitations, we propose a new architecture based on a decoder…
We establish sensitivity analysis on the sphere. We present formulas that allow us to decompose a function $f\colon \mathbb S^d\rightarrow \mathbb R$ into a sum of terms $f_{\boldsymbol u,\boldsymbol \xi}$. The index $\boldsymbol u$ is a…
This work builds on our earlier work on designing demodulators for diffusion-based molecular communications using a Markovian approach. The demodulation filters take the form of an ordinary differential equation (ODE) which computes the…