Source: http://www.google.com/patents/US4930021?dq=7,468,661
Timestamp: 2015-03-05 19:01:02
Document Index: 292062337

Matched Legal Cases: ['ART 1', 'ART 2', 'ART 3', 'ART 4', 'ART 5', 'ART 6', 'ART 7']

Patent US4930021 - Process and apparatus for reducing a picture with fine line disappearance ... - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inAdvanced Patent SearchPatentsA process for reducing a picture by determining monochrome data of converted picture pixels according to logic calculations based on monochrome data of original picture pixels by using divisional regions of a picture area according to a reduction rate, for avoiding disappearance of fine lines from the...http://www.google.com/patents/US4930021?utm_source=gb-gplus-sharePatent US4930021 - Process and apparatus for reducing a picture with fine line disappearance preventionAdvanced Patent SearchPublication numberUS4930021 APublication typeGrantApplication numberUS 07/325,912Publication dateMay 29, 1990Filing dateMar 20, 1989Priority dateMar 18, 1988Fee statusPaidAlso published asCA1306052C, DE68923110D1, DE68923110T2, EP0333496A2, EP0333496A3, EP0333496B1Publication number07325912, 325912, US 4930021 A, US 4930021A, US-A-4930021, US4930021 A, US4930021AInventorsYoshiyuki OkadaOriginal AssigneeFujitsu LimitedExport CitationBiBTeX, EndNote, RefManPatent Citations (5), Referenced by (17), Classifications (6), Legal Events (5) External Links: USPTO, USPTO Assignment, EspacenetProcess and apparatus for reducing a picture with fine line disappearance prevention
US 4930021 AAbstract
1. A process for reducing a picture by determining monochrome data of converted picture pixels based on monochrome data of original picture pixels, and for avoiding disappearance of fine lines from the converted picture,said process comprising the steps of: (a) successively receiving monochrome data of original picture pixels in the vicinity of a converted picture pixel; (b) generating data of a line susceptible to disappearance; (c) discriminating a divisional region in which said converted picture pixel is located; (d) calculating, according to logic calculations, monochrome data of said converted picture pixel based on said generated data, said discriminated divisional region, and said monochrome data of original picture pixels; and (e) producing a signal indicating said monochrome data of said converted picture pixel according to said calculation. 2. A process according to claim 1, wherein step (b) includes the sub-steps of:determining, with regard to an X-axis direction, if a preceding converted picture pixel position coordinate is greater than a reference position coordinate, if the pixel position coordinate of said converted picture pixel is greater than a reference position coordinate, and if a subsequent converted picture pixel position coordinate is greater than a reference position coordinate; and determining the number of original picture pixels between said converted picture pixel position coordinate and said preceding converted picture pixel position coordinate or said subsequent converted picture pixel position coordinate. 3. A process according to claim 2, wherein step (b) includes the sub-steps of:determining with regard to a Y-axis direction, if a preceding converted picture pixel position coordinate is greater than a reference position coordinate, if the pixel position coordinate of said converted picture pixel is greater than a reference position coordinate, and a subsequent converted picture pixel position coordinate is greater than a reference position coordinate; and determining the number of original picture pixels between said converted picture pixel position coordinate and said preceding converted picture pixel position coordinate or said subsequent converted picture pixel position coordinate. 4. A process according to claim 1, wherein includes the sub-steps of:determining, with regard to an X-axis direction, if the present pixel position coordinate of said converted picture pixel is greater than a reference position coordinate; and determining, with regard to a Y-axis direction, if the pixel position coordinate of said converted picture pixel is greater than a reference position coordinate. 5. A process according to claim 1, wherein step (d) includes the sub-step of:performing a logic calculation to preserve a fine line based on said generated data and the most adjacent pixel of the original picture or the pixels close to the most adjacent pixel of an original picture. 6. A process according to claim 1, wherein a reduction rate in an X-axis direction is p, a reduction rate in a Y-axis direction is q, the number n of lines of said monochrome data of original picture pixels is given as n=22 (m=0, 1, 2 . . . ), the desired reduction rates in the X-axis direction and the Y-axis direction are 1>p≧1/n and 1>q≧1/n, steps (a)-(e) are carried out "m-1" times with a reduction rate of 1/2, and steps (a)-(e) are carried out once with reduction of 2m-1 *p and 2m-1 *q.
7. A process according to claim 1, wherein step (b) includes the sub-step of:generating said line data based on a picture reduction rate; and step (d) includes the sub-step of: calculating said monochrome data of said converted picture pixel further based on said reduction rate. 8. An apparatus for reducing a picture by determining monochrome data of converted picture pixels based on monochrome data of original picture pixels, and for avoiding disappearance of fine lines in the converted picture,said apparatus comprising: monochrome data receiving means for receiving a sequence of monochrome data of original picture pixels in the vicinity of a converted picture pixel; control means including a disappearance susceptibility line data generation means for generating data of a line susceptible to disappearance, and a region discrimination means for discriminating a divisional region in which said converted picture pixel is located; and monochrome data calculation means, operatively connected to said monochrome data receiving means and said control means, for calculating monochrome data of said converted picture pixel based on said generated data, said discriminated divisional region, and said monochrome data of original picture pixels. 9. A process for providing a reduced picture of converted picture pixels by reducing the number of original picture pixels in an x-axis direction by a first reduction rate and reducing the number of original picture pixels in a y-axis direction by a second reduction rate, and for preventing fine line disappearance, comprising the steps of:(a) receiving monochrome data of original picture pixels in the vicinity of a converted picture pixel; (b) generating condition data based on the first and second reduction rates and spatial relationships between converted picture pixels and original picture pixels in the vicinity of said converted picture pixel; (c) detecting a fine line susceptible to disappearance based upon said condition data; (d) discriminating a divisional region in which said converted picture pixel is located; (e) calculating, according to logic calculations, monochrome data of said converted picture pixel based on the first and second reduction rates, said detected fine line, said divisional region, and said received monochrome data. 10. A process as recited in claim 9, wherein step (b) includes the sub-step of:generating spatial relationship data based on at least one of the following spatial relationships:(1) the number of lines in the x-axis direction of original picture pixels between said converted picture pixel and a first preceding converted picture pixel; (2) the number of lines in the y-axis direction of original picture pixels between said converted picture pixel and a second preceding converted picture pixel; (3) the number of lines in the x-axis direction of original picture pixels between said converted picture pixel and a first subsequent converted picture pixel; (4) the number of lines in the y-axis direction of original picture pixels between said converted picture pixel and a second subsequent converted picture pixel; (5) if the x-axis coordinate of said first preceding converted picture pixel is greater than a first reference x-axis coordinate; (6) if the y-axis coordinate of said second preceding converted picture pixel is greater than a first reference y-axis coordinate; (7) if the x-axis coordinate of said converted picture pixel is greater than a second reference x-axis coordinate; (8) if the y-axis coordinate of said converted picture pixel is greater than a second reference y-axis coordinate; (9) if the x-axis coordinate of said first subsequent converted picture pixel is greater than a third reference x-axis coordinate; and (10) if the y-axis coordinate of said second subsequent converted picture pixel is greater than a third reference y-axis coordinate. 11. A process as recited in claim 9, wherein step (c) includes the sub-step of:detecting a pattern of said fine line. 12. A process as recited in claim 9, wherein step (e) includes the sub-step of:producing a signal indicating monochrome data of said converted picture pixel based on said calculation. 13. A process as recited in claim 12, wherein steps (a)-(e) are repeated for subsequent converted picture pixels.
Principle of a Process According to Present Invention
TABLE______________________________________TIMING  OPERATIONS______________________________________(PART 1)T1 Store following data into R2:   yshift0 = 1, yshift1 = 0, Y0 location = 1,   Y1 location = 0, Y2 location = 1.T2 Store following data in R3:   coordinate of intersecting point between Y = Y1 =   0.25 and division equation.T3 Store following data into R11:   16 bit/word picture data including reference pixels   S00 , S01 , S02 , . . .T4 Store following data into R21:   16 bit/word picture data including reference pixels   S00 , S01 , S02 , . . . of R11.   Store following data into R11:   16 bit/word picture data including reference pixels   S10 , S11 , S12 . . .T5 Store following data into R22:   16 bit/word picture data including reference pixels   S10 , S11 , S.sub. 12 , . . . of R11.   Store following data into R11:   16 bit/word picture data including reference pixels   S20 , S21 , S22 . . .(PART 2)T6 Store following data into R23:   16 bit/word picture data including reference pixels   S20 , S21 , S22 , . . . of R11.   Store following data into R11:   picture data subsequent to 16 bit/word picture data   including reference pixels S00 , S01 , S02.T7 Store following data into R31:   16 bit/word picture data including reference pixels   S00 , S01 , S02 , . . . of R21.   Store following data into R21:   picture data subsequent to 16 bit/word picture data   including reference pixels S00 , S01 , S02 , . . .   of R11.   Store following data into R11:   picture data subsequent to 16 bit/word picture data   including reference pixels S10 , S11 , S12 . . .T8 Store following data into R32:   16 bit/word picture data including reference pixels   S10 , S11 , S12 , . . . of R22.   Store following data into R22:   picture data subsequent to 16 bit/word picture data   including reference pixels S10 , S11 , S12 , . . .   of R11.   Store following data into R11:   picture data subsequent to 16 bit/word picture data   including reference pixels S20 , S21 , S22 , . .   .(PART 3)T9 Store following data into R33:   16 bit/word picture data including reference pixels   S20 , S21 , S22 , . . . of R23.   Store following data into R23:   16 bit/word picture data including reference pixels   S20 , S21 , S22 , . . . of R11.   Store following data into R111:   the initial X-coordinate X.sub. 0 = 0.25   Calculate the coordinate X0  by the adder-1 during   period from T9 to T10.T10   Store distance 1/P between converted pixels into R1   where 1/P = 3/2.   Store beginning 2 bits: LD114, 115 of 16 bit/word   data processed subsequent to R21 into R51.   Store beginning 2 bits: LD214, 215 of 16 bit/word   data processed subsequent to R22 into R52.   Store beginning 2 bits: LD314, 315 of 16 bit/word   data processed subsequent to R23 into R53.   Store initial X-coordinate: X0 = 0.25 as output of   adder-1 into R111.   Calculate coordinate of X1 : X1 = 0.25 + 1.5 = 1.75   by adder-1 during period from T10 to T11.   Store integer portion INT10 to 14 of initial X-   coordinate as output of adder-1 into R122, decimal   portion DEC10 to 17 into R121.(PART 4)T10   Calculate line disappearance data � shift by sub-   tracter-1 during period from T.sub. 10 to T11.   Select 4 pixels from 19 bits consisting of 16 bit/word   of each of R31, R41, and R51 and preceding 1 bit and   subsequent 2 bits by pixel selection circuits-1, -2   and -3 according to output INT20 to 23 of R122   during period from T10 to T11.T11   Store X-coordinate of X1 : X1 = 1.75 as output of   adder-1 into R111.   Calculate X-coordinate of X2 : 2 = 1.75 + 1.5 =   3.25 by adder-1 during period from T11 to T12.   (Hereinafter, coordinate calculations by adder-1 are   abbreviated.) Store integer portion INT10 to 14 of   X-coordinate of X1  as output of adder-1 into R122,   decimal portion DEC 101 to 17 into R121.   (Explanations of similar storing operations at later   timings are abbreviated.)   Store x shift = 1 as output of subtracter-1 into R132.   Store INT20 to 23 as output of R122, into R133.   Calculate disappearance data x shift by subtracter-1   during period T11 to T12.   (Hereinafter, such disappearance data calculations   are abbreviated.)   Store data corresponding to 12 reference pixels   selected by pixel selection circuits: Pixel Selection -1,   -2, and -3 into R134.   (Explanation of similar storing operations at later   timings are abbreviated.)(PART 5)T12   Store xshift0 = 1 as output of R132 into R142.   Store xshift1 = 0 as output of subtracter-1 into R132.   Produce signal TLP 40, 41 representing fine line pat-   tern during period T12 to T13 from following 10 data:   yshift0 = 1, yshift1 = 0, YO location = 1,   Y1 location = 0, Y2 location = 1 as Y-axis line   disappearance data from R2   xshift0 = 1 as output of R142, xshift1 = 0 as output   of R132, location of X0 = 0 from DEC57 of R151,   location of X1 = 0 from DEC47 of R141, location of   X.sub. 2 = 1 from DEC37 of R131.   (Explanation of similar operations at later timings are   abbreviated.)T13   Store output TLP40, 41 of   pattern group decision circuit of R152.   Store 12 reference pixel data as outputs PIX400 to 411   of R143 to R153.   Detect existence of fine   line operation in actual picture   by pattern detection circuit during period T13 to T14   based on TLP50, 51 representing fine line pattern from   R152 and PIX500 to 511 representing 12 reference   pixel data from T153.   (Explanations of similar   operations at later timings are abbreviated.)(PART 6)T14   Store output DEC 50 to 57 of R151 into R161.   Store data of Y1 location = 0 of R2 into R162.   Compare output TH 0 to 7 of R3 and output DEC   60 to 67 of R161 by comparator-1 during   period from T14 to T15 to   determine left/right with respect   to border of regions.   (Explanations of similar   operations at later timings are   abbreviated.)T15   Store output COMP of   comparator-1, output DEC 67 of R161,   and output Y1 ' of R162 into R171.   Store output PAT 60 to 63 of R163 into R172.   Store output PIX 600 to 603   for reference pixels A, B, C,   D, of R164 into R173.   Carry out calculation in   arithmetic circuit during period   from T15 to T16 based on   output G0 to 2 of R171 as region   signal, output PAT 70 to 73   of R172 as disappearance   indication signal, and   output PIX 701 to 703 of R173 as   reference pixel indication   signal for reference pixels   A, B, C, D, according to logic   calculation formula, and   from result of this calculation   deliver output for   determining monochrome data of   converted picture pixel.   (Explanations of similar operations   at later timings   are abbreviated.)T16   Store output LAS of logic   arithmetic circuit into shift   register SR1.(PART 7)T17   Prepare for receiving next   16 bit/word picture data at   later timing, because value   of adder-1 becomes greater   than 16. Operations of R111   and so on are stopped until   receipt of data.T18 to T21   Store next 16 bit/word picture data into R21 , R22 ,   and R23 through R11.T22   Release stopping of operations of elements for re-   starting processes for   pixel units, because next 16 bit/   word picture data has   been stored into R21, R22, and R23.T23   Store output PD 00 to 15   of SR1 into R61 and transfer   data through common bus,   because 16 converted picture   pixels have been stored into SR1.   (After that, processes with   unit of pixel, word, and line   are carried out in similar manner.)______________________________________
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS4275450 *Aug 1, 1979Jun 23, 1981Xerox CorporationMagnification/demagnification apparatus and methodUS4682243 *Mar 27, 1985Jul 21, 1987Dainippon Screen Mfg. Co., Ltd.Magnification ratio conversion in image reproductionUS4734785 *Feb 26, 1985Mar 29, 1988Canon Kabushiki KaishaImage processing apparatus having an automatic sampling modification functionUS4814894 *Apr 8, 1985Mar 21, 1989Canon Kabushiki KaishaImage transmitting system having density selectionUS4827353 *Dec 19, 1986May 2, 1989U.S. Philips CorporationMethod of and circuit arrangement for changing the resolution of binary pseudo-halftone pictures* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS5083216 *Dec 22, 1989Jan 21, 1992Kabushiki Kaisha ToshibaImage forming apparatus for forming an image according to magnificationUS5089893 *Nov 2, 1990Feb 18, 1992Sony CorporationPicture element number converterUS5159468 *Mar 30, 1990Oct 27, 1992Canon Kabushiki KaishaImage reduction systemUS5243440 *Jun 5, 1992Sep 7, 1993Canon Kabushiki KaishaPixel density conversion apparatusUS5323250 *Apr 3, 1992Jun 21, 1994Dainippon Screen Mfg. Co., Ltd.Pixel-skipping apparatus in an image processorUS5371606 *Nov 2, 1992Dec 6, 1994Canon Kabushiki KaishaImage encoding apparatusUS5418626 *Mar 17, 1993May 23, 1995Mitsubishi Denki Kabushiki KaishaImage processing device for resolution conversionUS5493420 *Feb 13, 1990Feb 20, 1996Hitachi, Ltd.Dot density conversion method and systemUS5539534 *Jun 1, 1993Jul 23, 1996Hitachi, Ltd.Method of scaling an image capable of line width preservationUS5680225 *Feb 11, 1992Oct 21, 1997Canon Kabushiki KaishaImage reduction with fine-line protectionUS5786906 *Aug 18, 1994Jul 28, 1998Canon Kabushiki KaishaMethod and apparatus for processing imageUS5838838 *Jul 19, 1996Nov 17, 1998Hewlett-Packard CompanyDown-scaling technique for bi-level imagesUS5936628 *Mar 9, 1995Aug 10, 1999Canon Kabushiki KaishaThree-dimensional model processing method, and apparatus thereforUS6616700Jan 7, 2000Sep 9, 2003Newstakes, Inc.Method and apparatus for converting video to multiple markup-language presentationsUS6995780 *Jan 27, 2000Feb 7, 2006Nec CorporationPicture convert apparatusUS8897561 *Oct 11, 2012Nov 25, 2014Novatek Microelectronics Corp.Method and circuit for detecting disappearance of logo patternUS20130136357 *Oct 11, 2012May 30, 2013Novatek Microelectronics Corp.Method and circuit for detecting disappearance of logo pattern* Cited by examinerClassifications U.S. Classification358/451, 358/484, 358/445International ClassificationH04N1/393Cooperative ClassificationH04N1/3935European ClassificationH04N1/393MLegal EventsDateCodeEventDescriptionNov 8, 2001FPAYFee paymentYear of fee payment: 12Sep 29, 1997FPAYFee paymentYear of fee payment: 8Nov 18, 1993FPAYFee paymentYear of fee payment: 4Jun 18, 1991CCCertificate of correctionMay 5, 1989ASAssignmentOwner name: FUJITSU LIMITED, JAPANFree format text: ASSIGNMENT OF ASSIGNORS INTEREST.;ASSIGNOR:OKADA, YOSHIYUKI;REEL/FRAME:005091/0982Effective date: 19890403RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services