TW556435B - Method for comprising an image in real time - Google Patents

Abstract

The present invention relates to a method for compressing an image data in real time. At first, the present invention divides an image, which is got after a pre-scanning process, into plural lines. Each line is divided into several blocks, whose sizes are the same. Each block comprises plural pixel values. A pixel value of a block is saved in the buffer completely to become the first datum. The pixel value is usually the minimum pixel value. Then plural differences, which are between the first datum and the plural pixel values of the block, are calculated. One of the plural differences, which are not equal to zero, is saved in the buffer completely to become the second datum. The difference, which is not equal to zero, is usually a minimum difference. Using the second datum to be a divisor and using the plural differences to be dividends will get plural specific values of plural differences to the second datum. When the first number, which is after a dot, of the specific value is greater than a fixed value or equal to the fixed value, it will be carried to the first number, which is in front of the dot and numbers, which are after the dot, are deleted. When the first number, which is after a dot, of the specific value is lower than a fixed value, numbers, which are after the dot, are deleted. This method will make the specific values become integers. At last, the plural specific values are saved in the buffer completely to become the plural third data and the compression procedure of the block is finished. Then the next block is compressed by the same procedure.

Description

556435 V. Description of the invention (1) 5-1 Field of the invention: The present invention relates to a method for image compression, and more particularly to a method for processing real-time image compression to reduce the amount of data and the number of data transmissions, and improve scanning. Speed. 5-2 Background of the Invention: For today's information users, especially personal computer users, the mode of contacted computer information has entered the era of so-called Mult i-Media from a more monotonous text mode. And multimedia means that the data contains text, video, sound and other content. In order to make the data available to the audience in the form of multimedia, many multimedia devices have been developed that can capture images or sound. Because multimedia data contains more content, the memory capacity required to process multimedia data must be higher than the monotonous text mode, so that the multimedia data can be presented in a smoother way. For image input devices, a scanner (s c a η n e r) and a digital camera (d i g i t a 1 c am e r a) are currently more common devices. Digital cameras use digitized information to store captured images. It uses a disk that can record images or the Personala 1 Computer Memory Card International Association.

556435 V. Description of the invention (2)

Association (PCMCIA) memory card to store still images. In order to save the memory space used by storage media, digital cameras usually capture and store images in compressed files. Common still images are: 屙 $ / τ · 4-n U 、, 77 示, Joint Photographic Experts Group; JPEG) Lou Qicai is concerned about the types of scanners used. Generally, scanners can be divided into handheld scanners and desktop scanners. Ryt Ueda σσ 〔desktop scanner or flat bed scanner ) And feed-type scanning, crying, r ,, and 1 "Q sheet feed scanner). The sharpness of the scan is in dots per inch (do p t r r n c h; d p i). The higher the d p i, the better the quality of the machine, but the longer the scan time. When scanning a color image, the RGB scanner must separately scan the three primary colors of RGB, so repeating the scanning action ^ 'also makes the scanning time longer. Desktop scanner is a more commonly used scanner, i, /, is used to scan some documents to be scanned, such as transmissive documents (such as slides) or reflective documents (such as photos or paper). Program to convert to digital data ^ Generally speaking, the photoelectric sensor module used in 'desktop scanners' mainly includes a photoelectric sensor element. This photoelectric sensor element can be: charge coupled device (CCD) or It is a contact image sensor (CIS). The desktop scanner is used to convert the document to be scanned placed on the glass platform into a digital material through the scanning process and input it into a personal computer for further use. negative

556435 V. Description of the invention (3) The light emitted by the household to the electric sensing module such as a personal computer during the scanning process' the image to be scanned reflects or transmits the light source, and the reflected or transmitted light is caused by light receive. After that, it is connected to the host computer via a control circuit, and image processing is performed via a personal computer. ^ Generally speaking, various colored lights can be obtained by combining the three primary colors of light-red (R), blue green = G) at different ratios. & In conclusion, each colored light can be regarded as a combination of R, G, and B. Underneath, the components of R, G, and B that are included for a long time are referred to as red (R) data, and green = during the scanning process, the photoelectric sensor module first captures each of #uw% The R data, G data, and B data of the pixel.

Should be an analog signal. These analog signals are then sent to an analog-to-digital converter to generate digital data ° for the next unit to process. Then the photoelectric sensor module captures the R data, G data, and B data in the bottom row of the image to be scanned for similar operations. In this process, it can be roughly divided into two types according to the different scanning methods and data processing methods: one-channel scanning and three-channel scanning. Refer to Figures A and B for illustrations. These two figures are schematic diagrams of the conventional technology for sending image data. The first diagram A shows how the conventional technology selects the scanning start position and scanning area of R, G, and B. In the first A graph, each

Page 9 556435 V. Description of the Invention (4) Each box represents a color data of a pixel on the area to be scanned, and the number ‘in the block represents the position of this pixel on the area to be scanned. In the present specification, the image data of a pixel—the pixel value is represented by the symbol P (X, y), where X represents a column coordinate and y represents a row coordinate. For example: P (2 η-1, 1) represents the pixel value of the first pixel in the second η-1 (η is a natural number) column. In the traditional technology, when scanning the 2η-1 column, the scanning of R, G, and B causes the positions to be the first pixels in the area to be scanned, and the scanning area is a complete row. . That is, its resolution is complete. The map of the corresponding production of the material in the first case is shown in Figure B of the corresponding diagram, which is in the form of the quantity B material map and the product G of the R element. For each of the y graphs, if each X is expected to show the color of each asset, the color of the C includes the element 8 y, and the XC is not divided into P. The material is only 4 2 II 8 氺 3 R, If you see the picture, you can take B and the first one each time; ._ ,. Yuetu A. The first person from the material to the image to send the video to the device to scan the whole transmission βτ it mouth full material B and The storage buffer buffer buffer is buffered or the time limit scan is limited to the storage of the first storage. The storage of the first day of the material is available. The storage and transfer of the storage buffer must be buffered and when ο? Egnt ^ J, the storage of the storage of the element, will be stored in the memory, and will be stored in the memory. If you do n’t take it easy, here is the reason to enter. At the moment, the stoppage of the newsletter should be directed to the phase. Scanning is a pass to the memory of the receiving device, and R)

Page 10 556435 V. Description of the invention (5), 6 and B data are stored on the buffer memory. The buffer memory will often reach the upper limit of its data storage, and the data stored in it must be exported. When the amount of data is large, the buffer storage is full, and the number of times of data transmission is increased, so the scanning speed will be slowed down and the life of the buffer storage will be shortened. The bottleneck of the speed of the traditional scanning device often occurs when the scanning device transmits data to the host. Due to the large amount of data, the data must be transmitted to the host in batches to reduce the scanning speed. Therefore, in order to speed up the scanning speed, it is an effective way to reduce the amount of poor data transmitted to the host. 5-3 Objects and Summary of the Invention: In view of the above background of the invention, the traditional data transmission method will cause a large number of transmissions due to the large amount of data to be transmitted, resulting in a reduction in scanning speed. The present invention mainly provides a method for compressing image data in advance by using a real-time image compression processing method to reduce the amount of data to be transmitted. A second object of the present invention is to compress the image data in advance using a real-time image compression processing method to reduce the number of times data is transmitted from the buffer memory to the host.

556435 5. Description of the invention (6) The third object of the present invention is to compress the image data in advance by using the real-time image compression processing method to accelerate the scanning speed. A fourth object of the present invention is to compress the image data in advance using a real-time image compression processing method to reduce the number of times the buffer memory is fully loaded. Another object of the present invention is to compress the image data in advance by using a real-time image compression processing method, so as to extend the service life of the buffer memory. According to the above-mentioned purpose, the present invention provides a method for compressing data in advance using a g-time image compression processing method to reduce the amount of data. · The present invention first divides the image data obtained after the pre-scanning into several lines, and each line is divided into several blocks of equal size and each block contains a plurality of pixel values. One pixel value in the block is completely stored in the buffer memory and becomes the first data. Usually this pixel value is a minimum pixel value. Next, find the difference between the first data and the number of pixel values in the block, and from this difference, take a difference that is not "0" and store it completely in the buffer memory. As the second data. Usually this is not a "0" difference is a minimum difference. Using the second data as the divisor and the majority of the differences as the dividend, we can get the ratio of the majority of the differences to the majority of the second data. When the first digits after the decimal point reach a fixed value or more, the number is rounded to the first digit before the decimal point and the digits after the decimal point are deleted, so that the majority ratio is an integer. When the majority ratio is less than a fixed value, the first digit after the decimal point is deleted. _

Page 12 556435 V. Description of the invention The number after (7) point, so that most of the ratios are integer types. Finally, the majority ratios are stored in the buffer memory as the majority of the third data to complete the compression of the majority pixel values of this block, and the next block is processed in the same way to truly reduce the amount of data and data. Number of transfers from the buffer memory to the host. The invention can also reduce the number of times the buffer memory is fully loaded and prolong the service life of the buffer memory. The invention can further accelerate the scanning speed. 5-4 Detailed description of the invention: — _ Some embodiments of the present invention will be described in detail as follows. However, in addition to the detailed description, the present invention can also be widely implemented in other embodiments, and the scope of the present invention is not limited, which is subject to the scope of subsequent patents. The invention provides a real-time compressed image processing method to compress image data to reduce the amount of data. The instant compressed image processing method of the present invention first divides the image data obtained through the pre-scanning of the charge-coupled element into a plurality of lines. The majority of the lines are composed of one line that the charge-handling element can scan. Because a plane is usually composed of many lines, during the scanning process, the charge-coupled element of the scanner also divides the file to be scanned into multiple lines of data to store and finally transfer it to the host and then Combine the lines into this file. The data of this line is usually a row of data. Next, divide each line into a number of blocks.

Page 13 556435 5. Description of the invention (8) All of them are the same (refer to the second picture). Usually the number of blocks included on each line is set to a fixed value, but with different product requirements, the number of blocks included on each line can also be adjusted with different image data to speed up image processing . Each block contains many pixel values. Usually the number of pixel values contained in each block is the same, but with different product requirements, the number of pixel values contained in each block can also be adjusted with different image data to speed up Speed of image processing. Referring to the third figure, this is the arrangement of the pixel data in each block, but it does not limit the scope of the present invention. The image data of the pixels-the pixel values are represented by the symbol P (X, y), and X represents the column coordinates and y represents the row coordinates. For example: P (2 η-1, 1) represents the pixel value of the first pixel in the second η-1 (η is a natural number) column. R (x, y), G (x, y), and B (x, y) represent the color data included in the pixel values P (x, y), respectively. The arrangement of the data in each block varies with the size of the block. The memory capacity of the first block is set to hold k pen pixel values, and the other blocks are also set to hold k pen pixel values. The number of each pixel value of each block on the same line is P (2 η-1, (k (m-1) + r)), where m is the number of the block, and r is the number of pixel values in the block. After the image data is divided into a large number of blocks, Select one of the blocks for processing immediately. First compare the size of many pixel values in this block, and take a pixel value and store it in the buffer memory to become the first m 11 band m 111 «βι

556435 V. Description of the invention (9) Data. Usually this pixel value is the smallest pixel value in this block. Next, find the difference between the first data and the number of pixel values in the block, and use the difference that is not "0" as the second data. . Usually this is not the smallest "0" difference. Next, store this second data in the buffer buffer. When the second piece of data is obtained and stored in the buffer buffer, the second piece of data is used as the divisor, and the majority difference is used as the dividend. The ratio of the majority of data is stored in the buffer memory to form a majority of the third data, and then the compression process of this block is completed, and then the same compression process is used to process the next block. When all blocks on the image data are compressed using the method of the present invention, the real-time image compression process of the present invention ends. Most of the third data represent the pixel values in this block. Therefore, the method of the present invention can fully compress each pixel value to increase the operating efficiency of the scanner. Generally, each third data is stored in the buffer memory in a six-bit memory mode, but with different product requirements or image data, the memory mode used is different. Because the second piece of data is a number other than "0", the process of using the second piece of data as a divisor to obtain the majority ratios will not produce an infinitely large ratio. When calculating the majority ratio, the majority difference and the second data do not necessarily show an integer multiple relationship. Therefore, after the majority ratio is calculated, some of the majority ratio still contains decimals. To make the majority

The slow image is like its fullness, degree, when the shadow is waiting for the storage tank to travel at a low speed, the memory is reduced into the material, and the material department records the reduction of the internal capital, which is also the minimum number of buffers. The main pressure sensor will be traced to this picture, because the sweep has been used for a long time. Compared with the end of the process, the material feeding and transportation will increase the data. The saving step is similar to the loss of the asset storage. The shadow of the pass can be used to save the full life of the device or store the stored material and scan the stored materials into the fund and make the full part into a redemption. In the machine, the camera is stored in the camera so that the master can reduce the storage time, but it will be legal to store the red when it will be lost or the load of the buffer unit will be reduced. The deferred redundancies of the deposited capital can be saved. 556435 V. Description of the invention (10) The ratios are all integers, so as to facilitate the subsequent storage into the buffer temporary storage, a set value will be set in advance for discrimination. When the part contains a large number of ratios, and the first digit after the decimal point exceeds the set value, it will automatically round to the first digit before the decimal point and delete the number after the decimal point. When the part contains a majority ratio, and the first digit after the decimal point is smaller than the set value, the number after the decimal point is automatically deleted. Usually this setting is "5". The following is an embodiment of a real-time compressed image processing method, but does not limit the scope of the present invention. First divide an image data into the first line, the second line and the third line. The first line contains the first block, the second block, and the third block. The second line contains the fourth block, the fifth block, and the sixth block. The third line contains the seventh block, the eighth block, and the ninth block. Each block is the same size and contains six different pixel values for six pixels. First of all

Page 16 556435 V. Description of the invention (11) Obtain the data in the first block for comparison, where the first block includes the first pixel, the second pixel, the third pixel, the fourth pixel, The fifth pixel and the sixth pixel. The first pixel is adjacent to the second pixel. The second pixel value is adjacent to the first pixel and the third pixel and is between the first pixel and the third pixel. The third pixel value is adjacent to the second pixel and the fourth pixel and is between the second pixel and the fourth pixel. The fourth pixel is adjacent to the third pixel and the fifth pixel and is between the third pixel and the fifth pixel. The fifth pixel is adjacent to and between the fourth and sixth pixels. The sixth pixel is adjacent to the fifth pixel. When the second pixel value is the smallest pixel value in the first block, the second pixel value is completely stored in the buffer memory as the first data. Continue to g to find the first difference between the first data and the first pixel value, the second difference between the first data and the second pixel value, the first data and the third image The third difference between the prime values, the fourth difference between the first data and the fourth pixel value, the fifth difference between the first data and the fifth pixel value, and the first data and the sixth The sixth difference between the pixel values is used to obtain a minimum and non-zero difference. Although the second difference is the smallest difference, it cannot be selected to match the subsequent steps because it is "0". When it is determined that the third difference is the smallest and not a "0" difference, the third difference is completely stored in the buffer memory as the second data. Next take the second piece of data as the divisor, and each difference is the dividend to find the first ratio between the first difference and the second piece of data, the second difference ¥ and the second ratio between the second piece of data, The third ratio between the third difference and the second data, the fourth ratio between the fourth difference and the second data, the fifth ratio between the fifth difference and the second data, and the sixth difference between the third and second data. The sixth ratio of data. When each ratio has a decimal, determine the first digit of each ratio after the decimal point

Page 17 556435 V. Description of the invention (12) Whether the word reaches a set value or more. When the first digit of each ratio after the decimal point exceeds the set value, it automatically rounds to the first digit before the decimal point and deletes the number after the decimal point, so that each ratio is an integer. When the first digit of each ratio after the decimal point is less than the set value, the digits after the decimal point are automatically deleted so that each ratio is an integer. The first ratio, the second ratio, the third ratio, the fourth ratio, the fifth ratio and the sixth ratio are stored in a buffer memory to complete the compression of the first block. Next, the pixels of the second block, the third block, the fourth block, the fifth block, the sixth block, the seventh block, the eighth block, and the ninth block are compressed in the same manner. Finally, the data in the buffer memory is transmitted to a host, and the data is combined on this host into image data. The fourth figure is a flowchart of the instant image compression processing method of the present invention. First, the image data obtained after the scanner is pre-scanned is divided into a plurality of lines, each line contains blocks of equal size, and each block contains a plurality of pixels 100. Take a plurality of pixels in one of the blocks for comparison, and select a pixel value from the plurality of pixels as the first data and store it in the buffer memory 2000. Usually this pixel value is the smallest pixel value. Find the difference between the first data and the majority of pixels in the block, and select a difference other than "0" from the difference to store the second data in the buffer storage.器 内 3 0 0. Usually this is not the "0" difference is the smallest difference. The ratio of the majority difference to the majority of the second data is 4 0 0. Determine whether the first digit of the majority of the ratios after the decimal point reaches a set value above 50 0. When this majority ratio is the first digit after the decimal point

Page 18 556435 V. Description of the invention (13) When the word reaches the set value or more, it will automatically round to the first digit before the decimal point and delete the number after the decimal point, so that the majority ratio is an integer 6 0 0. When the first digit of each ratio after the decimal point is less than the set value, the digits after the decimal point are automatically deleted so that the majority ratio is an integer 7 0 0. Next, each ratio is stored in the buffer memory to complete the compression of this block. Next, the next block 900 is processed in the same way. After each block is compressed, the data in the buffer memory is finally transferred to a host, and the data is combined on this host into image data 9 50. In summary, the present invention provides a method for compressing data in advance using a real-time image compression processing method to reduce the amount of data. The present invention first divides the image data obtained after the pre-scanning into several lines, and each line is divided into several blocks of equal size and each block contains a plurality of pixel values. One pixel value in the block is completely stored in the buffer memory and becomes the first data. Usually this pixel value is the smallest pixel value. Next, find the difference between the first data and the number of pixel values in the block, and from this difference, take a difference that is not "0" and store it completely in the buffer memory. As the second data. Usually this is not a "0" difference is a minimum difference. By using the second piece of data as the divisor and the majority of the differences as the dividend, the ratio of the majority of the differences to the majority of the second piece of data can be obtained. When the multiple digits have more than a fixed number of first digits after the decimal point, round to the first digit before the decimal point and delete the digits after the decimal point, so that most of the ratios are integer types state. When most ratios are after the decimal point and the first digit of is less than a fixed value, the digits after the decimal point are deleted.

Page 19 556435 V. Description of the invention (14) The type in which most ratios are integers. Finally, the majority ratios are stored in the buffer memory as the majority of the third data to complete the compression of the majority pixel values of this block, and the next block is processed in the same way to truly reduce the amount of data and data. Number of transfers from the buffer memory to the host. The invention can also reduce the number of times the buffer memory is fully loaded and prolong the service life of the buffer memory. The invention can further accelerate the scanning speed, not only has practical effects, but also has a design that has not been seen before. It has an increase in efficacy and progress. Therefore, it has met the requirements of the patent law and applied for it in accordance with the law. For this reason, the review committee would scrutinize it in detail and pray for the grant of a patent as soon as possible. The above description is only a preferred embodiment of the present invention. This embodiment is only for illustration, not for limiting Patent application scope of invention. Changes can be made without departing from the scope of the invention, and such changes should still fall within the scope of the invention. Therefore, the scope of the present invention is defined by the following patent application scope.

Page 556435 The diagram briefly illustrates the above-mentioned objects and advantages of the present invention. The following embodiments and diagrams will be used to explain in detail as follows. Among them: The first diagram A shows how to select R, G and B scans in the conventional technology. For the unintentional position and the area of the scan seedlings, the first picture B is a schematic diagram of the corresponding R, G, and B data generated by each pixel; the second picture is the image obtained by completing the pre-scan The intention is not to divide the data into a number of blocks. The third figure is a schematic diagram of the arrangement of pixel data in each block; and the fourth figure is a flowchart of the real-time image compression processing method of the present invention. The main part of the symbol: 1 the first block 2 the second block 3 the third block 4 the fourth block 5 the fifth block 6 the sixth block 7 the seventh block

Page 21 556435 Schematic description 8 8th block 9 9th block 1 10th block 1 1 11th block 1 2 12th block R (X, y) red pixel image data -Pixel value G (X, y) Green pixel image data-Pixel value B (x, y) Blue pixel image data-Pixel value X column coordinate y row coordinate k block can hold Number of pixels m Number of block n Number of pixel values in block n

Page 22

Claims (1)

556435 VI. Application for Patent Scope 1. A method for real-time compression of an image data, including: segmenting the image data into a plurality of lines, any one of which includes a plurality of blocks and any of the blocks including a plurality of pixels ; Performing a line compression procedure for each of the lines, the line compression procedure includes ^ 'a block compression procedure for each of the blocks ^ the block compression procedure includes: storing a first piece of data in a memory , The first data is a pixel value of a pixel in a block after a first judgment procedure; and calculating a majority difference between the first data and a plurality of pixel values of the plurality of pixels Store a second piece of data in the memory, wherein the second piece of data is a difference among the plurality of differences through a second judgment procedure, and the difference is not "0"; Calculating the majority ratio between the majority difference and the second data, wherein the majority ratio is an integer after an adjustment procedure; and storing the majority ratio in the memory; and storing the majority area Block A plurality of third data; storing the plurality of fourth data lines of the most; and combinations of the data for the fourth image data. 2. If the method of compressing an image data in real time in item 1 of the scope of patent application, 556435 VI. Application for patent scope 9. The method for real-time compression of an image data as described in item 1 of the scope of patent application, wherein most of the above ratios are stored in the memory in a 6-bit mode. The method of image data includes: dividing the image data into a plurality of lines, wherein any one of the lines includes a plurality of blocks and any of the blocks includes a plurality of pixels; performing a one-line compression process on each of the lines, The line compression program includes: performing a block compression program for each of the blocks, the block compression program including: storing a first piece of data in a memory, the first piece of data being one of a block The minimum pixel value; calculating the majority difference between the first data and the majority pixel values of the plurality of pixels; storing a second data in the memory, wherein the second data is the One of the plurality of differences is the smallest difference, and the minimum difference is not "0"; the majority ratio of the plurality of differences to the second piece of data is calculated, after a decimal point of the majority ratio One first When the word reaches a set value or more, it automatically rounds to the first digit before the decimal point and deletes the majority digits after the decimal point. When the majority ratio is less than the first digit after the decimal point, When the setting value is Page 25