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

Makoto Hasegawa

dblp:03/686 · DBLP profile ↗
← Back
14ranked-venue papers
9as first author
1since 2021 · last 2023
—ORCID · conflict

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

Artificial intelligence and machine learning · 6 · 3 first-authorSoftware engineering, systems software and programming languages · 4 · 3 first-authorSystems, architecture and hardware · 3 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 3 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorHuman-computer interaction and ubiquitous computing · 2 · 2 first-author · 1 since 2021Databases, 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.

Computer architecture, parallel and distributed computing, and storage systems
3 papers
Interconnection networks and networks-on-chip · 40% Integrated circuit design · 26% Processor architecture and microarchitecture · 23%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Integrated circuit design › 3d integration
3D VLSI
0.011986
AT2=O(N log4 N), T=O(log N) Fast Fourier Transform in a Light Connected 3-Dimensional VLSI · ISCA 1986
Interconnection networks and networks-on-chip
optical interconnection networks
0.011986
AT2=O(N log4 N), T=O(log N) Fast Fourier Transform in a Light Connected 3-Dimensional VLSI · ISCA 1986
Processor architecture and microarchitecture › instruction set architecture › instruction set style
stack architecture
0.011985
High-Speed Top-of-Stack Scheme for VLSI Processor: a Management Algorithm and Its Analysis · ISCA 1985
Interconnection networks and networks-on-chip › bus-based interconnection
bus
0.011981
Distributed Communicating Media-A Multitrack Bus-Capable of Concurrent Data Exchanging · ISCA 1981
Algorithms and data structures › fourier transform
fast fourier transform
0.011986
AT2=O(N log4 N), T=O(log N) Fast Fourier Transform in a Light Connected 3-Dimensional VLSI · ISCA 1986
Performance modeling and evaluation › storage performance evaluation
access time analysis
0.011985
High-Speed Top-of-Stack Scheme for VLSI Processor: a Management Algorithm and Its Analysis · ISCA 1985
Distributed systems
concurrent data transfer
0.011981
Distributed Communicating Media-A Multitrack Bus-Capable of Concurrent Data Exchanging · ISCA 1981

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

area-time complexity analysis · 0.0random-walk model · 0.0
YearPublicationVenuePosition
2023 STEM outreach activities for pre-university generation to be performed by the extra-curriculum project team of undergraduate students
abstract
The extra-curriculum project team organized by undergraduate students has performed various STEM outreach activities for pre-university generation in local community for almost 20 years. Small age differences are believed to be effective for realizing active communication during the activities, which is in turn believe to be effective for stimulating interests of younger children and students toward various STEM fields. The extra-curriculum status of the project team is also effective for improved qualities of the activities.
Makoto Hasegawa
EDUCON1
2020 Architecture for accurate polyp segmentation in motion-blurred colonoscopy images
abstract
The video colonoscopy analysis environment is prone to reduced resolution and blurred image quality, both of which greatly reduce the accuracy of computer-assisted polyp segmentation. However, polyp segmentation from blurred colonoscopy images has not received much attention in research till date. In this paper, we propose an extended high-frequency residual block, and introduce a segmentation network that improves on the deep residual U-Net. In our experiments, we show that motion-blurred colonoscopy images can be used for accurate segmentation of polyp areas. Our experimental evaluation also shows that the proposed method produces excellent segmentation results for publicly available data sets. Furthermore, we find that the proposed network1performs better than all the available state- of-the-art segmentation networks, The calculated dice coefficient and IoU of our network for unclear data with high amounts of motion blur were also found to be better than those of other conventional networks.
Makoto Takamatsu, Makoto Hasegawa
ICMLA2
2017 A study of social graph analysis for preschool education using face authentication: Pruning for centrality optimization in graph analysis
abstract
Social graph analysis for preschool education is discussed in this paper. Our social graph describes relations between preschool children and preschool teachers. The preschool teachers wear eyeglasses equipped with a video camera, and they take a video in their childcare. The social graph is created by a face recognition and authentication systems that perform identification for children and preschool teachers from the video. Some centralities of our graph are computed, and analyze the preschool education. When we take a long video, our social graph may become a complete graph, so that values of the centralities for all children are equal; it is our technical issues. In this paper, we discuss graph pruning and optimize our centralities for the graph analysis. Our performances of graph pruning are shown in our experiments.
Tsuyoshi Tomioka, Makoto Hasegawa, Shojiro Shiraishi
SNPD2
2016 Camera-captured document image perspective distortion correction using vanishing point detection based on Radon transform
abstract
A correction method for perspective distortions on document images is discussed. In documents, lines and line feeds give rise to many horizontal and vertical lines, then two vanishing points generated by these lines can be computed. High-energy regions are identified in the Radon transform thanks to a binarization step. Then, the image is zero-padded and the inverse Radon transform is applied to underline the main lines direction in the original image. The distortion is corrected by the perspective mapping determined with the two vanishing points and we propose to compute the homography matrix for the perspective mapping. Experimental results show that our method can correct the perspective distortions effectively and outperforms the state-of-the-art for vanishing points detection accuracy.
Yusuke Takezawa, Makoto Hasegawa, Salvatore Tabbone
ICPR2
2016 Histogram of Radon transform with angle correlation matrix for distortion invariant shape descriptor
Makoto Hasegawa, Salvatore Tabbone
Neurocomputing1
2014 Affine Invariant Shape Matching using Histogram of Radon Transform and Angle Correlation Matrix
abstract
An affine invariant shape matching method using the histogram of Radon transform (HRT) and the dynamic time warping (DTW) distance is proposed. Our descriptor based on the Radon transform is robust to shape rotation, uniform scaling, and translation. For non-uniform scaling and shearing, our descriptor has a non-linear sparse and dense distortion relative to the angle coordinates. Therefore, we apply DTW on a cost matrix to be robust to these transformations. This cost matrix is defined as an angle correlation matrix based on the product of two matrices only. Moreover, based on the beam search algorithm, we speed-up the time complexity of our method. Experimental results show that our approach is fast to compute and competitive compared to well-known descriptors.
Makoto Hasegawa, Salvatore Tabbone
ICPRAM1
2014 Amplitude-only log Radon transform for geometric invariant shape descriptor
Makoto Hasegawa, Salvatore Tabbone
Pattern Recognit.1
2013 Shape-based time series analysis for remote phenology studies
abstract
Remote phenology has motivated the development of new technologies for pattern observation. In this scenario, digital cameras have been used as data source for studies that estimate changes on phenological events. In this paper, we investigate the use of shape descriptors in the task of characterizing time series associated with phenological changes. The main objectives are: i) to determine which color channel is better for extracting shape descriptors and ii) to analyze the impact of the sunshine on the performance of shape descriptors.
Ricardo da Silva Torres, Makoto Hasegawa, Salvatore Tabbone, Jurandy Almeida, Jefersson A. dos Santos, Bruna Alberton, Leonor Patricia C. Morellato
IGARSS2
2011 A Shape Descriptor Combining Logarithmic-Scale Histogram of Radon Transform and Phase-Only Correlation Function
abstract
A shape descriptor combining the histogram of the Radon transform, the logarithmic-scale histogram, and the phase-only correlation function is proposed. Applying a logarithmic-scale to the Radon transform, the shape scaling and rotation become two-dimensional translation in our descriptor without any normalization. The geometric invariance to translation, when we match two shapes, are kept using the phase-only correlation function. In addition, we can determine with this function the rotation angle and the scale parameter between two shapes. Our descriptor is robust to shape occlusion and noise also.
Makoto Hasegawa, Salvatore Tabbone
ICDAR1
2007 Quantitative evaluation of Intelligent Ability with Computer Games
abstract
Owing to advanced information technologies, a computer works as our intelligent collaborator in our intelligent activities. Especially in educational environment of e-learning, a tutor needs take into consideration of learner's intelligent ability in collaboration with a computer. In this paper, the authors discuss quantitative evaluation of the intelligent ability with computer games. The details of intelligent ability are classified into quickness, logics, accuracy, memory, discernment, patience, decision, and inference, and evaluated quantitatively with computer games. The software for the evaluation is implemented. The result of the research will be able to apply to computer assisted education to support z learner's intelligent activities.
Makoto Hasegawa, Yukuo Isomoto
ICALT1
2003 Multi-antenna system for a handy phone to reduce influence by user's hand
abstract
A multi-antenna system without any switching circuits, which is suitable for the CDMA handy phone is proposed. The proposed antenna system is compiled of the two quarter wavelength monopole antennas (QMPA) located at the top and bottom of the handy phone, and the two QMPAs are simultaneously fed through a power divider in phase and same amplitude. The radiation efficiency is measured in three conditions that upper, center and lower portions of the handy phone are held by user's hand in the talk position. The radiation efficiency is generally high in the all conditions even if one of the QMPAs is wrapped by the hand. The proposed antenna system is effective to reduce the influence by user' hand. Moreover, the phase difference in feed circuit is varied by inserting a phase sifter between the power divider and the QMPA. Although the radiation pattern in free space is changed by the phase difference, the improvement of radiation efficiency in the talk position can be obtained as in phase.
Tomoaki Nishikido, Yutaka Saito, Makoto Hasegawa, Hiroshi Haruki, Yoshio Koyanagi, Kiyoshi Egawa
PIMRC3
1986 AT2=O(N log4 N), T=O(log N) Fast Fourier Transform in a Light Connected 3-Dimensional VLSI
abstract
We can perform a N-point FFT with time performance T=Ο(log N) and area-time performance AT 2 =Ο(N log 4 N), by using the 3-dimensional VLSI system which is optically interconnected. This performance exceeds the theoretical lower bound of the area-time performance (N 2 log 2 N) of the conventional VLSI.
Makoto Hasegawa, Yoshiharu Shigei
ISCA1
1985 High-Speed Top-of-Stack Scheme for VLSI Processor: a Management Algorithm and Its Analysis
abstract
The Top-Of-Stack(TOS) register is a high-speed storage which hold the top portion of the frequently used stack entries.We propose a Cut-Back-K algorithm, a sophisticated algorithm for TOS register management, to speed up the stack operation.The performance of this algorithm is analyzed with random-walk model.The effective stack access time with this algorithm can be as fast as the inherent access time of the TOS register in appropriate configurations.The inherent access time of TOSregister formed by on-chip shift register is proportional to O(1)~O(log N) for N cells.On the other hand, N elements arrav of dual-ports register takes O(N 27k) minimum access delay (k:some constant) .
Makoto Hasegawa, Yoshiharu Shigei
ISCA1
1981 Distributed Communicating Media-A Multitrack Bus-Capable of Concurrent Data Exchanging
Makoto Hasegawa, Tadao Nakamura, Yoshiharu Shigei
ISCA1