We present a convex formulation of dictionary learning for sparse signal decomposition. Convexity is obtained by replacing the usual explicit upper bound on the dictionary size by...
Skeletons are often used as a framework for part-based shape description and matching. This paper describes some useful strategies that can be employed to improve the performance ...
We present a mathematical and computational feasibility study of the variational convex decomposition of 2D vector fields into coherent structures and additively superposed flow ...
Abstract. We analyze the convergence rate of an asynchronous space decomposition method for constrained convex minimization in a reflexive Banach space. This method includes as spe...
In this paper we consider the problem of decomposing a simple polygon into subpolygons that exclusively use vertices of the given polygon. We allow two types of subpolygons: pseud...