Searcharxiv⌕ Search

arXiv subjects

Alexander Petrovsky

Publications and source records attributed to Alexander Petrovsky.

6 recordsLinked to original sources
arXiv2023

POA: Passable Obstacles Aware Path-planning Algorithm for Navigation of a Two-wheeled Robot in Highly Cluttered Environments

This paper focuses on Passable Obstacles Aware (POA) planner - a novel navigation method for two-wheeled robots in a highly cluttered environment. The navigation algorithm detects and classifies objects to distinguish two types of obstacles - passable and unpassable. Our algorithm allows two-wheeled robots to find a path through passable obstacles. Such a solution helps the robot working in areas inaccessible to standard path planners and find optimal trajectories in scenarios with a high number of objects in the robot's vicinity. The POA planner can be embedded into other planning algorithms and enables them to build a path through obstacles. Our method decreases path length and the total travel time to the final destination up to 43% and 39%, respectively, comparing to standard path planners such as GVD, A*, and RRT*

cs.RO↗
arXiv2022

A low multiplicative complexity fast recursive DCT-2 algorithm

A fast Discrete Cosine Transform (DCT) algorithm is introduced that can be of particular interest in image processing. The main features of the algorithm are regularity of the graph and very low arithmetic complexity. The 16-point version of the algorithm requires only 32 multiplications and 81 additions. The computational core of the algorithm consists of only 17 nontrivial multiplications, the rest 15 are scaling factors that can be compensated in the post-processing. The derivation of the algorithm is based on the algebraic signal processing theory (ASP). MATLAB implementation of the algorithm can be found in the public repository https://github.com/Mak-Sim/Fast_recursive_DCT.

cs.IT↗
arXiv2020

Practical design of multi-channel oversampled warped cosine-modulated filter banks

A practical approach to optimal design of multichannel oversampled warped cosine-modulated filter banks (CMFB) is proposed. Warped CMFB is obtained by allpass transformation of uniform CMFB. The paper addresses the problems of minimization amplitude distortion and suppression of aliasing components emerged due to oversampling of filter bank channel signals. Proposed optimization-based design considerably reduces distortions of overall filter bank transfer function taking into account channel subsampling ratios. Matlab-implementation of the proposed warped CMFB design method is available in public GitHub repository.

cs.IT↗
arXiv2020

Bulbar ALS Detection Based on Analysis of Voice Perturbation and Vibrato

On average the lack of biological markers causes a one year diagnostic delay to detect amyotrophic lateral sclerosis (ALS). To improve the diagnostic process an automatic voice assessment based on acoustic analysis can be used. The purpose of this work was to verify the sutability of the sustain vowel phonation test for automatic detection of patients with ALS. We proposed enhanced procedure for separation of voice signal into fundamental periods that requires for calculation of perturbation measurements (such as jitter and shimmer). Also we proposed method for quantitative assessment of pathological vibrato manifestations in sustain vowel phonation. The study's experiments show that using the proposed acoustic analysis methods, the classifier based on linear discriminant analysis attains 90.7\% accuracy with 86.7\% sensitivity and 92.2\% specificity.

cs.SD↗
arXiv2012

Derivation of fast DCT algorithms using algebraic technique based on Galois theory

The paper presents an algebraic technique for derivation of fast discrete cosine transform (DCT) algorithms. The technique is based on the algebraic signal processing theory (ASP). In ASP a DCT associates with a polynomial algebra C[x]/p(x). A fast algorithm is obtained as a stepwise decomposition of C[x]/p(x). In order to reveal the connection between derivation of fast DCT algorithms and Galois theory we define polynomial algebra over the field of rational numbers Q instead of complex C. The decomposition of Q[x]/p(x) requires the extension of the base field Q to splitting field E of polynomial p(x). Galois theory is used to find intermediate subfields L_i in which polynomial p(x) is factored. Based on this factorization fast DCT algorithm is derived.

cs.DS↗