activity
20162020
most citedA Quantum Algorithm for Finding -Minima

6 citations · 7 across the 2 of their papers we have counts for

collaborators

6 papers

cs.CV20201 cited

Distortion-Adaptive Grape Bunch Counting for Omnidirectional Images

Ryota Akai, Yuzuko Utsumi, Yuka Miwa +2

This paper proposes the first object counting method for omnidirectional images. Because conventional object counting methods cannot handle the distortion of omnidirectional images…

quant-ph20196 cited

A Quantum Algorithm for Finding -Minima

Kohei Miyamoto, Masakazu Iwamura, Koichi Kise

We propose a new finding -minima algorithm and prove that its query complexity is , where is the number of data indices. Though the complexity is equ…

quant-ph2019

Quantum Speedup for the Minimum Steiner Tree Problem

Masayuki Miyamoto, Masakazu Iwamura, Koichi Kise +1

A recent breakthrough by Ambainis, Balodis, Iraids, Kokainis, Prūsis and Vihrovs (SODA'19) showed how to construct faster quantum algorithms for the Traveling Salesman Problem and…

cs.CV2018

Facial Landmark Detection for Manga Images

Marco Stricker, Olivier Augereau, Koichi Kise +1

The topic of facial landmark detection has been widely covered for pictures of human faces, but it is still a challenge for drawings. Indeed, the proportions and symmetry of standa…

cs.CV2016

A Generic Method for Automatic Ground Truth Generation of Camera-captured Documents

Sheraz Ahmed, Muhammad Imran Malik, Muhammad Zeshan Afzal +4

The contribution of this paper is fourfold. The first contribution is a novel, generic method for automatic ground truth generation of camera-captured document images (books, magaz…

cs.CV2016

Scalable Solution for Approximate Nearest Subspace Search

Masakazu Iwamura, Masataka Konishi, Koichi Kise

Finding the nearest subspace is a fundamental problem and influential to many applications. In particular, a scalable solution that is fast and accurate for a large problem has a g…