999 search results - page 1 / 200 » Spectral simplex method |
GFKL
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
IPCO
2008
13 years 6 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
IGARSS
2010
13 years 2 months ago
2010
Spectral unmixing is an important task for remotely sensed hyperspectral data exploitation. Linear spectral unmixing relies on two main steps: 1) identification of pure spectral c...
ICASSP
2010
IEEE
13 years 4 months ago
2010
IEEE
Hyperspectral unmixing is a process of extracting hidden spectral signatures (or endmembers) and the corresponding proportions (or abundances) of a scene, from its hyperspectral o...
ICASSP
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract—Hyperspectral unmixing aims at identifying the hidden spectral signatures (or endmembers) and their corresponding proportions (or abundances) from an observed hyperspect...