Effortless Critical Representation of Laplacian Pyramid

DOI10.1109/TSP.2010.2066271zbMATH Open1392.94037MaRDI QIDQ4570622FDOQ4570622

Authors: Youngmi Hur 

Publication date: 9 July 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Recommendations

• Scaling Laplacian pyramids
• scientific article; zbMATH DE number 892273
• Pyramidal Algorithms for Littlewood-Paley Decompositions
• Laplacian simplices
• The pyramid decomposition and rank minimization
• scientific article; zbMATH DE number 2087447

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cited In (2)

• Scaling Laplacian pyramids
• Tight wavelet filter banks with prescribed directions

This page was built for publication: Effortless Critical Representation of Laplacian Pyramid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4570622)