← Search

Kiyoharu Aizawa

24 accepted papers

2025

Harnessing PDF Data for Improving Japanese Large Multimodal Models

ACL 2025finding

Large Multimodal Models (LMMs) have demonstrated strong performance in English, but their effectiveness in Japanese remains limited due to the lack of high-quality training data. Current Japanese LMMs often rely on translated English datasets, restricting their ability to capture Japan-specific cult…

2025

Unsolvable Problem Detection: Robust Understanding Evaluation for Large Multimodal Models

ACL 2025long

This paper introduces a novel task to evaluate the robust understanding capability of Large Multimodal Models (LMMs), termed Unsolvable Problem Detection (UPD). Multiple-choice question answering (MCQA) is widely used to assess the understanding capability of LMMs, but it does not guarantee that LMM…

2024

Entity-NeRF: Detecting and Removing Moving Entities in Urban Scenes

CVPR 2024poster

Recent advancements in the study of Neural Radiance Fields (NeRF) for dynamic scenes often involve explicit modeling of scene dynamics. However this approach faces challenges in modeling scene dynamics in urban environments where moving objects of various categories and scales are present. In such s…

Cited by 4SourcePDFScholar
2024

Retrieval-Augmented Layout Transformer for Content-Aware Layout Generation

CVPR 2024poster

Content-aware graphic layout generation aims to automatically arrange visual elements along with a given content such as an e-commerce product image. In this paper we argue that the current layout generation approaches suffer from the limited training data for the high-dimensional layout structure.…

2024

The Lottery Ticket Hypothesis in Denoising: Towards Semantic-Driven Initialization

ECCV 2024poster

"Text-to-image diffusion models allow users control over the content of generated images. Still, text-to-image generation occasionally leads to generation failure requiring users to generate dozens of images under the same text prompt before they obtain a satisfying result. We formulate the lottery…

2023

LoCoOp: Few-Shot Out-of-Distribution Detection via Prompt Learning

NeurIPS 2023poster

We present a novel vision-language prompt learning approach for few-shot out-of-distribution (OOD) detection. Few-shot OOD detection aims to detect OOD images from classes that are unseen during training using only a few labeled in-distribution (ID) images. While prompt learning methods such as CoOp…

2022

COO: Comic Onomatopoeia Dataset for Recognizing Arbitrary or Truncated Texts

ECCV 2022poster

"Recognizing irregular texts has been a challenging topic in text recognition. To encourage research on this topic, we provide a novel comic onomatopoeia dataset (COO), which consists of onomatopoeia texts in Japanese comics. COO has many arbitrary texts, such as extremely curved, partially shrunk t…

2022

Self-Labeling Framework for Novel Category Discovery over Domains

AAAI 2022technical

Unsupervised domain adaptation (UDA) has been highly successful in transferring knowledge acquired from a label-rich source domain to a label-scarce target domain. Open-set domain adaptation (open-set DA) and universal domain adaptation (UniDA) have been proposed as solutions to the problem concerni…

Cited by 31SourcePDFScholar
2021

What if We Only Use Real Datasets for Scene Text Recognition? Toward Scene Text Recognition With Fewer Labels

CVPR 2021poster

Scene text recognition (STR) task has a common practice: All state-of-the-art STR models are trained on large synthetic data. In contrast to this practice, training STR models only on fewer real labels (STR with fewer labels) is important when we have to train STR models without synthetic data: for…

Cited by 124PDFcodeScholar
2020

Channel-Level Variable Quantization Network for Deep Image Compression

IJCAI 2020poster

Deep image compression systems mainly contain four components: encoder, quantizer, entropy model, and decoder. To optimize these four components, a joint rate-distortion framework was proposed, and many deep neural network-based methods achieved great success in image compression. However, almost al…

2020

Multi-Task Curriculum Framework for Open-Set Semi-Supervised Learning

ECCV 2020poster

Semi-supervised learning (SSL) has been proposed to leverage unlabeled data for training powerful models when only limited labeled data is available. While existing SSL methods assume that samples in the labeled and unlabeled data share the classes of their samples, we address a more complex novel s…

Cited by 158SourcePDFScholar
2018

Cross-Domain Weakly-Supervised Object Detection Through Progressive Domain Adaptation

CVPR 2018poster

Can we detect common objects in a variety of image domains without instance-level annotations? In this paper, we present a framework for a novel task, cross-domain weakly supervised object detection, which addresses this question. For this paper, we have access to images with instance-level annotati…

2018

Fast and Robust Estimation for Unit-Norm Constrained Linear Fitting Problems

CVPR 2018poster

M-estimator using iteratively reweighted least squares (IRLS) is one of the best-known methods for robust estimation. However, IRLS is ineffective for robust unit-norm constrained linear fitting (UCLF) problems, such as fundamental matrix estimation because of a poor initial solution. We overcome th…

Cited by 10SourcePDFScholar
2018

Joint Optimization Framework for Learning With Noisy Labels

CVPR 2018poster

Deep neural networks (DNNs) trained on large-scale datasets have exhibited significant performance in image classification. Many large-scale datasets are collected from websites, however they tend to contain inaccurate labels that are termed as noisy labels. Training on such noisy labeled datasets c…

Cited by 899SourcePDFScholar
2018

Local and Global Optimization Techniques in Graph-Based Clustering

CVPR 2018poster

The goal of graph-based clustering is to divide a dataset into disjoint subsets with members similar to each other from an affinity (similarity) matrix between data. The most popular method of solving graph-based clustering is spectral clustering. However, spectral clustering has drawbacks. Spectral…

Cited by 8SourcePDFScholar
2017

Object detection refinement using Markov random field based pruning and learning based rescoring

ICASSP 2017accepted

Contextual information such as the co-occurrence of objects and the location of objects has played an important role in object detection. We present candidate pruning and object rescoring methods that leverage contextual information and that can improve the state-of-the-art CNN-based object detectio…

Cited by 0SourceScholar
2017

Residual Expansion Algorithm: Fast and Effective Optimization for Nonconvex Least Squares Problems

CVPR 2017poster

We propose the residual expansion (RE) algorithm: a global (or near-global) optimization method for nonconvex least squares problems. Unlike most existing nonconvex optimization techniques, the RE algorithm is not based on either stochastic or multi-point searches; therefore, it can achieve fast glo…

Cited by 1PDFScholar
2017

Spatio-Temporal Vector of Locally Max Pooled Features for Action Recognition in Videos

CVPR 2017poster

We introduce Spatio-Temporal Vector of Locally Max Pooled Features (ST-VLMPF), a super vector-based encoding method specifically designed for local deep features encoding. The proposed method addresses an important problem of video understanding: how to build a video representation that incorporate…

Cited by 68PDFScholar
2016

Uncalibrated Photometric Stereo by Stepwise Optimization Using Principal Components of Isotropic BRDFs

CVPR 2016poster

The uncalibrated photometric stereo problem for non-Lambertian surfaces is challenging because of the large number of unknowns and its ill-posed nature stemming from unknown reflectance functions. We propose a model that represents various isotropic reflectance functions by using the principal comp…

Cited by 9PDFScholar
2015

PQTable: Fast Exact Asymmetric Distance Neighbor Search for Product Quantization Using Hash Tables

ICCV 2015poster

We propose the product quantization table (PQTable), a product quantization-based hash table that is fast and requires neither parameter tuning nor training steps. The PQTable produces exactly the same results as a linear PQ search, and is 10^2 to 10^5 times faster when tested on the SIFT1B data. In…

Cited by 44PDFScholar