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

Masayuki Hashimoto

dblp:76/6570 · DBLP profile ↗
← Back
19ranked-venue papers
5as first author
3since 2021 · last 2022
—ORCID · conflict

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

Graphics, computer vision, multimedia, augmented reality and games · 5 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 5 · 1 first-authorArtificial intelligence and machine learning · 3Security and privacy · 2 · 1 since 2021Human-computer interaction and ubiquitous computing · 2Software engineering, systems software and programming languages · 1 · 1 since 2021Theory of computation · 1 · 1 since 2021

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
Image and video coding · 67% Image and video processing · 33%

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

TopicWeightPapersLastEvidence papers
Image and video coding
image transcoding
0.012002
Tile boundary artifact reduction algorithms for tile size conversion of wavelet image · ACM Multimedia 2002
Image and video processing › image restoration › artifact removal
tile boundary artifact reduction
0.012002
Tile boundary artifact reduction algorithms for tile size conversion of wavelet image · ACM Multimedia 2002
Image and video coding › image compression
wavelet-based image coding
0.012002
Tile boundary artifact reduction algorithms for tile size conversion of wavelet image · ACM Multimedia 2002

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

wavelet transform · 0.0reversible filter · 0.0irreversible filter · 0.0
YearPublicationVenuePosition
2022 Decentralized and Collaborative Tracing for Group Signatures
abstract
We propose a decentralized but collaborative attribute-based tracing mechanism (a signer-identifying mechanism) for group signatures. Instead of a central tracing party in our scheme, a set of tracers satisfying the attribute set used for generating the group signature can identify the signer. Thus our proposal limits the parties who can identify the signer. On the other hand, it decentralized the tracing authority.
Maharage Nisansala Sevwandi Perera, Toru Nakamura, Masayuki Hashimoto, Hiroyuki Yokoyama, Chen-Mou Cheng, Kouichi Sakurai
AsiaCCS3
2021 Automatic Security Inspection Framework for Trustworthy Supply Chain
abstract
Threats and risks against supply chains are increasing and a framework to add the trustworthiness of supply chain has been considered. In this framework, organisations in the supply chain validate the conformance to the pre-defined requirements. The results of validations are linked each other to achieve the trustworthiness of the entire supply chain. In this paper, we further consider this framework for data supply chains. First, we implement the framework and evaluate the performance. The evaluation shows 500 digital evidences (logs) can be checked in 0.28 second. We also propose five methods to improve the performance as well as five new functionalities to improve usability. With these functionalities, the framework also supports maintaining the certificate chain.
Yuto Nakano, Toru Nakamura, Yasuaki Kobayashi, Takashi Ozu, Masahito Ishizaka, Masayuki Hashimoto, Hiroyuki Yokoyama, Yutaka Miyake, Shinsaku Kiyomoto
SERA6
2021 Almost fully anonymous attribute-based group signatures with verifier-local revocation and member registration from lattice assumptions
Maharage Nisansala Sevwandi Perera, Toru Nakamura, Masayuki Hashimoto, Hiroyuki Yokoyama, Kouichi Sakurai
Theor. Comput. Sci.3
2019 Traceable and Fully Anonymous Attribute Based Group Signature Scheme with Verifier Local Revocation from Lattices
Maharage Nisansala Sevwandi Perera, Toru Nakamura, Masayuki Hashimoto, Hiroyuki Yokoyama
NSS3
2018 Exploiting alternative acoustic sensors for improved noise robustness in speech communication
Panikos Heracleous, Jani Even, Fumiaki Sugaya, Masayuki Hashimoto, Akio Yoneyama
Pattern Recognit. Lett.4
2017 Speech emotion recognition in noisy and reverberant environments
abstract
The current study is focused on automatic speech emotion recognition, and particularly on the effect of additive noise and reverberation on speech emotion recognition. The emotional clean speech is produced by four professional actors, who simulate the neutral, joy, anger, and sadness emotions. To produce noisy emotional speech data, white Gaussian noise is superimposed onto the clean speech at several signal-to-noise ratio (SNR) levels. Concerning the reverberant emotional speech data, a technique is applied which is based on convolution of clean speech data with impulse responses recorded in several environments with different reverberation times. The four emotions are recognized using i-vectors, along with probabilistic linear discriminant analysis (PLDA), widely used in speaker recognition and adapted here for speech emotion recognition. When noisy and reverberant emotional speech data are recognized using clean models, the recognition rates are significantly decreased compared to the clean test data. To address this problem, a method based on multi-style training is applied, which utilizes training data of several SNR levels (different to the SNR level of the test data, therefore SNR-independent), or training on data with different reverberation times. Using multi-style training to recognize emotions in noisy or reverberant environments, the recognition rates are significantly increased, and the differences compared to the clean case are statistically not significant. Furthermore, the i-vector paradigm based classification method is compared with a baseline Gaussian mixture models (GMM) based method, and it demonstrates superior performance.
Panikos Heracleous, Keiji Yasuda, Fumiaki Sugaya, Akio Yoneyama, Masayuki Hashimoto
ACII5
2017 Machine Learning Approaches for Speech Emotion Recognition: Classic and Novel Advances
Panikos Heracleous, Akio Ishikawa, Keiji Yasuda, Hiroyuki Kawashima, Fumiaki Sugaya, Masayuki Hashimoto
CICLing (2)6
2017 Building a Location Dependent Dictionary for Speech Translation Systems
Keiji Yasuda, Panikos Heracleous, Akio Ishikawa, Masayuki Hashimoto, Kazunori Matsumoto, Fumiaki Sugaya
CICLing (2)4
2017 Automatic Scoring Method for Descriptive Test Using Recurrent Neural Network
Keiji Yasuda, Izuru Nogaito, Hiroyuki Kawashima, Hiroaki Kimura, Masayuki Hashimoto
EDM5
2015 Meal-Camera System to Support Nutritional Tele-Consultation for Diabetics
Masayuki Hashimoto, Umi Nakamura, Miki Akiyama, Toru Takebayashi, Marino Oshima, Tomoki Kumegawa, Hitomi Imachi, Koji Murao
AMIA1
2015 Implementation of a Mobile Electronic Medical Record System that Uses a Problem-oriented Contiguous Timeline View
Akiko Shibuya, Keisuke Ogawa, Kazunori Matsumoto, Masayuki Hashimoto, Yukihiro Maeda, Yoshiaki Kondo
AMIA4
2014 Clarifying requirements chronological visualization of medical data by investigating medical journal articles
Keisuke Ogawa, Kazunori Matsumoto, Masayuki Hashimoto, Akiko Shibuya, Yoshiaki Kondo
AMIA3
2010 Fast and robust content-based copy detection based on quadrant of luminance centroid and adaptive feature comparison
abstract
This paper proposes a fast and robust content-based copy detection scheme. Our proposal consists of a new compact feature, efficient keyframe selection and adaptive mask-based feature comparison. Firstly, a block-level luminance centroid is binarized into a 32-bit quadrant feature for fast and robust feature comparison. Subsequently, a new keyframe selection method is adopted to enhance pairwise independence between unrelated video segments in addition to choosing stable keyframes. Finally, a block-level mask-based feature comparison method is introduced to compare only stable features. Experimental results show our scheme improves recall by 0.1 at the same precision 0.9 and the processing speed in feature comparison of the proposed scheme is about twice as fast as that of conventional schemes.
Yusuke Uchida, Masayuki Hashimoto, Ryoichi Kawada
ICIP2
2004 CT image compression with level of interest
abstract
This paper proposes a novel CT image coding concept named LOI which stands for level of interest and coding methods based on that concept. The well-known ROI (region of interest) coding gives priority to pixels in particular regions of an image when encoding or decoding the image. Similarly, LOI coding gives priority to the pixels having a particular pixel level. LOI is ideal for coding of CT images and offers remarkably high coding efficiency. This paper proposes two types of LOI coding methods. One type is the floating point method and the other is the integer method. This paper verifies that the both types improve coding efficiency of pixels in the LOI window. This paper also shows that adequate image quality is obtained even if the viewing window is different from the LOI window.
Masayuki Hashimoto, Kenji Matsuo, Atsushi Koike, Hiroki Hayashi, Tetsuo Shimono
ICIP1
2004 A face image recognition scheme with strong tolerances to lighting fluctuations
Kenji Matsuo, Masayuki Hashimoto, Atsushi Koike
ICIP2
2003 JPEG2000 encoder for reducing tiling artifacts and accelerating the coding process
abstract
This paper proposes novel techniques for reducing tiling artifacts and encoding time which are two of the largest problems with the JPEG2000 encoder. The proposed method detects tiling artifacts during the coding process and reduces them automatically using tile-boundary adaptive post-quantization. It also provides a higher speed JPEG2000 coding process. This accelerated performance was obtained by predicting the truncation points using the entropy of wavelet transform coefficients prior to the arithmetic coding. This encoding method also requires no additional processing in the decoder. In the experiment, it was subjectively confirmed that tiling artifacts were greatly reduced and that the coding process was considerably accelerated.
Masayuki Hashimoto, Kenji Matsuo, Atsushi Koike
ICIP (1)1
2002 Tile boundary artifact reduction algorithms for tile size conversion of wavelet image
abstract
This paper proposes the tile size conversion method for the wavelet image transcoding gateway and a set of methods to reduce the tile boundary artifacts caused by the conversion.In the wavelet image coding system represented by JPEG2000, pictures are usually divided into one or more tiles and each tile then transformed separately. On low memory terminals such as mobile terminals, some decoders are likely to have limits on what tile sizes they can decode. Assuming a system using these limited decoders, methods were investigated for converting the tile size quickly and automatically at the gateway when image data with a non-decodable tile size is received at the gateway from another system. Furthermore, tile boundary artifacts reduction methods are investigated. This paper proposes a basic method, which creates a tiled wavelet coefficient sequence from a non-tiled wavelet coefficient sequence. This paper also verifies the validity of the proposed scheme by implementing it with a 5x3 reversible filter and a 9x7 irreversible filter.
Masayuki Hashimoto, Kenji Matsuo, Atsushi Koike, Yasuyuki Nakajima
ACM Multimedia1
1998 A new nonlinear system control method using second order derivatives of universal learning network
abstract
Universal learning networks (ULNs) have been proposed, which are a super set of any kinds of supervised learning networks. One of the important features of the ULNs is that the ULNs have a systematic algorithm for calculating higher order derivatives of the criterion function with respect to parameters. Both robust control and chaos control methods using the second order derivatives of the ULNs have also been proposed. In this paper, a new control design method of the nonlinear systems is proposed, which is an extension of the above robust control method in terms of the stability as well as the quick response of the systems.
Kotaro Hirasawa, Masanao Ohbayashi, Masayuki Hashimoto, Jinglu Hu, Junichi Murata
SMC3
1997 Forward and reverse link capacity enhancement of DS/CDMA cellular system using channel activation and soft power control techniques
abstract
This paper proposes a direct sequence/code division multiple access (DS/CDMA) cellular system using channel activation and soft power control techniques to increase both the forward and reverse link capacities. To equivalently control the received signal to interference and noise power ratio (CINR) to be constant, the proposed system employs a channel activation technique in which higher channel coding gain and small processing gain are employed with a shorter burst length during higher CINR period, and a lower channel coding gain and larger processing gain are employed with longer burst during lower CINR. Moreover, the proposed system employs a soft power control technique to enhance the advantages of the channel activation technique. Computer simulation confirms that the proposed system can achieve a higher system capacity with a smaller soft hand-off margin and a smaller average transmitter power.
Masayuki Hashimoto, Seiichi Sampei, Norihiko Morinaga
PIMRC1