NDLI: Learning Topographic Representations of Nature Images with Pairwise Cumulant

Content Provider	Springer Nature Link
Author	Wang, Zhe Huang, Yaping Luo, Xiaoyue Wang, Liang Luo, Siwei
Copyright Year	2011
Abstract	In this paper, we propose a model for natural images to learn topographic representations and complex cell properties. Different from the estimation of traditional models, e.g., pooling the outputs of filters in neighboring regions, our method maximizes a simple form of binary relations between two adjacent complex cells—“pairwise cumulant”, which contains the favorable nonlinearity as high order cumulant, and can exploit the “sparseness” and “correlation” of cells in primary visual cortex. By means of choosing nonlinearity properly, our model is related to cumulant-based ICA model, and the derived fixed-point algorithm is close to the well-known FastICA algorithm. The local convergence analysis proves that our fixed-point algorithm is cubic convergence and experiments on nature images show its high efficiency than traditional algorithms. Besides, simulations demonstrate the effectiveness of our model in capturing nonlinear dependencies among these neighboring complex cells. The learnt filters preserve properties of complex cells, and their orientation, spatial frequency and location change smoothly over the topographic map. In addition, these learnt filters can be used as feature descriptors. They produce features that are invariant to object transformations, and achieve better results than traditional models on digit recognition tasks.
Starting Page	155
Ending Page	175
Page Count	21
File Format	PDF
ISSN	13704621
Journal	Neural Processing Letters
Volume Number	34
Issue Number	2
e-ISSN	1573773X
Language	English
Publisher	Springer US
Publisher Date	2011-06-28
Publisher Place	Boston
Access Restriction	Subscribed
Subject Keyword	Independent component analysis Topographic representation Complex cell Binary relation Pairwise cumulant Cubic convergence Computational Intelligence Statistical Physics, Dynamical Systems and Complexity Artificial Intelligence (incl. Robotics)
Content Type	Text
Resource Type	Article
Subject	Neuroscience Artificial Intelligence Computer Networks and Communications Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Complexity Pursuit for Unifying Model

Linear Multilayer ICA Using Adaptive PCA

Blind Source Separation Using Quadratic form Innovation

Global Rademacher Complexity Bounds: From Slow to Fast Convergence Rates

Boundedness and Convergence of Split-Complex Back-Propagation Algorithm with Momentum and Penalty

Convergence Analysis of Möller Algorithm for Estimating Minor Component

Constraint Score Evaluation for Spectral Feature Selection

Kernel Local Sparse Representation Based Classifier

Statistically Adaptive Image Denoising Based on Overcomplete Topographic Sparse Coding

Learning Topographic Representations of Nature Images with Pairwise Cumulant

Similar Documents

Complexity Pursuit for Unifying Model

Linear Multilayer ICA Using Adaptive PCA

Blind Source Separation Using Quadratic form Innovation

Global Rademacher Complexity Bounds: From Slow to Fast Convergence Rates

Boundedness and Convergence of Split-Complex Back-Propagation Algorithm with Momentum and Penalty

Convergence Analysis of Möller Algorithm for Estimating Minor Component

Constraint Score Evaluation for Spectral Feature Selection

Kernel Local Sparse Representation Based Classifier

Statistically Adaptive Image Denoising Based on Overcomplete Topographic Sparse Coding

Learning Topographic Representations of Nature Images with Pairwise Cumulant