← Search

Sei-ichiro Kamata

7 accepted papers

2021

Deep Neural Networks with Flexible Complexity While Training Based on Neural Ordinary Differential Equations

ICASSP 2021accepted

Most structures of deep neural networks (DNN) are with a fixed complexity of both computational cost (parameters and FLOPs) and the expressiveness. In this work, we experimentally investigate the effectiveness of using neural ordinary differential equations (NODEs) as a component to provide further…

Cited by 0SourceScholar
2021

Sub-Band Grouping Spectral Feature-Attention Block for Hyperspectral Image Classification

ICASSP 2021accepted

Hyperspectral images (HSIs) consists of 2D spatial information and 1D spectral signature due to its specialty. Most models take the raw spectral signature as the input directly by regarding the spectral data as a sequence, which cannot fully explore the redundant and complementary information inside…

Cited by 0SourceScholar
2018

Universal Approach for DCT-Based Constant-Time Gaussian Filter with Moment Preservation

ICASSP 2018accepted

This paper presents a universal approach for constant-time Gaussian filters (O(1) GF) based on the Discrete Cosine Transform (DCT). It is well known that DCT has the eight types of definitions. Existing methods of O(1) GF use difference DCT type according to their original concepts. However, all typ…

Cited by 0SourceScholar
2016

Efficient keypoint detection and description via polynomial regression of scale space

ICASSP 2016accepted

Keypoint detection and description using approximate continuous scale space are more efficient techniques than typical discretized scale space for achieving more robust feature matching. However, this state-of-the-art method requires high computational complexity to approximately reconstruct, or dec…

Cited by 0SourceScholar
2016

Learning discriminative and shareable patches for scene classification

ICASSP 2016accepted

This paper addresses the problem of scene classification and proposes learning discriminative and shareable patches (LDSP) method. The main idea of learning discriminative and shareable patches is to discover patches that exhibit both large between-class dissimilarity (discriminative) and large with…

Cited by 0SourceScholar