Optimality conjecture for the local-set-based piecewise-constant wavelet basis

Let W\operatorname{W} be the local-set-based wavelet basis with the even partition. For a fixed sparsity level KK, consider signals x\mathbf{x} satisfying

Δx0K.\left\|\Delta\mathbf{x}\right\|_0\leq K.

Optimality conjecture. The local-set-based wavelet basis WLSPC\operatorname{W}_{\rm LSPC} minimizes, among all orthonormal bases F\operatorname{F}, the worst-case number of nonzero coefficients:

WLSPC=argminF maxx:Δx0KFTx0,\operatorname{W}_{\rm LSPC}=\arg\min_{\operatorname{F}}\ \max_{\mathbf{x}:\,\left\|\Delta\mathbf{x}\right\|_0\leq K}\left\|\operatorname{F}^T\mathbf{x}\right\|_0,

subject to F\operatorname{F} being orthonormal. The conjecture asserts that this construction is optimal for promoting sparsity in piecewise-constant graph signals; the surrounding discussion establishes sparsity bounds for the proposed basis but provides no resolution of this global optimality claim.

Sources & referencesView supporting material

Primary source

Siheng Chen, Rohan Varma, Aarti Singh and Jelena Kovačević, “Signal Representations on Graphs: Tools and Applications”, arXiv:1512.05406 (2015).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.