Minoru Maruyama
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Minoru Maruyama has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Hidetoshi Miyao
Shinshu University
4 shared publications H. Miyao
Dept. of Inf. Eng., Shinshu Univ., Nagano, Japan
2 shared publicationsK. Murakami
NTT Laboratories
2 shared publicationsKosuke Ota
Shinshu Univ, Dept Elect & Comp Engn, 4-17-1 Wakasato, Nagano 3808553, Japan
2 shared publicationsHidetoshi Miyao
Shinshu University
1 shared publication- Hidetoshi Miyao
Academic Assembly School of Science and Technology Institute of Engineering, Shinshu University, Nagano city, Japan
1 shared publication
Latest Publications
- Open Access
- 20 November 2022
- Published by Fuji Technology Press Ltd. in Journal of Advanced Computational Intelligence and Intelligent Informatics
- Vol. 26 (6) , 995-1003
Multimodal Analogy-Based Image Retrieval by Improving Semantic Embeddings
Title: Multimodal Analogy-Based Image Retrieval by Improving Semantic Embeddings | Keywords: machine vision and scene understanding, natural language processing, deep learning, siamese network | Author: Kosuke Ota, Keiichiro Shirai, Hidetoshi Miyao, and Minoru Maruyama
- 20 November 2022
- Published by Fuji Technology Press Ltd. in Journal of Advanced Computational Intelligence and Intelligent Informatics
- Vol. 26 (6) , 995-1003
Open AccessMultimodal Analogy-Based Image Retrieval by Improving Semantic Embeddings
Title: Multimodal Analogy-Based Image Retrieval by Improving Semantic Embeddings | Keywords: machine vision and scene understanding, natural language processing, deep learning, siamese network | Author: Kosuke Ota, Keiichiro Shirai, Hidetoshi Miyao, and Minoru Maruyama
- 16 June 2022
- Published by Springer Nature
- p. 19-26
A Guitar Training System for Beginners Using a Mixed Reality Device and a MIDI Guitar
- 16 June 2022
- Published by Springer Nature
- p. 19-26
A Guitar Training System for Beginners Using a Mixed Reality Device and a MIDI Guitar
- Open Access
- 26 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 79449-79460
Efficient Pixel-Wise SVD Required for Image Processing Using the Color Line Feature
In color image processing based on mathematical optimization, a color-line image feature has been considered and many methods that give good results have been proposed. A color-line is a linear color distribution (correlation line) observed in a local image region, and is numerically represented by the sparsity of a data matrix generated from the neighboring pixel values. However, the calculation requires a lot of processing time because each data matrix is processed by inverse calculation or singular value decomposition (SVD) with some operations on the decomposed singular values. In this paper, in order to address this problem, we propose a method that can effectively compute SVD for each data matrix. Using the experimental knowledge that matrices obtained from neighboring regions (each centered at an adjacent pixel) are similar to each other, we intentionally design the SVD by using an iterative method (Arnoldi iteration), and propagate the converged singular vectors at a pixel to the next pixel as the initial vectors of the iteration. This propagation can drastically reduce the number of iterations required for convergence. Additionally, the singular values and vectors are obtained in descending order, which is advantageous when a matrix is reconstructed after reducing small singular values, so we can truncate the calculation when a singular value becomes lower than a threshold value. To show the effectiveness, we apply the proposed method to a denoising method, arranged structure-tensor total variation (ASTV), and show that the processing time is shortened by 95% compared to the naive method without losing numerical accuracy.
- 26 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 79449-79460
Open AccessEfficient Pixel-Wise SVD Required for Image Processing Using the Color Line Feature
In color image processing based on mathematical optimization, a color-line image feature has been considered and many methods that give good results have been proposed. A color-line is a linear color distribution (correlation line) observed in a local image region, and is numerically represented by the sparsity of a data matrix generated from the neighboring pixel values. However, the calculation requires a lot of processing time because each data matrix is processed by inverse calculation or singular value decomposition (SVD) with some operations on the decomposed singular values. In this paper, in order to address this problem, we propose a method that can effectively compute SVD for each data matrix. Using the experimental knowledge that matrices obtained from neighboring regions (each centered at an adjacent pixel) are similar to each other, we intentionally design the SVD by using an iterative method (Arnoldi iteration), and propagate the converged singular vectors at a pixel to the next pixel as the initial vectors of the iteration. This propagation can drastically reduce the number of iterations required for convergence. Additionally, the singular values and vectors are obtained in descending order, which is advantageous when a matrix is reconstructed after reducing small singular values, so we can truncate the calculation when a singular value becomes lower than a threshold value. To show the effectiveness, we apply the proposed method to a denoising method, arranged structure-tensor total variation (ASTV), and show that the processing time is shortened by 95% compared to the naive method without losing numerical accuracy.
- 13 May 2017
- Published by Springer Nature
- p. 591-596
Interactive Image Search System Based on Multimodal Analogy
- 13 May 2017
- Published by Springer Nature
- p. 591-596
Interactive Image Search System Based on Multimodal Analogy
- 1 January 2015
- Published by Springer Nature
- p. 534-538
Handwritten Character Recognition in the Air by Using Leap Motion Controller
- 1 January 2015
- Published by Springer Nature
- p. 534-538
Handwritten Character Recognition in the Air by Using Leap Motion Controller
- Open Access
- 1 September 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 53-60
Feature Extraction for Document Image Segmentation by pLSA Model
In this paper, we propose a method for document image segmentation based on pLSA (probabilistic latent semantic analysis) model. The pLSA model is originally developed for topic discovery in text analysis using "bag-of-words" document representation. The model is useful for image analysis by "bag-of-visual words" image representation. The performance of the method depends on the visual vocabulary generated by feature extraction from the document image. We compare several feature extraction and description methods, and examine the relations to segmentation performance. Through the experiments, we show accurate content-based document segmentation is made possible by using pLSA-based method.
- 1 September 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 53-60
Open AccessFeature Extraction for Document Image Segmentation by pLSA Model
In this paper, we propose a method for document image segmentation based on pLSA (probabilistic latent semantic analysis) model. The pLSA model is originally developed for topic discovery in text analysis using "bag-of-words" document representation. The model is useful for image analysis by "bag-of-visual words" image representation. The performance of the method depends on the visual vocabulary generated by feature extraction from the document image. We compare several feature extraction and description methods, and examine the relations to segmentation performance. Through the experiments, we show accurate content-based document segmentation is made possible by using pLSA-based method.
- Open Access
- 4 August 2006
- Published by Springer Nature in International Journal on Document Analysis and Recognition (IJDAR)
- Vol. 9 (1) , 49-58
An online handwritten music symbol recognition system
- 4 August 2006
- Published by Springer Nature in International Journal on Document Analysis and Recognition (IJDAR)
- Vol. 9 (1) , 49-58
Open AccessAn online handwritten music symbol recognition system
- 1 January 2005
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 494-498 Vol. 1
Off-line handwritten character recognition by SVM based on the virtual examples synthesized from on-line characters
This paper proposes a method to improve the off-line character classifiers which are learned from examples by using the virtual examples synthesized from on-line character database. To obtain the good classifiers, usually a large database which contains enough number of variations of handwritten characters is required. However, in practice collecting enough number of data is time-consuming and costly. In this paper, we propose a method to train SVM for off-line character recognition based on the artificially augmented examples using on-line characters. In our method, a virtual example is synthesized from an on-line character by applying affine transformation to each stroke. SVM classifiers are trained by using the artificially generated patterns. To reject inappropriate artificial examples, a preliminary SVM is learned from the original set of samples, and then used for data selection. Using the augmented training samples, the final SVM is obtained. We examine the effectiveness of the proposed method by experiments of handwritten Japanese Hiragana character classification.
- 1 January 2005
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 494-498 Vol. 1
Off-line handwritten character recognition by SVM based on the virtual examples synthesized from on-line characters
This paper proposes a method to improve the off-line character classifiers which are learned from examples by using the virtual examples synthesized from on-line character database. To obtain the good classifiers, usually a large database which contains enough number of variations of handwritten characters is required. However, in practice collecting enough number of data is time-consuming and costly. In this paper, we propose a method to train SVM for off-line character recognition based on the artificially augmented examples using on-line characters. In our method, a virtual example is synthesized from an on-line character by applying affine transformation to each stroke. SVM classifiers are trained by using the artificially generated patterns. To reject inappropriate artificial examples, a preliminary SVM is learned from the original set of samples, and then used for data selection. Using the augmented training samples, the final SVM is obtained. We examine the effectiveness of the proposed method by experiments of handwritten Japanese Hiragana character classification.
- 1 January 2004
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (10514651) , 687-690 Vol.2
Character extraction from natural scene images by hierarchical classifiers
This paper proposes a method to extract character regions in natural scene images by hierarchical classifiers. The hierarchy consists of two types of classifiers: histogram based classifier and SVM. On the bottom level, fast and reliable histogram based classifier is used to reject apparent non-character regions. On the next level, a non-linear SVM is exploited to make a final decision. One of the drawbacks of non-linear SVMs is its computational cost. To reduce the computational cost, we use sparse wavelet representation. Moreover, to reduce the cost further, we propose a method to approximate a SVM with sparse support vectors. We experimentally show this two-step method can perform very well with respect to both the computational cost and recognition rate.
- 1 January 2004
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (10514651) , 687-690 Vol.2
Character extraction from natural scene images by hierarchical classifiers
This paper proposes a method to extract character regions in natural scene images by hierarchical classifiers. The hierarchy consists of two types of classifiers: histogram based classifier and SVM. On the bottom level, fast and reliable histogram based classifier is used to reject apparent non-character regions. On the next level, a non-linear SVM is exploited to make a final decision. One of the drawbacks of non-linear SVMs is its computational cost. To reduce the computational cost, we use sparse wavelet representation. Moreover, to reduce the cost further, we propose a method to approximate a SVM with sparse support vectors. We experimentally show this two-step method can perform very well with respect to both the computational cost and recognition rate.
- 1 January 2004
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (10514651) , 461-464 Vol.1
An online handwritten music score recognition system
The objective of this study is to produce a system that would allow music symbols to be written by hand using a pen-based computer that would simulate the feeling of writing on sheets of paper and that would also accurately recognize the music symbols. To accomplish these objectives, the following methods are proposed: (1) Two features, time-series data and an image of a handwritten stroke, are used to recognize strokes; and (2) The strokes are combined, as efficiently as possible, and outputted automatically as a music symbol. As a result, recognition rates of 97.60% and 98.80% were obtained in tests with strokes and music symbols, respectively.
- 1 January 2004
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (10514651) , 461-464 Vol.1
An online handwritten music score recognition system
The objective of this study is to produce a system that would allow music symbols to be written by hand using a pen-based computer that would simulate the feeling of writing on sheets of paper and that would also accurately recognize the music symbols. To accomplish these objectives, the following methods are proposed: (1) Two features, time-series data and an image of a handwritten stroke, are used to recognize strokes; and (2) The strokes are combined, as efficiently as possible, and outputted automatically as a music symbol. As a result, recognition rates of 97.60% and 98.80% were obtained in tests with strokes and music symbols, respectively.