IP Library Granted Patent US 7,016,541
Granted Patent B2
US 7,016,541 · App. 10/200,225 · Granted Mar 21, 2006

Image processing method for facilitating data transmission

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,016,541
App. No.
10/200,225
Granted
Mar 21, 2006
Kind
B2
Abstract

An image processing method for facilitating data transmission is provided. An image compression method is performed to convert X-bits binary digital signals to a binary compressed data in the form of n*2 m , in which n is represented by the former Y bits of the X-bits binary digital signals, m is set to the value of (X−Y), and represented by binary numbers with [log 2 (X−Y+1)] bits. The binary compressed data is transmitted with a sequence of [log 2 (X−Y+1)]+Y bits, representing (m, n), wherein m is the former [log 2 (X−Y+1)] bits and n is the latter Y bits. Therefore, by the present image compression method, the transmission amount of image data is reduced. The transmission time of image data and the volume of a memory for storing the image data are also reduced.

Claims (31)

1. An image processing method for facilitating data transmission, comprising:

capturing an image signal from an object with an image capture device;

providing said image signal to an analog-to-digital converter for converting said image signal to X-bits binary digital signals, wherein X is a natural number;

transmitting said X-bits binary digital signals to image processing means for compressing said X-bits binary digital signals to a binary compressed data in the form of n*2 m , wherein X bits includes bit (X−1) to bit 0 , m is a non-negative integer; when n is represented by the former Y bits of said X-bits binary digital signals, Y is a natural number, m is set to (X−Y), and then m is represented by binary numbers with [log 2 (X−Y+1)] bits, such that said X-bits binary digital signals are converted to said binary compressed data represented by (m, n) with a sequence of [log 2 (X−Y+1)]+Y bits, wherein m is the former [log 2 (X−Y+1)] bits and n is the latter Y bits; and

storing said binary compressed data represented by (m, n) with the sequence of [log 2 (X−Y+1)]+Y bits in memory means.

2. The method of claim 1 , wherein the step of compressing said X-bits binary digital signals to said binary compressed data in the form of n*2 m , further comprising:

(a) when bit (X−1) is logic level “1”, n is represented by the former bit (X−1) to bit (X−Y) of said X-bits binary digital signals, m is set to (X−Y), and is represented by binary numbers with [log 2 (X−Y+1)] bits, said binary compressed data is then outputted by (m, n) with the sequence of [log 2 (X−Y+1)]+Y bits, wherein m is represented by the former [log 2 (X−Y+1)] bits and n is the latter bits consisted of said bit (X−1) to said bit (X−Y);

(b) when bit (X−1) is logic level “0” and bit (X−2) is logic level “1”, n is represented by the former bit (X−2) to bit (X−1−Y) of said X-bits binary digital signals, m is set to (X−1−Y) and is represented by binary numbers with [log 2 (X−Y+1)] bits, said binary compressed data is then outputted by (m, n) with [log 2 (X−Y+1)]+Y bits, wherein m is represented by the former [log 2 (X−Y+1)] bits and n is the latter bits consisted of said bit (X−2) to said bit (X−1−Y);

(c) when bit (X−1) and bit (X−2) are logic level “0”, and bit (X−3) is logic level “1”, n is represented by the former bit (X−3) to bit (X−2−Y) of said X-bits binary digital signals, m is set to (X−2−Y) and is represented by binary numbers with [log 2 (X−Y+1)] bits, said binary compressed data is then outputted by (m, n) with [log 2 (X−Y+1)]+Y bits, wherein m is represented by the former [log 2 (X−Y+1)] bits and n is the latter bits consisted of said bit (X−3) to said bit (X−2−Y);

(d) when each of bit (X−1) to bit (Y+1) is logic level “0” and bit Y is logic level “1”, n is represented by bit Y to bit 1 , m is set to 1 and is represented by binary numbers with [log 2 (X−Y+1)] bits, said binary compressed data is then outputted by (m, n) with [log 2 (X−Y+1)]+Y bits, wherein m is represented by the former [log 2 (X−Y+1)] bits and n is the latter bits consisted of said bit Y to said bit 1 ; and

(e) when each of bit (X−1) to bit Y is logic level “0” and bit (Y−1) is logic level “1”, n is represented by bit (Y−1) to bit 0 , m is set to 0 and is represented by binary numbers with [log 2 (X−Y+1)] bits, said binary compressed data is then outputted by (m, n) with [log 2 (X−Y+1)]+Y bits, wherein m is represented by the former [log 2 (X−Y+1)] bits and n is the latter bits consisted of said bit Y−1 to said bit 0 .

3. The method of claim 1 , further comprising accessing said binary compressed data from said memory means via said image processing means to a host and decompressing said binary compressed data to recover to said X-bits binary digital signals.

4. The method of claim 2 , further comprising accessing said binary compressed data from said memory means via said image processing means to a host and decompressing said binary compressed data to recover to said X-bits binary digital signals.

5. The method of claim 3 , wherein the step for decompressing said binary compressed data comprises:

(a) assigning the former [log 2 (X−Y+1)] bits of said binary compressed data to m, thereby obtaining the value of m, and assigning the latter Y bits of said binary compressed data to n; and

(b) recovering said binary compressed data in the form of n*2 m to said X-bits binary digital signals.

6. The method of claim 4 , wherein the step for decompressing said binary compressed data comprises:

(b) assigning the former [log 2 (X−Y+1)] bits of said binary compressed data to m, thereby obtaining the value of m, and assigning the latter Y bits of said binary compressed data to n; and

(b) recovering said binary compressed data in the form of n*2 m to said X-bits binary digital signals.

7. The method of claim 5 , wherein when m is a positive integer, further comprising a step for compensating the pixel corresponding to said X-bits binary digital signals with a bit-enhanced method after the step (b), wherein said bit-enhanced method comprises (c) calculating a first average of a plurality of neighboring pixels around the pixel; and (d) calculating a second average of the first average and the pixel.

8. The method of claim 6 , wherein when m is a positive integer, further comprising a step for compensating the pixel corresponding to said X-bits binary digital signals with a bit-enhanced method after the step (b), wherein said bit-enhanced method comprises (c) calculating a first average of a plurality of neighboring pixels around the pixel; and (d) calculating a second average of the first average and the pixel.

9. The method of claim 1 , further comprising accessing said binary compressed data from said memory means by a host and decompressing said binary compressed data to recover to said X-bits binary digital signals.

10. The method of claim 2 , further comprising accessing said binary compressed data from said memory means by a host and decompressing said binary compressed data to recover to said X-bits binary digital signals.

11. The method of claim 9 , wherein the step for decompressing said binary compressed data comprises:

(a) assigning the former [log 2 (X−Y+1)] bits of said binary compressed data to m, thereby obtaining the value of m, and assigning the latter Y bits of said binary compressed data to n; and

(b) recovering said binary compressed data in the form of n*2 m to said X-bits binary digital signals.

12. The method of claim 10 , wherein the step for decompressing said binary compressed data comprises:

(a) assigning the former [log 2 (X−Y+1)] bits of said binary compressed data to m, thereby obtaining the value of m, and assigning the latter Y bits of said binary compressed data to n; and

(b) recovering said binary compressed data in the form of n*2 m to said X-bits binary digital signals.

13. The method of claim 11 , wherein when m is a positive integer, further comprising a step for compensating the pixel corresponding to said X-bits binary digital signals with a bit-enhanced method after the step (b), wherein said bit-enhanced method comprises (c) calculating a first average of a plurality of neighboring pixels around the pixel; and (d) calculating a second average of the first average and the pixel.

14. The method of claim 12 , wherein when m is a positive integer, further comprising a step for compensating the pixel corresponding to said X-bits binary digital signals with a bit-enhanced method after the step (b), wherein said bit-enhanced method comprises (c) calculating a first average of a plurality of neighboring pixels around the pixel; and (d) calculating a second average of the first average and the pixel.