An algorithm for matrix extension and wavelet construction
Mathematics of Computation
The lifting scheme: a construction of second generation wavelets
SIAM Journal on Mathematical Analysis
International Journal of Computer Mathematics
IEEE Transactions on Signal Processing
Adaptive lifting schemes with perfect reconstruction
IEEE Transactions on Signal Processing
M-band biorthogonal interpolating wavelets via lifting scheme
IEEE Transactions on Signal Processing
Multiwavelet Frames in Signal Space Originated From Hermite Splines
IEEE Transactions on Signal Processing
Biorthogonal Butterworth wavelets derived from discreteinterpolatory splines
IEEE Transactions on Signal Processing
The polyphase-with-advance representation and linear phase lifting factorizations
IEEE Transactions on Signal Processing - Part I
Wavelet families of increasing order in arbitrary dimensions
IEEE Transactions on Image Processing
IEEE Transactions on Image Processing
Original article: The lifting factorization of wavelet bi-frames with arbitrary generators
Mathematics and Computers in Simulation
Real-Time Disparity Map-Based Pictorial Depth Cue Enhancement
Computer Graphics Forum
Hi-index | 0.01 |
In this paper, we present the lifting scheme of wavelet bi-frames along with theory analysis, structure, and algorithm. We show how any wavelet bi-frame can be decomposed into a finite sequence of simple filtering steps. This decomposition corresponds to a factorization of a polyphase matrix of a wavelet bi-frame. Based on this concept, we present a new idea for constructing wavelet bi-frames. For the construction of symmetric bi-frames, we use generalized Bernstein basis functions, which enable us to design symmetric prediction and update filters. The construction allows more efficient implementation and provides tools for custom design of wavelet bi-frames. By combining the different designed filters for the prediction and update steps, we can devise practically unlimited forms of wavelet bi-frames. Moreover, we present an algorithm of increasing the number of vanishing moments of bi-framelets to arbitrary order via the presented lifting scheme, which adopts an iterative algorithm and ensures the shortest lifting scheme. Several construction examples are given to illustrate the results.