Search Results for author: Takeshi Naemura

Found 8 papers, 2 papers with code

Classification-Reconstruction Learning for Open-Set Recognition

1 code implementation CVPR 2019 Ryota Yoshihashi, Wen Shao, Rei Kawakami, ShaoDi You, Makoto Iida, Takeshi Naemura

Existing open-set classifiers rely on deep networks trained in a supervised manner on known classes in the training set; this causes specialization of learned representations to known classes and makes it hard to distinguish unknowns from knowns.

Classification General Classification +2

Differentiating Objects by Motion: Joint Detection and Tracking of Small Flying Objects

no code implementations14 Sep 2017 Ryota Yoshihashi, Tu Tuan Trinh, Rei Kawakami, ShaoDi You, Makoto Iida, Takeshi Naemura

While generic object detection has achieved large improvements with rich feature hierarchies from deep nets, detecting small objects with poor visual cues remains challenging.

Object object-detection +2

Continuous 3D Label Stereo Matching using Local Expansion Moves

2 code implementations28 Mar 2016 Tatsunori Taniai, Yasuyuki Matsushita, Yoichi Sato, Takeshi Naemura

The local expansion moves extend traditional expansion moves by two ways: localization and spatial propagation.

Patch Matching Stereo Matching +1

Superdifferential Cuts for Binary Energies

no code implementations CVPR 2015 Tatsunori Taniai, Yasuyuki Matsushita, Takeshi Naemura

We then present our method as generalization of SSP, which is further shown to generalize several state-of-the-art techniques for higher-order and pairwise non-submodular functions [Ayed13, Gorelick14, Tang14].

Binarization Image Segmentation +1

Graph Cut based Continuous Stereo Matching using Locally Shared Labels

no code implementations CVPR 2014 Tatsunori Taniai, Yasuyuki Matsushita, Takeshi Naemura

We present an accurate and efficient stereo matching method using locally shared labels, a new labeling scheme that enables spatial propagation in MRF inference using graph cuts.

Disparity Estimation Stereo Matching +1

Cannot find the paper you are looking for? You can Submit a new open access paper.