Actions for Vectorized Rebinning Algorithm for Fast Data Down-Sampling
Vectorized Rebinning Algorithm for Fast Data Down-Sampling
- Author
- Dean, Bruce
- Published
- March 2013.
- Physical Description
- 1 electronic document
- Additional Creators
- Aronstein, David and Smith, Jeffrey
Online Version
- hdl.handle.net , Connect to this object online.
- Restrictions on Access
- Unclassified, Unlimited, Publicly available.
Free-to-read Unrestricted online access - Summary
- A vectorized rebinning (down-sampling) algorithm, applicable to N-dimensional data sets, has been developed that offers a significant reduction in computer run time when compared to conventional rebinning algorithms. For clarity, a two-dimensional version of the algorithm is discussed to illustrate some specific details of the algorithm content, and using the language of image processing, 2D data will be referred to as "images," and each value in an image as a "pixel." The new approach is fully vectorized, i.e., the down-sampling procedure is done as a single step over all image rows, and then as a single step over all image columns. Data rebinning (or down-sampling) is a procedure that uses a discretely sampled N-dimensional data set to create a representation of the same data, but with fewer discrete samples. Such data down-sampling is fundamental to digital signal processing, e.g., for data compression applications.
- Other Subject(s)
- Collection
- NASA Technical Reports Server (NTRS) Collection.
- Note
- Document ID: 20130011239.
GSC-15949-1.
NASA Tech Briefs, March 2013; 5-6. - Terms of Use and Reproduction
- Copyright, Distribution as joint owner in the copyright.
View MARC record | catkey: 16005050