The Hough Transform and Uncertainity

The paper deals with the generalisations of the Hough Transform making it the mean for analysing uncertainty. Some results related Hough Transform for Euclidean spaces are represented. These latter use the powerful means of the Generalised Inverse for description the Transform by itself as well as its Accumulator Function.

Hough Transform Approach to Identification of Flare Stars in Multi-exposure Plate Images

ACM Computing Classification System (1998): I.2.8 , I.2.10, I.5.1, J.2.

Detection of Logical-and-Probabilistic Correlation in Time Series

An application of the heterogeneous variables system prediction method to solving the time series analysis problem with respect to the sample size is considered in this work. It is created a logical-and-probabilistic correlation from the logical decision function class. Two ways is considered. When the information about event is kept safe in the process, and when it is kept safe in depending process.

An Algorithm for Fresnel Diffraction Computing Based on Fractional Fourier Transform

The fractional Fourier transform (FrFT) is used for the solution of the diffraction integral in optics. A scanning approach is proposed for finding the optimal FrFT order. In this way, the process of diffraction computing is speeded up. The basic algorithm and the intermediate results at each stage are demonstrated.

On the Error-Free Computation of Fast Cosine Transform

We extend our previous work into error-free representations of transform basis functions by presenting a novel error-free encoding scheme for the fast implementation of a Linzer-Feig Fast Cosine Transform (FCT) and its inverse. We discuss an 8x8 L-F scaled Discrete Cosine Transform where the architecture uses a new algebraic integer quantization of the 1-D radix-8 DCT that allows the separable computation of a 2-D DCT without any intermediate number representation conversions. The resulting architecture is very regular and reduces latency by 50% compared to a previous error-free design, with virtually the same hardware cost.

Minimization of Reactive Probabilistic Automata

The problem of finite automata minimization is important for software and hardware designing. Different types of automata are used for modeling systems or machines with finite number of states. The limitation of number of states gives savings in resources and time. In this article we show specific type of probabilistic automata: the reactive probabilistic finite automata with accepting states (in brief the reactive probabilistic automata), and definitions of languages accepted by it. We present definition of bisimulation relation for automata's states and define relation of indistinguishableness of automata states, on base of which we could effectuate automata minimization. Next we present detailed algorithm reactive probabilistic automata’s minimization with determination of its complexity and analyse example solved with help of this algorithm.

Self-Learning Fuzzy Spiking Neural Network as a Nonlinear Pulse-Position Threshold Detection Dynamic System Based on Second-Order Critically Damped Response Units

Architecture and learning algorithm of self-learning spiking neural network in fuzzy clustering task are outlined. Fuzzy receptive neurons for pulse-position transformation of input data are considered. It is proposed to treat a spiking neural network in terms of classical automatic control theory apparatus based on the Laplace transform. It is shown that synapse functioning can be easily modeled by a second order damped response unit. Spiking neuron soma is presented as a threshold detection unit. Thus, the proposed fuzzy spiking neural network is an analog-digital nonlinear pulse-position dynamic system. It is demonstrated how fuzzy probabilistic and possibilistic clustering approaches can be implemented on the base of the presented spiking neural network.

On the Range of the Fourier Transform Associated with the Spherical Mean Operator

We characterize the range of some spaces of functions by the Fourier transform associated with the spherical mean operator R and we give a new description of the Schwartz spaces. Next, we prove a Paley-Wiener and a Paley-Wiener-Schawrtz theorems.

An Analogue of Beurling-Hörmander’s Theorem for the Dunkl-Bessel Transform

Mathematics Subject Classification: Primary 35R10, Secondary 44A15

Hankel Transform in Quantum Calculus and Applications

Mathematics Subject Classification: 44A15, 33D15, 81Q99

Spectrum of Functions for the Dunkl Transform on R^d

Mathematics Subject Classification: 42B10

On Hankel Transform of Generalized Mathieu Series

Mathematics Subject Classification: Primary 33E20, 44A10; Secondary 33C10, 33C20, 44A20

Representations of Inverse Functions by the Integral Transform with the Sign Kernel

Mathematics Subject Classification: Primary 30C40

On Y. Nievergelt's Inversion Formula for the Radon Transform

Mathematics Subject Classification 2010: 42C40, 44A12.

Bochner-Hecke Theorems for the Weinstein Transform and Application

MSC 2010: 42B10, 44A15