Learning Sparse FRAME Models for Natural Image Patterns

Jianwen Xie

doi:10.1007/s11263-014-0757-x

Return

Learning Sparse FRAME Models for Natural Image Patterns

2014-10-02

PRE

Jianwen Xie

Wenze Hu

Song-Chun Zhu (Song‐Chun Zhu)

Ying Wu *

DOI：10.1007/s11263-014-0757-x

Original

Original request for help

Save

Abstract

En 中文

It is well known that natural images admit sparse representations by redundant dictionaries of basis functions such as Gabor-like wavelets. However, it is still an open question as to what the next layer of representational units above the layer of wavelets should be. We address this fundamental question by proposing a sparse FRAME (Filters, Random field, And Maximum Entropy) model for representing natural image patterns. Our sparse FRAME model is an inhomogeneous generalization of the original FRAME model. It is a non-stationary Markov random field model that reproduces the observed statistical properties of filter responses at a subset of selected locations, scales and orientations. Each sparse FRAME model is intended to represent an object pattern and can be considered a deformable template. The sparse FRAME model can be written as a shared sparse coding model, which motivates us to propose a two-stage algorithm for learning the model. The first stage selects the subset of wavelets from the dictionary by a shared matching pursuit algorithm. The second stage then estimates the parameters of the model given the selected wavelets. Our experiments show that the sparse FRAME models are capable of representing a wide variety of object patterns in natural images and that the learned models are useful for object classification.

Keywords:

Generative models

Markov random fields

Shared sparse coding

AI Summary

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