Sciweavers

7351 search results - page 340 / 1471
» Segmenting Point Sets
Sort
View
ICML
2010
IEEE
15 years 7 months ago
Robust Subspace Segmentation by Low-Rank Representation
We propose low-rank representation (LRR) to segment data drawn from a union of multiple linear (or affine) subspaces. Given a set of data vectors, LRR seeks the lowestrank represe...
Guangcan Liu, Zhouchen Lin, Yong Yu
ICASSP
2011
IEEE
14 years 10 months ago
Marker-based Hierarchical Segmentation and classification approach for hyperspectral imagery
The Hierarchical SEGmentation (HSEG) algorithm, which is a combination of hierarchical step-wise optimization and spectral clustering, has given good performances for hyperspectra...
Yuliya Tarabalka, James C. Tilton, Jon Atli Benedi...
SSPR
2004
Springer
16 years 4 days ago
On Extending Symmetry Sets for 2D Shapes
Many attempts have been made to represent families of 2D shapes in a simpler way. These approaches lead to so-called structures as the Symmetry Set (SS) and a subset of it, the Med...
Arjan Kuijper, Ole Fogh Olsen
JOTA
2010
127views more  JOTA 2010»
15 years 1 months ago
Optimization Over the Efficient Set of Multi-objective Convex Optimal Control Problems
We consider multi-objective convex optimal control problems. First we state a relationship between the (weakly or properly) efficient set of the multi-objective problem and the sol...
Henri Bonnel, C. Yalçin Kaya
IWPEC
2009
Springer
16 years 1 months ago
Planar Capacitated Dominating Set Is W[1]-Hard
Given a graph G together with a capacity function c : V (G) → N, we call S ⊆ V (G) a capacitated dominating set if there exists a mapping f : (V (G) \ S) → S which maps every...
Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penni...