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

Charalampos Papanastasiou

dblp:97/11336 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1999
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorArtificial intelligence and machine learning · 1

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.

Computer graphics and multimedia
1 paper
Audio and music processing · 75% Image and video coding · 25%

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

TopicWeightPapersLastEvidence papers
Audio and music processing › speech coding
linear predictive coding
0.011999
Split matrix quantization of LPC parameters · IEEE Trans. Speech Audio Process. 1999
Audio and music processing › speech coding
line spectral frequency quantization
0.011999
Split matrix quantization of LPC parameters · IEEE Trans. Speech Audio Process. 1999
Audio and music processing
speech coding
0.011999
Split matrix quantization of LPC parameters · IEEE Trans. Speech Audio Process. 1999
Image and video coding › quantization
vector quantization
0.011999
Split matrix quantization of LPC parameters · IEEE Trans. Speech Audio Process. 1999

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

split vector quantization · 0.0
YearPublicationVenuePosition
1999 Split matrix quantization of LPC parameters
abstract
This paper examines in detail the design issues and performance characteristics of linear predictive coding (LPC) split matrix quantization (SMQ). This efficient LPC quantization method which was proposed by Xydeas and Papanastasiou (1995) can be viewed as an extension of the conventional split vector quantization (SVQ) process. SMQ removes existing interframe/intraframe line spectral frequency (LSF) redundancy by applying VQ principles on trajectories of smoothly evolving, with time, LSF coefficients. Using a 20 ms LPC analysis frame size, "transparent" quantization is achieved at 900 b/s, whereas "high quality" LSF quantization is easily obtained at 650 b/s, Furthermore, the SMQ methodology offers valuable flexibility in the way quantization of LPC coefficients is performed and leads into several schemes of varying computational complexity/storage characteristics.
Costas S. Xydeas, Charalampos Papanastasiou
IEEE Trans. Speech Audio Process.2
1997 Efficient mixed excitation models in LPC based prototype interpolation speech coders
abstract
This paper presents a new and efficient method for modeling voiced, mixed excitation spectra in sinusoidal (SC) and prototype interpolation coding (PIC) systems. Speech harmonics are classified as "weak-voiced" or "strong-voiced" by simply examining the short-term residual magnitude spectrum. This information is encoded effectively in terms of fixed width frequency bands and is used to control sets of periodic and random sine wave oscillators which model the short-term mixed excitation nature of speech. In this way the model allows the mixing of periodic and random signal energy on a harmonic basis. The proposed methodology has been used in a 2.4 Kbits/sec speech coder, whose recovered speech quality is better than that of the 4.8 Kbits/sec DoD standard.
Charalampos Papanastasiou, Costas S. Xydeas
ICASSP1
1995 Efficient coding of LSP parameters using split matrix quantisation
abstract
This paper presents a new and efficient LPC quantisation scheme called split matrix quantisation (SMQ). The proposed method can be viewed as an extension of the conventional split vector quantisation process. It operates over N consecutive LPC frames and effectively divides a p/spl times/N LSP matrix into K submatrices which are then vector quantised independently. SMQ exploits the interframe redundancy that exists between consecutive sets of LSP coefficients and achieves "transparent" quantisation at 900 bits/sec. "High quality" LSP quantisation can be easily obtained at 750 bits/sec. These bit rates are based in a 20 msec LPC analysis frame size. Furthermore, SMQ is characterised by relatively low complexity and low storage requirements.
Costas S. Xydeas, Charalampos Papanastasiou
ICASSP2