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

Minoru Kohata

dblp:41/4846 · DBLP profile ↗
← Back
8ranked-venue papers
8as first author
0since 2021 · last 2011
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 7 · 7 first-authorArtificial intelligence and machine learning · 3 · 3 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%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Audio and music processing › speech coding
line spectral frequency quantization
0.112007
A New Segment Quantization Using Lempel-Ziv Algorithm and Its Application to Quantization of Line Spectral Frequencies · IEEE Trans. Commun. 2007
Audio and music processing
speech coding
0.112007
A New Segment Quantization Using Lempel-Ziv Algorithm and Its Application to Quantization of Line Spectral Frequencies · IEEE Trans. Commun. 2007
Coding theory
source coding
0.112007
A New Segment Quantization Using Lempel-Ziv Algorithm and Its Application to Quantization of Line Spectral Frequencies · IEEE Trans. Commun. 2007
Coding theory › source coding › quantization
vector quantization
0.112007
A New Segment Quantization Using Lempel-Ziv Algorithm and Its Application to Quantization of Line Spectral Frequencies · IEEE Trans. Commun. 2007

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

lempel-ziv algorithm · 0.1
YearPublicationVenuePosition
2011 Bit rate reduction of the MELP coder using Lempel-Ziv segment quantization
abstract
We previously proposed a new segment quantization method called Lempel-Ziv segment quantization (LZSQ), which is a modified version of Lempel-Ziv (LZ) coding that can be applied to a continuous information source. In the present paper, LZSQ is applied to the mixed excitation linear prediction (MELP) coder, which is a standardized vocoder-type speech coder that operates at 2.4 kbit/s, in order to reduce the bit rate to below 2.4 kbit/s, while preserving the quality of the coded speech. LZSQ is applied to six coding parameters of the MELP coder to reduce the total bit rate as much as possible. As a result, the total bit rate of the modified MELP coder was reduced to 1.57 kbit/s, while the subjective quality of the modified MELP coder is equivalent to that of the previous MELP coder.
Minoru Kohata, Motoyuki Suzuki, Akinori Ito, Shozo Makino
ICASSP1
2007 A New Segment Quantization Using Lempel-Ziv Algorithm and Its Application to Quantization of Line Spectral Frequencies
abstract
A new segment quantization method using the Lempel-Ziv algorithm is proposed, and it is applied to quantize line spectral frequency parameters in speech codec. The proposed segment quantizer can save four bits per frame, compared with the ITU-T G.729 speech codec (18 bits/frame), without degradation of subjective or objective speech quality
Minoru Kohata, Motoyuki Suzuki, Akinori Ito, Shozo Makino
IEEE Trans. Commun.1
2005 A New Segment Quantizer for Line Spectral Frequencies Using Lempel-Ziv Algorithm
abstract
This paper presents a new segment quantization method, which is based upon the Lempel-Ziv algorithm, and it is applied to quantize LSF segments of speech signals. The proposed quantizer is compared with other practical coders such as the G.729 and the MELP, by substituting those original LSF quantizers with the proposed segment quantizer. As a result, at the same cepstral distortion, nine bits per frame were saved compared with the scalar quantizer of the MELP (25 bits/frame), and three bits per frame were saved compared with the MA prediction VQ of the G.729 (18 bits/frame), respectively.
Minoru Kohata, Motoyuki Suzuki, Shozo Makino
ICASSP (1)1
2000 Efficient segment quantization of LSP parameters for very low bit speech coding
Minoru Kohata, Ikuya Mitsuya, Motoyuki Suzuki, Shozo Makino
INTERSPEECH1
1999 1.2 kbit/s harmonic coder using auditory filters
abstract
In this paper, a very low bit speech coder at 1.2 kbps is newly proposed. Like the LPC vocoder, it only requires gain, pitch, and spectral information, but its quality is far superior. The synthesis method is one of harmonic coding, using sinusoids whose frequencies are multiples of the fundamental frequency, where the amplitudes of the sinusoids are adaptively modulated using gammatone filters as a perceptual weighting filter. The sinusoids' phases are also adjusted so as to maximize the perceptual quality. In order to reduce the total bit rate to 1.2 kbit/s, a new segment coder for spectral information (LSP coefficients) using DP matching is also proposed. The quality of the synthesized speech was improved by 0.45 in the mean opinion score (MOS) compared with that of the simple LPC vocoder operating at the same rate, and it was comparable to that of 2.4 kbit/s MELP coder.
Minoru Kohata
ICASSP1
1998 A sinusoidal harmonic vocoder at 1.2 kbps using auditory perceptual characteristics
Minoru Kohata
ICSLP1
1996 An application of recurrent neural networks to low bit rate speech coding
Minoru Kohata
ICSLP1
1994 Vector quantization with hyper-columnar clusters
abstract
A new vector quantization method is proposed which can reduce search complexity and code book memory size by reducing the number of code vectors without increasing quantization distortion. This method uses hyper-columnar clusters, and an input vector is quantized to a cluster, center axis of which is nearest to the input vector. Thus, one vector and one scalar must be coded and transmitted. The proposed method was applied to four geometrically different distributions and LPC cepstrums of speech signals. As a result, the number of code vectors was decreased compared with that in an ordinary vector quantizer, in all of the above distributions. Then the reduction of memory size and search complexity were evaluated.>
Minoru Kohata, Tasuku Takagi
ICASSP (1)1