-
公开(公告)号：DE3484736D1
公开(公告)日：1991-07-25
申请号：DE3484736
申请日：1984-12-11
Applicant: IBM
Abstract: Method for rotating an image by 90 degrees includes the steps of: storing the image in a raster format arranged in r rows by c columns, image information in each row being stored in a number of bytes, each byte having b bits, there being c/b bytes in each row of the raster format; moving a block of the image into a temporary storage, there being n rows by m columns in the block; separating each image block into groups of bytes of rotatable size; determining for each group if all bits are the same value; rotating each group that does not have all bits the same value; storing each rotated group in an output area of the raster storage; repeating the above steps for all remaining blocks of the image.
-
-
公开(公告)号：DE3483521D1
公开(公告)日：1990-12-06
申请号：DE3483521
申请日：1984-12-11
Applicant: IBM
Inventor： ANDERSON KAREN LOUISE , MITCHELL JOAN LA VERNE , GOERTZEL GERALD NMN
-
公开(公告)号：DE3582701D1
公开(公告)日：1991-06-06
申请号：DE3582701
申请日：1985-06-11
Applicant: IBM
Inventor： ANDERSON KAREN LOUISE , MITCHELL JOAN LA VERNE , PENNEBAKER WILLIAM BOONE , GOERTZEL GERALD
Abstract: A method for converting an image from a bit map to a run end or run length representation includes the steps of : storing the image as a bit map representation; accessing for each byte in an image by a look-up table a selected routine, corresponding to such byte, from a number of routines for converting bit strings to run representations, wherein the look-up table accessed is selected in accordance with a color value of a preceding pixel binary bit; and executing the selected routine on the current byte to convert the bit string to a run representation; storing in a run representation buffer, as a count value, each run representation; repeating the above steps of accessing and executing for each byte and storing for each run of continuous color to the end of the image.
-
公开(公告)号：DE3483951D1
公开(公告)日：1991-02-21
申请号：DE3483951
申请日：1984-11-06
Applicant: IBM
Inventor： MITCHELL JOAN LA VERNE , PENNEBAKER WILLIAM BOONE
Abstract: Data compression, resolution and coding efficiency of graphic text or line image data is achieved by eliminating transitions between gray levels at edges in an image, converting all gray levels to a common value to achieve a 3 level representation of the image, and reversibly converting the 3 level representation to a bilevel double resolution representation by increasing the data sampling rate and therefore allowing the use of two level data compression techniques. A high resoluton display or printed output may be obtained from the bilevel multiresolution representation,
-
Patent Agency Ranking
公开(公告)号：DE3581221D1
公开(公告)日：1991-02-14
申请号：DE3581221
申请日：1985-02-22
Applicant: IBM
Inventor： GOERTZEL GERALD , MITCHELL JOAN LA VERNE
Abstract: Data compression for transfer (storage or communication) by a continuously adaptive probability decision model, closely approaches the compression entropy limit. Sender and receiver perform symmetrical compression/decompression of binary decision n according to probabilities calculated independently from the transfer sequence of 1...n-1 binary decisions. Sender and receiver dynamically adapt the model probabilities, as a cumulative function of previously presented decisions, for optimal compression/decompression.Adaptive models for sender and receiver are symmetrical, to preserve data identity; transfer optimization is the intent. The source model includes a state generator and an adaptive probability generator, which dynamically modify the coding of decisions according to state, probability and bit signals, and adapt for the next decision. The system calculates probability history for all decisions, including the current decision, but uses probability history for decision n-1 (the penultimately current decision) for encoding decision n (the dynamically current decision). The system, separately at source and destination, reconfigures the compression/expansion algorithm, on a penultimately current basis, codes each decision in the data stream optimally, according to its own character in relation to the calculated probability history, and dynamically reconfigures the current decision to the penultimately current transfer optimum.
-
公开(公告)号：MY123212A
公开(公告)日：2006-05-31
申请号：MYPI9904738
申请日：1999-11-02
Applicant: IBM
Inventor： BRIGHT MARTIN JAMES , MITCHELL JOAN LA VERNE
Abstract: THIS INVENTION SOLVES PROBLEMS DUE TO EMPLOYING ERROR DEGRADED DATA IN DIGITAL PROCESSING. IT PARTICULARLY SOLVES MULTI-GENERATION PROBLEMS WHEREIN TRANSFORM DATA DEGRADE DURING EACH INVERSE TRANSFORM AND FORWARD TRANSFORM CYCLE EVEN WITHOUT ANY PROCESSING DUE TO THE ROUNDING AND CLIPPING ERRORS. IT PROVIDES METHODS, SYSTEMS AND DEVICES FOR REDUCED-ERROR PROCESSING OF TRANSFORM-CODED DATA. AFTER INVERSE TRANSFORMATION OF TRANSFORM DATA, HIGH-PRECISION NUMBERS ARE CONVERTED TO INTEGERS AND CLIPPED TO AN ALLOWED RANGE FORMING CONVERTED DATA. HIGH-PRECISION DIFFERENCES ARE OBTAINED BY SUBTRACTING THE HIGH-PRECISION OUTPUT OF THE INVERSE TRANSFORM FROM THE CONVERTED DATA. THE CONVERTED DATA CAN BE MANIPULATED AND SENT TO OUTPUT DEVICES WHICH EXPECT INTEGER DATA. PROCESSED HIGH-PRECISION NUMBERS ARE FORMED BY ADDING THE HIGH-PRECISION DIFFERENCES TO THE PROCESSED CONVERTED DATA. THUS, THE ROUNDING AND CLIPPING ERRORS ARE GREATLY REDUCED IN THE PROCESSED HIGH-PRECISION NUMBERS.THE PROCESSED HIGH-PRECISION NUMBERS ARE USED FOR FURTHER PROCESSING INCLUDING FORWARD TRANSFORMING BACK TO THE TRANSFORM DOMAIN. IN ANOTHER EMBODIMENT OF THE PRESENT INVENTION PROCESSED HIGH-PRECISION NUMBERS ARE GENERATED BY SELECTING THE HIGH-PRECISION NUMBERS INSTEAD OF THE MANIPULATED CONVERTED DATA WHENEVER THE MANIPULATED CONVERTED DATA STILL EQUALS THE CONVERTED DATA. ALTHOUGH ADVANTAGEOUS TO MANY APPLICATIONS EMPLOYING DIGITAL TRANSFORMED DATA, THE INVENTION IS PARTICULARLY ADVANTAGEOUS FOR USE IN DIGITAL STUDIOS DURING EDITING OF MPEG-CODED, JPEG-CODED AND WAVELET-CODED VIDEO AND AUDIO DATA.(FIG. 11A)
-
公开(公告)号：DE3484136D1
公开(公告)日：1991-03-28
申请号：DE3484136
申请日：1984-12-11
Applicant: IBM
Inventor： ANDERSON KAREN LOUISE , GOERTZEL GERALD , MITCHELL JOAN LA VERNE
Abstract: 57 A method for converting an image from a bit map to a run end or run length representation includes the steps of: storing said image as a bit map representation; initializing all variables to be used in the conversion process; converting by table lookup, each run of continuous color to a run end; storing, in a run end buffer, as a count value, each run end; repeating the steps of converting and storing for each run of continuous color to the end of the image.
-
公开(公告)号：DE3484135D1
公开(公告)日：1991-03-28
申请号：DE3484135
申请日：1984-12-11
Applicant: IBM
Inventor： MITCHELL JOAN LA VERNE , ANDERSON KAREN LOUISE
Abstract: A method for converting an image from a run represen-; tation to a bit map, includes the steps of: storing a plurality of run representations of an image in a buffer; initializing a line of data; converting, by table lookup, each run representation, in said line, to a picture element representation, storing said picture element representation of said line; repeating the steps of initializing, converting and storing for remaining run representations until said image has been converted to a bit map representation.
-
公开(公告)号：DE3473191D1
公开(公告)日：1988-09-08
申请号：DE3473191
申请日：1984-12-11
Applicant: IBM
Inventor： MITCHELL JOAN LA VERNE , ANDERSON KAREN LOUIS , MINTZER FREDERICK COLE
Abstract: 57 A method for rotation of a binary image by 180 degrees, includes the steps of: positioning first (Pl) and second (P2) address pointers at the center or at the beginning and end respectively of an image to be rotated; indexing the first pointer in a first direction through said image; indexing the second pointer in a second direction through said image; exchanging, for each index step, a first image word at the first pointer with a second image word, at the second pointer if the first image word and the second image word have any two bits with different values; reversing all exchanged words; storing the reversed, exchanged words at said pointer locations; repeating the above steps until the first pointer and the second pointer have been indexed through all words in the image at which point the image has been rotated by 180 degrees.
-
-
-
-
-
-
-
-
-
Search Results
10
records
(took 0.02 seconds)
