Related papers: Inversion and Integral Identities in dCFTs
It is demonstrated is this letter that linear multistep methods for integrating ordinary differential equations can be used to develop a family of fast forward scattering algorithms with higher orders of convergence. Excluding the cost of…
The inverse source problem for the Helmholtz equation poses significant challenges, particularly when sources exhibit complex or discontinuous geometries. Traditional numerical methods suffer from prohibitive computational costs, while…
The graph fractional Fourier transform (GFRFT) for unitary graph Fourier transform (GFT) matrices can be interpreted through the scalar function $e^{j\alpha\theta}$ on the unit circle. Under the principal branch, its Fourier-series…
We use analytic bootstrap techniques for a CFT with an interface or a boundary. Exploiting the analytic structure of the bulk and boundary conformal blocks we extract the CFT data. We further constrain the CFT data by applying the equation…
We formally extend the CFT techniques introduced in arXiv:1505.00963, to $\phi^{\frac{2d_0}{d_0-2}}$ theory in $d=d_0-\epsilon$ dimensions and use it to compute anomalous dimensions near $d_0=3, 4$ in a unified manner. We also do a similar…
We propose a novel framework for fast integral operations by uncovering hidden geometries in the row and column structures of the underlying operators. This is accomplished through the \texttt{Questionnaire} algorithm, an iterative…
We introduce a neural network architecture to solve inverse problems linked to a one-dimensional integral operator. This architecture is built by unfolding a forward-backward algorithm derived from the minimization of an objective function…
In this paper, we present a novel affine-invariant feature based on SIFT, leveraging the regular appearance of man-made objects. The feature achieves full affine invariance without needing to simulate over affine parameter space. Low-rank…
This note introduces a novel paradigm for conformal defects with continuously adjustable dimensions. Just as the standard $\varepsilon$ expansion interpolates between integer spacetime dimensions, a new parameter, $\delta$, is used to…
A cascaded iterative Fourier transform (CIFT) algorithm is presented for optical security applications. Two phase-masks are designed and located in the input and the Fourier domains of a 4-f correlator respectively, in order to implement…
In conformal field theory, the presence of a defect may break the global symmetry, giving rise to defect operators such as the tilts. In this work, we derive integral identities that relate correlation functions involving bulk and defect…
Piecewise affine functions are widely used to approximate nonlinear and discontinuous functions. However, most, if not all existing models only deal with fitting continuous functions. In this paper, we investigate the problem of fitting a…
This paper is concerned with parameter identification problem for finite impulse response (FIR) systems with binary-valued observations under low computational complexity. Most of the existing algorithms under binary-valued observations…
This paper proposes to use Fast Fourier Transformation-based U-Net (a refined fully convolutional networks) and perform image convolution in neural networks. Leveraging the Fast Fourier Transformation, it reduces the image convolution costs…
Conformal field theories (CFTs) in Euclidean signature satisfy well-accepted rules, such as conformal invariance and the convergent Euclidean operator product expansion (OPE). Nowadays, it is common to assume that CFT correlators exist and…
This work introduces a general numerical technique to invert one dimensional analytic or tabulated nonlinear functions in assigned ranges of interest. The proposed approach is based on an optimal version of the k-vector range searching, an…
In this work we present a new algorithm for data deconvolution that allows the retrieval of the target function with super-resolution with a simple approach that after a precis e measurement of the instrument response function (IRF), the…
For person re-identification, existing deep networks often focus on representation learning. However, without transfer learning, the learned model is fixed as is, which is not adaptable for handling various unseen scenarios. In this paper,…
A fast implementation of the OPED algorithm, a reconstruction algorithm for Radon data introduced recently, is proposed and tested. The new implementation uses FFT for discrete sine transform and an interpolation step. The convergence of…
This paper presents a new face identification system based on Graph Matching Technique on SIFT features extracted from face images. Although SIFT features have been successfully used for general object detection and recognition, only…