Group sparse autoencoder

doi:10.1016/j.imavis.2017.01.005

Return

Group sparse autoencoder

2017-04-01

PRE

DOI：10.1016/j.imavis.2017.01.005

Original

Original request for help

Save

Abstract

En 中文

Unsupervised feature extraction is gaining a lot of research attention following its success to represent any kind of noisy data. Owing to the presence of a lot of training parameters, these feature learning models are prone to overfitting. Different regularization methods have been explored in the literature to avoid overfitting in deep learning models. In this research, we consider autoencoder as the feature learning architecture and propose l(2.1)-norm based regularization to improve its learning capacity, called as Group Sparse AutoEncoder (GSAE). l(2.1) -norm is based on the postulate that the features from the same class will have a common sparsity pattern in the feature space. We present the learning algorithm for group sparse encoding using majorization-minimization approach. The performance of the proposed algorithm is also studied on three baseline image datasets: MNIST, CIFAR-10, and SVHN. Further, using GSAE, we propose a novel deep learning based image representation for minutia detection from latent fingerprints. Latent fingerprints contain only a partial finger region, very noisy ridge patterns, and depending on the surface it is deposited, contain significant background noise. We formulate the problem of minutia extraction as a two-class classification problem and learn the descriptor using the novel formulation of GSAE. Experimental results on two publicly available latent fingerprint datasets show that the proposed algorithm yields state-of-the-art results for automated minutia extraction. (C) 2017 Elsevier B.V. All rights reserved.

Keywords:

Supervised autoencoder

Group sparsity

Latent fingerprint

Minutia extraction

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.