We consider the problem of segmenting multiple rigid motions from point correspondences in multiple affine views. We cast this problem as a subspace clustering problem in which th...
In this paper we propose a method for matching articulated shapes represented as large sets of 3D points by aligning the corresponding embedded clouds generated by locally linear ...
Diana Mateus, Fabio Cuzzolin, Radu Horaud, Edmond ...
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...
A crucial preprocessing stage in applications such as OCR is text extraction from mixed-type documents. The present work, in contrast to most until now, successfully faces the pro...
Abstract—We evaluate the system-level performance and potential capacity gain of MBSFN (Multicast/Broadcast Single Frequency Network) operation in Wideband CDMA (WCDMA) and compa...
Christoph A. Jotten, Christian Sgraja, Josef J. Bl...