Joan Mitchell

US Patent:

6603573, Aug 5, 2003

Filed:

Oct 30, 1998

Appl. No.:

09/182420

Inventors:

Roy L. Adler - Chappaqua NY
Marco Martens - Chappaqua NY
Joan L. Mitchell - Cortlandt Manor NY
Nenad Rijavec - Longmont CO
Robert H. Risch - Ossining NY
Charles P. Tresser - Mamaroneck NY
Chai W. Wu - Poughquag NY

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

H04N 152

US Classification:

358 19, 358 303, 358 306, 358534, 358518

Abstract:

A method and apparatus for halftoning digital images renders color data subject to constraints on the number of colorants which can be deposited on a single pixel and constraints on consecutive pixels rendered with the same color. The color data to be rendered is mapped into a second data set in an achievable color gamut space. Then, using a digital halftoning method in the achievable color gamut space, the second data set is rendered, so that the constraints are satisfied.

US Patent:

7298925, Nov 20, 2007

Filed:

Sep 30, 2003

Appl. No.:

10/675094

Inventors:

Tomasz J. Nowicki - Briarcliff Manor NY, US
Marco Martens - Groningen, NL
Jennifer Q. Trelewicz - Gilroy CA, US
Timothy J. Trenary - Berthoud CO, US
Joan L. Mitchell - Longmont CO, US
Michael T. Brady - Ithaca NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06K 9/32

US Classification:

382298, 382235

Abstract:

A method and system for efficient scaling in the transform domain, wherein transform coefficient data is provided as an input to a data processing system and scaled in the transform domain by application of a combined matrix. Some embodiments utilize discrete cosine transform data. One embodiment of the invention generates a combined matrix for one-dimensional scaling by selecting a rational scaling factor and matrix dimension value, generating a matrix with some zero values, applying a one-dimensional inverse transform, regrouping, and applying a one-dimensional forward transform. One application of the invention performs up-scaling operations, and another performs down-scaling operations. The invention also provides for two-dimensional scaling by selecting horizontal and vertical scaling parameters and generating first and second combined matrices responsive to the parameters and combining them into a single combined matrix. The invention may also incorporate a predetermined cost function.

US Patent:

7474805, Jan 6, 2009

Filed:

Aug 27, 2007

Appl. No.:

11/845359

Inventors:

Tomasz J. Nowicki - Briarcliff Manor NY, US
Marco Martens - Groningen, NL
Jennifer Q. Trelewicz - Gilroy CA, US
Timothy J. Trenary - Berthoud CO, US
Joan L. Mitchell - Longmont CO, US
Michael T. Brady - Ithaca NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06K 9/32
G06F 17/14

US Classification:

382298, 708400

Abstract:

Methods and systems for efficient scaling in the transform domain are provided when transform coefficient data is provided as an input to a data processing system, comprising generating a first matrix from transform coefficient data; zeroing out a row or column of, or inserting a row or column of zeros into, the first matrix; generating a second matrix by applying a one-dimensional inverse transform to the first matrix with the zeroed-out at least one row, the at least one column, the inserted at least one row of zeros or the at least one column of zeros; generating a third matrix by regrouping the second matrix; generating a combined matrix by applying a forward transform to the third matrix; and the data processing system scaling the data represented by the transform coefficient data by applying the combined matrix to the transform coefficient data.

US Patent:

20130198721, Aug 1, 2013

Filed:

Mar 14, 2013

Appl. No.:

13/828998

Inventors:

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY, US
Sandra Kay Johnson - Cary NC, US
Joan Mitchell - Las Vegas NV, US
David Ward - Broomfield CO, US

Assignee:

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY

International Classification:

G06F 9/44

US Classification:

717123

Abstract:

The present invention relates to the visualization of complex information using a set of navigable landmasses. A method for generating a visualization of a programming code base using a set of navigable landmasses in accordance with an embodiment of the present invention includes: representing each of a plurality of different code components using a respective landmass; adjusting a size of each landmass based on a number of lines of code in the code component corresponding to the landmass; and displaying the landmasses.

US Patent:

43822860, May 3, 1983

Filed:

Jun 30, 1980

Appl. No.:

6/164120

Inventors:

Joan L. Mitchell - Ossining NY
Peter Quarendon - Romsey, GB2

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 500

US Classification:

364900

Abstract:

A compression technique for a character graphics system in which character cell definition bit strings are transmitted from a central processing unit to a display unit. Each cell is divided into a number of slices and each slice into digits. A test is made on whether to compress on a comparison with an all zero slice, the previous slice or the previous slice but one, depending upon the number of digit mismatches that occur when the comparison occurs. Slices are then compressed by comparing each digit with the corresponding digit in the comparison slice and generating a single 0 bit if the digit matches and including a 1 bit and the whole digit if a mismatch occurs. The compression in the central processing unit and the decompression in the display unit is implemented in microcoded routines.

US Patent:

47991054, Jan 17, 1989

Filed:

Sep 16, 1987

Appl. No.:

7/097371

Inventors:

Joan L. Mitchell - Ossining NY
William B. Pennebaker - Carmel NY

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

H04N 514

US Classification:

358160

Abstract:

A method for suppressing the perception of flicker in interlaced video images, includes the steps of: testing, each pixel in an image, for an intensity value below a first predetermined threshold; modifying, for each tested pixel, an intensity value representation for each nearest neighbor pixel along a first axis of said interlaced image having an intensity value exceeding a second predetermined threshold, if the intensity value of the tested pixel is below the first predetermined threshold; displaying, on a video display device, an interlaced image generated by the steps of testing and modifying, having a suppressed perception of flicker.

US Patent:

45583706, Dec 10, 1985

Filed:

Nov 21, 1983

Appl. No.:

6/553216

Inventors:

Joan L. Mitchell - Ossining NY
William B. Pennebaker - Carmel NY

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

H04N 140
G09G 114
G09G 300
G06K 936

US Classification:

358260

Abstract:

Graphics images are generally considered to be those images comprised of text and/or line drawings. Data compression of graphics images is desired whenever a fast image transmission speed is desired in a limited band width channel. It is also used for storage of a large number of images in a limited capacity storage system. The method and apparatus described herein improves data compression, resolution and coding efficiency 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 a graphics 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 resolution display or printed output may be obtained from the bilevel multiresolution representation.

US Patent:

46334904, Dec 30, 1986

Filed:

Mar 15, 1984

Appl. No.:

6/589981

Inventors:

Gerald Goertzel - White Plains NY
Joan L. Mitchell - Ossining NY

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

H04B 166

US Classification:

375122

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, up to decision n-1, codes each decision in the data stream optimally, according to its own character in relation to the calculated probability history, and dynamically optimizes the current decision according to the transfer optimum of the data stream previously transferred.