Related papers: Efficient Retrieval of Similar Time Sequences Usin…
In this paper, we propose a new data structure for approximate nearest neighbor search. This structure augments the neighborhood graph with a bridge graph. We propose to exploit Cartesian concatenation to produce a large set of vectors,…
The Discrete Fourier Transform (DFT) underpins the solution to many inverse problems commonly possessing missing or un-measured frequency information. This incomplete coverage of Fourier space always produces systematic artefacts called…
We generalize the short-time Fourier transform (STFT) formalism for radial velocity extraction to cases where the underlying spectral components are unknown. The method factorizes a spectroscopic time series into principal spectra and…
One of the major challenges of employing a dual-frequency phase-shifting algorithm for phase retrieval is its sensitivity to noise. Yun et. al [H Yun, B Li, S Zhang. 2017] proposed a dual-frequency method based on the Fourier transform…
Stock price prediction is of significant importance in quantitative investment. Existing approaches encounter two primary issues: First, they often overlook the crucial role of capturing short-term stock fluctuations for predicting…
The study of binary pulsars enables tests of general relativity. Orbital motion in binary systems causes the apparent pulsar spin frequency to drift, reducing the sensitivity of periodicity searches. Acceleration searches are methods that…
We propose the Deep Distance Measurement Method (DDMM) to improve retrieval accuracy in unsupervised multivariate time series similarity retrieval. DDMM enables learning of minute differences within states in the entire time series and…
We investigate the uniqueness of short-time Fourier transform phase retrieval problems in $L^2(\mathbb{R})$. In particular, for underlying window functions whose Fourier transform decay faster than any exponential function, we derive…
Density Functional Theory (DFT) is one of the most used ab initio theoretical frameworks in materials science. It derives the ground state properties of a multi-atomic ensemble directly from the computation of its one-particle density \nr…
It is well-known since the seventies of last century that Depth First Search (DFS) can be used to compute strongly connected components [RE. Tarjan. SIAM Journal on Computing, 1972] and Breadth First Search (BFS) can be used to compute…
In some applications, one is interested in reconstructing a function $f$ from its Fourier series coefficients. The problem is that the Fourier series is slowly convergent if the function is non-periodic, or is non-smooth. In this paper, we…
We survey permutation-based methods for approximate k-nearest neighbor search. In these methods, every data point is represented by a ranked list of pivots sorted by the distance to this point. Such ranked lists are called permutations. The…
In this paper we propose a novel fingerprint indexing approach for speeding up in the fingerprint recognition system. What kind of features are used for indexing and how to employ the extracted features for searching are crucial for the…
In this research we address the problem of capturing recurring concepts in a data stream environment. Recurrence capture enables the re-use of previously learned classifiers without the need for re-learning while providing for better…
A novel addition to the family of integral transforms, the quadratic phase Fourier transform (QPFT) embodies a variety of signal processing tools, including the Fourier transform (FT), fractional Fourier transform (FRFT), linear canonical…
Channel estimation is one of the most important parts in current mobile communication systems. Among the huge contributions in channel estimation studies, the discrete Fourier transform (DFT)-based channel estimation has attracted lots of…
Many real-world networks are characterized by directionality; however, the absence of an appropriate Fourier basis hinders the effective implementation of graph signal processing techniques. Inspired by discrete signal processing, where…
Discrete Fourier transforms~(DFTs) over finite fields have widespread applications in error correction coding. Hence, reducing the computational complexities of DFTs is of great significance, especially for long DFTs as increasingly longer…
Range aggregate queries find frequent application in data analytics. In some use cases, approximate results are preferred over accurate results if they can be computed rapidly and satisfy approximation guarantees. Inspired by a recent…
In this paper, a novel and robust algorithm is proposed for adaptive beamforming based on the idea of reconstructing the autocorrelation sequence (ACS) of a random process from a set of measured data. This is obtained from the first column…