Heterogeneous Regularization-Based Tensor Subspace Clustering for Hyperspectral Band Selection
Band selection (BS) reduces effectively the spectral dimension of a hyperspectral image (HSI) by selecting relatively few representative bands, which allows efficient processing in subsequent tasks. Existing unsupervised BS methods based on subspace clustering are built on matrix-based models, where...
Gespeichert in:
Veröffentlicht in: | IEEE transaction on neural networks and learning systems 2023-11, Vol.34 (11), p.9259-9273 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 9273 |
---|---|
container_issue | 11 |
container_start_page | 9259 |
container_title | IEEE transaction on neural networks and learning systems |
container_volume | 34 |
creator | Huang, Shaoguang Zhang, Hongyan Xue, Jize Pizurica, Aleksandra |
description | Band selection (BS) reduces effectively the spectral dimension of a hyperspectral image (HSI) by selecting relatively few representative bands, which allows efficient processing in subsequent tasks. Existing unsupervised BS methods based on subspace clustering are built on matrix-based models, where each band is reshaped as a vector. They encode the correlation of data only in the spectral mode (dimension) and neglect strong correlations between different modes, i.e., spatial modes and spectral mode. Another issue is that the subspace representation of bands is performed in the raw data space, where the dimension is often excessively high, resulting in a less efficient and less robust performance. To address these issues, in this article, we propose a tensor-based subspace clustering model for hyperspectral BS. Our model is developed on the well-known Tucker decomposition. The three factor matrices and a core tensor in our model encode jointly the multimode correlations of HSI, avoiding effectively to destroy the tensor structure and information loss. In addition, we propose well-motivated heterogeneous regularizations (HRs) on the factor matrices by taking into account the important local and global properties of HSI along three dimensions, which facilitates the learning of the intrinsic cluster structure of bands in the low-dimensional subspaces. Instead of learning the correlations of bands in the original domain, a common way for the matrix-based models, our model learns naturally the band correlations in a low-dimensional latent feature space, which is derived by the projections of two factor matrices associated with spatial dimensions, leading to a computationally efficient model. More importantly, the latent feature space is learned in a unified framework. We also develop an efficient algorithm to solve the resulting model. Experimental results on benchmark datasets demonstrate that our model yields improved performance compared to the state-of-the-art. |
doi_str_mv | 10.1109/TNNLS.2022.3157711 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_pubmed_primary_35294365</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9737043</ieee_id><sourcerecordid>2882570962</sourcerecordid><originalsourceid>FETCH-LOGICAL-c395t-dae1a1d066dd7b952a9f2a0a253cc26bdfe5737df3e295fd94ff8e1e7f281d513</originalsourceid><addsrcrecordid>eNpdkcFLwzAUxoMoKuo_oCAFL146k5cmbY461AlDwU3wZMial1Hp2pq0B_3rjW7uYC4vefl9H3n5CDlldMQYVVfzx8fpbAQUYMSZyHPGdsghMAkp8KLY3e7z1wNyEsI7jUtSITO1Tw64AJVxKQ7J2wR79O0SG2yHkDzjcqiNr75MX7VNemMC2mSOTWh9MhsWoTMlJuN6CFFUNcvExf7ks0MfOix7b-rkxjQ2mWEdj9HhmOw5Uwc82dQj8nJ3Ox9P0unT_cP4epqWXIk-tQaZYZZKaW2-UAKMcmCoAcHLEuTCOhQ5z63jCEo4qzLnCmSYOyiYFYwfkcu1b-fbjwFDr1dVKLGuze9cGmRGOWQF5RG9-Ie-t4Nv4us0FAWInCoJkYI1Vfo2BI9Od75aGf-pGdU_AejfAPRPAHoTQBSdb6yHxQrtVvL33RE4WwMVIm6vVRyNZpx_A9phixw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2882570962</pqid></control><display><type>article</type><title>Heterogeneous Regularization-Based Tensor Subspace Clustering for Hyperspectral Band Selection</title><source>IEEE Xplore</source><creator>Huang, Shaoguang ; Zhang, Hongyan ; Xue, Jize ; Pizurica, Aleksandra</creator><creatorcontrib>Huang, Shaoguang ; Zhang, Hongyan ; Xue, Jize ; Pizurica, Aleksandra</creatorcontrib><description>Band selection (BS) reduces effectively the spectral dimension of a hyperspectral image (HSI) by selecting relatively few representative bands, which allows efficient processing in subsequent tasks. Existing unsupervised BS methods based on subspace clustering are built on matrix-based models, where each band is reshaped as a vector. They encode the correlation of data only in the spectral mode (dimension) and neglect strong correlations between different modes, i.e., spatial modes and spectral mode. Another issue is that the subspace representation of bands is performed in the raw data space, where the dimension is often excessively high, resulting in a less efficient and less robust performance. To address these issues, in this article, we propose a tensor-based subspace clustering model for hyperspectral BS. Our model is developed on the well-known Tucker decomposition. The three factor matrices and a core tensor in our model encode jointly the multimode correlations of HSI, avoiding effectively to destroy the tensor structure and information loss. In addition, we propose well-motivated heterogeneous regularizations (HRs) on the factor matrices by taking into account the important local and global properties of HSI along three dimensions, which facilitates the learning of the intrinsic cluster structure of bands in the low-dimensional subspaces. Instead of learning the correlations of bands in the original domain, a common way for the matrix-based models, our model learns naturally the band correlations in a low-dimensional latent feature space, which is derived by the projections of two factor matrices associated with spatial dimensions, leading to a computationally efficient model. More importantly, the latent feature space is learned in a unified framework. We also develop an efficient algorithm to solve the resulting model. Experimental results on benchmark datasets demonstrate that our model yields improved performance compared to the state-of-the-art.</description><identifier>ISSN: 2162-237X</identifier><identifier>EISSN: 2162-2388</identifier><identifier>DOI: 10.1109/TNNLS.2022.3157711</identifier><identifier>PMID: 35294365</identifier><identifier>CODEN: ITNNAL</identifier><language>eng</language><publisher>United States: IEEE</publisher><subject>Algorithms ; Band selection (BS) ; Banded structure ; Clustering ; Clustering algorithms ; Computational modeling ; Correlation ; Data models ; hyperspectral image (HSI) ; Hyperspectral imaging ; Learning ; Mathematical analysis ; Regularization ; remote sensing ; subspace clustering ; Subspaces ; Task analysis ; tensor ; Tensors</subject><ispartof>IEEE transaction on neural networks and learning systems, 2023-11, Vol.34 (11), p.9259-9273</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c395t-dae1a1d066dd7b952a9f2a0a253cc26bdfe5737df3e295fd94ff8e1e7f281d513</citedby><cites>FETCH-LOGICAL-c395t-dae1a1d066dd7b952a9f2a0a253cc26bdfe5737df3e295fd94ff8e1e7f281d513</cites><orcidid>0000-0003-2451-7445 ; 0000-0001-5439-5018 ; 0000-0002-7894-5755 ; 0000-0002-9322-4999</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9737043$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/9737043$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/35294365$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><creatorcontrib>Huang, Shaoguang</creatorcontrib><creatorcontrib>Zhang, Hongyan</creatorcontrib><creatorcontrib>Xue, Jize</creatorcontrib><creatorcontrib>Pizurica, Aleksandra</creatorcontrib><title>Heterogeneous Regularization-Based Tensor Subspace Clustering for Hyperspectral Band Selection</title><title>IEEE transaction on neural networks and learning systems</title><addtitle>TNNLS</addtitle><addtitle>IEEE Trans Neural Netw Learn Syst</addtitle><description>Band selection (BS) reduces effectively the spectral dimension of a hyperspectral image (HSI) by selecting relatively few representative bands, which allows efficient processing in subsequent tasks. Existing unsupervised BS methods based on subspace clustering are built on matrix-based models, where each band is reshaped as a vector. They encode the correlation of data only in the spectral mode (dimension) and neglect strong correlations between different modes, i.e., spatial modes and spectral mode. Another issue is that the subspace representation of bands is performed in the raw data space, where the dimension is often excessively high, resulting in a less efficient and less robust performance. To address these issues, in this article, we propose a tensor-based subspace clustering model for hyperspectral BS. Our model is developed on the well-known Tucker decomposition. The three factor matrices and a core tensor in our model encode jointly the multimode correlations of HSI, avoiding effectively to destroy the tensor structure and information loss. In addition, we propose well-motivated heterogeneous regularizations (HRs) on the factor matrices by taking into account the important local and global properties of HSI along three dimensions, which facilitates the learning of the intrinsic cluster structure of bands in the low-dimensional subspaces. Instead of learning the correlations of bands in the original domain, a common way for the matrix-based models, our model learns naturally the band correlations in a low-dimensional latent feature space, which is derived by the projections of two factor matrices associated with spatial dimensions, leading to a computationally efficient model. More importantly, the latent feature space is learned in a unified framework. We also develop an efficient algorithm to solve the resulting model. Experimental results on benchmark datasets demonstrate that our model yields improved performance compared to the state-of-the-art.</description><subject>Algorithms</subject><subject>Band selection (BS)</subject><subject>Banded structure</subject><subject>Clustering</subject><subject>Clustering algorithms</subject><subject>Computational modeling</subject><subject>Correlation</subject><subject>Data models</subject><subject>hyperspectral image (HSI)</subject><subject>Hyperspectral imaging</subject><subject>Learning</subject><subject>Mathematical analysis</subject><subject>Regularization</subject><subject>remote sensing</subject><subject>subspace clustering</subject><subject>Subspaces</subject><subject>Task analysis</subject><subject>tensor</subject><subject>Tensors</subject><issn>2162-237X</issn><issn>2162-2388</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpdkcFLwzAUxoMoKuo_oCAFL146k5cmbY461AlDwU3wZMial1Hp2pq0B_3rjW7uYC4vefl9H3n5CDlldMQYVVfzx8fpbAQUYMSZyHPGdsghMAkp8KLY3e7z1wNyEsI7jUtSITO1Tw64AJVxKQ7J2wR79O0SG2yHkDzjcqiNr75MX7VNemMC2mSOTWh9MhsWoTMlJuN6CFFUNcvExf7ks0MfOix7b-rkxjQ2mWEdj9HhmOw5Uwc82dQj8nJ3Ox9P0unT_cP4epqWXIk-tQaZYZZKaW2-UAKMcmCoAcHLEuTCOhQ5z63jCEo4qzLnCmSYOyiYFYwfkcu1b-fbjwFDr1dVKLGuze9cGmRGOWQF5RG9-Ie-t4Nv4us0FAWInCoJkYI1Vfo2BI9Od75aGf-pGdU_AejfAPRPAHoTQBSdb6yHxQrtVvL33RE4WwMVIm6vVRyNZpx_A9phixw</recordid><startdate>20231101</startdate><enddate>20231101</enddate><creator>Huang, Shaoguang</creator><creator>Zhang, Hongyan</creator><creator>Xue, Jize</creator><creator>Pizurica, Aleksandra</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7QF</scope><scope>7QO</scope><scope>7QP</scope><scope>7QQ</scope><scope>7QR</scope><scope>7SC</scope><scope>7SE</scope><scope>7SP</scope><scope>7SR</scope><scope>7TA</scope><scope>7TB</scope><scope>7TK</scope><scope>7U5</scope><scope>8BQ</scope><scope>8FD</scope><scope>F28</scope><scope>FR3</scope><scope>H8D</scope><scope>JG9</scope><scope>JQ2</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>P64</scope><scope>7X8</scope><orcidid>https://orcid.org/0000-0003-2451-7445</orcidid><orcidid>https://orcid.org/0000-0001-5439-5018</orcidid><orcidid>https://orcid.org/0000-0002-7894-5755</orcidid><orcidid>https://orcid.org/0000-0002-9322-4999</orcidid></search><sort><creationdate>20231101</creationdate><title>Heterogeneous Regularization-Based Tensor Subspace Clustering for Hyperspectral Band Selection</title><author>Huang, Shaoguang ; Zhang, Hongyan ; Xue, Jize ; Pizurica, Aleksandra</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c395t-dae1a1d066dd7b952a9f2a0a253cc26bdfe5737df3e295fd94ff8e1e7f281d513</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Band selection (BS)</topic><topic>Banded structure</topic><topic>Clustering</topic><topic>Clustering algorithms</topic><topic>Computational modeling</topic><topic>Correlation</topic><topic>Data models</topic><topic>hyperspectral image (HSI)</topic><topic>Hyperspectral imaging</topic><topic>Learning</topic><topic>Mathematical analysis</topic><topic>Regularization</topic><topic>remote sensing</topic><topic>subspace clustering</topic><topic>Subspaces</topic><topic>Task analysis</topic><topic>tensor</topic><topic>Tensors</topic><toplevel>online_resources</toplevel><creatorcontrib>Huang, Shaoguang</creatorcontrib><creatorcontrib>Zhang, Hongyan</creatorcontrib><creatorcontrib>Xue, Jize</creatorcontrib><creatorcontrib>Pizurica, Aleksandra</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998–Present</collection><collection>IEEE Xplore</collection><collection>PubMed</collection><collection>CrossRef</collection><collection>Aluminium Industry Abstracts</collection><collection>Biotechnology Research Abstracts</collection><collection>Calcium & Calcified Tissue Abstracts</collection><collection>Ceramic Abstracts</collection><collection>Chemoreception Abstracts</collection><collection>Computer and Information Systems Abstracts</collection><collection>Corrosion Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Engineered Materials Abstracts</collection><collection>Materials Business File</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Neurosciences Abstracts</collection><collection>Solid State and Superconductivity Abstracts</collection><collection>METADEX</collection><collection>Technology Research Database</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><collection>Aerospace Database</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Biotechnology and BioEngineering Abstracts</collection><collection>MEDLINE - Academic</collection><jtitle>IEEE transaction on neural networks and learning systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Huang, Shaoguang</au><au>Zhang, Hongyan</au><au>Xue, Jize</au><au>Pizurica, Aleksandra</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Heterogeneous Regularization-Based Tensor Subspace Clustering for Hyperspectral Band Selection</atitle><jtitle>IEEE transaction on neural networks and learning systems</jtitle><stitle>TNNLS</stitle><addtitle>IEEE Trans Neural Netw Learn Syst</addtitle><date>2023-11-01</date><risdate>2023</risdate><volume>34</volume><issue>11</issue><spage>9259</spage><epage>9273</epage><pages>9259-9273</pages><issn>2162-237X</issn><eissn>2162-2388</eissn><coden>ITNNAL</coden><abstract>Band selection (BS) reduces effectively the spectral dimension of a hyperspectral image (HSI) by selecting relatively few representative bands, which allows efficient processing in subsequent tasks. Existing unsupervised BS methods based on subspace clustering are built on matrix-based models, where each band is reshaped as a vector. They encode the correlation of data only in the spectral mode (dimension) and neglect strong correlations between different modes, i.e., spatial modes and spectral mode. Another issue is that the subspace representation of bands is performed in the raw data space, where the dimension is often excessively high, resulting in a less efficient and less robust performance. To address these issues, in this article, we propose a tensor-based subspace clustering model for hyperspectral BS. Our model is developed on the well-known Tucker decomposition. The three factor matrices and a core tensor in our model encode jointly the multimode correlations of HSI, avoiding effectively to destroy the tensor structure and information loss. In addition, we propose well-motivated heterogeneous regularizations (HRs) on the factor matrices by taking into account the important local and global properties of HSI along three dimensions, which facilitates the learning of the intrinsic cluster structure of bands in the low-dimensional subspaces. Instead of learning the correlations of bands in the original domain, a common way for the matrix-based models, our model learns naturally the band correlations in a low-dimensional latent feature space, which is derived by the projections of two factor matrices associated with spatial dimensions, leading to a computationally efficient model. More importantly, the latent feature space is learned in a unified framework. We also develop an efficient algorithm to solve the resulting model. Experimental results on benchmark datasets demonstrate that our model yields improved performance compared to the state-of-the-art.</abstract><cop>United States</cop><pub>IEEE</pub><pmid>35294365</pmid><doi>10.1109/TNNLS.2022.3157711</doi><tpages>15</tpages><orcidid>https://orcid.org/0000-0003-2451-7445</orcidid><orcidid>https://orcid.org/0000-0001-5439-5018</orcidid><orcidid>https://orcid.org/0000-0002-7894-5755</orcidid><orcidid>https://orcid.org/0000-0002-9322-4999</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 2162-237X |
ispartof | IEEE transaction on neural networks and learning systems, 2023-11, Vol.34 (11), p.9259-9273 |
issn | 2162-237X 2162-2388 |
language | eng |
recordid | cdi_pubmed_primary_35294365 |
source | IEEE Xplore |
subjects | Algorithms Band selection (BS) Banded structure Clustering Clustering algorithms Computational modeling Correlation Data models hyperspectral image (HSI) Hyperspectral imaging Learning Mathematical analysis Regularization remote sensing subspace clustering Subspaces Task analysis tensor Tensors |
title | Heterogeneous Regularization-Based Tensor Subspace Clustering for Hyperspectral Band Selection |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-14T19%3A04%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Heterogeneous%20Regularization-Based%20Tensor%20Subspace%20Clustering%20for%20Hyperspectral%20Band%20Selection&rft.jtitle=IEEE%20transaction%20on%20neural%20networks%20and%20learning%20systems&rft.au=Huang,%20Shaoguang&rft.date=2023-11-01&rft.volume=34&rft.issue=11&rft.spage=9259&rft.epage=9273&rft.pages=9259-9273&rft.issn=2162-237X&rft.eissn=2162-2388&rft.coden=ITNNAL&rft_id=info:doi/10.1109/TNNLS.2022.3157711&rft_dat=%3Cproquest_RIE%3E2882570962%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2882570962&rft_id=info:pmid/35294365&rft_ieee_id=9737043&rfr_iscdi=true |