Przemyslaw Mazurek

Prof. Przemyslaw Mazurek

Department of Signal Processing and Multimedia Engineering, West Pomeranian University of Technology, 71126PL Szczecin, Poland
orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2014 in International Journal of Applied Mathematics and Computer Science
Verified
Journal Article
Closed access
PDF file
Przemyslaw MazurekPrzemyslaw Mazurek
Przemyslaw Mazurek
DODorota Oszutowska-Mazurek
Dorota Oszutowska-Mazurek

29 November 2012 in Soft Computing
Verified
Journal Article
Open access
PDF file
Przemyslaw MazurekPrzemyslaw Mazurek
Przemyslaw Mazurek
Track-before-detect (TBD) algorithms are used for tracking systems, where the object’s signal is below the noise floor (low-SNR objects). A lot of computations and memory transfers for real-time signal processing are necessary. GPGPU in parallel processing devices for TBD algorithms is well suited. Finding optimal or suboptimal code, due to lack of documentation for low-level programming of GPGPUs is not possible. High-level code optimization is necessary and the evolutionary approach, based on the single parent and single child is considered, that is local search approach. Brute force search technique is not feasible, because there are N! code variants, where N is the number of motion vectors components. The proposed evolutionary operator—LREI (local random extraction and insertion) allows source code reordering for the reduction of computation time due to better organization of memory transfer and the texture cache content. The starting point, based on the sorting and the minimal execution time metric is proposed. The unbiased random and biased sorting techniques are compared using experimental approach. Tests shows significant improvements of the computation speed, about 8 % over the conventional code for CUDA code. The time period of optimization for the sample code is about 1 h (1,000 iterations) for the considered recursive spatio-temporal TBD algorithm.

26 February 2021 in Remote Sensing
Verified
Journal Article
Open access
PDF file
GMGrzegorz Matczak
Grzegorz Matczak
Przemyslaw MazurekPrzemyslaw Mazurek
Przemyslaw Mazurek
Background estimation algorithms are important in UAV (Unmanned Aerial Vehicle) vision tracking systems. Incorrect selection of an algorithm and its parameters leads to false detections that must be filtered by the tracking algorithm of objects, even if there is only one UAV within the visibility range. This paper shows that, with the use of genetic optimization, it is possible to select an algorithm and its parameters automatically. Background estimation algorithms (CNT (CouNT), GMG (Godbehere-Matsukawa-Goldberg), GSOC (Google Summer of Code 2017), MOG (Mixture of Gaussian), KNN (K–Nearest Neighbor–based Background/Foreground Segmentation Algorithm), MOG2 (Mixture of Gaussian version 2), and MEDIAN) and the reference algorithm of thresholding were tested. Monte Carlo studies were carried out showing the advantages of the MOG2 algorithm for UAV detection. An empirical sensitivity analysis was presented that rejected the MEDIAN algorithm.


1 January 2012 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
DODorota Oszutowska-Mazurek
Dorota Oszutowska-Mazurek
Przemyslaw MazurekPrzemyslaw Mazurek
Przemyslaw Mazurek
KSKinga Sycz
Kinga Sycz
GWGrażyna Waker-Wójciuk
Grażyna Waker-Wójciuk

1 January 2013 in International Journal of Electronics and Telecommunications
Verified
Journal Article
Closed access
PDF file
Przemyslaw MazurekPrzemyslaw Mazurek
Przemyslaw Mazurek
The Track-Before-Detect (TBD) filter banks is proposed for the processing of noise object that are additive to the background noise. Spatio-Temporal TBD algorithm uses the preprocessing of measurement. The modified moving standard deviation filter is applied. The correction of the results for the selection of the highest possible filter banks window is proposed. Position and velocity errors are evaluated numerically for two smoothing coefficients. Monte Carlo test shows that all filter banks allow the tracking if the standard deviation of the background is below 1.3.