no code implementations • 6 Feb 2024 • Yuta Kawachi, Mitsuru Ambai, Yuichi Yoshida, Gaku Takano
The current vector trajectories of the RNN showed that the RNN could automatically determine arbitrary trajectories in the flux-weakening region in accordance with an arbitrarily designed loss function.
no code implementations • 22 Apr 2022 • Tadashi Kadowaki, Mitsuru Ambai
In edge computing, suppressing data size is a challenge for machine learning models that perform complex tasks such as autonomous driving, in which computational resources (speed, memory size and power) are limited.
no code implementations • 13 Sep 2018 • Kent Fujiwara, Ikuro Sato, Mitsuru Ambai, Yuichi Yoshida, Yoshiaki Sakakura
We present a novel compact point cloud representation that is inherently invariant to scale, coordinate change and point permutation.
no code implementations • 14 Sep 2017 • Ryuji Kamiya, Takayoshi Yamashita, Mitsuru Ambai, Ikuro Sato, Yuji Yamauchi, Hironobu Fujiyoshi
Our method replaces real-valued inner-product computations with binary inner-product computations in existing network models to accelerate computation of inference and decrease model size without the need for retraining.
1 code implementation • 30 Nov 2016 • Gou Koutaki, Keiichiro Shirai, Mitsuru Ambai
In this paper, we propose a learning-based supervised discrete hashing method.
no code implementations • ICCV 2015 • Takahiro Hasegawa, Mitsuru Ambai, Kohta Ishikawa, Gou Koutaki, Yuji Yamauchi, Takayoshi Yamashita, Hironobu Fujiyoshi
We propose a method for estimating multiple-hypothesis affine regions from a keypoint by using an anisotropic Laplacian-of-Gaussian (LoG) filter.
no code implementations • 29 Jan 2015 • Kohta Ishikawa, Ikuro Sato, Mitsuru Ambai
Binary Hashing is widely used for effective approximate nearest neighbors search.