Finding the best K-sparse approximation of a signal in redundant dictionary is an NP-hard problem. Suboptimal greedy matching pursuit (MP) algorithms are generally used for this task. In work, we present acceleration technique and implementation algorithm acting on multi-Gabor dictionary, i.e., concatenation several Gabor-type time-frequency dictionaries, each which consisting translations modu...

Video object segmentation, aiming to segment the foreground objects given annotation of first frame, has been attracting increasing attentions. Many state-of-the-art approaches have achieved great performance by relying on online model updating or mask-propagation techniques. However, most models require high computational cost due fine-tuning during inference. Most based are faster but with re...