Related papers: A Comparative study of Arabic handwritten characte…
Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. In this paper, we pay special attention to the description of complex-data FFT. We analyze two common descriptions of…
We show that the quantum Fourier transform on finite fields used to solve query problems is a special case of the usual quantum Fourier transform on finite abelian groups. We show that the control/target inversion property holds in general.…
This note is a survey of various results on the capabilities of unique hard attention transformers encoders (UHATs) to recognize formal languages. We distinguish between masked vs. non-masked, finite vs. infinite image and general vs.…
Hybrid approaches for automatic vowelization of Arabic texts are presented in this article. The process is made up of two modules. In the first one, a morphological analysis of the text words is performed using the open source morphological…
Handwriting recognition (HWR) using inertial measurement unit (IMU) data remains challenging due to variations in writing styles and the limited availability of datasets. Previous approaches often struggle with handwriting from unseen…
Modeling non-stationary processes, where statistical properties vary across the input domain, is a critical challenge in machine learning; yet most scalable methods rely on a simplifying assumption of stationarity. This forces a difficult…
Handwritten text recognition aims to convert visual input into machine-readable text, and it remains challenging due to the evolving and context-dependent nature of handwriting. Character sets change over time, and character frequency…
The Fourier transform is typically seen as closely related to the additive group of real numbers, its characters and its Haar measure. In this paper, we propose an alternative viewpoint; the Fourier transform can be uniquely characterized…
Automatic readability assessment is relevant to building NLP applications for education, content analysis, and accessibility. However, Arabic readability assessment is a challenging task due to Arabic's morphological richness and limited…
Recent advances in multimodal deep learning have greatly enhanced the capability of systems for speech analysis and pronunciation assessment. Accurate pronunciation detection remains a key challenge in Arabic, particularly in the context of…
Uniqueness of normal forms ($UN^=$) is an important property of term rewrite systems. $UN^=$ is decidable for ground (i.e., variable-free) systems and undecidable in general. Recently it was shown to be decidable for linear, shallow…
Hilbert-Huang Transform (HHT) is a novel data analysis technique for nonlinear and non-stationary data. We present a time-frequency analysis of both simulated light curves and an X-ray burst from the X-ray burster 4U 1702-429 with both the…
The Fourier transform of the indicator function of arbitrary polygons and polyhedra is computed for complex wavevectors. Using the divergence theorem and Stokes' theorem, closed expressions are obtained. Apparent singularities, all…
The reliance of humans over machines has never been so high such that from object classification in photographs to adding sound to silent movies everything can be performed with the help of deep learning and machine learning algorithms.…
The dual-tree complex wavelet transform (DT-CWT) is known to exhibit better shift-invariance than the conventional discrete wavelet transform. We propose an amplitude-phase representation of the DT-CWT which, among other things, offers a…
Quantum Fourier transform (QFT) is a key function to realize quantum computers. A QFT followed by measurement was demonstrated on a simple circuit based on fiber-optics. The QFT was shown to be robust against imperfections in the rotation…
In this paper a method for recognition of handwritten devanagari characters is described. Here, feature vector is constituted by accumulated directional gradient changes in different segments, number of intersections points for the…
In this work, we formally prove that, under certain conditions, if a neural network is invariant to a finite group then its weights recover the Fourier transform on that group. This provides a mathematical explanation for the emergence of…
In this paper we construct directionally sensitive functions that can be viewed as directional time-frequency representations. We call such a sequence a rotational uniform covering frame and by studying rotations of the frame, we derive the…
In their study of inverse Doppler shift and superluminal light [Phys. Rev. A 91, 053807 (2015)], Ghafoor et al. consider a three-level atomic arrangement with transitions in the optical domain. In fact, the values they give to the…