Login| Sign Up| Help| Contact|

Patent Searching and Data


Title:
FAST LOSS LESS IMAGE COMPRESSION SYSTEM BASED ON NEIGHBORHOOD COMPARISONS
Document Type and Number:
WIPO Patent Application WO2005001760
Kind Code:
B1
Abstract:
A fast loss less image compression system based on neighborhood comparisons compares pixel value differences with neighboring pixels and replaces such pixel values with the minimum of the differences. A marker is attached to a block of pixels, such that all the pixels in that block are compared with neighbors of one direction. The marker indicates how of the pixels in that block are compared. Intermittent Huffman-tree construction is used such that one tree is used for several frames. Huffman coding is used to compress the resulting frame. A single Huffman-tree is constructed once every predetermined number of frames. The frequency of Huffman-tree construction can be performed according to the instantaneous availability of processor time to perform the construction. When more processing time is available, the Huffman-trees are computed more frequently. Such frequency variation can be implemented by using an input video frame buffer.

Inventors:
SUZUKI NORIHISA
Application Number:
PCT/US2004/016951
Publication Date:
September 29, 2005
Filing Date:
May 27, 2004
Export Citation:
Click for automatic bibliography generation   Help
Assignee:
ZAXEL SYSTEMS INC (US)
International Classes:
G06K9/36; G06K9/46; G06T9/00; H03M7/40; H04N7/26; H04N7/50; H04N19/593; G06T; (IPC1-7): G06K9/36
Download PDF: