Demo Data from SIGIR 2026 / reviewers in the wild / expert
Atsushi Kanehira
dblp:150/5432
· DBLP profile ↗
9ranked-venue papers
5as first author
3since 2021 · last 2025
0009-0005-0157-7500ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 9 · 5 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 7 · 5 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 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.
| Artificial intelligence
4 papers |
Trustworthy machine learning · 59% Video understanding and tracking · 25% Segmentation and scene understanding · 13% | |
| Databases, data mining, and information retrieval
1 paper |
Data mining · 33% Machine learning and data management · 33% Information retrieval · 33% | |
| Computer graphics and multimedia
1 paper |
Multimedia analysis and retrieval · 100% |
Topics — the 14 heaviest of 15, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning
interpretability |
0.8 | 2 | 2019 | Multimodal Explanations by Predicting Counterfactuality in Videos · CVPR 2019 Learning to Explain With Complemental Examples · CVPR 2019 |
Machine learning › Trustworthy machine learning › interpretability › explainable AI
multimodal explanation |
0.8 | 2 | 2019 | Multimodal Explanations by Predicting Counterfactuality in Videos · CVPR 2019 Learning to Explain With Complemental Examples · CVPR 2019 |
Computer vision › Segmentation and scene understanding
panoptic segmentation |
0.5 | 1 | 2021 | Hierarchical Lovasz Embeddings for Proposal-Free Panoptic Segmentation · CVPR 2021 |
Computer vision › Video understanding and tracking
action recognition |
0.4 | 1 | 2019 | Multimodal Explanations by Predicting Counterfactuality in Videos · CVPR 2019 |
Machine learning › Trustworthy machine learning › interpretability
counterfactual explanation |
0.4 | 1 | 2019 | Multimodal Explanations by Predicting Counterfactuality in Videos · CVPR 2019 |
Machine learning › Trustworthy machine learning › interpretability
visual explanation |
0.4 | 1 | 2019 | Learning to Explain With Complemental Examples · CVPR 2019 |
Multimedia analysis and retrieval
video summarization |
0.3 | 1 | 2018 | Viewpoint-Aware Video Summarization · CVPR 2018 |
Computer vision › Video understanding and tracking
activity recognition |
0.2 | 1 | 2016 | Recognizing Activities of Daily Living with a Wrist-Mounted Camera · CVPR 2016 |
Computer vision › Video understanding and tracking › activity recognition
egocentric activity recognition |
0.2 | 1 | 2016 | Recognizing Activities of Daily Living with a Wrist-Mounted Camera · CVPR 2016 |
Data mining › predictive modeling › classification
multi-label classification |
0.2 | 1 | 2016 | Multi-label Ranking from Positive and Unlabeled Data · CVPR 2016 |
Machine learning and data management › weak supervision
positive-unlabeled learning |
0.2 | 1 | 2016 | Multi-label Ranking from Positive and Unlabeled Data · CVPR 2016 |
Information retrieval
ranking |
0.2 | 1 | 2016 | Multi-label Ranking from Positive and Unlabeled Data · CVPR 2016 |
Machine learning › Representation and self-supervised learning › representation learning
embedding learning |
0.1 | 1 | 2021 | Hierarchical Lovasz Embeddings for Proposal-Free Panoptic Segmentation · CVPR 2021 |
Computer vision › Video understanding and tracking
video representation learning |
0.1 | 1 | 2016 | Recognizing Activities of Daily Living with a Wrist-Mounted Camera · CVPR 2016 |
Methods — techniques the papers use, named apart from their topics
lovasz embedding · 0.5hierarchical embedding · 0.5neural network · 0.4maximum subpath layer · 0.4interaction information · 0.4information theory · 0.4fisher's discriminant criteria · 0.3discriminative video representation · 0.2convolutional neural network · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Agreeing to Interact in Human-Robot Interaction using Large Language Models and Vision Language ModelsabstractIn human-robot interaction (HRI), the beginning of an interaction is often complex. Whether the robot should communicate with the human is dependent on several situational factors (e.g., the current human’s activity, urgency of the interaction, etc.). We test whether large language models (LLM) and vision language models (VLM) can provide solutions to this problem. We compare four different system-design patterns using LLMs and VLMs, and test on a test set containing 84 human-robot situations. The test set mixes several publicly available datasets and also includes situations where the appropriate action to take is open-ended. Our results using the GPT-4o and Phi-3 Vision model indicate that LLMs and VLMs are capable of handling interaction beginnings when the desired actions are clear. The design using direct image input scored an 89% accuracy on the test set. Of the designs using indirect input, a combined text about human activity and gaze performed best with a 90% accuracy. However, challenges remain in the open-ended situations where the model must choose the priority between the human and robot situation. The design using direct image input mostly prioritized the robot situation, whereas the design with best performance using indirect input mostly prioritized the human situation. Such one-sided behavior could be crucial for practical HRI applications. Kazuhiro Sasabuchi, Naoki Wake, Atsushi Kanehira, Jun Takamatsu, Katsushi Ikeuchi |
RO-MAN | 3 |
| 2025 | Plan-and-Act using Large Language Models for Interactive AgreementabstractRecent large language models (LLMs) are capable of planning robot actions. In this paper, we explore how LLMs can be used for planning actions with tasks involving situational human-robot interaction (HRI). A key problem of applying LLMs in situational HRI is balancing between "respecting the current human’s activity" and "prioritizing the robot’s task," as well as understanding the timing of when to use the LLM to generate an action plan. In this paper, we propose a necessary plan-and-act skill design to solve the above problems. We show that a critical factor for enabling a robot to switch between passive / active interaction behavior is to provide the LLM with an action text about the current robot’s action. We also show that a second-stage question to the LLM (about the next timing to call the LLM) is necessary for planning actions at an appropriate timing. The skill design is applied to an Engage skill and is tested on four distinct interaction scenarios. We show that by using the skill design, LLMs can be leveraged to easily scale to different HRI scenarios with a reasonable success rate reaching 90% on the test scenarios. Kazuhiro Sasabuchi, Naoki Wake, Atsushi Kanehira, Jun Takamatsu, Katsushi Ikeuchi |
RO-MAN | 3 |
| 2021 | Hierarchical Lovasz Embeddings for Proposal-Free Panoptic Segmentation
Tommi Kerola, Jie Li 0031, Atsushi Kanehira, Yasunori Kudo, Alexis Vallet, Adrien Gaidon |
CVPR | 3 |
| 2019 | Learning to Explain With Complemental ExamplesabstractThis paper addresses the generation of explanations with visual examples. Given an input sample, we build a system that not only classifies it to a specific category, but also outputs linguistic explanations and a set of visual examples that render the decision interpretable. Focusing especially on the complementarity of the multimodal information, i.e., linguistic and visual examples, we attempt to achieve it by maximizing the interaction information, which provides a natural definition of complementarity from an information theoretical viewpoint. We propose a novel framework to generate complemental explanations, on which the joint distribution of the variables to explain, and those to be explained is parameterized by three different neural networks: predictor, linguistic explainer, and example selector. Explanation models are trained collaboratively to maximize the interaction information to ensure the generated explanation are complemental to each other for the target. The results of experiments conducted on several datasets demonstrate the effectiveness of the proposed method. Atsushi Kanehira, Tatsuya Harada |
CVPR | 1 |
| 2019 | Multimodal Explanations by Predicting Counterfactuality in VideosabstractThis study addresses generating counterfactual explanations with multimodal information. Our goal is not only to classify a video into a specific category, but also to provide explanations on why it is not categorized to a specific class with combinations of visual-linguistic information. Requirements that the expected output should satisfy are referred to as counterfactuality in this paper: (1) Compatibility of visual-linguistic explanations, and (2) Positiveness/negativeness for the specific positive/negative class. Exploiting a spatio-temporal region (tube) and an attribute as visual and linguistic explanations respectively, the explanation model is trained to predict the counterfactuality for possible combinations of multimodal information in a post-hoc manner. The optimization problem, which appears during training/inference, can be efficiently solved by inserting a novel neural network layer, namely the maximum subpath layer. We demonstrated the effectiveness of this method by comparison with a baseline of the action recognition datasets extended for this task. Moreover, we provide information-theoretical insight into the proposed method. Atsushi Kanehira, Kentaro Takemoto, Sho Inayoshi, Tatsuya Harada |
CVPR | 1 |
| 2018 | Viewpoint-Aware Video SummarizationabstractThis paper introduces a novel variant of video summarization, namely building a summary that depends on the particular aspect of a video the viewer focuses on. We refer to this as viewpoint. To infer what the desired viewpoint may be, we assume that several other videos are available, especially groups of videos, e.g., as folders on a person's phone or laptop. The semantic similarity between videos in a group vs. the dissimilarity between groups is used to produce viewpoint-specific summaries. For considering similarity as well as avoiding redundancy, output summary should be (A) diverse, (B) representative of videos in the same group, and (C) discriminative against videos in the different groups. To satisfy these requirements (A)-(C) simultaneously, we proposed a novel video summarization method from multiple groups of videos. Inspired by Fisher's discriminant criteria, it selects summary by optimizing the combination of three terms (a) inner-summary, (b) inner-group, and (c) between-group variances defined on the feature representation of summary, which can simply represent (A)-(C). Moreover, we developed a novel dataset to investigate how well the generated summary reflects the underlying viewpoint. Quantitative and qualitative experiments conducted on the dataset demonstrate the effectiveness of proposed method. Atsushi Kanehira, Luc Van Gool, Yoshitaka Ushiku, Tatsuya Harada |
CVPR | 1 |
| 2016 | Multi-label Ranking from Positive and Unlabeled DataabstractIn this paper, we specifically examine the training of a multi-label classifier from data with incompletely assigned labels. This problem is fundamentally important in many multi-label applications because it is almost impossible for human annotators to assign a complete set of labels, although their judgments are reliable. In other words, a multilabel dataset usually has properties by which (1) assigned labels are definitely positive and (2) some labels are absent but are still considered positive. Such a setting has been studied as a positive and unlabeled (PU) classification problem in a binary setting. We treat incomplete label assignment problems as a multi-label PU ranking, which is an extension of classical binary PU problems to the wellstudied rank-based multi-label classification. We derive the conditions that should be satisfied to cancel the negative effects of label incompleteness. Our experimentally obtained results demonstrate the effectiveness of these conditions. Atsushi Kanehira, Tatsuya Harada |
CVPR | 1 |
| 2016 | Recognizing Activities of Daily Living with a Wrist-Mounted CameraabstractWe present a novel dataset and a novel algorithm for recognizing activities of daily living (ADL) from a first-person wearable camera. Handled objects are crucially important for egocentric ADL recognition. For specific examination of objects related to users' actions separately from other objects in an environment, many previous works have addressed the detection of handled objects in images captured from head-mounted and chest-mounted cameras. Nevertheless, detecting handled objects is not always easy because they tend to appear small in images. They can be occluded by a user's body. As described herein, we mount a camera on a user's wrist. A wrist-mounted camera can capture handled objects at a large scale, and thus it enables us to skip the object detection process. To compare a wrist-mounted camera and a head-mounted camera, we also developed a novel and publicly available dataset1that includes videos and annotations of daily activities captured simultaneously by both cameras. Additionally, we propose a discriminative video representation that retains spatial and temporal information after encoding the frame descriptors extracted by convolutional neural networks (CNN). Katsunori Ohnishi, Atsushi Kanehira, Asako Kanezaki, Tatsuya Harada |
CVPR | 2 |
| 2016 | True-negative label selection for large-scale multi-label learningabstractIn this paper, we focus on training a classifier from large-scale data with incompletely assigned labels. In other words, we treat samples with following properties: 1. assigned labels are definitely positive, 2. absent labels are not necessarily negative, and 3. samples are allowed to take more than one label. These properties are frequently found in various kinds of computer vision tasks, including image and video classification and retrieval. Many online algorithms for multi-label task employ label sampling, which selects a label pair that reduces the largest penalty to update the model, thereby avoiding waste of computation. In the setting above, however, there are “false-negative” labels, which are originally positive labels but regarded as negative. Since it is high likely for label sampling to select these labels as negative labels in the sampled pair, it may severely degrade classification performance. In order to solve this problem while preserving convergence property of the online algorithms, we propose a novel label sampling approach, which aims to fetch “true-negative” labels via false-negativeness measure based on independently trained uni-class classifiers. Experimental results show the effectiveness of our approach. Atsushi Kanehira, Andrew Shin, Tatsuya Harada |
ICPR | 1 |