895 search results - page 44 / 179 » Approximate convex decomposition |
ICIP
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
We introduce a linearly weighted variant of the total
variation for vector fields in order to formulate regularizers
for multi-class labeling problems with non-trivial interclass...
NIPS
2008
14 years 11 months ago
2008
Recently, supervised dimensionality reduction has been gaining attention, owing to the realization that data labels are often available and indicate important underlying structure...
SIAMNUM
2010
14 years 4 months ago
2010
Infimizing sequences in nonconvex variational problems typically exhibit enforced finer and finer oscillations called microstructures such that the infimal energy is not attained. ...
195
click to vote
SDM
2011
SIAM
14 years 17 days ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...