Hideaki Kimata
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
Research Subjects
Hideaki Kimata has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Yoshiki Inazu
Kogakuin University, Japan
2 shared publications - Hayaru Shouno
Graduate School of Informatics and Engineering, The University of Electro-Communications, Chofu, Tokyo 182-8585, Japan
1 shared publication - Jue Zhang
Department of Informatics, Kogakuin University, 1-24-2 Nishi-Shinjuku, Shinjuku-ku, 163-8677, Tokyo, Japan
1 shared publication Katsuhiko Fukazawa
NTT Cyber Space Laboratories, NTT Corporation, Yokosuka, Japan
1 shared publication- Kenta Nakada
Kogakuin University, Japan
1 shared publication - Masaki Kitahara
NTT, Inc
1 shared publication
Latest Publications
- Open Access
- 16 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 772-774
Improving the Accuracy of Model Placement in AR Applications for Presenting Affected Area Shapes
- 16 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 772-774
Open AccessImproving the Accuracy of Model Placement in AR Applications for Presenting Affected Area Shapes
- Open Access
- 19 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 165481-165495
Fast-Parallel Singular Value Thresholding for Low-Rank Analysis With Small Columns Matrices
This paper proposes a fast-parallel method for singular value thresholding, aimed at low-rank analysis of many small matrices. In low-rank analysis, the problem of regularizing the nuclear norm, defined as the sum of singular values, is typically solved by iteratively applying singular value thresholding. However, this process often requires a long run-time due to the computational cost of singular value decomposition. To address this issue, we provide a method that is computationally inexpensive and can be executed in parallel. The core of our approach lies in the discovery of geometric properties of the nuclear norm, leading to a computational process that is fundamentally different from conventional methods. Our method is fast because it does not require singular value decomposition, which has been a bottleneck in terms of computational complexity and parallelism. We design the computation method for two-column matrices as the main proposal, and also demonstrate an optional method for approximately solving the three-column matrices problem. Through experiments, the proposed method calculated singular value thresholding up to 65.81 times faster with higher calculation accuracy than conventional methods.We also applied our method to real data for noise removal in 3D models and confirmed the improvement in computational speed.
- 19 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 165481-165495
Open AccessFast-Parallel Singular Value Thresholding for Low-Rank Analysis With Small Columns Matrices
This paper proposes a fast-parallel method for singular value thresholding, aimed at low-rank analysis of many small matrices. In low-rank analysis, the problem of regularizing the nuclear norm, defined as the sum of singular values, is typically solved by iteratively applying singular value thresholding. However, this process often requires a long run-time due to the computational cost of singular value decomposition. To address this issue, we provide a method that is computationally inexpensive and can be executed in parallel. The core of our approach lies in the discovery of geometric properties of the nuclear norm, leading to a computational process that is fundamentally different from conventional methods. Our method is fast because it does not require singular value decomposition, which has been a bottleneck in terms of computational complexity and parallelism. We design the computation method for two-column matrices as the main proposal, and also demonstrate an optional method for approximately solving the three-column matrices problem. Through experiments, the proposed method calculated singular value thresholding up to 65.81 times faster with higher calculation accuracy than conventional methods.We also applied our method to real data for noise removal in 3D models and confirmed the improvement in computational speed.
- Open Access
- 14 March 2024
- Published by Association for Computing Machinery (ACM)
- p. 104-110
Study on Learned RGBA Image Compression Using Loss Function Based on Alpha Channel
Extensive research on image compression has focused mainly on the 3-channel RGB format. However, many real-world applications, including image editing, icon and logo creation, frequently use the RGBA format, which incorporates an additional "alpha" channel to adjust transparency. In this paper, we propose a new deep learning-based network architecture specifically designed for RGBA images. The proposed architecture consists of an RGB encoder to process 3-channel input images, an alpha encoder dedicated to 1-channel input images, an RGB decoder to generate RGB images from latent variables, and an alpha decoder to generate alpha images. To compress image signals with the alpha channel, the proposed network architecture takes into account that the compressed image signal is not limited to a rectangular shape and is able to take any shape. Furthermore, a new loss function for training the network is proposed to account for the different signal characteristics between the RGB signal representing the image and the alpha channel depicting shape and transparency. In the evaluation, to train the network, the COCO dataset commonly used for semantic segmentation tasks was used as training image data and the labeled segmentation regions were used as alpha channels. The proposed method was compared with existing compression methods that support RGBA, such as BPG, WebP and AVIF. Experimental results show that the proposed method improves rate distortion performance across all bit rates.
- 14 March 2024
- Published by Association for Computing Machinery (ACM)
- p. 104-110
Open AccessStudy on Learned RGBA Image Compression Using Loss Function Based on Alpha Channel
Extensive research on image compression has focused mainly on the 3-channel RGB format. However, many real-world applications, including image editing, icon and logo creation, frequently use the RGBA format, which incorporates an additional "alpha" channel to adjust transparency. In this paper, we propose a new deep learning-based network architecture specifically designed for RGBA images. The proposed architecture consists of an RGB encoder to process 3-channel input images, an alpha encoder dedicated to 1-channel input images, an RGB decoder to generate RGB images from latent variables, and an alpha decoder to generate alpha images. To compress image signals with the alpha channel, the proposed network architecture takes into account that the compressed image signal is not limited to a rectangular shape and is able to take any shape. Furthermore, a new loss function for training the network is proposed to account for the different signal characteristics between the RGB signal representing the image and the alpha channel depicting shape and transparency. In the evaluation, to train the network, the COCO dataset commonly used for semantic segmentation tasks was used as training image data and the labeled segmentation regions were used as alpha channels. The proposed method was compared with existing compression methods that support RGBA, such as BPG, WebP and AVIF. Experimental results show that the proposed method improves rate distortion performance across all bit rates.
- Open Access
- 23 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 9-15
A Study on Voxel Shape Generation and Reconstruction with VQ-VAE-2
- 23 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 9-15
Open AccessA Study on Voxel Shape Generation and Reconstruction with VQ-VAE-2
- Open Access
- 23 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 35-41
Study on Lightweight and Efficient Deep Image Compression Method Based on MBConv
There have been many studies on image compression using deep learning methods. The most of these studies have focused mainly on increasing the image compression ratio. However, for effective implementation in a wide range of mobile devices, it is crucial to also develop lightweight network architectures that can cope with the limited computational resources and power constraints of these devices. We have proposed three image compression methods based on the MBConv (Mobile inverted Bottleneck Convolution) architecture, which is proposed for image recognition tasks in mobile devices. The main goal of this research is to improve the performance of image compression while at the same time reducing the computational complexity of the network. To validate the effectiveness of the proposed method, we constructed a network based on previous research and conducted a series of experiments. Then, using Rate-Distortion curves, we compared the performance of the proposed method with that of a comparison method. The results showed that all three proposed methods improve the peak signal-to-noise ratio (PSNR), an objective evaluation metric, especially at medium and low bit rates. In addition, the proposed methods were shown to successfully reduce the number of parameters in the network by up to 22%.
- 23 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 35-41
Open AccessStudy on Lightweight and Efficient Deep Image Compression Method Based on MBConv
There have been many studies on image compression using deep learning methods. The most of these studies have focused mainly on increasing the image compression ratio. However, for effective implementation in a wide range of mobile devices, it is crucial to also develop lightweight network architectures that can cope with the limited computational resources and power constraints of these devices. We have proposed three image compression methods based on the MBConv (Mobile inverted Bottleneck Convolution) architecture, which is proposed for image recognition tasks in mobile devices. The main goal of this research is to improve the performance of image compression while at the same time reducing the computational complexity of the network. To validate the effectiveness of the proposed method, we constructed a network based on previous research and conducted a series of experiments. Then, using Rate-Distortion curves, we compared the performance of the proposed method with that of a comparison method. The results showed that all three proposed methods improve the peak signal-to-noise ratio (PSNR), an objective evaluation metric, especially at medium and low bit rates. In addition, the proposed methods were shown to successfully reduce the number of parameters in the network by up to 22%.
- 24 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 32 (6) , 3934-3946
Deep Feature Compression Using Spatio-Temporal Arrangement Toward Collaborative Intelligent World
Collaborative Intelligence is a new paradigm that splits a deep neural network (DNN) into an edge and cloud for deploying a DNN-based image recognition application. In this paradigm, deep features, which are the outputs of the edge DNN, are compressed and transmitted to the cloud DNN. Because the deep features have a number of responses that are similar to each other, for efficient compression, previous methods spatially arrange and compress the deep features as an image to utilize the similarity as a spatial correlation. However, if the deep features are arranged in not only spatial but also temporal directions like those in a video, it may be possible to compress them more efficiently by increasing a temporal correlation. To explore this possibility, we propose a “spatio-temporal arrangement”. This method spatially arranges the deep features as images and temporally arranges them as a video with a novel ordering search algorithm. Our method effectively increases the spatial and temporal correlations hidden in the deep features and achieves high compression efficiency compared with the previous methods. Experimental results demonstrate the compression efficiency of our method is better than that of the previous methods (1.50% to 4.98% on BD-Rate evaluation in a lossy setting). Our analysis shows that our method effectively increases the correlation when the input is an image with rich edges and textures.
- 24 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 32 (6) , 3934-3946
Deep Feature Compression Using Spatio-Temporal Arrangement Toward Collaborative Intelligent World
Collaborative Intelligence is a new paradigm that splits a deep neural network (DNN) into an edge and cloud for deploying a DNN-based image recognition application. In this paradigm, deep features, which are the outputs of the edge DNN, are compressed and transmitted to the cloud DNN. Because the deep features have a number of responses that are similar to each other, for efficient compression, previous methods spatially arrange and compress the deep features as an image to utilize the similarity as a spatial correlation. However, if the deep features are arranged in not only spatial but also temporal directions like those in a video, it may be possible to compress them more efficiently by increasing a temporal correlation. To explore this possibility, we propose a “spatio-temporal arrangement”. This method spatially arranges the deep features as images and temporally arranges them as a video with a novel ordering search algorithm. Our method effectively increases the spatial and temporal correlations hidden in the deep features and achieves high compression efficiency compared with the previous methods. Experimental results demonstrate the compression efficiency of our method is better than that of the previous methods (1.50% to 4.98% on BD-Rate evaluation in a lossy setting). Our analysis shows that our method effectively increases the correlation when the input is an image with rich edges and textures.
- 1 January 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21583994,p. 891-892
Partial delivery method with multi-bitrates and resolutions for interactive panoramic video streaming system
This paper examines delivery methods for the interactive panoramic video delivery service that enables users to watch high-resolution panoramic images beyond HD quality using available network resources and the TV sets in users' homes. We propose a new data format based on Multiview Video Coding and a partial delivery method that permits even restricted bandwidth networks to support high-quality partial panoramic video transmission. We show the experiments conducted on the proposed partial delivery method. The results show that two types of the proposed method can achieve higher subjective video quality than the deliver-all method when the ROI (Region Of Interest) moves.
- 1 January 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21583994,p. 891-892
Partial delivery method with multi-bitrates and resolutions for interactive panoramic video streaming system
This paper examines delivery methods for the interactive panoramic video delivery service that enables users to watch high-resolution panoramic images beyond HD quality using available network resources and the TV sets in users' homes. We propose a new data format based on Multiview Video Coding and a partial delivery method that permits even restricted bandwidth networks to support high-quality partial panoramic video transmission. We show the experiments conducted on the proposed partial delivery method. The results show that two types of the proposed method can achieve higher subjective video quality than the deliver-all method when the ROI (Region Of Interest) moves.