The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A Compressive Sensing and Unmixing Scheme for Hyperspectral Data Processing
Open accessAbstract
Hyperspectral data processing typically demands enormous computational resources in terms of storage, computation, and input/output throughputs, particularly when real-time processing is desired. In this paper, a proof-of-concept study is conducted on compressive sensing (CS) and unmixing for hyperspectral imaging. Specifically, we investigate a low-complexity scheme for hyperspectral data compression and reconstruction. In this scheme, compressed hyperspectral data are acquired directly by a device similar to the single-pixel camera based on the principle of CS. To decode the compressed data, we propose a numerical procedure to compute directly the unmixed abundance fractions of given endmembers, completely bypassing high-complexity tasks involving the hyperspectral data cube itself. The reconstruction model is to minimize the total variation of the abundance fractions subject to a preprocessed fidelity equation with a significantly reduced size and other side constraints. An augmented Lagrangian-type algorithm is developed to solve this model. We conduct extensive numerical experiments to demonstrate the feasibility and efficiency of the proposed approach, using both synthetic data and hardware-measured data. Experimental and computational evidences obtained from this paper indicate that the proposed scheme has a high potential in real-world applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fast approximate energy minimization via graph cuts
Boykov, Y., Veksler, O., & Zabih, R. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.969114 · Cited by 6,988
A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
Wang, Y., Yang, J., Yin, W., & Zhang, Y. (2008) · SIAM Journal on Imaging Sciences · doi:10.1137/080724265 · Cited by 1,975
Self-citation
Cited by
An efficient augmented Lagrangian method with applications to total variation minimization
Li, C., Yin, W., Jiang, H., & Zhang, Y. (2013) · Computational Optimization and Applications · doi:10.1007/s10589-013-9576-1 · Cited by 656
Self-citationSingle Particle Tracking: From Theory to Biophysical Applications
Shen, H., Tauzin, L. J., Baiyasi, R., Wang, W., Moringo, N., Shuang, B., & Landes, C. F. (2017) · Chemical Reviews · doi:10.1021/acs.chemrev.6b00815 · Cited by 536
High-quality hyperspectral reconstruction using a spectral prior
Choi, I., Jeon, D. S., Nam, G., Gutierrez, D., & Kim, M. H. (2017) · ACM Transactions on Graphics · doi:10.1145/3130800.3130810 · Cited by 320
Spectral Unmixing via Data-Guided Sparsity
Zhu, F., Wang, Y., Fan, B., Xiang, S., Meng, G., & Pan, C. (2014) · IEEE Transactions on Image Processing · doi:10.1109/tip.2014.2363423 · Cited by 276
Capsulenet-Based Spatial–Spectral Classifier for Hyperspectral Images
Arun, P. V., Buddhiraju, K. M., & Porwal, A. (2019) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2019.2913097 · Cited by 37
Metadata
- Authors
- Li, C., Sun, T., Kelly, K. F., & Zhang, Y.
- Venue
- IEEE Transactions on Image Processing
- Published
- 2012-03
- Volume
- 21
- Issue
- 3
- Pages
- 1200-1210
- ISSN
- 1057-7149 (ISSN-L)
- 1941-0042
- OpenAlex
- W2075394305
- Cited by
- 198
- References
- 2
- FWCI
- 18.07
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Compressive Sensing and Unmixing Scheme for Hyperspectral Data Processing. https://app.cochat.ai/papers/10.1109/tip.2011.2167626
- The paper
- Li, C., Sun, T., Kelly, K. F., & Zhang, Y. (2012). A Compressive Sensing and Unmixing Scheme for Hyperspectral Data Processing. IEEE Transactions on Image Processing. https://doi.org/10.1109/tip.2011.2167626
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.