Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/wiley/spectral-compression-using-subspace-clustering-tvRatoIEpY
References (20)
-
M. Sattler, Ralf Sarlette, R. Klein (2005)
Simple and efficient compression of animation sequences -
Lance Parsons, E. Haque, Huan Liu (2004)
Subspace clustering for high dimensional data: a reviewSIGKDD Explor., 6
-
Q. Du, J. Fowler (2007)
Hyperspectral Image Compression Using JPEG2000 and Principal Component AnalysisIEEE Geoscience and Remote Sensing Letters, 4
-
A. Yang, John Wright, Yi Ma, S. Sastry (2008)
Unsupervised segmentation of natural images via lossy data compressionComput. Vis. Image Underst., 110
-
Farnaz Agahian, B. Funt (2014)
Outlier modeling for spectral data reduction.Journal of the Optical Society of America. A, Optics, image science, and vision, 31 7
-
A. Garcia-Beltran, J. Nieves, J. Hernández-Andrés, J. Romero (1998)
LINEAR BASES FOR SPECTRAL REFLECTANCE FUNCTIONS OF ACRYLIC PAINTSColor Research and Application, 23
-
Lena Chang, Yang-Lang Chang, Z. Tang, Bormin Huang (2011)
Group and Region Based Parallel Compression Method Using Signal Subspace Projection and Band Clustering for Hyperspectral ImageryIEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 4
-
C. Rodarmel, J. Shan (2002)
Principal Component Analysis for Hyperspectral Image Classification -
X. Jia, J. Richards (1999)
Segmented principal components transformation for efficient hyperspectral remote-sensing image display and classificationIEEE Trans. Geosci. Remote. Sens., 37
-
E. Magli (2009)
Multiband Lossless Compression of Hyperspectral ImagesIEEE Transactions on Geoscience and Remote Sensing, 47
-
R. Ciprian, M. Carbucicchio (2011)
Colorimetric–spectral clustering: a tool for multispectral image compressionJournal of Optics, 13
-
A. Kaarna, P. Toivanen, P. Keränen (2006)
Compression and classification methods for hyperspectral imagesPattern Recognition and Image Analysis, 16
-
J. Ho, Ming-Hsuan Yang, Jongwoo Lim, Kuang-chih Lee, D. Kriegman (2003)
Clustering appearances of objects under varying illumination conditions2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings., 1
-
Q. Du, Wei Zhu, He Yang, J. Fowler (2009)
Segmented Principal Component Analysis for Parallel Compression of Hyperspectral ImageryIEEE Geoscience and Remote Sensing Letters, 6
-
A. Kaarna, P. Zemčík, H. Kälviäinen, J. Parkkinen (2000)
Compression of multispectral remote sensing images using clustering and spectral reductionIEEE Trans. Geosci. Remote. Sens., 38
-
B. Penna, T. Tillo, E. Magli, G. Olmo (2006)
A New Low Complexity KLT for Lossy Hyperspectral Data Compression2006 IEEE International Symposium on Geoscience and Remote Sensing
-
Wei Hong, John Wright, Kun Huang, Yi Ma (2006)
Multiscale Hybrid Linear Models for Lossy Image RepresentationIEEE Transactions on Image Processing, 15
-
J. Hernández-Andrés, Javier Romero, A. Garcia-Beltran, J. Nieves (1998)
Testing linear models on spectral daylight measurements.Applied optics, 37 6
-
N. Kambhatla, T. Leen (1997)
Dimension Reduction by Local Principal Component AnalysisNeural Computation, 9
-
J. Parkkinen, J. Hallikainen, T. Jaaskelainen (1989)
Characteristic spectra of Munsell colorsJournal of The Optical Society of America A-optics Image Science and Vision, 6
- Publisher
- Wiley
- Copyright
- © 2015 Wiley Periodicals, Inc.
- ISSN
- 0361-2317
- eISSN
- 1520-6378
- DOI
- 10.1002/col.21942
- Publisher site
- See Article on Publisher Site
Abstract
This article describes a subspace clustering strategy for the spectral compression of multispectral images. Unlike standard principal component analysis, this approach finds clusters in several different subspaces of different dimension. Consequently, instead of representing all spectra in a single low‐dimensional subspace of a fixed dimension, spectral data are assigned to multiple subspaces having a range of dimensions from one to eight. In other words, this strategy allows us to distribute spectra into different subspaces thereby obtaining the best fit for each. As a result, more resources can be allocated to those spectra that need many dimensions for accurate representation and fewer resources to those that can be modeled using fewer dimensions. For a given compression ratio, this trade off reduces the overall reconstruction error. In the case of compressing multispectral images, this initial compression method is followed by JPEG2000 compression in order to remove the spatial redundancy in the data as well. © 2015 Wiley Periodicals, Inc. Col Res Appl, 41, 7–15, 2016
Journal
Color Research & Application – Wiley
Published: Feb 1, 2016