Best basis search in lapped dictionaries
This paper proposes, analyzes, and illustrates several best basis search algorithms for dictionaries consisting of lapped orthogonal bases. It improves upon the best local cosine basis selection based on a dyadic tree , by considering larger dictionaries of bases. It is shown that this can result in sparser representations and approximate shift invariance. An algorithm that is strictly shift invariant is also provided. The experiments in this paper suggest that the new dictionaries can be advantageous for time-frequency analysis, compression, and noise removal. Accelerated versions of the basic algorithm are provided that explore various tradeoffs between computational efficiency and adaptability. It is shown that the proposed algorithms are in fact applicable to any finite dictionary comprised of lapped orthogonal bases. One such novel dictionary is proposed that constructs the best local cosine representation in the frequency domain, and it is shown that the new dictionary is better suited for representing certain types of signals.