SPL Volume 26 Issue 9

The discrete Mumford-Shah formalism has been introduced for the image denoising problem, allowing to capture both smooth behavior inside an object and sharp transitions on the boundary. In this letter, we propose first to extend this formalism to graphs and to the problem of mixing matrix estimation.

Zero-shot learning (ZSL) has enjoyed great popularity in recent years due to its ability to recognize novel objects, where semantic information is exploited to build up relations among different categories. Traditional ZSL approaches usually focus on learning more robust visual-semantic embeddings among seen classes and directly apply them to the unseen classes without considering whether they are suitable.

This letter proposes a new approach to nonnegative Tucker decomposition, which assumes recursive updates of latent factors with any nonnegative matrix factorization algorithm. The proposed strategy is extended to the nonnegatively constrained hierarchical Tucker decomposition model.