Corpus ID: 8705001

Fast Spectral Unmixing based on Dykstra's Alternating Projection

@article{Wei2015FastSU,
  title={Fast Spectral Unmixing based on Dykstra's Alternating Projection},
  author={Q. Wei and J. Bioucas-Dias and N. Dobigeon and J. Tourneret},
  journal={ArXiv},
  year={2015},
  volume={abs/1505.01740}
}
  • Q. Wei, J. Bioucas-Dias, +1 author J. Tourneret
  • Published 2015
  • Computer Science
  • ArXiv
  • This paper presents a fast spectral unmixing al- gorithm based on Dykstra's alternating projection. The pro- posed algorithm formulates the fully constrained least squares optimization problem associated with the spectral unmixing task as an unconstrained regression problem followed by a projection onto the intersection of several closed convex sets. This projection is achieved by iteratively projecting onto each of the convex sets individually, following Dyktra's scheme . The sequence thus… CONTINUE READING
    ART in the European Union
    9
    A fast algorithm based on a sylvester-like equation for LS regression with GMRF prior
    Unsupervised Nonlinear Spectral Unmixing Based on a Multilinear Mixing Model
    16
    Linear and Nonlinear Unmixing in Hyperspectral Imaging
    27
    Multiband Image Fusion Based on Spectral Unmixing
    60

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 54 REFERENCES
    Is Consistent Mapping Necessary for High-Speed Search?
    12
    Compatible Ionic liquid‐cellulases system for hydrolysis of lignocellulosic biomass
    100
    Purdue MapReduce benchmark suite
    • 2012
    Temporal linkage between the phenotypic and genomic responses to caloric restriction.
    248