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

Kazuhiko Ozeki

dblp:18/2118 · DBLP profile ↗
← Back
22ranked-venue papers
7as first author
0since 2021 · last 2004
—ORCID · none

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

Artificial intelligence and machine learning · 18 · 4 first-authorGraphics, computer vision, multimedia, augmented reality and games · 16 · 3 first-authorTheory of computation · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 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.

Theoretical computer science
2 papers
Information theory · 59% Mathematical optimization · 41%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%

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

TopicWeightPapersLastEvidence papers
Information theory › information measures
entropy
0.011980
A New Definition of the Entropy of General Probability Distributions Based on the Non-Standard Analysis · Inf. Control. 1980
Mathematical optimization › numerical analysis
eigenvalue analysis
0.011979
A Coordinate-Free Theory of Eingenvalue Analysis Related to the Method fo Principal Components and the Karhunen-Loève Expansion · Inf. Control. 1979
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
principal component analysis
0.011979
A Coordinate-Free Theory of Eingenvalue Analysis Related to the Method fo Principal Components and the Karhunen-Loève Expansion · Inf. Control. 1979
Information theory › probability theory › stochastic processes › stochastic process representation
karhunen-loève expansion
0.011979
A Coordinate-Free Theory of Eingenvalue Analysis Related to the Method fo Principal Components and the Karhunen-Loève Expansion · Inf. Control. 1979

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

nonstandard analysis · 0.0coordinate-free theory · 0.0
YearPublicationVenuePosition
2004 Dependency analysis of read Japanese sentences using pause and F0 information: a speaker independent case
Kazuyuki Takagi, Kazuhiko Ozeki
INTERSPEECH2
2004 Improved model training and automatic weight adjustment for multi-SNR multi-band speaker identification system
Kazuyuki Takagi, Kazuhiko Ozeki
INTERSPEECH3
2003 The use of multiple pause information in dependency structure analysis of spoken Japanese sentences
Meirong Lu, Kazuyuki Takagi, Kazuhiko Ozeki
INTERSPEECH3
2003 A neural network approach to dependency analysis of Japanese sentences using prosodic information
Kazuyuki Takagi, Mamiko Okimoto, Yoshio Ogawa, Kazuhiko Ozeki
INTERSPEECH4
2002 Combination of pause and F0 information in dependency analysis of Japanese sentences
Kazuyuki Takagi, Hajime Kubota, Kazuhiko Ozeki
INTERSPEECH3
2001 Pause information for dependency analysis of read Japanese sentences
Kazuyuki Takagi, Kazuhiko Ozeki
INTERSPEECH2
2001 A multi-SNR subband model for speaker identification under noisy environments
Kazuyuki Takagi, Kazuhiko Ozeki
INTERSPEECH3
2000 Effectiveness of prosodic features in syntactic analysis of read Japanese sentences
abstract
Prosody contains information that is lost when utterances are transcribed into letters or characters. This paper is concerned with exploiting such information for syntactic analysis of read Japanese sentences. In our previous work, we employed 12 prosodic features, and made a statistical model to represent the relationship between those features and dependency distances. Then, by incorporating the model in our parser, which allows the use of numerical information as linguistic knowledge, we showed that prosodic information is in fact effective for syntactic analysis. In the present work, we took up 24 prosodic features, and conducted an extensive search for effective ones. Also the statistical model was modified to account for the actual distribution of the feature values. In open experiments using an ATR 503-sentence database, parsing accuracy was improved by 21.2% compared with the case where no prosodic information was used. The duration of pauses at phrase boundaries was consistent...
Yukiyoshi Hirose, Kazuhiko Ozeki, Kazuyuki Takagi
INTERSPEECH2
2000 Effects of word string language models on noisy broadcast news speech recognition
abstract
In this paper, we present the results that our n-gram based word string language model, combined with speaker and noise adaptation of the acoustic model, improves recognition performance of noisy broadcast news speech. The focus was brought into a remedy against recognition errors of short words. The word string language models based on POS and n-gram frequency reduced deletion errors by 17%, insertion errors by 20%, and substitution errors by 3% in Japanese TV broadcast news speech recognition. 1 Introduction Recently large vocabulary continuous speech recognition systems have been challenged with increasingly difficult tasks, as the research focus has shifted from read speech data to speech data found in the real world. The Japanese counterpart of HUB-4 [1] broadcast news recognition projects have been pursued by NHK (Japan Broadcasting Corporation) and other research institutes since 1996 [2, 3]. The research has now stepped in the stage where real time captioning of news speech [...
Kazuyuki Takagi, Rei Oguro, Kazuhiko Ozeki
INTERSPEECH3
1999 Speaker identification using subband HMMS
Kazuyuki Takagi, Kazuhiko Ozeki
EUROSPEECH3
1999 A Classification Tree Approach to Automatic Segmentation of Japanese Compound Sentences
Kazuhiko Ozeki
PACLIC2
1998 Performance evaluation of word phrase and noun category language models for broadcast news speech recognition
abstract
This paper reports our work to improve a bigram language model for Japanese TV broadcast news speech recognition. First, frequent word strings were grouped into phrases in order that the phrases were added to the lexicon as new units of recognition. The test set perplexity was improved when frequent function word strings were used as additional recognition units. The speech recognition performance was improved both by grouping function word strings and by grouping compound nouns that were selected by word association ratio. Secondly, in order to alleviate the OOV problem related with nouns, we built and tested a language model that allows switching its noun lexicon according to the domain of the article to be recognized next. 1 INTRODUCTION The DARPA Hub-4 launched in 1995 is evaluating LVCSR systems to transcribe audio recordings of broadcast news [1]. The evaluation results have been updated annually [2]. The Japanese counterpart of HUB-4 broadcast news materials has been being deve...
Kazuyuki Takagi, Rei Oguro, Kenji Hashimoto, Kazuhiko Ozeki
ICSLP4
1998 Automatic Bunsetsu Segmentation of Japanese Sentences Using a Classification Tree
Kazuhiko Ozeki
PACLIC2
1997 Syntactic information contained in prosodic features of Japanese utterances
Kazuhiko Ozeki, Kazuyuki Kousaka
EUROSPEECH1
1996 Likelihood normalization using an ergodic HMM for continuous speech recognition
Kazuhiko Ozeki
ICSLP1
1994 Performance comparison of recognition systems based on the akaike information criterion
Kazuhiko Ozeki
ICSLP1
1994 Dependency Structure Analysis as Combinatorial Optimization
Kazuhiko Ozeki
Inf. Sci.1
1990 A Polynomial - Order Algorithm For Optimal Phrase Sequence Selection From A Phrase Lattice And Its Parallel Layered Implementation
Kazuhiko Ozeki
COLING1
1990 Clustering algorithms to minimize recognition error function and their applications to the vowel template learninig
Akio Ando, Kazuhiko Ozeki
ICSLP2
1986 A "Bunsetsu" speech recognition system using a top-down processor controlled by bottom-up information
abstract
This paper is concerned with a system to recognize continuously uttered "bunsetsu", which is a syntactic unit in the Japanese language. This system has two main features. One is that its top-down processor is directly controlled by bottom-up information: in the first stage, the bottom-up processor recognizes relatively unambiguous parts of the input speech signal using only local acoustical information, and then the recognition result is used to control the top-down processor for restriction of the number of hypotheses. The other feature is an unsupervised learning algorithm for vowel templates. This algorithm generates new vowel templates automatically by cutting out appropriate portions from the input speech, thus acquiring new knowledge for phonemes such as devocalized and nasalized vowels. A recognition experiment shows that the "bunsetsu" recognition rate for 1022 "bunsetsu"s uttered by 1 male speaker at 3 mora/sec rate is 86 %, and 65 % at 4 mora/sec rate.
Akio Ando, Kazuhiko Ozeki
ICASSP2
1980 A New Definition of the Entropy of General Probability Distributions Based on the Non-Standard Analysis
Kazuhiko Ozeki
Inf. Control.1
1979 A Coordinate-Free Theory of Eingenvalue Analysis Related to the Method fo Principal Components and the Karhunen-Loève Expansion
Kazuhiko Ozeki
Inf. Control.1