| Summary: | This article introduces a new algorithm that constructs an efficient search strategy, called parallel search, for blind adaptive Karhunen–Loéve transform. Unlike anterior Karhunen–Loéve transform, the proposed algorithm converges quickly by searching for solutions in different directions simultaneously. Moreover, the process is “blind,” which means that minimal information about the original data is used. The new algorithm also avoids repeating the Karhunen–Loéve transform basis learning step in data compression applications. Numerical simulation results verify the validity of the theory and illustrate the capability of the proposed algorithm.
|
|---|