• 検索結果がありません。

Mining the Displacement by Max-pooling in Convolutional Neural Networks

N/A
N/A
Protected

Academic year: 2021

シェア "Mining the Displacement by Max-pooling in Convolutional Neural Networks"

Copied!
2
0
0

読み込み中.... (全文を見る)

全文

(1)

九州大学学術情報リポジトリ

Kyushu University Institutional Repository

Mining the Displacement by Max-pooling in Convolutional Neural Networks

鄭, 煜辰

http://hdl.handle.net/2324/4110518

出版情報:九州大学, 2020, 博士(学術), 課程博士 バージョン:

権利関係:

(2)

(別紙様式2

氏 名 :鄭 煜辰

:Mining the Displacement by Max-pooling in Convolutional Neural Networks (畳み込みニューラルネットワークにおける最大プーリングによる

変位検出) 区 分 :甲

The max-pooling operation is a common step in modern deep convolutional neural networks (CNNs), which is often introduced to obtain translation-invariant representations and downsample the feature maps of convolutional layers. However, in doing so, it loses the spatial information of the maximums. In this thesis, a novel feature is extracted from the max-pooling operation in CNNs, called displacement features. The displacement features record the location coordinates of the maximums in pooling windows of the max-pooling operation, which represents the “inter-class” and “intra-class” micro differences between different samples. Then, the class-wise trends and behaviors of the displacement features are discovered and analyzed in different ways. To verify the effectiveness of the displacement features, the displacement features are applied on two classical tasks, text recognition and offline signature verification.

For text recognition tasks, the displacement features are extracted from the max-pooling layer and combined with the features resulting from max-pooling to capture the inter-class micro differences between the similar classes. The displacement features compensate for spatial information lost in the traditional max-pooling operation helps discriminate unnecessary absorptions from necessary absorptions. The extensive experiments and discussions on three text datasets, MNIST, HASY, and Chars74K-font datasets demonstrate that the proposed displacement features can improve the performance of the CNN based architectures and tackle the issues with the micro differences of max-pooling in the text recognition tasks. For offline signature verification tasks, the displacement features of the maximums in the max-pooling operation are extracted and fused with the pooling features to capture the intra-class micro differences between the genuine signatures and skilled forgeries as a feature extraction procedure. The displacement features represent the crucial differences between the genuine signatures and their corresponding skilled forgeries, which is useful for verification systems.

The extensive experimental results and analysis on GPDS-150, GPDS-300, GPDS-1000, GPDS-2000, and GPDS-5000 datasets demonstrate that the proposed method can discriminate the genuine signatures and their corresponding skilled forgeries well and achieve state-of-the-art performance on these datasets.

参照

関連したドキュメント

We present sufficient conditions for the existence of solutions to Neu- mann and periodic boundary-value problems for some class of quasilinear ordinary differential equations.. We

In Section 13, we discuss flagged Schur polynomials, vexillary and dominant permutations, and give a simple formula for the polynomials D w , for 312-avoiding permutations.. In

Analogs of this theorem were proved by Roitberg for nonregular elliptic boundary- value problems and for general elliptic systems of differential equations, the mod- ified scale of

Then it follows immediately from a suitable version of “Hensel’s Lemma” [cf., e.g., the argument of [4], Lemma 2.1] that S may be obtained, as the notation suggests, as the m A

Our method of proof can also be used to recover the rational homotopy of L K(2) S 0 as well as the chromatic splitting conjecture at primes p > 3 [16]; we only need to use the

The proof uses a set up of Seiberg Witten theory that replaces generic metrics by the construction of a localised Euler class of an infinite dimensional bundle with a Fredholm

Correspondingly, the limiting sequence of metric spaces has a surpris- ingly simple description as a collection of random real trees (given below) in which certain pairs of

[Mag3] , Painlev´ e-type differential equations for the recurrence coefficients of semi- classical orthogonal polynomials, J. Zaslavsky , Asymptotic expansions of ratios of