Semi-streaming quantization for remote sensing data

被引:7
|
作者
Braverman, A
Fetzer, E
Eldering, A
Nittel, S
Leung, K
机构
[1] CALTECH, Jet Prop Lab, Div Earth & Space Sci, Pasadena, CA 91109 USA
[2] Univ Calif Los Angeles, Dept Comp Sci, Los Angeles, CA 90095 USA
[3] Univ Maine, Dept Spatial Informat Sci & Engn, Orono, ME 04469 USA
[4] CALTECH, Jet Prop Lab, Div Earth & Space Sci, Pasadena, CA 91109 USA
关键词
cluster analysis; data compression; data reduction; massive datasets;
D O I
10.1198/1061860032535
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
We describe a strategy for reducing the size and complexity of very large, remote sensing datasets acquired from NASA's Earth Observing System. We apply the quantization paradigm from, and algorithms developed in, signal processing to the problem of summarization. Because data arrive in discrete chunks, we formulate a semi-streaming strategy that partially processes chunks as they become available and stores the results. At the end of the summary time period, we re-ingest the partial summaries and summarize them. We show that mean squared errors between the final summaries and the original data can be computed from the mean squared errors incurred at the two stages without directly accessing the original data. The procedure is demonstrated using data from JPL's Atmospheric Infrared Sounder.
引用
收藏
页码:759 / 780
页数:22
相关论文
共 50 条
  • [21] A Simple Semi-Streaming Algorithm for Global Minimum Cuts
    Assadi, Sepehr
    Dudej, Aditi
    2021 PROCEEDINGS OF THE SYMPOSIUM ON ALGORITHM ENGINEERING AND EXPERIMENTS, ALENEX, 2021, : 172 - 180
  • [22] IMPROVED APPROXIMATION GUARANTEES FOR WEIGHTED MATCHING IN THE SEMI-STREAMING MODEL
    Epstein, Leah
    Levin, Asaf
    Mestre, Julian
    Segev, Danny
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2011, 25 (03) : 1251 - 1265
  • [23] IMPROVED APPROXIMATION GUARANTEES FOR WEIGHTED MATCHING IN THE SEMI-STREAMING MODEL
    Epstein, Leah
    Levin, Asaf
    Mestre, Julian
    Segev, Danny
    27TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2010), 2010, 5 : 347 - 358
  • [24] Semi-Streaming Bipartite Matching in Fewer Passes and Optimal Space
    Assadi, Sepehr
    Jambulapati, Arun
    Jin, Yujia
    Sidford, Aaron
    Tian, Kevin
    PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 627 - 669
  • [25] A (2+ε)-Approximation for MaximumWeight Matching in the Semi-streaming Model
    Paz, Ami
    Schwartzman, Gregory
    ACM TRANSACTIONS ON ALGORITHMS, 2019, 15 (02)
  • [26] Optimal per-edge processing times in the semi-streaming model
    Zelke, Mariano
    INFORMATION PROCESSING LETTERS, 2007, 104 (03) : 106 - 112
  • [27] Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem
    Ahn, Kook Jin
    Guha, Sudipto
    AUTOMATA, LANGUAGES AND PROGRAMMING, ICALP, PT II, 2011, 6756 : 526 - 538
  • [28] Linear programming in the semi-streaming model with application to the maximum matching problem
    Ahn, Kook Jin
    Guha, Sudipto
    INFORMATION AND COMPUTATION, 2013, 222 : 59 - 79
  • [29] A Two-Pass (Conditional) Lower Bound for Semi-Streaming Maximum Matching
    Assadi, Sepehr
    PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 708 - 742
  • [30] A Semi-streaming Algorithm for Monotone Regularized Submodular Maximization with a Matroid Constraint
    Nong, Qing-Qin
    Wang, Yue
    Gong, Su-Ning
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2024,