Takayuki Suyama

dblp:24/3777 · DBLP profile ↗
← Back
12ranked-venue papers
3as first author
0since 2021 · last 2020
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 2 first-authorSystems, architecture and hardware · 4 · 1 first-authorSoftware engineering, systems software and programming languages · 2 · 1 first-authorHuman-computer interaction and ubiquitous computing · 2Computer networks · 1Graphics, computer vision, multimedia, augmented reality and games · 1

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.

Human-computer interaction and pervasive computing
3 papers
Ubiquitous computing and smart environments · 62% Interaction techniques and input · 27% Health and well-being technologies · 11%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Ubiquitous computing and smart environments
environmental sensing
0.412020
Identifying human contact points on environmental surfaces using heat traces to support disinfect activities: poster abstract · SenSys 2020
Information retrieval › multimedia analysis and retrieval
video retrieval
0.212016
Egocentric Video Search via Physical Interactions · AAAI 2016
Ubiquitous computing and smart environments
context-aware computing
0.112016
Selecting home appliances with smart glass based on contextual information · UbiComp 2016
Interaction techniques and input
gesture input
0.112016
Egocentric Video Search via Physical Interactions · AAAI 2016
Hardware reliability and fault tolerance › error correction
error correction decoder
0.011998
Soft Decision Maximum Likelihood Decoders for Binary Linear Block Codes Implemented on FPGAs (Abstract) · FPGA 1998
Coding theory › error-correcting codes
decoding
0.011998
Soft Decision Maximum Likelihood Decoders for Binary Linear Block Codes Implemented on FPGAs (Abstract) · FPGA 1998
Coding theory › error-correcting codes › decoding › decoding algorithms › optimal decoding
maximum-likelihood decoding
0.011998
Soft Decision Maximum Likelihood Decoders for Binary Linear Block Codes Implemented on FPGAs (Abstract) · FPGA 1998
Coding theory › error-correcting codes › decoding
soft-decision decoding
0.011998
Soft Decision Maximum Likelihood Decoders for Binary Linear Block Codes Implemented on FPGAs (Abstract) · FPGA 1998
Reconfigurable computing and FPGAs
FPGA implementation
0.011998
Soft Decision Maximum Likelihood Decoders for Binary Linear Block Codes Implemented on FPGAs (Abstract) · FPGA 1998

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

probabilistic modeling · 0.5canonical correlation analysis · 0.5thermographic imaging · 0.4background image processing · 0.4non-parametric bayesian · 0.2multiple kernel learning · 0.2deep learning · 0.2
YearPublicationVenuePosition
2020 Identifying human contact points on environmental surfaces using heat traces to support disinfect activities: poster abstract
abstract
The disinfection of environmental surfaces is an effective countermeasure for COVID-19. In this paper, we use a thermographic camera and lightweight background image processing and propose a method that detects and visualizes the places touched by a person. Our method will support effective disinfection activities.
Yasue Kishino, Yoshinari Shirai, Yutaka Yanagisawa, Kazuya Ohara, Shin Mizutani, Takayuki Suyama
SenSys6
2018 Reduction of Communication Cost for Edge-Heavy Sensor using Divided CNN
abstract
Sensor networks allow us to collect data, such as camera images, over a wide area. Understanding the sensing area by aggregating and processing the data from multiple sensors is promising. Deep Learning (DL) is a powerful method for interpreting data. However, communication cost on the sensor network and computational cost on the server are two substantial problems of aggregating and processing data from multiple sensors. We therefore propose divided processing of the DL between a server and a powerful Edge-Heavy Sensor (EHS). In our study, we reduced transmission data to twelve times lower than the amount of raw input data while maintaining a 4.5% decrease in the DL's recognition accuracy.
Yoshihiro Ikeda, Yutaka Yanagisawa, Yasue Kishino, Shin Mizutani, Yoshinari Shirai, Takayuki Suyama, Kohei Matsumura, Haruo Noma
RTCSA6
2016 Egocentric Video Search via Physical Interactions
abstract
Retrieving past egocentric videos about personal daily life is important to support and augment human memory. Most previous retrieval approaches have ignored the crucial feature of human-physical world interactions, which is greatly related to our memory and experience of daily activities. In this paper, we propose a gesture-based egocentric video retrieval framework, which retrieves past visual experience using body gestures as non-verbal queries. We use a probabilistic framework based on a canonical correlation analysis that models physical interactions through a latent space and uses them for egocentric video retrieval and re-ranking search results. By incorporating physical interactions into the retrieval models, we address the problems resulting from the variability of human motions. We evaluate our proposed method on motion and egocentric video datasets about daily activities in household settings and demonstrate that our egocentric video retrieval framework robustly improves retrieval performance when retrieving past videos from personal and even other persons' video archives.
Taiki Miyanishi, Quan Kong, Takuya Maekawa, Hiroki Moriya, Takayuki Suyama
AAAI6
2016 Selecting home appliances with smart glass based on contextual information
abstract
We propose a method for selecting home appliances using a smart glass, which facilitates the control of network-connected appliances in a smart house. Our proposed method is image-based appliance selection and enables smart glass users to easily select a particular appliance by just looking at it. The main feature of our method is that it achieves high precision appliance selection using user contextual information such as position and activity, inferred from various sensor data in addition to camera images captured by the glass because such contextual information is greatly related in the home appliance that a user wants to control in her daily life. We design a state-of-the-art appliance selection method by fusing image features extracted by deep learning techniques and context information estimated by non-parametric Bayesian techniques within a framework of multiple kernel learning. Our experimental results, which use sensor data obtained in an actual house equipped with many network-connected appliances, show the effectiveness of our method.
Quan Kong, Takuya Maekawa, Taiki Miyanishi, Takayuki Suyama
UbiComp4
2013 Activity recognition with hand-worn magnetic sensors
Takuya Maekawa, Yasue Kishino, Yasushi Sakurai, Takayuki Suyama
Pers. Ubiquitous Comput.4
2005 Strategy/False-name Proof Protocols for Combinatorial Multi-Attribute Procurement Auction
Takayuki Suyama, Makoto Yokoo
Auton. Agents Multi Agent Syst.1
2001 Solving satisfiability problems using reconfigurable computing
abstract
This paper reports on an innovative approach for solving satisfiability problems for propositional formulas in conjunctive normal form (SAT) by creating a logic circuit that is specialized to solve each problem instance on field programmable gate arrays (FPGAs). This approach has become feasible due to recent advances in reconfigurable computing and has opened up an exciting new research field in algorithm design. SAT is an important subclass of constraint satisfaction problems, which can formalize a wide range of application problems. We have developed a series of algorithms that are suitable for a logic circuit implementation, including an algorithm whose performance is equivalent to the Davis-Putnam procedure with powerful dynamic variable ordering. Simulation results show that this method can solve a hard random 3-SAT problem with 400 variables within 1.6 min at a clock rate of 10 MHz. Faster speeds can be obtained by increasing the clock rate. Furthermore, we have actually implemented a 128-variable 256-clause problem instance on FPGAs.
Takayuki Suyama, Makoto Yokoo, Hiroshi Sawada, Akira Nagoya
IEEE Trans. Very Large Scale Integr. Syst.1
1999 Acceleration of Linear Block Code Evaluations Using New Reconfigurable Computing Approach
abstract
This paper presents an approach to performing applications using reconfigurable computing (RC). Our RC approach is achieved by effective use of design automation systems. Logic circuits specialized for each individual application task are automatically implemented on FPGAs. Such circuits can quickly perform tasks that are time-consuming for general purpose computers. Decoding of binary linear block codes for the evaluation is taken up as an example application. Experimental results show that the time for decoding of the code specific decoding circuit implemented on FPGAs, in which computations are executed in parallel, is much shorter than that of the software decoder.
Hidehisa Nagano, Takayuki Suyama, Akira Nagoya
ASP-DAC2
1999 Solving Satisfiability Problems on FPGAs Using Experimental Unit Propagation
Takayuki Suyama, Makoto Yokoo, Akira Nagoya
CP1
1998 Soft Decision Maximum Likelihood Decoders for Binary Linear Block Codes Implemented on FPGAs (Abstract)
Hidehisa Nagano, Takayuki Suyama, Akira Nagoya
FPGA2
1996 Solving Satisfiability Problems Using Field Programmable Gate Arrays: First Results
Makoto Yokoo, Takayuki Suyama, Hiroshi Sawada
CP2
1995 Logic synthesis for look-up table based FPGAs using functional decomposition and support minimization
abstract
This paper presents a logic synthesis method for look-up table (LUT) based field programmable gate arrays (FPGAs). We determine functions to be mapped to LUTs by functional decomposition. We use not only disjunctive decomposition but also nondisjunctive decomposition. Furthermore, we propose a new Boolean resubstitution technique customized for an LUT network synthesis. Resubstitution is used to determine whether an existing function is useful to realize another function; thus, we can share the common function among two or more functions. The Boolean resubstitution is effectively carried out by solving a support minimization problem for an incompletely specified function. We can also handle satisfiability don't cares of an LUT network using the technique.
Hiroshi Sawada, Takayuki Suyama, Akira Nagoya
ICCAD2