Publication

Investigation of Redundant Dictionaries for Distributed Source Coding

2004
Report or working paper

Abstract

In this project, we investigate the possibility of using the Matching Pursuit algorithm to generate image representations of a pair of correlated images for distributed source coding. We propose to use constrained dictionaries by appropriately selecting neighbouring atoms to increase the correlation between parameters, and with this, enable the application of the distributed framework.

Official source

https://infoscience.epfl.ch/record/87050?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Investigation of Redundant Dictionaries for Distributed Source Coding

Graph Chatbot

Chat with Graph Search

On Matching Pursuit and Coordinate Descent

Fast orthogonal sparse approximation algorithms over local dictionaries

A low complexity orthogonal matching pursuit for sparse signal approximation with shift-invariant dictionaries

Fast orthogonal sparse approximation algorithms over local dictionaries

A low complexity orthogonal matching pursuit for sparse signal approximation with shift-invariant dictionaries

On Matching Pursuit and Coordinate Descent