Everything about Wavelet Tree

🧭 Start here: a 6-step reading path

1. Read the overview: Wavelet TreeA 5-minute orientation
2. Skim a recent paper: Image fusion using dual tree discrete wavelet transform and weights optimizationInfluential work since 2022
3. Pick up a classic book: Tree structured function estimation with Haar waveletsThe most-reprinted book on the subject
4. Read the landmark paper: Embedded image coding using zerotrees of wavelet coefficientsCited 3,547 times
5. Go sideways: Succinct data structureA closely related topic
6. Go sideways: Longest common substringA closely related topic

🏆 Landmark papers (most cited)

• Embedded image coding using zerotrees of wavelet coefficients

  J.M. Shapiro · 1993 · IEEE Transactions on Signal Processing · 3,547 citations

• The dual-tree complex wavelet transform

  I.W. Selesnick, R.G. Baraniuk, N.C. Kingsbury · 2005 · IEEE Signal Processing Magazine · 2,028 citations

• Texture analysis and classification with tree-structured wavelet transform

  T. Chang, C.-C.J. Kuo · 1993 · IEEE Transactions on Image Processing · 1,030 citations

• Wavelet Tree Quantization for Copyright Protection Watermarking

  S.-H. Wang, Y.-P. Lin · 2004 · IEEE Transactions on Image Processing · 243 citations

• Generalized Tree-Based Wavelet Transform

  Idan Ram, Michael Elad, Israel Cohen · 2011 · IEEE Transactions on Signal Processing · 63 citations

• The wavelet matrix: An efficient wavelet tree for large alphabets

  Francisco Claude, Gonzalo Navarro, Alberto Ordóñez · 2015 · Information Systems · 53 citations

• Classification of melanoma using tree structured wavelet transforms

  Sachin V Patwardhan, Atam P Dhawan, Patricia A Relue · 2003 · Computer Methods and Programs in Biomedicine · 52 citations

• Face Recognition Using Dual-Tree Complex Wavelet Features

  Chao-Chun Liu, Dao-Qing Dai · 2009 · IEEE Transactions on Image Processing · 46 citations

🆕 Influential since 2022

• Image fusion using dual tree discrete wavelet transform and weights optimization

  Javad Abbasi Aghamaleki, Alireza Ghorbani · 2022 · The Visual Computer · 38 citations

• RETRACTED ARTICLE: Cardiac arrhythmia detection using dual-tree wavelet transform and convolutional neural network

  K. Reddy Madhavi, Padmavathi Kora, L. Venkateswara Reddy · 2022 · Soft Computing · 35 citations

• Cancelable Multi-biometric Template Generation Based on Dual-Tree Complex Wavelet Transform

  Ahmed M. Ayoup, Ashraf A. M. Khalaf, Fahad Alraddady · 2022 · Intelligent Automation & Soft Computing · 16 citations

• Best-tree wavelet packet transform bidirectional GRU for short-term load forecasting

  Hosein Eskandari, Maryam Imani, Mohsen Parsa Moghaddam · 2023 · The Journal of Supercomputing · 16 citations

• Wavelet Tree Transformer: Multihead Attention With Frequency-Selective Representation and Interaction for Remote Sensing Object Detection

  Jiahao Pan, Chu He, Wei Huang · 2024 · IEEE Transactions on Geoscience and Remote Sensing · 15 citations

📚 Books worth reading

• Tree structured function estimation with Haar waveletsJoachim Engel · 1999

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Succinct data structure In computer science, a succinct data structure is a data structure which uses an amount of space that is "close" to the information-theoretic lower bound…
• Longest common substring Wikibooks has a book on the topic of: Algorithm Implementation/Strings/Longest common substring In computer science, a longest common substring of two…
• Compressed suffix array In computer science, a compressed suffix array is a compressed data structure for pattern matching. Compressed suffix arrays are a general class of data…
• Suffix array In computer science, a suffix array is a sorted array of all suffixes of a string. It is a data structure used in, among others, full-text indices, data-compres…
• Suffix tree In computer science, a suffix tree (also called PAT tree or, in an earlier form, position tree) is a compressed trie containing all the suffixes of the…
• Trie In computer science, a trie (/ˈtraɪ/, /ˈtriː/ ), also known as a digital tree or prefix tree, is a specialized search tree data structure used to store…
• Palindrome tree In computer science a palindrome tree, also called an EerTree, is a type of search tree, that allows for fast access to all palindromes contained in a…
• Gaussian process approximations In statistics and machine learning, Gaussian process approximation is a computational method that accelerates inference tasks in the context of a Gaussian…