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 Experiment Video

Updated: Jun 27, 2026

Quasi-light Storage for Optical Data Packets
07:45

Quasi-light Storage for Optical Data Packets

Published on: February 6, 2014

Joint optimization of run-length coding, Huffman coding, and quantization table with complete baseline JPEG decoder

En-hui Yang1, Longji Wang

  • 1Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada. ehyang@uwaterloo.ca

IEEE Transactions on Image Processing : a Publication of the IEEE Signal Processing Society
|December 20, 2008
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

Methods of Medium Optimization01:28

Methods of Medium Optimization

Optimizing growth media enhances microbial proliferation and maximizes product yield. Statistical experimental design methodologies provide structured and reproducible approaches, offering progressively higher levels of robustness and efficiency.The One-Factor-at-a-Time (OFAT) MethodThe One-Factor-at-a-Time (OFAT) method involves adjusting a single variable while keeping all others constant. However, it cannot detect interactions between variables, often leading to suboptimal outcomes when...
Reducing Line Loss01:18

Reducing Line Loss

In a three-phase circuit, line loss is an indicator of energy dissipated as heat due to the resistance of transmission lines. To address this, incorporating transformers into the system—a step-up transformer at the source and a step-down transformer at the load—is a strategic solution. Two three-phase transformers are introduced to improve this.
With a step-up transformer at the source, the voltage is increased, thereby reducing the current in the transmission lines since power loss in...
Optimization Problems01:26

Optimization Problems

Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...
Convolution: Math, Graphics, and Discrete Signals01:24

Convolution: Math, Graphics, and Discrete Signals

In any LTI (Linear Time-Invariant) system, the convolution of two signals is denoted using a convolution operator, assuming all initial conditions are zero. The convolution integral can be divided into two parts: the zero-input or natural response and the zero-state or forced response, with t0 indicating the initial time.
To simplify the convolution integral, it is assumed that both the input signal and impulse response are zero for negative time values. The graphical convolution process...
Encoding01:19

Encoding

Information enters the brain through encoding, which is the input of information into the memory system. Once sensory information is received from the environment, the brain labels or codes it. The information is then organized with similar information and connected to existing concepts. Encoding occurs through automatic processing and effortful processing.
Automatic processing involves the encoding of details like time, space, frequency, and the meaning of words, usually done without conscious...
Linearization and Approximation01:26

Linearization and Approximation

Linearization is a mathematical technique used to approximate complex, nonlinear functions with simpler linear models in the vicinity of a chosen reference point. The method is based on the idea that, although a function may be difficult to evaluate exactly, its behavior near a specific input value can often be closely approximated by the tangent line at that point. This approach is particularly useful when small deviations from a known value are involved.Consider the square root function, for...

You might also read

Related Articles

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

Sort by
Same author

Nucleolar protein DCAF13 promotes non-small cell lung cancer cell proliferation via facilitating rDNA transcription and ribosome biogenesis.

The Journal of biological chemistry·2025
Same author

Global, regional, and national differences in the burden of refraction disorders among children, adolescents, and older adults: current trends and future projections.

BMC public health·2025
Same author

Conditional Mutual Information Constrained Deep Learning for Classification.

IEEE transactions on neural networks and learning systems·2025
Same author

Compression Helps Deep Learning in Image Classification.

Entropy (Basel, Switzerland)·2021
Same author

The chromosome-scale reference genome of Rubus chingii Hu provides insight into the biosynthetic pathway of hydrolyzable tannins.

The Plant journal : for cell and molecular biology·2021
Same author

Optimization of the Biosynthesis of B-Ring <i>Ortho</i>-Hydroxy Lated Flavonoids Using the 4-Hydroxyphenylacetate 3-Hydroxylase Complex (HpaBC) of <i>Escherichia coli</i>.

Molecules (Basel, Switzerland)·2021
Same journal

Change-Prior-Guided Unsupervised Change Detection of Heterogeneous Remote Sensing Images.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

AgonicDreamer: Enhancing Multi-View Consistency in Text-to-3D Generation via Rectified Score Distillation.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

BiCM-Prompt: Bidirectional Cross-Modal Prompt Tuning for Class-Incremental Learning on Multisource Remote Sensing Images.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

GoP-based Quality Enhancement on Video Compression.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

Align then Tensorize: Multi-Level Consistent Anchor Graph Learning for Scalable Multi-View Clustering.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

Beyond Fidelity: Diverse Image Synthesis via Retrieval-Augmented Diffusion.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
See all related articles

This study optimizes JPEG image compression by jointly tuning Huffman tables, quantization, and DCT indices. The novel iterative algorithm achieves superior compression, outperforming wavelet-based methods while maintaining JPEG compatibility.

Area of Science:

  • Digital image processing
  • Data compression algorithms
  • Information theory

Background:

  • JPEG compression is a widely used standard for image compression.
  • Existing JPEG optimization methods often focus on individual components, limiting overall performance.
  • Maximizing rate-distortion performance within the JPEG syntax is a key challenge.

Purpose of the Study:

  • To investigate the joint optimization of Huffman tables, quantization step sizes, and Discrete Cosine Transform (DCT) indices for JPEG encoders.
  • To develop computationally efficient algorithms for achieving optimal rate-distortion performance in JPEG compression.
  • To ensure the generated bitstream remains fully compatible with existing JPEG and MPEG decoders.

Main Methods:

  • A graph-based algorithm was developed to find optimal DCT indices (run-size pairs) given Huffman tables and quantization step sizes.

More Related Videos

Lensless Fluorescent Microscopy on a Chip
11:23

Lensless Fluorescent Microscopy on a Chip

Published on: August 17, 2011

Related Experiment Videos

Last Updated: Jun 27, 2026

Quasi-light Storage for Optical Data Packets
07:45

Quasi-light Storage for Optical Data Packets

Published on: February 6, 2014

Lensless Fluorescent Microscopy on a Chip
11:23

Lensless Fluorescent Microscopy on a Chip

Published on: August 17, 2011

  • An iterative algorithm was presented to jointly optimize run-length coding, Huffman coding, and quantization table selection, building upon the graph-based approach.
  • The algorithms were tested on standard image datasets to evaluate compression performance.

    • Main Results:

    • The proposed iterative algorithm achieves significant improvements in JPEG image compression, outperforming previous methods.
    • The compression performance of the developed algorithm exceeds that of some state-of-the-art wavelet-based image coders at comparable bit rates.
    • The resulting compressed bitstream is fully compatible with existing JPEG and MPEG decoders.

    Conclusions:

    • Joint optimization of JPEG compression parameters leads to superior rate-distortion performance.
    • The developed graph-based and iterative algorithms offer an efficient and effective approach to enhance JPEG compression.
    • These algorithms have broad applicability in areas like web image acceleration, digital camera compression, and video transcoding.