相关论文: Ultra-Fast Zernike Moments using FFT and GPU
Adapting image-pretrained backbones to video typically relies on time-domain adapters tuned to a single temporal scale. Our experiments show that these modules pick up static image cues and very fast flicker changes, while overlooking…
Fractional differential equations (FDEs) are an extension of the theory of fractional calculus. However, due to the difficulty in finding analytical solutions, there have not been extensive applications of FDEs until recent decades. With…
In this paper, a new and efficient numerical algorithm by using weak Galerkin (WG) finite element methods is proposed for a type of fourth order problem arising from fluorescence tomography(FT). Fluorescence tomography is an emerging, in…
We obtain for the Kempner series (i.e. harmonic series where certain digits are excluded from all denominators, for example the digit 9 in base 10) new representations as geometrically convergent series. The coefficients for these…
We introduce an efficient method for computing the Stekloff eigenvalues associated with the Helmholtz equation. In general, this eigenvalue problem requires solving the Helmholtz equation with Dirichlet and/or Neumann boundary condition…
The issue concerning the significant decline in the stability of feature extraction for images subjected to large-angle affine transformations, where the angle exceeds 50 degrees, still awaits a satisfactory solution. Even ASIFT, which is…
Wave propagation through random continuous media remains an important fundamental problem with applications ranging from remote sensing to quantum communication. Typically, such media are characterized by smooth refractive index…
We improve on Fourier transforms (FT) between imaginary time $\tau$ and imaginary frequency $\omega_n$ used in certain quantum cluster approaches using the Hirsch-Fye method. The asymptotic behavior of the electron Green's function can be…
Neural networks commonly execute on hardware accelerators such as NPUs and GPUs for their size and computation overhead. These accelerators are costly and it is hard to scale their resources to handle real-time workload fluctuations. We…
A new kind of geometric invariants is proposed in this paper, which is called affine weighted moment invariant (AWMI). By combination of local affine differential invariants and a framework of global integral, they can more effectively…
We introduce a novel method for obtaining a wide variety of moments of any random variable with a well-defined moment-generating function (MGF). We derive new expressions for fractional moments and fractional absolute moments, both central…
It is an open question how fast information processing can be performed and whether quantum effects can speed up the best existing solutions. Signal extraction, analysis and compression in diagnostics, astronomy, chemistry and broadcasting…
The $k$'th frequency moment of a sequence of integers is defined as $F_k = \sum_j n_j^k$, where $n_j$ is the number of times that $j$ occurs in the sequence. Here we study the quantum complexity of approximately computing the frequency…
Edge devices are being deployed at increasing volumes to sense and act on information from the physical world. The discrete Fourier transform (DFT) is often necessary to make this sensed data suitable for further processing -- such as by…
This paper introduces a novel, robust, and computationally efficient framework for high-quality quadrilateral mesh generation on general two-dimensional domains. The core of the proposed approach is a novel method for computing cross fields…
The short-time Fourier transform (STFT) is widely used for analyzing non-stationary signals. However, its performance is highly sensitive to its parameters, and manual or heuristic tuning often yields suboptimal results. To overcome this…
The eikonal equation is instrumental in many applications in several fields ranging from computer vision to geoscience. This equation can be efficiently solved using the iterative Fast Sweeping (FS) methods and the direct Fast Marching (FM)…
Fast algorithms for integer and polynomial multiplication play an important role in scientific computing as well as in other disciplines. In 1971, Sch{\"o}nhage and Strassen designed an algorithm that improved the multiplication time for…
In this work, the fast-convolving reproducing kernel particle method (FC-RKPM) is introduced. This method is hundreds to millions of times faster than the traditional RKPM for 3D meshfree simulations. In this approach, the meshfree…
The standard particle-in-cell algorithm suffers from grid heating. There exists a gridless alternative which bypasses the deposition step and calculates each Fourier mode of the charge density directly from the particle positions. We show…