Results 161 to 170 of about 10,314,714 (175)

FPGA implementation of a maximum simplex volume algorithm for endmember extraction from remotely sensed hyperspectral images

Journal of Real-Time Image Processing, 2017
Spectral unmixing is a very important technique for remotely sensed hyperspectral unmixing. Since more hyperspectral applications now require real or near real-time processing capabilities, fast spectral unmixing using field-programmable gate arrays (FPGAs) has received considerable interest in recent years.
Cong Li, Lianru Gao, Antonio Plaza, Bing Zhang   +3 more
openalex   +3 more sources

A New Maximum Simplex Volume Method Based on Householder Transformation for Endmember Extraction

IEEE Transactions on Geoscience and Remote Sensing, 2011
Endmember extraction is very important in hyperspectral image analysis. The accurate identification of endmembers enables target detection and classification and efficient spectral unmixing. Although a number of endmember extraction algorithms have been proposed, such as two state-of-the-art algorithms-vertex component analysis (VCA) and simplex ...
Junmin Liu, Jiangshe Zhang
openalex   +3 more sources

Dual Simplex Volume Maximization for Simplex-Structured Matrix Factorization [PDF]

SIAM Journal on Imaging Sciences
Simplex-structured matrix factorization (SSMF) is a generalization of nonnegative matrix factorization, a fundamental interpretable data analysis model, and has applications in hyperspectral unmixing and topic modeling.
Nicolas Gillis, Giovanni Barbarino, Maryam Abdolali   +2 more
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

A New Maximum Simplex Volume Method Based on Householder Transformation for Endmember Extraction

IEEE Transactions on Geoscience and Remote Sensing, 2012
Junmin Liu, Jiangshe Zhang
exaly  

A Maximum Volume Simplex Constrained Automatic Endmember Extraction Algorithm

, 2015
LI Erse
openalex  

FPGA Implementation of a Maximum Simplex Volume Algorithm for Endmember Extraction From Remotely Sensed Hyperspectral Images

Journal of Real-Time Image Processing, 2019
ZHANG, Bing, Antonio Plaza, Lianru Gao
exaly  

Maximum Simplex Volume: An Efficient Unsupervised Band Selection Method for Hyperspectral Image

IET Computer Vision, 2019
Shuying Li
exaly  

A Specialized Network Simplex Algorithm for the Constrained Maximum Flow Problem

European Journal of Operational Research, 2011
Cenk Çalışkan
exaly  

A Primal Simplex Algorithm That Solves the Maximum Flow Problem in at Mostnm Pivots and O(n 2 m) Time

Mathematical Programming, 1990
Donald Goldfarb
exaly  

On Strongly Polynomial Variants of the Network Simplex Algorithm for the Maximum Flow Problem

Operations Research Letters, 1991
Donald Goldfarb
exaly