Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Alexander V. Trushkin

dblp:86/4117 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
0since 2021 · last 2000
—ORCID · none

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

Theory of computation · 4 · 4 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
4 papers
Coding theory · 93% Information theory · 7%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › source coding › quantization
optimal quantization
0.041993
On the design of an optimal quantizer · IEEE Trans. Inf. Theory 1993
Monotony of Lloyd's method II for log-concave density and convex error weighting function · IEEE Trans. Inf. Theory 1984
Comment on 'Design of absolutely optimal quantizers for a wide class of distortion measures' by Sharma, D.K · IEEE Trans. Inf. Theory 1982
Coding theory › source coding
quantization
0.041993
On the design of an optimal quantizer · IEEE Trans. Inf. Theory 1993
Monotony of Lloyd's method II for log-concave density and convex error weighting function · IEEE Trans. Inf. Theory 1984
Comment on 'Design of absolutely optimal quantizers for a wide class of distortion measures' by Sharma, D.K · IEEE Trans. Inf. Theory 1982
Coding theory › source coding › quantization
lloyd's method
0.011984
Monotony of Lloyd's method II for log-concave density and convex error weighting function · IEEE Trans. Inf. Theory 1984
Information theory › probability theory
log-concave distribution
0.011984
Monotony of Lloyd's method II for log-concave density and convex error weighting function · IEEE Trans. Inf. Theory 1984
Coding theory › source coding › rate-distortion theory
fidelity criterion
0.011982
Sufficient conditions for uniqueness of a locally optimal quantizer for a class of convex error weighting functions · IEEE Trans. Inf. Theory 1982

Methods — techniques the papers use, named apart from their topics

lloyd's method i · 0.0dynamic programming · 0.0convex analysis · 0.0concavity conditions · 0.0
YearPublicationVenuePosition
2000 Estimation of stability and accuracy of inverse problem solution for the vocal tract
Victor N. Sorokin, Alexander S. Leonov, Alexander V. Trushkin
Speech Commun.3
1996 Articulatory-to-acoustic mapping for inverse problem
Victor N. Sorokin, Alexander V. Trushkin
Speech Commun.2
1993 On the design of an optimal quantizer
abstract
The problem of designing an optimal quantizer with a fixed number of levels for a wide class of error weighting functions and an arbitrary distribution function is discussed. The existence of an optimal quantizer is proved, and a two-stage algorithm for its design is suggested. In this algorithm, at the first stage, Lloyd's iterative Method I is applied for reducing the region where, at the second stage, the search for an optimal quantizer is performed using a hybrid of the dynamic programming algorithm and the Lloyd-Max algorithm, which achieves the absolute optimality of dynamic programming with much less computational effort. For a continuous distribution with log-concave density and an increasing convex weighting function of the absolute quantization error, a reliable method is presented to compute the parameters of the optimal quantizer with a known precision using a generalization either of Lloyd's Method I or of the Lloyd-Max algorithm.>
Alexander V. Trushkin
IEEE Trans. Inf. Theory1
1984 Monotony of Lloyd's method II for log-concave density and convex error weighting function
abstract
Kieffer recently showed that for a log-concave probability density there is a uniqueN-level quantizer which is a stationary point of the expected value of an increasing, convex, and continuously differentiable error weighting function, dependent on the absolute quantization error. It is shown that the requirement of continuous differentiability can be dropped, using the monotony of Lloyd's Method II, the proof of which is based on a generalization of previous work by the author.
Alexander V. Trushkin
IEEE Trans. Inf. Theory1
1982 Sufficient conditions for uniqueness of a locally optimal quantizer for a class of convex error weighting functions
abstract
Sufficient conditions are presented for uniqueness of a locally optimal quantizer being a stationary point of the quantization distortion measureE[f(x,\eta)], the expected value of an error weighting functionf(x,\eta), wherexis a random variable to be quantized, where the probability density functionp(x)describingxis continuous and positive on some finite or infinite interval and zero outside it, and where\etais the quantization error. The functionf(x,\eta)is assumed convex and symmetric in\etaand zero only for\eta = 0. It is shown that in the cases off(x,\eta)=\eta^{2}andf(x,\eta)=|\eta|, the simple condition of concavity of Inp(x)is sufficient for uniqueness of a locally optimal quantizer.
Alexander V. Trushkin
IEEE Trans. Inf. Theory1
1982 Comment on 'Design of absolutely optimal quantizers for a wide class of distortion measures' by Sharma, D.K
Alexander V. Trushkin
IEEE Trans. Inf. Theory1