Ken Tanaka

dblp:04/3135 · DBLP profile ↗
← Back
11ranked-venue papers
3as first author
2since 2021 · last 2023
—ORCID · conflict

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

Computer networks · 3 · 1 first-authorTheory of computation · 3 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorHuman-computer interaction and ubiquitous computing · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021
YearPublicationVenuePosition
2023 Efficient linear-time ranking and unranking of derangements
Kenji Mikawa, Ken Tanaka
Inf. Process. Lett.2
2023 Case-based similar image retrieval for weakly annotated large histopathological images of malignant lymphoma using deep metric learning
abstract
In the present study, we propose a novel case-based similar image retrieval (SIR) method for hematoxylin and eosin (H&E) stained histopathological images of malignant lymphoma. When a whole slide image (WSI) is used as an input query, it is desirable to be able to retrieve similar cases by focusing on image patches in pathologically important regions such as tumor cells. To address this problem, we employ attention-based multiple instance learning, which enables us to focus on tumor-specific regions when the similarity between cases is computed. Moreover, we employ contrastive distance metric learning to incorporate immunohistochemical (IHC) staining patterns as useful supervised information for defining appropriate similarity between heterogeneous malignant lymphoma cases. In the experiment with 249 malignant lymphoma patients, we confirmed that the proposed method exhibited higher evaluation measures than the baseline case-based SIR methods. Furthermore, the subjective evaluation by pathologists revealed that our similarity measure using IHC staining patterns is appropriate for representing the similarity of H&E stained tissue images for malignant lymphoma.
Noriaki Hashimoto, Yusuke Takagi, Hiroki Masuda, Hiroaki Miyoshi, Kei Kohno, Miharu Nagaishi, Kensaku Sato, Mai Takeuchi, Takuya Furuta, Keisuke Kawamoto, Kyohei Yamada, Mayuko Moritsubo, Kanako Inoue, Yasumasa Shimasaki, Yusuke Ogura, Teppei Imamoto, Tatsuzo Mishina, Ken Tanaka, Yoshino Kawaguchi, Shigeo Nakamura, Koichi Ohshima, Hidekata Hontani, Ichiro Takeuchi
Medical Image Anal.18
2020 Beamformed mmWave System Propagation at 60 GHz in an Office Environment
abstract
Millimeter wave wireless systems rely heavily on directional communication in narrow steerable beams. Tools to measure the spatial and temporal nature of the channel are necessary to evaluate beamforming and related algorithms. This paper presents a novel 60 GHz phased-array based directional channel sounder and data analysis procedure that can accurately extract paths and their transmit and receive directions. The gains along each path can also be measured for analyzing blocking scenarios. The sounder is validated in an indoor office environment.
Syed Hashim Ali Shah, Sarankumar Balakrishnan, Liangxiao Xin, Mohamed Abouelseoud, Kazuyuki Sakoda, Ken Tanaka, Christopher Slezak, Sundeep Rangan, Shivendra S. Panwar
ICC6
2020 60 GHz Multipath Propagation Analysis and Inference for an Indoor Scenario
abstract
Channel measurements at millimeter wave (mmWave) frequencies are typically carried out using directional antennas to overcome high path loss at mmWave frequencies. Unlike traditional directional channel measurements using narrow beam horn antennas where ray paths can be uniquely mapped to a direction with sufficient high accuracy, phased arrays with irregular beam pattern offers additional complexity in determining the arrival statistics of ray paths. In this work, we propose a systematic method to infer the ray path characteristics with the knowledge of beam patterns used by the phased array. We leverage on the channel measurement data obtained from extensive 60 GHz measurement campaign performed for indoor living room scenario and extract the ray path information from the measured data with high reliability. We also verify our findings through ray tracing simulation.
Sarankumar Balakrishnan, Syed Hashim Ali Shah, Liangxiao Xin, Mohamed Abouelseoud, Kazuyuki Sakoda, Ken Tanaka, Christopher Slezak, Sundeep Rangan, Shivendra S. Panwar
VTC Fall6
2019 Acceleration of Packet Classification Using Adjacency List of Rules
abstract
Packet classification is used to determine the behavior of packets incoming to network devices. Since it is achieved using linear search on a classification rule list, a large number of rules leads to longer communication latency. To decrease this latency, the problem is generalized as optimal rule ordering (ORO), which aims to identify the order of rules that minimizes the classification latency caused by packet classification while preserving the classification policy. Since ORO is known to be NP-complete, various heuristics for ORO have been proposed. Sub-graph merging (SGM) is the state-of-the-art heuristic algorithm for ORO. However, the SGM algorithm does not terminate in most cases because of inappropriate updates of the array that stores the number of reachable rules. Moreover, since SGM uses the adjacent matrix to maintain the preceding relation on the rules, a considerable amount of time is consumed when the preceding relation is complex. In this paper, we propose a correction for SGM that can terminate for any instance. The proposed algorithm decreases reordering time by about 99\% compared to SGM. Furthermore, we propose a reordering algorithm that selects sub-graphs more comprehensively than SGM. Doing so decreases the latency in comparison with SGM. We show the efficiency of the algorithms through experiments.
Takashi Fuchino, Takashi Harada, Ken Tanaka, Kenji Mikawa
ICCCN3
2017 Linear-time generation of uniform random derangements encoded in cycle notation
Kenji Mikawa, Ken Tanaka
Discret. Appl. Math.2
2014 Lexicographic ranking and unranking of derangements in cycle notation
Kenji Mikawa, Ken Tanaka
Discret. Appl. Math.2
2010 Sightseeing navigation system that promotes interaction with environment by restricting information
abstract
In recent years our lives have become more convenient with the abundant information being provided by our information society. We utilize that abundant information in living more effectively. A similar thing could be said about sightseeing. For example, tourist navigation systems have many features that allow the most suitable route to a destination to be displayed, similar to car navigation systems. However, there is a need to incorporate accidental encounters so that walking type sightseeing can be reviewed. This study does not support effective sightseeing but instead supports sightseeing that can be leisurely enjoyed. This study emphasizes “a sense of fun” and suggests a tourist navigation system that intentionally limits route information and induces accidental encounters. Or more concretely a navigation system was experimentally created in which the map around you disappears with movement. The effectiveness of it was then tested in assessment experiments utilizing a subject.
Ken Tanaka, Yoshio Nakatani
SMC1
2007 Multi-Carrier DS-CDMA Transmission with Frequency-domain Equalization
abstract
MC DS-CDMA is a combination of OFDM and time-domain spreading, while MC-CDMA is a combination of OFDM and frequency-domain spreading. In MC-CDMA, a good bit error rate (BER) performance can be achieved by using frequency-domain equalization (FDE), since the frequency diversity gain is obtained. On the other hand, the conventional MC DS-CDMA cannot obtain the frequency diversity gain. In this paper, the authors propose MC DS-CDMA that can obtain the frequency diversity gain by applying FDE. The conditional BER analysis is presented. The theoretical average BER performance in a frequency-selective Rayleigh fading channel is evaluated by Monte-Carlo numerical computation method using the derived conditional BER and is confirmed by computer simulation of the MC DS-CDMA signal transmission.
Ken Tanaka, Hiromichi Tomeba, Fumiyuki Adachi
WCNC1
2003 The cubic interpolated level set method for realistic fluid animation
abstract
No abstract available.
Ken Tanaka, Heihachi Ueki, Atsushi Kunimatsu
SIGGRAPH1
2003 Realistic Animation of Fluid with Splash and Foam
abstract
Abstract In this paper we describe a method for modeling and rendering dynamic behavior of fluids withsplashes and foam. A particle system is built into a fluid simulation system to represent an ocean wavecresting and spraying over another object. We use the Cubic Interpolated Propagation (CIP) method asthe fluid solver. The CIP method can solve liquid and gas together in the framework of fluid dynamicsand has high accuracy in the case of relatively coarse grids. This enables us to simulate the fluids in ashort time and describe the motion of splashes in the air that is associated with the liquid motion well.The foam floating on the water also can be described using the particle system. We integrate the rigidbody simulation with the fluid and particle system to create sophisticated scenes including splashes andfoam. We construct state change rules that are used with the particle system. This controls the generation,vanishing and transition rule of splashes and foam. The transition rule makes the seamless connection betweena splash and foam. We employed a fast volume rendering method with scattering effect for particles.One of the important features of our method is the combination of fast simulation and rendering techniques,which provides dynamic and realistic scenes in a short time.
Tsunemi Takahashi, Hiroko Fujii, Atsushi Kunimatsu, Kazuhiro Hiwada, Takahiro Saito, Ken Tanaka, Heihachi Ueki
Comput. Graph. Forum6