Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Trapezoidal Rule

Trapezoidal Rule

Estimating the distance traveled by a vehicle using its recorded velocity over time is a common problem in physics and engineering. When velocity data is available at discrete time intervals, rather than as a continuous function, numerical integration methods such as the trapezoidal rule are often employed to approximate the total displacement.The trapezoidal rule works by dividing the total time interval into several equal segments. Within each segment, the recorded velocities at the endpoints...

Computed Tomography

Computed Tomography

Tomography refers to imaging by sections. Computed tomography (CT) is a non-invasive imaging technique that uses computers to analyze several cross-sectional X-rays to reveal minute details about structures in the body.
The technique was invented in the 1970s and is based on the principle that as X-rays pass through the body, they are absorbed or reflected at different levels. In the technique, a patient lies on a motorized platform while a computerized axial tomography (CAT) scanner rotates...

Imaging Studies III: Computed Tomography

Imaging Studies III: Computed Tomography

DefinitionComputed Tomography (CT) of the genitourinary (GU) tract is a non-invasive imaging modality that utilizes X-rays and computer processing to generate detailed cross-sectional images of the urinary system, encompassing the kidneys, ureters, bladder, and adjacent structures such as the adrenal glands.PurposeCT scans of the GU tract serve several diagnostic and therapeutic purposes, including:Diagnosis of Urinary Tract Diseases: Detects kidney stones, tumors, cysts, and congenital...

Fast Fourier Transform

Fast Fourier Transform

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...

Convolution: Math, Graphics, and Discrete Signals

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...

Rectangular and Triangular Pulse Function

Rectangular and Triangular Pulse Function

The unit rectangular pulse function is mathematically represented by a rectangular function centered at the origin with a height of one unit. This function is defined by two parameters: T, which specifies the center location of the pulse along the time axis, and τ, which determines the pulse duration.
For example, consider a rectangular pulse with a 5V amplitude, a 3-second duration, and centered at t=2 seconds. This pulse can be expressed using the rectangular function, written as,

You might also read

Related Articles

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

Sort by

Same author

Hemostatic efficacy of a novel Ca/P/S-based bone graft material and its preliminary clinical evidence in sternum closure procedures.

Frontiers in bioengineering and biotechnology·2026

Same author

Low-Power OOK Transceiver with Auto-Feedback Calibrator in Receiver and Harmonic Mitigation Technique in Transmitter for Implantable Devices.

IEEE transactions on biomedical circuits and systems·2026

Same author

Agent-specific, histopathology-stratified hematologic malignancy risk among dpp-4 inhibitors, glp-1 receptor agonists, and SGLT2 inhibitors: a network meta-analysis of 270,471 participants.

Journal of hematology & oncology·2026

Same author

Efficacy of Glucagon-Like Peptide-1 Receptor Agonists for Psychological Well-Being and Depressive Symptoms: A Systematic Review and Meta-Analysis of Randomized Controlled Trials.

Human psychopharmacology·2026

Same author

Predictive Factors of Low HDL-C in Patients with Schizophrenia.

Neuropsychiatric disease and treatment·2026

Same author

Telomere length in bipolar disorder: An updated meta-analysis of observational studies.

Psychiatry research·2026

Search research articles

Related Experiment Video

Updated: May 10, 2026

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques

Published on: December 3, 2013

Two-dimensional orthogonal DCT expansion in trapezoid and triangular blocks and modified JPEG image compression.

Jian-Jiun Ding¹, Ying-Wun Huang, Pao-Yen Lin

¹Graduate Institute of Communication Engineering, National Taiwan University, Taipei 106, Taiwan. djj@cc.ee.ntu.edu.tw

IEEE Transactions on Image Processing : a Publication of the IEEE Signal Processing Society

|June 21, 2013

Summary

This study generalizes the JPEG algorithm using trapezoid and triangular blocks for image compression. This novel approach enhances compression ratios and image quality (PSNR) compared to standard methods.

More Related Videos

Outer-Boundary Assisted Segmentation and Quantification of Trabecular Bones by an Imagej Plugin

Outer-Boundary Assisted Segmentation and Quantification of Trabecular Bones by an Imagej Plugin

Published on: March 14, 2018

Related Experiment Videos

Last Updated: May 10, 2026

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques

Published on: December 3, 2013

Outer-Boundary Assisted Segmentation and Quantification of Trabecular Bones by an Imagej Plugin

Outer-Boundary Assisted Segmentation and Quantification of Trabecular Bones by an Imagej Plugin

Published on: March 14, 2018

Area of Science:

Digital image processing
Signal processing
Data compression

Background:

Conventional JPEG uses 8x8 blocks and 2-D DCT for image encoding.
Existing shape-adaptive algorithms can be complex and introduce boundary errors.

Purpose of the Study:

To generalize the JPEG algorithm for improved image compression.
To explore the orthogonality of 2-D DCT on non-rectangular blocks.
To achieve higher compression ratios and better image quality.

Main Methods:

Investigated the orthogonality of 2-D DCT on trapezoid and triangular blocks.
Developed a generalized JPEG algorithm using these non-rectangular blocks.
Compared performance against standard JPEG and other shape-adaptive algorithms.

Main Results:

The 2-D DCT is orthogonal in trapezoid and triangular blocks.
The proposed algorithm achieves higher Peak Signal-to-Noise Ratio (PSNR) at fixed bit rates.
Reduced overhead for encoding object edges compared to exact shape matching.

Conclusions:

Generalizing JPEG with trapezoid and triangular blocks offers superior compression and quality.
The method avoids high-frequency errors at block boundaries.
Applicable to various orthogonal bases beyond 2-D DCT.