VLDB 2026 Research / reviewers in the wild / expert
Shunsuke Araki
dblp:19/1010
· DBLP profile ↗
18ranked-venue papers
6as first author
3since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 14 · 6 first-authorTheory of computation · 13 · 5 first-authorSoftware engineering, systems software and programming languages · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Reflections Removal Produced by Multiple Transparent and Reflective Glass Objects in TLS MeasurementsabstractIn the measurement of buildings using terrestrial laser scanners, the measurement data contains a large amount of noise that is erroneously measured due to reflections from reflective and transparent glass objects. Measurement data containing such reflection noise adversely affects the analysis that uses it. In this study, we propose an efficient method to remove these erroneous measurements. First, we estimate the glass regions that are the source of the reflection noise based on the reflection intensity of the measured point cloud. Next, we trace the path of the laser beams using the estimated glass regions and the laser scanner position to estimate the area where reflection noise can occur. Finally, we detect reflection noises based on a combination of (1) the symmetry of the noise point cloud and its source entity due to reflection by the window and (2) the geometric similarity of those point clouds, and only reflection noise is removed based on them. Experimental results showed that the reflection noise removal rate reached around 90%, confirming that only the reflection noise can be selectively removed from a measurement point cloud. Wanpeng Shao, Ken'ichi Kakizaki, Shunsuke Araki, Tomohisa Mukai |
COMPSAC | 3 |
| 2022 | Automated Two-Stage Approach for Damage Detection of Surface Defects in Historical BuildingsabstractDamages of reinforced concrete buildings caused by aging or complicated environmental factors have become a worldwide problem. It is critical to accurately obtain damage information to determine the current state of the aging structure or its levels of decay. However, the inspection of multiple damages o the whole surface of a concrete structure is challenging. In this study, we present a two-stage method for damage detection of surface deflects of reinforced concrete buildings in point clouds captured by a terrestrial laser scanner using a 3D neural network and a novel cluster analysis technique. In the first stage, we divide the whole building into 3D grids, then a classification of multiple damages is performed using PointNet++ along with 3D data with color information mapped on it. In the second stage, we propose a four-step post-processing method based on cluster analysis including removal of isolated damaged clusters, dilation, and filling to develop the detection results. Experimental results show that the voxel-based recall rate reaches 0.928 and the precision rate reaches 0.753. The proposed method offers an acceptable damage detection performance on aging concrete surfaces. Wanpeng Shao, Ken'ichi Kakizaki, Shunsuke Araki, Tomohisa Mukai |
COMPSAC | 3 |
| 2021 | Damage Detection of the RC Building in TLS Point Clouds Using 3D Deep Neural Network PointNet++abstractWe are working on a research project to evaluate the safety and structure of reinforced concrete buildings damaged by earthquakes using point cloud data acquired by a terrestrial laser scanner. We propose a framework for damage analysis as a classification problem that divides a building in point clouds into small 3D voxel grids and determines which voxels are damaged, instead of detecting the damaged parts from the point cloud of the whole building. Our framework is divided into three steps: First, the damaged building in point clouds is divided into small 3d voxel grids. Second, every voxel is fed into the deep neural network for damage classification. As a deep neural network to classify the voxel grids, we used PointNet++. Finally, the original damage map is refined by a simple cluster analysis. After post-processing, the recall reaches 0.929. That is, 92.9% of damage portions are correctly detected although the damage map still contains some FPs. Wanpeng Shao, Ken'ichi Kakizaki, Shunsuke Araki, Tomohisa Mukai |
ISM | 3 |
| 2020 | A Study on Randomness of Sequences Obtained from Piecewise Logistic Map over Integers
Sota Eguchi, Takeru Miyazaki, Shunsuke Araki, Satoshi Uehara, Yasuyuki Nogami |
ISITA | 3 |
| 2020 | A Study on Binary Sequences Located in Hadamard Matrices of Order 2n
Kasumi Nakano, Kako Takahashi, Satoshi Uehara, Takeru Miyazaki, Shunsuke Araki, Yasuyuki Nogami |
ISITA | 5 |
| 2018 | A Study on Computational Methods of the Logistic Map over Integers for a Pseudorandom Number GeneratorabstractIn this paper, we will discuss properties of different computational methods of the logistic map over integers. We will give four computational methods of the map in order to implement the map on a computer with limited memories, and then will evaluate average processing times and lengths of sequences generated by these methods. By these results, we will provide a constructive use of these four computational methods of the logistic map over integers for a design of the pseudorandom number generator. Shunsuke Araki, Hideyuki Muraoka, Takeru Miyazaki, Satoshi Uehara, Ken'ichi Kakizaki |
ISITA | 1 |
| 2016 | A design guide of renewal of a parameter of the logistic map over integers on pseudorandom number generator
Shunsuke Araki, Hideyuki Muraoka, Takeru Miyazaki, Satoshi Uehara, Ken'ichi Kakizaki |
ISITA | 1 |
| 2016 | Occurrence rate per bit for any control parameter on the logistic map over integers
Hideyuki Muraoka, Shunsuke Araki, Takeru Miyazaki, Satoshi Uehara, Ken'ichi Kakizaki |
ISITA | 2 |
| 2014 | Initial values entering into an element zero with period one for logistic maps over integers
Shunsuke Araki, Ken'ichi Kakizaki, Takeru Miyazaki, Satoshi Uehara |
ISITA | 1 |
| 2014 | A study of an automorphism on the logistic maps over prime fields
Takeru Miyazaki, Shunsuke Araki, Satoshi Uehara, Yasuyuki Nogami |
ISITA | 2 |
| 2014 | Relations between evaluations of NIST tests and Lyapunov exponents of sequences generated by the logistic map over integers
Chikara Miyazaki, Takeru Miyazaki, Satoshi Uehara, Shunsuke Araki |
ISITA | 4 |
| 2014 | Some properties of the maximum period on the logistic map over Z2n
Kyohei Yoshida, Takeru Miyazaki, Satoshi Uehara, Shunsuke Araki |
ISITA | 4 |
| 2014 | An Extracting Method for Individual Building Wall Points from Mobile Mapping System DataabstractBuilding a 3D model that can well represent the realistic is always the upmost goal in 3D landscape modeling. One purpose of our research is to propose an automatic generation method of building polygon models from point clouds created by a mobile mapping system. In this paper, as a first step, we show an extraction method of individual building walls' points from mobile mapping data. Shunsuke Araki, Ken'ichi Kakizaki |
ISM | 2 |
| 2012 | A study on precision of pseudorandom number generators using the logistic map
Shunsuke Araki, Takeru Miyazaki, Satoshi Uehara, Ken'ichi Kakizaki |
ISITA | 1 |
| 2012 | Distribution of the loops on the logistic maps over integers for the control parameter
Takeru Miyazaki, Shunsuke Araki, Satoshi Uehara |
ISITA | 2 |
| 2010 | Suitable representation of values on the logistic map with finite precisionabstractWe are investigating the logistic map over integers and its pseudorandom number generator. Focusing on differences between the logistic maps over floating-point numbers and over integers, we herein show that the integer format is a suitable representation for implementing the logistic map on computers with limited memories. Shunsuke Araki, Ken'ichi Kakizaki, Takeru Miyazaki, Satoshi Uehara |
ISITA | 1 |
| 2010 | A study on differences in properties of the logistic maps over integers affected by roundingabstractOn the studies of the logistic map, many reports are presented because of the simple structure of the equation. Calculations with finite precision are usually used for implementations of the map for computers. Then a rounding is needed to these calculations. There are five major methods to implement rounding, but there was not any paper on the rounding of the map. In the present paper, we get some experimental results that the properties of sequences change greatly by roundings, and give some theoretical analyses of them. Then we will give principal reasons that the map with a floor function for rounding generates long aperiodic subsequences. Takeru Miyazaki, Shunsuke Araki, Satoshi Uehara |
ISITA | 2 |
| 2002 | A Nyberg-Rueppel Signature for Multiple Messages and Its Batch Verification
Shunsuke Araki |
ISC | 1 |