Marko D. Petkovic

dblp:26/3679 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
1since 2021 · last 2024
0000-0002-6862-1968ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 1 first-authorTheory of computation · 2 · 1 first-author · 1 since 2021Computer networks · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1
YearPublicationVenuePosition
2024 Zeroing neural network based on the equation AXA = A
Marko D. Petkovic, Predrag S. Stanimirovic
Inf. Comput.1
2019 Improved GNN Models for Constant Matrix Inversion
Predrag S. Stanimirovic, Marko D. Petkovic
Neural Process. Lett.2
2018 Modified discrete iterations for computing the inverse and pseudoinverse of the time-varying matrix
Marko D. Petkovic, Predrag S. Stanimirovic, Vasilios N. Katsikis
Neurocomputing1
2018 Gradient neural dynamics for solving matrix equations and their applications
Predrag S. Stanimirovic, Marko D. Petkovic
Neurocomputing2
2018 Gradient Neural Network with Nonlinear Activation for Computing Inner Inverses and the Drazin Inverse
Predrag S. Stanimirovic, Marko D. Petkovic, Dimitrios Gerontitis
Neural Process. Lett.2
2018 Support region estimation of the product polar companded quantizer for Gaussian source
Zoran H. Peric, Marko D. Petkovic, Jelena Nikolic, Aleksandra Jovanovic 0001
Signal Process.2
2011 Optimisation of variable-length code for data compression of memoryless Laplacian source
abstract
In this study, the authors present an efficient technique for compression and coding of memoryless Laplacian sources, which uses variable-length code (VLC). That technique is based on the combination of two companding quantisers in the first case and three companding quantisers in the second case. These quantisers have disjoint support regions, different number of representation levels and different compressor functions. The closed-form expressions are obtained for the distortion, average bit rate and signal to quantisation noise ratio (SQNR). The presented numerical results point out the effects of rate-distortion (R-D) optimisation on the system performances. Since our model assumes the general case of Laplacian distribution, it has wide applications like the coding of speech and images. It is shown that the difference of SQNR of our model and classical companding quantiser based model is 2.8 dB for two quantisers and 4.2 dB in three quantisers model. The authors have also made a comparison between our model, combination of the optimal uniform quantiser and Huffmann lossless coder and combination of optimal companding quantiser and simple lossless coder.
Marko D. Petkovic, Zoran H. Peric, Aleksandar V. Mosic
IET Commun.1
2010 Design of a Hybrid Quantizer with Variable Length Code
abstract
In this paper a new model for compression of Laplacian source is given. This model consists of hybrid quantizer whose output levels are coded with Golomb-Rice code. Hybrid quantizer is combination of uniform and nonuniform quantizer, and it can be considered as generalized quantizer, whose special cases are uniform and nonuniformquantizers. We propose new generalized optimal compression function for companding quantizers. Hybrid quantizer has better performances (smaller bit-rate and complexity for the same quality) than both uniform and nonuniformquantizers, because it joins their good characteristics. Also, hybrid quantizer allows great flexibility, because there are many combinations of number of levels in uniform part and in nonuniformpart, which give similar quality. Each of these combinations has different bit-rate and complexity, so we have freedom to choose combination which is the most appropriate for our application, in regard to quality, bit-rate and complexity. We do not have such freedom of choice when we use uniform or nonuniform quantizers. Until now, it has been thought that uniform quantizer is the most appropriate to use with lossless code, but in this paper we show that combination of hybrid quantizer and lossless code gives better performances. As lossless code we use Golomb-Rice code because it is especially suitable for Laplacian source since it gives average bit-rate very close to the entropy and it is easier for implementation than Huffman code. Golomb-Rice code is used in many modern compression standards. Our model can be used for compression of all signals with Laplacian distribution.
Zoran H. Peric, Milan R. Dincic, Marko D. Petkovic
Fundam. Informaticae3