CN1435992A - Instantaneous picture compression processing method - Google Patents
Instantaneous picture compression processing method Download PDFInfo
- Publication number
- CN1435992A CN1435992A CN 02103365 CN02103365A CN1435992A CN 1435992 A CN1435992 A CN 1435992A CN 02103365 CN02103365 CN 02103365 CN 02103365 A CN02103365 A CN 02103365A CN 1435992 A CN1435992 A CN 1435992A
- Authority
- CN
- China
- Prior art keywords
- several
- data
- block
- view data
- store
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Landscapes
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
A processing method for instantaneous image compression includes dividing the image data obtained by prescanning into several equal blocks to make each block contains several pixel values, storing a pixel value in buffer to obtain the first data as minimal pixel value, finding several difference values between it and several pixel value, storing a non-zero difference value in buffer to obtain the second data as minimal difference value, respectively using the second data and several difference values as divider and devidends to obtain several ratio values, and storing the several ratio values in buffer to obtain the third data.
Description
(1) technical field
The method of the relevant a kind of image compression of the present invention, the particularly processing method of relevant a kind of instant image compression with the number of times of minimizing data volume and transfer of data, and are improved the speed that scans.
(2) background technology
To data consumer now, especially the pattern of computer data that the PC user contacts enters into the so-called multimedia epoch by comparatively dull type mode, and multimedia means that data comprise contents such as literal, image, sound, and for make data can with multimedia form be presented on spectators in face of, developed the multimedia device that multiple fechtable image or sound etc. now.Therefore because multi-medium data comprises more content, handle type mode that the capacity of the needed holder of multi-medium data need handle single silk fabric for high, so that multi-medium data presents with pattern more smoothly.
For image-input device, scanner and digital camera are to be present comparatively common device.Digital camera is to utilize digitized data to store the captured image that gets, and it utilizes the disk sheet or (the Personal Computer Memory Card InternationalAssociation of PC holder card international association of an image recordable; PCMCIA) store card, store still image.In order to save the employed storage area of Storage Media, the captured image of digital camera all is to store with archive file usually, and common have a still image compression standard (Joint Photographic Experts Group; JPEG) File Format.
And with regard to the kind that scanner uses, scanner can be divided into three kinds of hand held scanner and Flatbed scanner and paper feed type scanning devices usually.The definition of scanning is (the dot per inch that counts with per inch; Dpi) be unit, its quality of machine that dpi is high more is high more, but sweep time is also longer.When the scanning colour image, many scanners must separately scan RGB (RGB) three primary colors, so scanning motion is wanted triplicate, also feasible scanning institute's time spent lengthening.
Flatbed scanner is to be a kind of scanner commonly used, and it is in order to some files to be scanned, and converts numerical data as penetration file (as transparency) or reflective file (as photo or paper) etc. to by scanning program.Generally speaking, the used optoelectronic induction assembly of Flatbed scanner mainly comprises a photovoltaic sensing element, and this photovoltaic sensing element can be: charge coupled cell (charge coupled device; CCD) or contact image sensing element (contact image sensor; CIS).Flatbed scanner is to scan manuscript and convert numerical data to through scanning process and input in the PC in order to will be positioned over treating on the glass platform, for further utilization.
In the process that what scans, image to be scanned is that the light that light source is sent reflects or transmission, and this reverberation or transmitted light are received by the optoelectronic induction assembly.Hou, be connected to main frame through control circuit again, such as PC, and carry out image processing by PC.
Such as known, the three primary colors-redness (R) of light, blue (B) and green (G) can be obtained the various coloured light that have according to different ratio combinations.The various conversely speaking, combinations that have coloured light to can be considered R, G and B.Hereinafter, variously abbreviate red (R) data, green (G) data and indigo plant (B) data as with the R, the G that are comprised in the coloured light and the composition of B.
In the process that scans, the acquisition earlier of optoelectronic induction assembly waits to scan each pixel R data, G data and B data in the view data row, and produces corresponding analog signal.Again these analog signals are given analog and digital signal transducer (analog-digital converter), handle for next unit to produce numerical data.Then the acquisition of optoelectronic induction assembly waits to scan R data, G data and the B data in the image next column, does similarly action.In this process according to its scan, the difference of deal with data mode and can roughly be divided into two types: single channel scans (one-channel scanning) and three channels scan (three-channel scanning).
Shown in Figure 1A and Figure 1B, this two figure is that conventional art is being sent the schematic diagram of view data.First figure illustrates conventional art and how to select having scanned of R, G and B to make the position and scan the zone.In Figure 1A, each grid is all represented a kind of color data of waiting to scan a pixel on the zone, and the numeral in the block then represents this pixel in the position of waiting to scan on the zone.In specification of the present invention, (x represents that y) wherein x represents the row coordinate to view data one pixel value of pixel, and y then represents capable coordinate with symbol P.For example: P (2n-1,1) promptly represents the pixel value of first pixel in 2n-1 (n the is a natural number) row.
In conventional art, when scanning the 2n-1 row, it is all in first pixel of waiting to scan the zone that having scanned of R, G and B makes the position, and its to scan the zone be complete row.Just its resolution is complete.
And Figure 1B illustrates the situation that corresponding each pixel of what produces corresponding R, G and B data.In Figure 1B, and R (x, y), (x, y) (x y) is represent pixel value P (x, y) included color data respectively to G with B.If with 8 bits (bit) expression, then the data volume that each pixel produced is the 3*8=24 bit respectively for the R of each pixel, G and B data.
Can find out that by Figure 1A and Figure 1B conventional scanners during to PC, is that R, G and the B each pixel all sends out in the transmitted image data.And the data that will spread out of can be stored in earlier on the buffer on the scanner, receive one when scanning termination signal when buffer arrives going up in limited time of its storage or buffer, buffer will be sent to data stored in it on main frame and handle.In general, the shared holder space of pixel is sizable, therefore if unprocessedly just R, G and the B data of each pixel are stored on the buffer all, buffer will usually reach the upper limit of its data storing and its stored transfer of data in inside must be gone out.When data volume was big, the situation that buffer is fully loaded with was also more, and the number of times of transmission data also increases thereupon, and therefore the life-span of buffer will be slowed down and can be shortened to the speed that scans.
The bottleneck of the speed of traditional scanning means when often occurring in scanning apparatus data being transmitted toward main frame, causes data to reduce the speed that scans by batchwise transfer to main frame because of data volume is excessive.Therefore in order to accelerate scan speed, reducing toward the main frame data quantity transmitted will be effective and efficient manner.
(3) summary of the invention
In the above-mentioned background of invention of mirror what, traditional data transmission method will because of the excessive and feasible transmission of data quantity transmitted often, cause the reduction of scan speed, a purpose of the present invention provides a kind of processing method of instant image compression, be earlier with view data compression in advance, to reduce required data quantity transmitted.
Second purpose of the present invention is for providing a kind of processing method of instant image compression, with view data compression in advance, to reduce data are transferred to main frame by buffer number of times.
The 3rd purpose of the present invention is for providing a kind of instant image compress processing method, with view data compression in advance, with the speed of quickening to scan.
The 4th purpose of the present invention is for providing a kind of instant image compress processing method, with view data compression in advance, to reduce the fully loaded number of times of buffer.
A further object of the present invention is for providing a kind of instant image compress processing method, with view data compression in advance, to prolong the useful life of buffer.
For achieving the above object, the method for a kind of instant compression one view data that provides according to an aspect of the present invention is characterized in, comprising: cut apart this view data and be several lines, wherein arbitrary this line comprises several blocks and arbitrary this block comprises several pixels; Each bar line is carried out the line pressure program that contracts, this line pressure program that contracts comprises each this block is carried out a block condensing routine, this block condensing routine comprises: store in the first stroke data what one holder, these the first stroke data are to be a pixel value of the pixel in the block through one first determining program; Calculate several differences of several pixel values of these the first stroke data and these several pixels; Store in one second this holder of data what, wherein said second data are to be the difference in these several differences through one second determining program, and this difference is not " 0 "; Calculate several ratios of these several differences and these second data, wherein said these several ratios are to be integer through an adjustment program; Store in these several these holders of ratio what; Store several the 3rd data of these several blocks; Store several the 4th data of these several lines; And combination the 4th data are this view data.
The method of a kind of instant compression one view data that provides according to a further aspect of the invention is characterized in, comprising: cut apart this view data for several lines, wherein arbitrary line comprises several blocks and arbitrary this block comprises several pixels; Each bar line is carried out the line pressure program that contracts, this line pressure program that contracts comprises: each this block is carried out a block condensing routine, this block condensing routine comprises: store in the first stroke data what one holder, these the first stroke data are the minimum pixel value in the block; Calculate several differences of several pixel values of these the first stroke data and these several pixels; Store in one second this holder of data what, wherein said second data are the minimal difference in these several differences, and this minimal difference is not " 0 "; Calculate several ratios of these several differences and these second data, when one first bit digital of a decimal point Hou of these several ratios reaches a set point when above, then automatic carry to this decimal point one first bit digital and delete several numerals of this decimal point Hou, when these several during, then delete these several numerals of this decimal point Hou automatically than straight this set point of the little what of this first bit digital this decimal point Hou; Store in these several these holders of ratio what; Store several the 3rd data of these several blocks; Store several the 4th data of these several lines; And combination the 4th data are this view data.
Adopt such scheme, can reduce data volume really and reduce data are transferred to main frame by buffer number of times.The present invention also can reduce fully loaded number of times of buffer and the useful life that prolongs buffer storage.The speed that the present invention more can quicken to scan.
For further specifying purpose of the present invention, design feature and effect, the present invention is described in detail below with reference to accompanying drawing.
(4) description of drawings
The schematic diagram how Figure 1A selects having scanned of R, G and B to make the position and scan the zone for conventional art;
Figure 1B produces the schematic diagram of the situation of corresponding R, G and B data for corresponding each pixel of what;
Fig. 2 finishes the schematic diagram that the view data that is obtained is divided into several blocks for sweeping in advance;
Fig. 3 is the arrangement mode schematic diagram of each pixel data in each block; And
Fig. 4 is the flow chart of instant image Compression method of the present invention.
(5) embodiment
Some embodiments of the present invention are described in detail as follows.Yet except describing in detail, the present invention can also be widely implements with other execution modes, and scope of the present invention do not limit by it, and should be as the criterion with claim institute restricted portion.
The invention provides instant compressed image processing method number of compressed images and reduce data volume according to this.Instant compressed image processing method of the present invention at first earlier will through charge coupled cell sweep the view data of finishing and obtaining in advance and be divided into several lines.These several lines are that the line that charge coupled cell can scan is formed.Therefore because a plane normally is made of a lot of bar lines, in the process that scans, the charge coupled cell of scanner also is that the data that the file that will desire to scan is divided into many lines store, and Hou transfers to and line is combined into this file on the main frame again.The data of this line are generally a columns certificate.
Next each bar line is divided into several blocks, the size of each block all identical (with reference to shown in Figure 2).Usually the number of blocks that is comprised on each bar line all is made as fixed value, and still along with the difference of product demand, the number of blocks that is comprised on each bar line also can be adjusted to accelerate the speed of image processing with the difference of view data.All comprise several pixel values in each block.Usually the number of the pixel value that is comprised in each block is all identical, and still along with the difference of product demand, the pixel value number that is comprised in each block also can be adjusted with the difference of view data, to accelerate the speed of image processing.
With reference to shown in Figure 3, this is the arrangement mode of each pixel data in each block, but does not limit the scope of the invention.Wherein (x y) represents it to the view data-pixel value of pixel, and x represents the row coordinate, and y then represents capable coordinate with symbol P.For example: P (2n-1; 1) promptly represents the pixel value of first pixel in 2n-1 (n the is a natural number) row.R (x, y), (x, y) (x y) is represent pixel value P (x, y) included color data respectively to G with B.The difference of the size that sets along with block, the data array of each block also is not quite similar.The memory capacity of first block is set at holds k pixel value, and other blocks are also set to become and can be held k pixel value, then on the same line each pixel value of each block be numbered P (2n-1, (k (m-1)+r)), wherein m represents the numbering of block, and r represents the numbering of the pixel value in the block.
Finish view data for several blocks Hou when cutting apart, choose wherein a block immediately and handle.The size of several pixel values in this block at first relatively, and get a pixel value and it is stored in what buffer and become the first stroke data.Common this pixel value is the interior minimum pixel value of block for this reason.Next ask for these the first stroke data therewith several pixel values in the block several differences and by get in these several differences one for the difference of " 0 " as second data.Usually this is not the difference of the difference of " 0 " for minimum.Next complete being stored into of these second data cushioned in the temporary storage.
When obtain second data and with it complete be stored into the buffering temporary storage in Hou, with these second data as divisor, and several differences can be obtained several differences several ratios of second data therewith as dividend, respectively these several ratios are stored in the buffer and become the compression process that several the 3rd data are promptly finished this block, next utilize same compression process to handle next block.Each block on view data all utilizes method of the present invention compression to finish Hou promptly to finish instant image compression process of the present invention.Several the 3rd data are promptly represented each pixel value in this block, therefore utilize method of the present invention can fully compress each pixel value to increase the operational paradigm of scanner.Common every the 3rd data all are stored in the buffer with the holder pattern of six bits, but along with the demand of product or the difference of view data, the holder pattern that is adopted is also inequality.
Because second data are one for the numeral of " 0 ", therefore utilize second data to ask for as divisor in the process of several ratios, can not produce infinitely-great ratio.When calculating several ratios, several differences and second data might not present the multiple relation of an integer, so are calculating several ratio Hou, and several ratios of part still contain decimal.In order to make several ratios all present integer, renew process into the buffering temporary storage in order to Hou.Can preestablish a set point to do differentiation.When part contains several ratios of decimal, first bit digital of its decimal point Hou reaches this set point when above, first bit digital of automatic carry to the decimal point then, and the numeral of decimal point Hou deleted.When several ratios that partly contain decimal, during this set point of the little what of first bit digital of its decimal point Hou, then automatically the numeral of decimal point Hou is deleted.Usually this set point is " 5 ".
Fully loaded or view data has been compressed and has finished Hou when buffer, and buffer is about to the combination that its inner stored transfer of data is carried out view data to the main frame, to finish the process that scans.Use instant image Compression method of the present invention can make buffer can store the data of more pixel, treat that it stores fully loaded or view data has all stored Hou, its inner stored transfer of data is carried out step of reducing to main frame.Therefore the fully loaded number of times of buffer will reduce, and transfer of data to the number of times of main frame also will reduce the useful life that can prolong buffer, and the processing speed of increase scanner.
The following stated is an embodiment of instant compressed image processing method, but it does not limit the scope of the invention.At first cutting apart a view data is article one line, second line and the 3rd line.Article one, line comprises first block, second block and the 3rd block.The second line comprises the 4th block, the 5th block and the 6th block.Article three, line comprises SECTOR-SEVEN piece, Section Eight piece and the 9th block.Each block big or small identical, and all comprise six different pixel values of six pixels.The data that at first obtain in first block compare, and wherein said first block comprises first pixel, second pixel, the 3rd pixel, the 4th pixel, the 5th pixel and the 6th pixel.Adjacent what second pixel of first pixel.Adjacent what first pixel of second pixel value and the 3rd pixel and between first pixel and the 3rd pixel.Adjacent what second pixel of the 3rd pixel value and the 4th pixel and between second pixel and the 4th pixel.Adjacent what the 3rd pixel of the 4th pixel and the 5th pixel and between the 3rd pixel and the 5th pixel.Adjacent what the 4th pixel of the 5th pixel and the 6th pixel and between the 4th pixel and the 6th pixel.Adjacent what the 5th pixel of the 6th pixel.In second pixel value is first block during minimum pixel value, then with in the complete storage what of second pixel value buffer as the first stroke data.Next the 6th difference of the first stroke data and the 6th pixel value is minimum and be not the difference of " 0 " to obtain one therewith to ask for the 5th difference of the 4th difference, these the first stroke data and the 5th pixel value of the 3rd difference, these the first stroke data and the 4th pixel value of second difference, these the first stroke data and the 3rd pixel value of first difference, these the first stroke data and the 3rd pixel value of these the first stroke data and first pixel value.Though second difference is minimum difference, because " 0 " therefore can not be selected to cooperate the continuous step of Hou.When judging that the 3rd difference be minimum and is not difference Hou of " 0 ", with in the complete storage what of the 3rd difference buffer as second data.Next be divisor with second data, each difference is a dividend with the 5th ratio of the 4th ratio, the 5th difference and second data of the 3rd ratio, the 4th difference and second data of second ratio, the 3rd difference and second data of first ratio, second difference and second data of asking for first difference and second data and the 6th ratio of the 6th difference and second data.When each ratio has decimal, judge whether each ratio reaches more than the set point in first bit digital of decimal point Hou.When each ratio reaches set point when above in first bit digital of decimal point Hou, then automatic carry to the decimal point first bit digital and delete the numeral of decimal point Hou so that each ratio is integer.When each ratio during, then delete the numeral of decimal point Hou automatically, so that each ratio is integer in the little what set point of first bit digital of decimal point Hou.Store in this first ratio, second ratio, the 3rd ratio, the 4th ratio, the 5th ratio and the 6th ratio what buffer, to finish the compression of first block.Next compress the pixel of second block, the 3rd block, the 4th block, the 5th block, the 6th block, SECTOR-SEVEN piece, Section Eight piece and the 9th block in the same way.On data to a main frame in the Hou transmit buffering holder, and these data of combination are view data on this main frame.
Fig. 4 is the flow chart of instant image Compression method of the present invention.At first the pre-inswept Hou acquired image data of scanner is divided into several lines, each bar line such as all comprises at the block of size, and all comprises several pixels 100 in each block.Several pixels of getting in wherein the block compare, and select in several pixels a pixel value to deposit in the buffer 200 in as the first stroke data thus.Usually this pixel value is minimum pixel value.Ask for the first stroke data several differences of several pixels in the block therewith, and select in several differences one not deposit in the buffer 300 in as second data thus for the difference of " 0 ".Usually this is not the difference of the difference of " 0 " for minimum.Calculate several ratios 400 of several differences and second data.Judge whether these several ratios reach more than the set point 500 in first bit digital of decimal point Hou.When these several ratios reach set point when above in first bit digital of decimal point Hou, then automatic carry to the decimal point first bit digital and delete the numeral of decimal point Hou so that these several ratios are integer 600.When each ratio during, then delete the numeral of decimal point Hou automatically, so that these several ratios are integer 700 in the little what set point of first bit digital of decimal point Hou.Next each ratio is deposited in the compression 800 to finish this block in the buffer.Next profit is handled next block 900 in the same way.When each block Hou is finished in compression, on data to a main frame in the Hou transmit buffering holder, and these data of combination are view data 950 on this main frame.
Comprehensively described, the invention provides a kind of method, utilize instant image compress processing method to be about to data compression earlier, to reduce data volume.The present invention at first will sweep in advance and finish the view data that is obtained and be divided into several lines, and every line is divided in the block of several sizes such as grade and each block and comprises several pixel values.With in the complete storage what of the pixel value buffer in the block and become the first stroke data.Usually this pixel value is minimum pixel value.Next ask for the first stroke data several differences of several pixel values in the block therewith, and thus in several differences, get one interior as second data for the complete storage what of the difference buffer of " 0 ".Usually this is not the difference of a minimum for the difference of " 0 ".Utilize second data as divisor, and with several differences as dividend, can obtain several ratios of several differences and second data.When several ratios reach a fixed value when above in first bit digital of decimal point Hou, then carry to the decimal point first bit digital and delete the numeral of decimal point Hou so that several ratios are the kenel of integer.When several ratios during, then delete the numeral of decimal point Hou so that several ratio is the kenel of integer in little what one fixed value of first bit digital of decimal point Hou.Hou stores in what buffers several ratios as the compression of several the 3rd data with several pixel values of finishing this block, and handle next block in the same way, with certain minimizing data volume and reduce data are transferred to main frame by buffer number of times.The present invention also can reduce fully loaded number of times of buffer and the useful life that prolongs buffer storage.The speed that the present invention more can quicken to scan, thereby have practical effect.
Certainly, those of ordinary skill in the art will be appreciated that, above embodiment is used for illustrating the present invention, and be not to be used as limitation of the invention, as long as in connotation scope of the present invention, all will drop in the scope of claims of the present invention variation, the modification of the above embodiment.
Claims (13)
1. the method for instant compression one view data is characterized in that, comprising:
Cut apart this view data and be several lines, wherein arbitrary this line comprises several blocks and arbitrary this block comprises several pixels;
Each bar line is carried out the line pressure program that contracts, and this line pressure program that contracts comprises each this block is carried out a block condensing routine, and this block condensing routine comprises:
Store in the first stroke data what one holder, these the first stroke data are to be a pixel value of the pixel in the block through one first determining program;
Calculate several differences of several pixel values of these the first stroke data and these several pixels;
Store in one second this holder of data what, wherein said second data are to be the difference in these several differences through one second determining program, and this difference is not " 0 ";
Calculate several ratios of these several differences and these second data, wherein said these several ratios are to be integer through an adjustment program;
Store in these several these holders of ratio what;
Store several the 3rd data of these several blocks;
Store several the 4th data of these several lines; And combination the 4th data are this view data.
2. the method for instant compression one view data as claimed in claim 1 is characterized in that described pixel value is the minimum pixel value in these several pixel values.
3. the method for instant compression one view data as claimed in claim 1 is characterized in that, described holder is a buffer.
4. the method for instant compression one view data as claimed in claim 1 is characterized in that, described first determining program is for judging the size of these several pixel values.
5. the method for instant compression one view data as claimed in claim 1 is characterized in that, described difference is the difference of the minimum in these several differences.
6. the method for instant compression one view data as claimed in claim 1 is characterized in that, described second determining program is for judging the size of these several differences.
7. the method for instant compression one view data as claimed in claim 1 is characterized in that, described adjustment program is:
When one first bit digital of a decimal point Hou of these several ratios reaches a set point when above, then automatic carry to this decimal point one first bit digital and delete several numerals of this decimal point Hou; And
When these several ratios this set point of the little what of this first bit digital, then delete these several numerals of this decimal point Hou automatically this decimal point Hou.
8. the method for instant compression one view data as claimed in claim 7 is characterized in that, described set point is 5.
9. the method for instant compression one view data as claimed in claim 1 is characterized in that, described several ratios store in this holder of what with the pattern of 6 bits.
10. the method for instant compression one view data is characterized in that, comprising:
Cut apart this view data for several lines, wherein arbitrary line comprises several blocks and arbitrary this block comprises several pixels;
Each bar line is carried out the line pressure program that contracts, and this line pressure program that contracts comprises:
Each this block is carried out a block condensing routine, and this block condensing routine comprises:
Store in the first stroke data what one holder, these the first stroke data are the minimum pixel value in the block;
Calculate several differences of several pixel values of these the first stroke data and these several pixels;
Store in one second this holder of data what, wherein said second data are the minimal difference in these several differences, and this minimal difference is not " 0 ";
Calculate several ratios of these several differences and these second data, when one first bit digital of a decimal point Hou of these several ratios reaches a set point when above, then automatic carry to this decimal point one first bit digital and delete several numerals of this decimal point Hou, when these several during, then delete these several numerals of this decimal point Hou automatically than straight this set point of the little what of this first bit digital this decimal point Hou;
Store in these several these holders of ratio what;
Store several the 3rd data of these several blocks;
Store several the 4th data of these several lines; And
Making up the 4th data is this view data.
11. the method for instant compression one view data as claimed in claim 10 is characterized in that, described holder is a buffer.
12. the method for instant compression one view data as claimed in claim 10 is characterized in that, described set point is 5.
13. the method for instant compression one view data as claimed in claim 10 is characterized in that, described several ratios store in this holder of what with the pattern of 6 bits.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 02103365 CN1435992A (en) | 2002-01-28 | 2002-01-28 | Instantaneous picture compression processing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 02103365 CN1435992A (en) | 2002-01-28 | 2002-01-28 | Instantaneous picture compression processing method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN1435992A true CN1435992A (en) | 2003-08-13 |
Family
ID=27627797
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 02103365 Pending CN1435992A (en) | 2002-01-28 | 2002-01-28 | Instantaneous picture compression processing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1435992A (en) |
-
2002
- 2002-01-28 CN CN 02103365 patent/CN1435992A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7349129B2 (en) | Controller for photosensor array with multiple different sensor areas | |
| GB2330972A (en) | Multiple image scanner | |
| AU595279B2 (en) | Thresholding algorithm selection apparatus | |
| CN1581924A (en) | Image processing apparatus,image forming apparatus and image processing method | |
| EP1608147A1 (en) | Image processing device and image processing method for performing conversion of color image data | |
| US5856832A (en) | System and method for parsing multiple sets of data | |
| US20030020940A1 (en) | Image reading apparatus | |
| EP0853419A2 (en) | Method and apparatus for obtaining multiple views from one scan window | |
| CN1435992A (en) | Instantaneous picture compression processing method | |
| US6307651B1 (en) | Image processing apparatus and method | |
| JPS63296125A (en) | Coordinate input device | |
| US8233195B2 (en) | Method for reducing image noise | |
| CN1464744A (en) | Method for automatic discriminating scanning compression ratio of scanner | |
| US20080297854A1 (en) | Reader Apparatus | |
| CN1447283A (en) | Method for compressing image by using color classification | |
| US7369283B2 (en) | Color image reading apparatus and color image reading method for eliminating or reducing moire | |
| CN101729729A (en) | Document reading apparatus | |
| CN101272433A (en) | Image processing apparatus, image processing method, and computer program product | |
| CN1604614A (en) | Image processing apparatus | |
| CN1251139C (en) | Multiple-pattern image processing method and system thereof | |
| TW556435B (en) | Method for comprising an image in real time | |
| CN1178124C (en) | Image data compressing circuit and compressing and decompressing method | |
| CN100338934C (en) | Dual-functional optical sensing element | |
| US6005688A (en) | Batch scanning method for an image input system | |
| CN100574356C (en) | Image pickup method and the image pick-up of using this method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |