<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>HyperCSI on 热爱可抵万难</title><link>https://www.jingmengzhiyue.tech/en/tags/hypercsi/</link><description>Recent content from 热爱可抵万难</description><generator>Hugo</generator><language>en</language><copyright>All articles on this blog are licensed under the BY license agreement unless otherwise stated. Please indicate the source when reprinting!</copyright><lastBuildDate>Sun, 24 Mar 2024 12:14:07 +0800</lastBuildDate><atom:link href="https://www.jingmengzhiyue.tech/en/tags/hypercsi/index.xml" rel="self" type="application/rss+xml"/><item><title>A Fast Hyperspectral Image Unmixing Algorithm Based on the Minimum-Volume Simplex</title><link>https://www.jingmengzhiyue.tech/en/hypercsi/</link><pubDate>Sun, 24 Mar 2024 11:37:14 +0800</pubDate><guid>https://www.jingmengzhiyue.tech/en/hypercsi/</guid><description>
<![CDATA[<h1>A Fast Hyperspectral Image Unmixing Algorithm Based on the Minimum-Volume Simplex</h1><p>Author: Jingmengzhiyue()</p>
        
          <p>Hyperspectral remote sensing is a key technique for identifying the endmember constituents within a target region and their proportions. It is widely used in land-cover classification, environmental monitoring, and related fields. Hyperspectral unmixing (HU) is the signal-processing task of analyzing hyperspectral data to identify the endmembers in an image and their corresponding abundances. Craig&rsquo;s minimum-volume simplex criterion is a classical and effective method for blind unmixing: the vertices of the minimum-volume simplex that encloses the data point cloud are taken as the endmember estimates. Related algorithms are computationally inefficient, however, because they involve complicated volume calculations. HyperCSI (Hyperplane-based Craig-Simplex Identification) does not evaluate a complicated volume function. It uses a geometric theorem instead: an \(N\)-dimensional simplex can be determined by \(N\) hyperplanes (of dimension \(N-2\)). HyperCSI reconstructs Craig&rsquo;s minimum-volume simplex by constructing \(N\) hyperplanes associated with it. This avoids the volume calculation and is far less expensive than algorithms based on Craig&rsquo;s criterion.</p>
        
        <hr><p>Published on 2024-03-24 at <a href='https://www.jingmengzhiyue.tech/'>热爱可抵万难</a>, last modified on 2024-03-24</p>]]></description><category>Remote Sensing</category><category>Algorithm</category></item></channel></rss>