Source: http://www.google.es/patents/US5493420?dq=flatulence
Timestamp: 2013-05-23 09:18:53
Document Index: 174395297

Matched Legal Cases: ['art.\n18', 'art 594', 'art 596', 'art 553', 'art 553', 'art 594']

Patente US5493420 - Dot density conversion method and system - Google PatentesB�squeda Im�genes Maps Play YouTube Noticias Gmail Drive M�s » B�squeda avanzada de patentes | Historial web | Iniciar sesi�n B�squeda avanzada de patentesPatentesWhen dot density conversion processing of page data is effected by managing the position, size and data kind of each area for the page data including the portions which are formed as the data of different areas for at least two kinds of data of a plurality of data kinds each having at least one kind...http://www.google.es/patents/US5493420?utm_source=gb-gplus-sharePatente US5493420 - Dot density conversion method and system N�mero de publicaci�nUS5493420 ATipo de publicaci�nConcesi�n N�mero de solicitud07/479,299 Fecha de publicaci�n20 Feb 1996 Fecha de presentaci�n13 Feb 1990 Fecha de prioridad20 Feb 1989 InventoresTadashi KuwabaraHideki KuwamotoKeiichi NakaneShigeyuki TaguchiHitoshi Tamura Cesionario originalHitachi, Ltd.Hitachi Printing Solutions, Ltd.Hitachi Home & Life Solutions, Inc. Clasificaci�n de EE.UU.358/462382/298358/451 Clasificaci�n internacionalG06T3/40H04N1/40G09G5/26 Clasificaci�n cooperativaH04N1/40068G06T3/4023H04N1/40075 Clasificaci�n europeaG06T 3/40DH04N 1/40NH04N 1/40MReferenciasCitas de patentes (15) Citada por (3)Enlaces externosUSPTO Cesi�n de USPTO EspacenetDot density conversion method and systemUS 5493420 A Resumen When dot density conversion processing of page data is effected by managing the position, size and data kind of each area for the page data including the portions which are formed as the data of different areas for at least two kinds of data of a plurality of data kinds each having at least one kind such as text data, graphic data, image data, and so forth, dot conversion means disposed for each area in such a manner as to correspond to each data kind is selected and conversion is made so that the result of conversion is drawn at a predetermined output position of each area.
What is claimed is: 1. A dot density conversion method comprising the steps of: (a) obtaining a string of three binary pixels from part of at least one of (i) text data, (ii) a bi-level photographic image, and (iii) a graphic, said string of three binary pixels comprising a number of "1" pixels which must be maintained as "1" pixels, said number being less than three; and (b) converting the obtained string of three binary pixels into four binary pixels by inserting a fourth binary pixel, comprising: (i) supplying an inverted value of a first one of said three binary pixels to a first input of a NAND logic, (ii) defining a value of a first one of said four binary pixels as the value of said first one of said three binary pixels; (iii) supplying a second one of said three binary pixels to a first input of a first AND logic, to a second input of said NAND logic, and to a first input of a second AND logic; (iv) supplying a third one of said three binary pixels to a second input of said second AND logic, to a third input of said NAND logic; (v) supplying an output of said NAND gate to a second input of said first AND logic; (vi) defining the value of a second one of said four binary pixels as the output of said first AND logic; (vii) defining the value of a third one of said four binary pixels as the value of said third one of said three binary pixels; and (viii) defining the value of said fourth binary pixel inserted between said second one of said four binary pixels and said third one of said four binary pixels, as the output of said second AND logic.
2. A dot density conversion apparatus comprising: (a) means for obtaining a string of three binary pixels from part of at least one of (i) text data, (ii) a bi-level photographic image, and (iii) a graphic, said string of three binary pixels comprising a number of "1" pixels which must be maintained as "1" pixels, said number being less than three; (b) means for selecting one of (i) a first conversion means for converting said string of three binary pixels into four binary pixels by inserting a pixel and (ii) a second conversion means for converting said string of three binary pixels into two binary pixels by skipping one of said three binary pixels; (c) said first conversion means comprising means for defining a first one of said three binary pixels as the value of said first one of said four binary pixels and a third one of said three binary pixels as the value of said third one of said four binary pixels, a NAND logic (i) receiving an inverted value of said first one of said three binary pixels at a first input, (ii) receiving a second one of said three binary pixels at a second input of said NAND logic, and (iii) receiving said third one of said three binary pixels at a third input of said NAND logic, a first AND logic (i) receiving said second one of said three binary pixels at a first input, (ii) receiving an output of said NAND logic at a second input, and (iii) outputting an output of said first AND logic as the value of a second pixel of said four binary pixels, and a second AND logic (i) receiving said second one of said three binary pixels at a first input, (ii) receiving a third one of said three binary pixels at a second input, and (iii) outputting an output of said second AND logic as the value of the pixel inserted between said second one of said four binary pixels and said third one of said four binary pixels; (d) said second conversion means comprising an AND logic (i) receiving a first one of said three binary pixels at a first input of said AND logic, and (ii) receiving a second one of said three binary pixels at a second input, a first OR logic (i) receiving said first one of said three binary pixels at a first input, and (ii) receiving said second one of said three binary pixels at a second input, an output of said first OR logic defining the value of a first one of said two binary pixels and a second OR logic (i) receiving an output of said AND logic at a first input of said OR logic, and (ii) receiving a third one of said three binary pixels at a second input, an output of said second OR logic defining a value of a second one of said two binary pixels.
3. A dot density conversion apparatus comprising: (a) means for converting a string of three binary pixels from part of at least one of (i) text data, (ii) a bi-level photographic image, and (iii) a graphic, to four binary pixels, said string of three binary pixels comprising a number of "1" pixels which are to be maintained as "1" pixels, said number being less than three; (b) a NAND logic (i) receiving an inverted value of a first one of said three binary pixels at a first input, (ii) receiving a second one of said three binary pixels at a second input of said NAND logic, and (iii) receiving a third one of said three binary pixels at a third input of said NAND logic; (c) a first AND logic (i) receiving said first one of said three binary pixels at a first input, (ii) receiving an output of said NAND logic at a second input, and (iii) outputting an output of said first AND logic as the value of a second one of said four binary pixels; (d) a second AND logic (i) receiving said second one of said three binary pixels at a first input, (ii) receiving a third one of said three binary pixels at a second input, and (iii) outputting an output of said second AND logic as a value of a fourth pixel inserted into said string of three binary pixels; (e) means for defining the value of a first one of said four binary pixels as the value of said first one of said three binary pixels; and (f) means for defining the value of a third one of said four binary pixels as the value of said third one of said four binary pixels.
4. A dot density conversion method comprising the steps of: (a) obtaining a string of three binary pixels from part of at least one of (i) text data, (ii) a bi-level photographic image, and (iii) a graphic, said string of three binary pixels comprising a number of "1" pixels which must be maintained as "1" pixels, said number being less than three; and (b) converting the obtained string of three binary pixels into two binary pixels by skipping one of said three binary pixels, comprising: (i) supplying a first one of said three binary pixels to a first input of an AND logic, (ii) supplying a second one of said three binary pixels to a second input of said AND logic, (iii) supplying said first one of said three binary pixels to a first input of a first OR logic, (iv) supplying said second one of said three binary pixels to a second input of said first OR logic, (iv) defining the value of a first one of said two binary pixels as the value of the output of said first OR logic, (vi) supplying said output of said AND logic to a first input of a second OR logic, (vii) supplying a third one of said three binary pixels to a second input of said second OR logic, and (viii) defining the value of a second one of said two binary pixels as the value of the output of said second OR logic.
5. A dot density conversion apparatus comprising: (a) means for converting a string of three binary pixels from part of at least one of (i) text data, (ii) a bi-level photographic image, and (iii) a graphic, into two binary pixels, said string of three binary pixels comprising a number of "1" pixels which must be maintained as "1" pixels, said number being less than three; (b) an AND logic (i) receiving a first one of said three binary pixels at a first input and (ii) receiving a second one of said three binary pixels at a second input; (c) a first OR logic (i) receiving said first one of said three binary pixels at a first input, and (ii) receiving said second one of said three binary pixels at a second input, an output of said first OR logic defining the value of a first one of said two binary pixels; and (d) a second OR logic (i) receiving an output of said AND logic at a first input, and (ii) receiving a third one of said three binary pixels at a second input, an output of said second OR logic defining the value of a second one of said two binary pixels.
6. A dot density conversion method comprising the steps of: (a) obtaining a string of three binary pixels from part of at least one of (i) text data, (ii) a bi-level photographic image, and (iii) a graphic, said string of three binary pixels comprising a number of "1" pixels which are to be maintained as "1" pixels, said number being less than three; (b) selecting one of (i) a first conversion method for converting said string of three binary pixels into four binary pixels by inserting a pixel and (ii) a second conversion method for converting said string of pixels into two binary pixels by skipping one of said three binary pixels; (c) if said first conversion method is selected, then performing the steps of (i) supplying an inverted value of a first one of said three binary pixels to a first input of a NAND logic, (ii) Supplying a second one of said three binary pixels to a second input of said NAND logic, (iii) supplying a third one of said three binary pixels to a third input of said NAND logic, (iv) supplying said second one of said three binary pixels to a first input of a first AND logic, (v) supplying an output of said NAND logic to a second input of said first AND logic, an output of said first AND logic defining the value of a second one of said four binary pixels, (vi) supplying said second one of said three binary pixels to a first input of a second AND logic, and (vii) supplying a third one of said three binary pixels to a second input of said second AND logic, the output of said second AND logic defining the value of said fourth pixel inserted into said three binary pixels, (viii) defining the value of a first one of said four binary pixels as the value of said first one of said three binary pixels, and (ix) defining the value of a third one of said four binary pixels as the value of said third one of said three binary pixels; and (d) if said second conversion method is selected, then performing the steps of (i) supplying a first one of said three binary pixels to a first input of an AND logic, (ii) supplying a second one of said three binary pixels to a second input of said AND logic, (iii) supplying said first one of said three binary pixels to a first input of a first OR logic, (iv) supplying said second one of said three binary pixels to a second input of said first OR logic, (v) defining the value of a first one of said two binary pixels as the value of an output of said first OR logic, (vi) supplying said output of said AND logic to a first input of a second OR logic, (vii) supplying a third one of said three binary pixels to a second input of said second OR logic, and (viii) defining the value of a second one of said two binary pixels as the value of the output of said second OR logic.
7. A dot density conversion method according to claim 6 wherein said string of three binary pixels is obtained from said graphic, said graphic comprising data of line graphics.
10. A dot density conversion method according to claim 6, further comprising steps of: obtaining data of different areas on a memory means, each of said areas corresponding to one of a plurality of data kinds, one of which is text; and selecting the text area from among said different areas for that dot density conversion.
11. A dot density conversion method according to claim 10, further comprising a step of: drawing the data of each of said areas convened by said converting step to a predetermined position.
12. A dot density conversion method according to claim 10, wherein said data kinds further include a graphic.
15. A dot density conversion method according to claim 6, wherein the string of three binary pixels is obtained from a document, said document including a number of pages, each of said number of pages including at least one area, said at least one area having one of a plurality of data kinds including text data said dot density conversion method further comprising steps of: inputting a first or a second type of conversion method via a means for data input; reading out data corresponding to said data kinds of each of said number of pages; when the conversion method inputted is of a first type, processing said dot density conversion uniformly on whole pages; and when the conversion method inputted is of a second type, processing said dot density conversion for each page based on the reading step.
16. The method of claim 15 wherein said data kinds include text data, image data, and graphic data.
17. The method of claim 16 wherein said text data includes control data and character point data, wherein said graphic data includes a sequence of drawing commands, and wherein said image data includes an attribute part and a data part.
18. The method of claim 17 wherein the read out data includes data kind of said at least one area, position of said at least one area, length in an X direction of said at least one area, length in a Y direction of said at least one area, capacity of said at least one area, and storage location of said at least one area.
19. The method of claim 18 wherein when said data kind of said at least one area is text, the processing of the second type conversion method includes sub-steps of: retrieving said storage location and said capacity of said at least one area; reading out area data of said at least one area; converting said position of said at least one area; and drawing character fonts onto said image memory.
20. The method of claim 18 wherein when said data kind of said at least one area is graphic, the processing of the second type conversion method includes sub-steps of: retrieving said storage location and said capacity of said at least one area; reading out area data of said at least one area; converting said position of said at least one area; reading out said sequence of drawing commands; converting values in each of said sequence of drawing commands; and drawing an image based on said convened values onto said image memory.
21. The method of claim 18 wherein when said data kind of said at least one area is image, the processing of the second type conversion method sub-steps of: retrieving said storage location and said capacity of said at least one area; reading out area data of said at least one area; converting said position of said at least one area; determining the image kind; and performing a first image process or a second image process based on said determination of image kind.
22. The method of claim 21 wherein said first image process includes a step of: drawing image based on said insert or skip processing onto an image memory.
23. The method of claim 21 wherein said second image process includes steps of: determining whether a change in dot density exists; converting image data when a change in dot density has been determined; drawing image data onto an image memory, wherein said step of convening image data includes sub-steps of convening to a grey scale image data and selecting a dither matrix.
FIG. 13 shows the structure of the area data of the area whose kind is the image (hereinafter referred to as the "image area data"). The image area data 590 consists of an image attribute part 594 describing an image kind 591, a vertical length 592 and a horizontal length 593 by the number of bytes, and a data part 596 consisting of the aggregate of pixel data 595 expressing one pixel 596 by one bit 597. A bit having a binary value "1" represents a black pixel and "0" represents a white pixel. The image data 595 of one byte represents the value of eight pixels which are continuous in the horizontal direction and corresponds to the image area 598 as shown in the drawing. Whether or not a bi-level graphic image is described in the image kind 591 is determined. If the image kind is a bi-level graphic image, it is expressed by a dither matrix of 4 of the bi-level graphic image.
Next, in FIG. 2(a), the text data dot density conversion processing 106 will be explained. First, the storage location 532 and the capacity 531 of the area data 525 are acquired (121) from the area management table 524 and the area data 525 is read out from the area data read-out processing 122. The area position 528 described on the area management table 524 is converted (123) to the position 127 of the pixel on the image memory 4 as shown in FIG. 2(b). If the area position 528 described on the area management table 524 is (Xs, Ys) and the dot density per unit length designated in the input processing 101 shown in FIG. 1 is b, the area position 127 expressed by the pixel number on the image memory 4 is (b text area data 550 is drawn on the image memory 4 (124) by use of the corresponding character font 126. If the font having the same size as the character font size 556 described in the attribute part 553 (FIG. 11) of the text area data 550 is prepared in advance, this character font 126 is as such drawn on the image memory 4. If the font of the character font size 556 is not prepared, the character size 126 which is prepared is either enlarged or diminished and is then drawn on the image memory 4. The position of the image memory 4 on which the character font 126 is drawn is determined by the line gaps 551 and character intervals 552 that are described in the attribute part 553 of the text area data 550. A well known method using pixel-matrix is used to enlarge or diminish the character font 126.
Next, in FIG. 3(a), the graphic data dot density conversion processing 107 will be explained. First, the storage location 532 of the area data 525 and its capacity 531 are acquired (161) from the area management table 524 and the graphic area data 525 is read out by the area data read-out processing 162. As shown in FIG. 12, the graphic area data 570 consists of the aggregate of drawing commands 571. The area position 528 described on the area management table 524 is converted to the position 171 of the pixel (163) on the image memory 4 in the same way as in the text data dot density conversion processing 106 (see FIG. 3b). Next, each drawing command 571 is read out sequentially (164), parameters 168-170 of the drawing command 571 are calculated (165) in such a manner as to correspond to the dot density designated by the input processing 101 and the drawing command is drawn as the pixels on the image memory 4 (166). In the case of the line drawing command shown in FIG. 3(b), for example, if the drawing start point 168 is (Xa, Ya), the drawing end point 169 is (Xb, Yb), the line width 170 is t, the area position 528 is (Xs, Ys) and the designated dot density per unit length is b, then, the positions of the pixels 171-173 on the corresponding image memory 4 are (b for the area position 171, (b for the drawing start position 172, (b b the line width.
Next, the image data dot density conversion processing 108 will be explained referring to FIGS. 4(a), 4(b), 5(a) and 5(b). In FIG. 4(a), first, the storage location 532 of the area data 525 and its capacity 531 are acquired (190) from the area management table 524 and the area data 525 is read out by the area data read-out processing 191. If the area position 532 is (Xs, Ys) and the dot density per unit length designated in the input processing 101 shown in FIG. 1 is b, the area position represented by the pixel number becomes (b
Next, the image kind 591 described in the attribute part 594 of the image area data 590 (FIG. 13) is judged (193) and the corresponding dot density conversion processing is conducted. First, the case where the image kind 591 is the bi-level photographic image will be explained referring to FIG. 4. The pixel data 595 described in the image area data 590 are assumed to be outputted at the dot density a. If a and b are equal when the dot density designated by the input processing 101 is b (202), the image area data 598 is as such drawn on the image memory 4 (196). If a and b are not equal to each other (202), the image area data 598 is first divided into small areas 199 of 4 black pixels in each small area is counted and is used as the tone wedge value 200 in that small area (194). Next, this tone wedge value 200 is expressed by use of the dither matrix 201 of (4
Next, the case where the image kind 591 is not the bi-level photographic image will be explained with reference to FIG. 5(a) and 5(b). Although the case where the pixels are inserted or skipped with predetermined intervals in the horizontal direction will be described, this process is the same for the vertical direction. The image data 595 of the image area data 590 shown in FIG. 13 is assumed to be with the dot density a and the dot density designated by the input processing is b. Then, if a&gt;b, one pixel is skipped for pixels a/(a-b). If b&gt;a, one pixel is inserted for pixels a/(b-a). If dot density conversion is made by skipping the pixels, the value of the pixel 211 next to the right of the pixel 210 to be skipped is determined by calculating its logical OR with the pixel 210 to be skipped as shown in FIG. 5(a) to minimize any loss of the information of the pixel 210 to be skipped. When dot density conversion is made by inserting the pixels, the value of the pixel 215 to be inserted uses the value of the pixel 212 next to the left of the insertion position as shown in FIG. 5(b). Insertion or skipping of the pixel is carried out in the manner described above (197) and the data is drawn from the area position on the image memory (198).
Next, the page dot density conversion processing 109 will be explained referring to FIGS. 6 and 7. First, the storage location 532 of the area data 525 and its capacity 531 are acquired for each area from the area management table 524 and the area data 525 are read out (210), and then drawn on the image memory 4 without applying dot density conversion (211). Next, the image data drawn on the image memory 4 is assumed to be outputted with the dot density a. If the dot density designated by the input processing 101 shown in FIG. 1 is b, one pixel is skipped for the pixels a/(a-b) if a&gt;b, and one pixel is inserted for the pixels a/(a-b) if b&gt;a (212). The character font prepared for the word processor of this embodiment has one pixel (i.e. a "1" pixel) for the line width of the line in the standard horizontal direction and two pixels (i.e. two 1 pixels) for the line width of the line in the standard vertical direction, and the character drawn as the pixel data in 211 on the image memory 4 has such line widths. Accordingly, when dot density conversion is made by skipping the pixel, conversion is made so that the line in the horizontal direction does not disappear and the line in the vertical direction having the line width of up to two pixels keeps its line width. When dot density conversion is made by inserting the pixel, conversion is made so that the line in the horizontal direction having the line width of one pixel keeps its line width and the line in the vertical direction having the line width of up to two pixels keeps its line width. Hereinafter, the case where the pixels are skipped with a predetermined interval will be first explained and then the case where the pixels are inserted with a predetermined interval will then be explained.
Citas de patentes Patente citada Fecha de presentaci�n Fecha de publicaci�n Solicitante T�tuloUS439469315 Dic 198019 Jul 1983International Business Machines CorporationSystem and method for generating enlarged or reduced imagesUS45551915 Nov 198426 Nov 1985Ricoh Company, Ltd.Method of reducing character fontUS469275722 Dic 19838 Sep 1987Hitachi, Ltd.Multimedia display systemUS469435213 Sep 198515 Sep 1987Canon Kabushiki KaishaImage information processing systemUS474844316 Ago 198531 May 1988Hitachi, Ltd.Method and apparatus for generating data for a skeleton pattern of a character and/or a painted pattern of the characterUS47604635 Dic 198626 Jul 1988Kabushiki Kaisha ToshibaImage scanner apparatus with scanning functionUS483763522 Ene 19886 Jun 1989Hewlett-Packard CompanyA scanning system in which a portion of a preview scan image of a picture displaced on a screen is selected and a corresponding portion of the picture is scanned in a final scanUS488106915 Dic 198714 Nov 1989Kabushiki Kaisha ToshibaFont compression method and apparatusUS489325827 Ene 19889 Ene 1990Kabushiki Kaisha ToshibaData processing apparatus having enlargement/reduction functions capable of setting different magnification in different directionsUS49031454 Ago 198720 Feb 1990Canon Kabushiki KaishaImage quality control apparatus capable of density-correcting plural areas of different typesUS490717127 Mar 19876 Mar 1990Kabushiki Kaisha ToshibaImage size converterUS493002120 Mar 198929 May 1990Fujitsu LimitedProcess and apparatus for reducing a picture with fine line disappearance preventionUS49376776 Jun 198926 Jun 1990Oce-Nederland B.V.Method of enlarging/reducing dithered imagesUS494247913 Abr 198917 Jul 1990Kabushiki Kaisha ToshibaImage information processing apparatusJP63054867A T�tulo no disponible Citada por Patente citante Fecha de presentaci�n Fecha de publicaci�n Solicitante T�tuloUS57085127 Jun 199513 Ene 1998Canon Kabushiki KaishaFacsimile apparatus and recording method thereinUS575735514 Abr 199726 May 1998International Business Machines CorporationDisplay of enlarged images as a sequence of different image frames which are averaged by eye persistenceUS66619217 Abr 19999 Dic 2003Canon Kabushiki KaishaImage process apparatus, image process method and storage mediumGirarImagen originalP�gina principal de Google - Sitemap - Descargas masivas de USPTO - Pol�tica de privacidad - Condiciones de servicio - Acerca de Google Patentes - Danos tu opini�nDatos proporcionados por IFI CLAIMS Patent Services©2012 Google