Hierarchized block wise image approximation by greedy pursuit strategies

Laura Rebollo-Neira, Ryszard MacIoł, Shabnam Bibi

Research output: Contribution to journalArticle

Abstract

An approach for effective implementation of greedy selection methodologies, to approximate an image partitioned into blocks, is proposed. The method is specially designed for approximating partitions on a transformed image. It evolves by selecting, at each iteration step, i) the elements for approximating each of the blocks partitioning the image and ii) the hierarchized sequence in which the blocks are approximated to reach the required global condition on sparsity.
LanguageEnglish
Pages1175-1178
Number of pages4
JournalIEEE Signal Processing Letters
Volume20
Issue number12
Early online date8 Oct 2013
DOIs
Publication statusPublished - Dec 2013

Fingerprint

Pursuit
Approximation
Sparsity
Partitioning
Partition
Iteration
Methodology
Strategy

Bibliographical note

© 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Software for implementing the approach is available on http://www.nonlinear-approx.info/examples/node0.html

Funding: EPSRC

Keywords

  • high quality sparse image approximation with separable dictionaries
  • orthogonal matching pursuit for sparse representation of partitions in the wavelet domain

Cite this

Rebollo-Neira, Laura ; MacIoł, Ryszard ; Bibi, Shabnam. / Hierarchized block wise image approximation by greedy pursuit strategies. In: IEEE Signal Processing Letters. 2013 ; Vol. 20, No. 12. pp. 1175-1178.
@article{8a63eba2d264491e9fc60837ea23e045,
title = "Hierarchized block wise image approximation by greedy pursuit strategies",
abstract = "An approach for effective implementation of greedy selection methodologies, to approximate an image partitioned into blocks, is proposed. The method is specially designed for approximating partitions on a transformed image. It evolves by selecting, at each iteration step, i) the elements for approximating each of the blocks partitioning the image and ii) the hierarchized sequence in which the blocks are approximated to reach the required global condition on sparsity.",
keywords = "high quality sparse image approximation with separable dictionaries, orthogonal matching pursuit for sparse representation of partitions in the wavelet domain",
author = "Laura Rebollo-Neira and Ryszard MacIoł and Shabnam Bibi",
note = "{\circledC} 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. Software for implementing the approach is available on http://www.nonlinear-approx.info/examples/node0.html Funding: EPSRC",
year = "2013",
month = "12",
doi = "10.1109/LSP.2013.2283510",
language = "English",
volume = "20",
pages = "1175--1178",
journal = "IEEE Signal Processing Letters",
issn = "1070-9908",
publisher = "IEEE",
number = "12",

}

Hierarchized block wise image approximation by greedy pursuit strategies. / Rebollo-Neira, Laura; MacIoł, Ryszard; Bibi, Shabnam.

In: IEEE Signal Processing Letters, Vol. 20, No. 12, 12.2013, p. 1175-1178.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Hierarchized block wise image approximation by greedy pursuit strategies

AU - Rebollo-Neira, Laura

AU - MacIoł, Ryszard

AU - Bibi, Shabnam

N1 - © 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. Software for implementing the approach is available on http://www.nonlinear-approx.info/examples/node0.html Funding: EPSRC

PY - 2013/12

Y1 - 2013/12

N2 - An approach for effective implementation of greedy selection methodologies, to approximate an image partitioned into blocks, is proposed. The method is specially designed for approximating partitions on a transformed image. It evolves by selecting, at each iteration step, i) the elements for approximating each of the blocks partitioning the image and ii) the hierarchized sequence in which the blocks are approximated to reach the required global condition on sparsity.

AB - An approach for effective implementation of greedy selection methodologies, to approximate an image partitioned into blocks, is proposed. The method is specially designed for approximating partitions on a transformed image. It evolves by selecting, at each iteration step, i) the elements for approximating each of the blocks partitioning the image and ii) the hierarchized sequence in which the blocks are approximated to reach the required global condition on sparsity.

KW - high quality sparse image approximation with separable dictionaries

KW - orthogonal matching pursuit for sparse representation of partitions in the wavelet domain

UR - http://www.scopus.com/inward/record.url?scp=84886881869&partnerID=8YFLogxK

UR - http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6624141

UR - http://www.nonlinear-approx.info/examples/node0.html

U2 - 10.1109/LSP.2013.2283510

DO - 10.1109/LSP.2013.2283510

M3 - Article

VL - 20

SP - 1175

EP - 1178

JO - IEEE Signal Processing Letters

T2 - IEEE Signal Processing Letters

JF - IEEE Signal Processing Letters

SN - 1070-9908

IS - 12

ER -