Abstract

We propose semi-supervised regression and dimensionality reduction methods for hyperspectral subspace learning based on abundant unlabeled data and a small number of labeled data. The quantitative target variables for regression and the order constraints for dimensionality reduction are embedded in matrices representing data relations, i.e., a set of between-class scatter matrices, within-class scatter matrices and supervised local attraction matrices. The optimal projection matrices are estimated by generalized eigenvalue problems based on the matrices. The proposed methods are applied to dimensionality reduction problems based on a time-series of hyper-spectral data for a deciduous broad-leaved forest to extract local coordinates related to phenological changes.

Full Text

Published Version

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.