Search Results for author: Tatsunori Taniai

Found 12 papers, 4 papers with code

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

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

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

Fast Multi-frame Stereo Scene Flow with Motion Segmentation

no code implementations CVPR 2017 Tatsunori Taniai, Sudipta N. Sinha, Yoichi Sato

This unified framework benefits all four tasks - stereo, optical flow, visual odometry and motion segmentation leading to overall higher accuracy and efficiency.

Motion Segmentation Optical Flow Estimation +3

Semi-Global Stereo Matching with Surface Orientation Priors

no code implementations3 Dec 2017 Daniel Scharstein, Tatsunori Taniai, Sudipta N. Sinha

In this paper we evaluate plane orientation priors derived from stereo matching at a coarser resolution and show that such priors can yield significant performance gains for difficult weakly-textured scenes.

Stereo Matching Stereo Matching Hand

Neural Inverse Rendering for General Reflectance Photometric Stereo

no code implementations ICML 2018 Tatsunori Taniai, Takanori Maehara

We present a novel convolutional neural network architecture for photometric stereo (Woodham, 1980), a problem of recovering 3D object surface normals from multiple images observed under varying illuminations.

Inverse Rendering

Path Planning using Neural A* Search

4 code implementations16 Sep 2020 Ryo Yonetani, Tatsunori Taniai, Mohammadamin Barekatain, Mai Nishimura, Asako Kanezaki

We present Neural A*, a novel data-driven search method for path planning problems.

Neural Structure Fields with Application to Crystal Structure Autoencoders

1 code implementation8 Dec 2022 Naoya Chiba, Yuta Suzuki, Tatsunori Taniai, Ryo Igarashi, Yoshitaka Ushiku, Kotaro Saito, Kanta Ono

We propose neural structure fields (NeSF) as an accurate and practical approach for representing crystal structures using neural networks.

Risk-aware Path Planning via Probabilistic Fusion of Traversability Prediction for Planetary Rovers on Heterogeneous Terrains

no code implementations2 Mar 2023 Masafumi Endo, Tatsunori Taniai, Ryo Yonetani, Genya Ishigami

Machine learning (ML) plays a crucial role in assessing traversability for autonomous rover operations on deformable terrains but suffers from inevitable prediction errors.

A Transformer Model for Symbolic Regression towards Scientific Discovery

1 code implementation7 Dec 2023 Florian Lalande, Yoshitomo Matsubara, Naoya Chiba, Tatsunori Taniai, Ryo Igarashi, Yoshitaka Ushiku

Once trained, we apply our best model to the SRSD datasets (Symbolic Regression for Scientific Discovery datasets) which yields state-of-the-art results using the normalized tree-based edit distance, at no extra computational cost.

regression Symbolic Regression

Crystalformer: Infinitely Connected Attention for Periodic Structure Encoding

no code implementations18 Mar 2024 Tatsunori Taniai, Ryo Igarashi, Yuta Suzuki, Naoya Chiba, Kotaro Saito, Yoshitaka Ushiku, Kanta Ono

Predicting physical properties of materials from their crystal structures is a fundamental problem in materials science.

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