Search

Your search keyword '"Kimura, Akisato"' showing total 34 results
Start Over Author "Kimura, Akisato" Publisher ieee
34 results on '"Kimura, Akisato"'

4. Font Generation with Missing Impression Labels

Author

Matsuda, Seiya, Kimura, Akisato, and Uchida, Seiichi

Subjects
FOS: Computer and information sciences, ComputingMethodologies_PATTERNRECOGNITION, Computer Vision and Pattern Recognition (cs.CV), Computer Science - Computer Vision and Pattern Recognition
Abstract

Our goal is to generate fonts with specific impressions, by training a generative adversarial network with a font dataset with impression labels. The main difficulty is that font impression is ambiguous and the absence of an impression label does not always mean that the font does not have the impression. This paper proposes a font generation model that is robust against missing impression labels. The key ideas of the proposed method are (1)a co-occurrence-based missing label estimator and (2)an impression label space compressor. The first is to interpolate missing impression labels based on the co-occurrence of labels in the dataset and use them for training the model as completed label conditions. The second is an encoder-decoder module to compress the high-dimensional impression space into low-dimensional. We proved that the proposed model generates high-quality font images using multi-label data with missing labels through qualitative and quantitative evaluations., Comment: Accepted ICPR2022

Published
2022

29. Designing various component analysis at will.

Author

Kimura, Akisato, Sakano, Hitoshi, Kameoka, Hirokazu, and Sugiyama, Masashi

Abstract

This paper provides a generic framework of component analysis (CA) methods introducing a new expression for scatter matrices and Gram matrices, called Generalized Pairwise Expression (GPE). This expression is quite compact but highly powerful: The framework includes not only (1) the standard CA methods but also (2) several regularization techniques, (3) weighted extensions, (4) some clustering methods, and (5) their semi-supervised extensions. This paper also presents quite a simple methodology for designing a desired CA method from the proposed framework: Adopting the known GPEs as templates, and generating a new method by combining these templates appropriately. [ABSTRACT FROM PUBLISHER]

Published
2012

31. Universal Source Coding Over Generalized Complementary Delivery Networks.

Author

Kimura, Akisato, Uyematsu, Tomohiko, Kuzuoka, Shigeaki, and Watanabe, Shun

Subjects
*CODING theory, *SIGNAL theory, *CODE generators, *COMPUTER input design, *INFORMATION theory, *COMMUNICATION, *DECODERS (Electronics)
Abstract

This paper deals with a universal coding problem for a certain kind of multiterminal source coding network called a generalized complementary delivery network. In this network, messages from multiple correlated sources are jointly encoded, and each decoder has access to some of the messages to enable it to reproduce the other messages. Both fixed-to-fixed length and fixed-to-variable length lossless coding schemes are considered. Explicit constructions of universal codes and the bounds of the error probabilities are clarified by using methods of types and graph-theoretical analysis. [ABSTRACT FROM AUTHOR]

Published
2009
Full Text
View/download PDF

32. A Quick Search Method for Audio Signals Based on a Piecewise Linear Representation of Feature Trajectories.

Author

Kimura, Akisato, Kashino, Kunio, Kurozumi, Takayuki, and Murase, Hiroshi

Subjects
HUMAN fingerprints, SOUND recordings, DATABASES
Abstract

This paper presents a new method for a quick similarity-based search through long unlabeled audio streams to detect and locate audio clips provided by users. The method involves feature-dimension reduction based on a piecewise linear representation of a sequential feature trajectory extracted from a long audio stream. Two techniques enable us to obtain a piecewise linear representation: the dynamic segmentation of feature trajectories and the segment-based Karhunen-Lóeve (KL) transform. The proposed search method guarantees the same search results as the search method without the proposed feature-dimension reduction method in principle. Experimental results indicate significant improvements in search speed. For example, the proposed method reduced the total search time to approximately 1/12 that of previous methods and detected queries in approximately 0.3 s from a 200-h audio database. [ABSTRACT FROM AUTHOR]

Published
2008
Full Text
View/download PDF

33. Weak Variable-Length Slepian--Wolf Coding With Linked Encoders for Mixed Sources.

Author

Kimura, Akisato and Uyematsu, Tomohiko

Subjects
*DATA transmission systems, *CODING theory, *DATA compression, *CODE generators, *PROBABILITY theory, *ERGODIC theory
Abstract

Coding problems for correlated information sources were first investigated by Slepian and Wolf. They considered the data compression system, called the SW system, where two sequences emitted from correlated sources are separately encoded to code words, and sent to a single decoder which has to output the original sequence pairs with a small probability of error. In this correspondence, we investigate the coding problem of a modified SW system allowing two encoders to communicate with zero rate. First, we consider the fixed-length coding and clarify that the admissible rate region for general sources is equal to that of the original SW system. Next, we investigate the variable-length coding having the asymptotically vanishing probability of error. We clarify the admissible rate region for mixed sources characterized by two ergodic sources and show that this region is strictly wider than that for fixed-length codes. Further, we investigate the universal coding problem for memoryless sources in the system and show that the SW system with linked encoders has much more flexibility than the original SW system. [ABSTRACT FROM AUTHOR]

Published
2004
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results