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

Downsampling

Downsampling

When considering a sampled sequence with zero values between sampling instants, one can replace it by taking every N-th value of the sequence. At these integer multiples of N, the original and sampled sequences coincide. This process, known as decimation, involves extracting every N-th sample from a sequence, thereby creating a more efficient sequence.
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...

Encoding

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

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

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

Graphical Representation of Inequalities

Graphical Representation of Inequalities

The graph of the equation where y equals x squared forms a curve known as a parabola. This curve acts as a boundary in the coordinate plane, dividing it into distinct regions based on the relative position of points.When the equality sign in the equation is replaced with an inequality—such as greater than, less than, greater than or equal to, or less than or equal to—the graphical representation changes from a single curve into a broader shaded area that signifies the set of all points...

Transformations of Functions III

Transformations of Functions III

Transformations modify the graphical representation of a function without changing its fundamental form. One common transformation is reflection, which flips the graph across a designated axis. When the vertical coordinates of all points are multiplied by the negative one, the entire graph is mirrored over the horizontal axis. This transformation reverses the vertical orientation of peaks and troughs, akin to signal inversion in electrical systems, where a waveform is flipped, but the timing of...

You might also read

Related Articles

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

Sort by

Same author

Depth-first picture expression viewed from digital picture processing.

IEEE transactions on pattern analysis and machine intelligence·2011

Same author

Relative decrease in signal intensity of subcortical white matter in spontaneous intracranial hypotension on fluid-attenuated inversion recovery images.

AJNR. American journal of neuroradiology·2009

Same author

Depiction of the cranial nerves within the brain stem with use of PROPELLER multishot diffusion-weighted imaging.

AJNR. American journal of neuroradiology·2008

Same author

Is skeletal muscle damaged by the oxidative stress following anaerobic exercise?

Journal of clinical laboratory analysis·2001

Same author

Differentiation of Fusobacterium necrophorum subspecies from bovine pathological lesions by RAPD-PCR.

Veterinary microbiology·2001

Same author

[Long-term follow up of QRS axis deviation].

Rinsho byori. The Japanese journal of clinical pathology·1998

Search research articles

Related Experiment Video

Updated: May 23, 2026

Lensless Fluorescent Microscopy on a Chip

Lensless Fluorescent Microscopy on a Chip

Published on: August 17, 2011

On a method of binary-picture representation and its application to data compression.

E Kawaguchi¹, T Endo

¹Department of Computer Science and Communication Engineering, Kyushu University, Fukuoka, Japan.

IEEE Transactions on Pattern Analysis and Machine Intelligence

|April 14, 2012

Summary

This summary is machine-generated.

A novel data compression method uses context-free grammar to represent binary pictorial patterns. This DF-expression technique offers efficient data reduction for documents and charts, outperforming existing methods.

More Related Videos

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

Related Experiment Videos

Last Updated: May 23, 2026

Lensless Fluorescent Microscopy on a Chip

Lensless Fluorescent Microscopy on a Chip

Published on: August 17, 2011

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

Area of Science:

Computer Science
Information Theory
Digital Image Processing

Background:

Binary pictorial patterns, such as texts and charts, require efficient data representation.
Existing data compression techniques may not be optimal for all types of binary images.

Purpose of the Study:

To develop a new method for representing and compressing binary pictorial patterns using context-free grammars.
To evaluate the effectiveness of the proposed DF-expression technique for data compression.

Main Methods:

Introduced fundamental concepts of binary-valued pictures, including complexity and primitives.
Defined a simple context-free grammar (G) where binary pictures are terminal sequences.
Developed the DF-expression as a reduced terminal sequence of G for detailed, lossless representation.

Main Results:

Demonstrated that any binary picture with complexity < 0.47 can be compressed using DF-expression.
Developed a simple, recursively executable coding algorithm for converting data into DF-expressions.
Experimental results showed high data compression ratios and feasible coding/decoding algorithms compared to facsimile techniques.

Conclusions:

The DF-expression is a highly effective data compression technique for binary pictorial patterns.
Its efficiency stems from high data compression ratios and practical, feasible algorithms for coding and decoding.