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

Yoshikazu Yokotani

dblp:72/11519 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2006
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2Artificial intelligence and machine learning · 1 · 1 first-authorComputer networks · 1 · 1 first-author

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 · 100%

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

TopicWeightPapersLastEvidence papers
Audio and music processing
audio coding
0.112006
Lossless Audio Coding Using the IntMDCT and Rounding Error Shaping · IEEE Trans. Speech Audio Process. 2006
Audio and music processing › audio coding
lossless audio coding
0.112006
Lossless Audio Coding Using the IntMDCT and Rounding Error Shaping · IEEE Trans. Speech Audio Process. 2006

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

rounding error shaping · 0.1lifting scheme · 0.1integer modified discrete cosine transform · 0.1
YearPublicationVenuePosition
2006 Audio Data Hiding with High Data Rates Based on Intmdct
abstract
This paper describes high data-rate audio data hiding using the IntMDCT. The IntMDCT is an integer approximation of the MDCT with perfect reconstruction. Based on this transform, we describe a straight-forward way to embed data and extract it in a bit-exact manner while perceptual transparency is maintained. Since the IntMDCT spectrum can be used to obtain a closer approximation of the masking threshold compared to time domain approaches, it is possible to achieve higher data rates. In a simple experimental implementation, we found we could embed data at rates up to about 140 kb/s without introducing audible distortions
Ralf Geiger, Yoshikazu Yokotani, Gerald Schuller
ICASSP (5)2
2006 Lossless Audio Coding Using the IntMDCT and Rounding Error Shaping
abstract
In this paper, lossless audio coding using the integer modified discrete cosine transform (IntMDCT) is discussed. The IntMDCT is constructed as an integer approximation of the MDCT using the lifting scheme and is reversible. The rounding error shape of the IntMDCT is derived. When the spectral energy of the input audio signal is concentrated at the low frequencies, the rounding error spectrum limits the lossless coding performance. A method for shaping the rounding error in the transform domain is presented. This rounding error shaping scheme manipulates the error so that it is below the spectral envelope of the signal at the high frequencies in order to improve the lossless coding performance for the signal. Examples of an error shaping filter design are presented and verified by simulations. An IntMDCT-based lossless coding implementation is carried out to illustrate the use of the error shaping filters
Yoshikazu Yokotani, Ralf Geiger, Gerald Schuller, Soontorn Oraintara, Kamisetty Ramamohan Rao
IEEE Trans. Speech Audio Process.1
2004 Approximation error analysis for transform-based lossless audio coding
abstract
The integer modified discrete cosine transform (IntMDCT), an integer approximation of the MDCT, is a reversible transform realized by the lifting scheme and thus is a useful transform for lossless audio coding. Because of the integer approximation, however, the approximation error appears as a "noise floor" in the transform domain and limits the lossless coding efficiency. In this paper, a theoretical analysis of the approximation error of the IntMDCT is discussed. The result is then used to design a simple test filter applied to each rounding operation of the IntMDCT in such a way that the error spectrum is shaped towards the low frequencies. As a result, especially when the spectral energy of an input signal is concentrated in the low frequency domain, the lossless coding efficiency is improved.
Yoshikazu Yokotani, Soontorn Oraintara, Ralf Geiger, Gerald Schuller, Kamisetty Ramamohan Rao
GLOBECOM1
2004 Improved integer transforms using multi-dimensional lifting [audio coding examples]
abstract
Recently lifting-based integer transforms have received much attention, especially in the area of lossless audio and image coding. The usual approach is to apply the lifting scheme to each Givens rotation. Especially in the case of long transform sizes in audio coding applications, this leads to a considerable approximation error in the frequency domain. This paper presents a multidimensional lifting approach for reducing this approximation error. In this approach, large parts of the transform are calculated without rounding operations, only the output is rounded and added. The new approach is applied and evaluated for both the integer modified discrete cosine transform (IntMDCT) and the integer fast Fourier transform (IntFFT).
Ralf Geiger, Yoshikazu Yokotani, Gerald Schuller, Jürgen Herre
ICASSP (2)2