Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Fast Fourier Transform01:10

Fast Fourier Transform

1.2K
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
1.2K
Fineness Modulus01:19

Fineness Modulus

1.8K
The fineness modulus (FM) of aggregate is a numerical index that measures the coarseness or fineness of the particles. It is calculated by adding the cumulative percentages of aggregate retained on each of a specified series of sieves and dividing the sum by 100.
Consider performing sieve analysis on sand through a set of ASTM sieves. The weight of aggregate retained in each sieve and pan placed at the bottom is recorded, as given in Column B of Table 1.
To determine the fineness modulus of...
1.8K
Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

434
Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
434
Upsampling01:22

Upsampling

707
Managing signal sampling rates is essential in digital signal processing to maintain signal integrity. A decimated signal, characterized by a reduced frequency range due to its lower sampling rate, can be upsampled by inserting zeros between each sample. This upsampling process expands the original spectrum and introduces repeated spectral replicas at intervals dictated by the new Nyquist frequency. To refine this zero-inserted sequence, it is passed through a lowpass filter with a cutoff...
707
Convergence of Fourier Series01:21

Convergence of Fourier Series

529
The Fourier series is a powerful mathematical tool for representing periodic signals as an infinite sum of complex exponentials. In practice, this infinite series is truncated to a finite number of terms, yielding a partial sum. This truncation makes the approximation of the signal feasible but introduces certain challenges, particularly near discontinuities, known as the Gibbs phenomenon.
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
529
Compacting Factor test01:22

Compacting Factor test

692
The compacting factor test is a method used to assess the workability of concrete. It is  especially suitable for concrete mixes containing aggregates up to one and a half inches in size. This test involves specialized equipment consisting of two truncated cone-shaped hoppers and a cylinder, all with polished interior surfaces to minimize friction.
The procedure begins by placing concrete into the upper hopper without any compaction. Once filled, the bottom door of this hopper is opened,...
692

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Expanding Access to Science Participation: A FAIR Framework for Petascale Data Visualization and Analytics.

IEEE transactions on visualization and computer graphics·2025
Same author

A General Framework for Progressive Data Compression and Retrieval.

IEEE transactions on visualization and computer graphics·2023
Same author

Progressive Tree-Based Compression of Large-Scale Particle Data.

IEEE transactions on visualization and computer graphics·2023
Same author

AMM: Adaptive Multilinear Meshes.

IEEE transactions on visualization and computer graphics·2022
Same author

Efficient and Flexible Hierarchical Data Layouts for a Unified Encoding of Scalar Field Precision and Resolution.

IEEE transactions on visualization and computer graphics·2020
Same author

TTHRESH: Tensor Compression for Multidimensional Visual Data.

IEEE transactions on visualization and computer graphics·2019
Same journal

MesoSplats: Texture Synthesis with Gaussian Splatting.

IEEE transactions on visualization and computer graphics·2026
Same journal

GLLA: A Unified Force-Directed Graph Layout Framework Supporting Local Adjustments.

IEEE transactions on visualization and computer graphics·2026
Same journal

Multi-Perception Crowd: Learning to combine entity and implicit perception for diverse crowd simulation.

IEEE transactions on visualization and computer graphics·2026
Same journal

Hiding in Plain Sight: Camouflaging Real-world Objects.

IEEE transactions on visualization and computer graphics·2026
Same journal

RTF2Mesh: Restricted Tangent Face Based Mesh Compression With Neural Displacement Fields.

IEEE transactions on visualization and computer graphics·2026
Same journal

Practical Occluder Generation for Mobile Games.

IEEE transactions on visualization and computer graphics·2026
See all related articles

Related Experiment Video

Updated: Apr 4, 2026

Generation and Coherent Control of Pulsed Quantum Frequency Combs
06:42

Generation and Coherent Control of Pulsed Quantum Frequency Combs

Published on: June 8, 2018

9.8K

Fixed-Rate Compressed Floating-Point Arrays.

Peter Lindstrom

    IEEE Transactions on Visualization and Computer Graphics
    |September 11, 2015
    PubMed
    Summary
    This summary is machine-generated.

    We developed a fixed-rate compression scheme for floating-point data, enabling random access to compressed scientific data. This method simplifies memory management for visualization and simulation applications.

    More Related Videos

    Author Spotlight: Introduction to Active Probe Atomic Force Microscopy with Quattro-Parallel Cantilever Arrays
    05:04

    Author Spotlight: Introduction to Active Probe Atomic Force Microscopy with Quattro-Parallel Cantilever Arrays

    Published on: June 13, 2023

    2.6K
    Quasi-light Storage for Optical Data Packets
    07:45

    Quasi-light Storage for Optical Data Packets

    Published on: February 6, 2014

    11.4K

    Related Experiment Videos

    Last Updated: Apr 4, 2026

    Generation and Coherent Control of Pulsed Quantum Frequency Combs
    06:42

    Generation and Coherent Control of Pulsed Quantum Frequency Combs

    Published on: June 8, 2018

    9.8K
    Author Spotlight: Introduction to Active Probe Atomic Force Microscopy with Quattro-Parallel Cantilever Arrays
    05:04

    Author Spotlight: Introduction to Active Probe Atomic Force Microscopy with Quattro-Parallel Cantilever Arrays

    Published on: June 13, 2023

    2.6K
    Quasi-light Storage for Optical Data Packets
    07:45

    Quasi-light Storage for Optical Data Packets

    Published on: February 6, 2014

    11.4K

    Area of Science:

    • Scientific Computing
    • Data Compression
    • Computer Graphics

    Background:

    • Current floating-point data compression methods create variable-length bit streams, hindering memory management and random access.
    • Fixed-rate texture compression in graphics hardware offers potential but requires adaptation for scientific data's high dynamic range and precision.

    Purpose of the Study:

    • To introduce a fixed-rate, near-lossless compression scheme for floating-point data that supports random access.
    • To adapt graphics hardware compression techniques for scientific applications.

    Main Methods:

    • Developed a novel lifted, orthogonal block transform and embedded coding for fixed-rate compression.
    • Implemented a software write-back cache to avoid frequent compression/decompression.
    • Designed the compressor for computational simplicity and speed, suitable for hardware implementation.

    Main Results:

    • Achieved block-granularity random access to compressed floating-point data.
    • Demonstrated viability of lossy compression for visualization, quantitative data analysis, and numerical simulation.
    • The scheme allows for flexible bit rate selection via stream truncation.

    Conclusions:

    • The proposed fixed-rate compression scheme enhances accessibility and management of scientific floating-point data.
    • The method's efficiency and adaptability show promise for various scientific applications, including those requiring hardware acceleration.