Michael A Perrone

US Patent:

6603881, Aug 5, 2003

Filed:

Oct 23, 2001

Appl. No.:

10/047152

Inventors:

Michael P. Perrone - Yorktown NY
Eugene H. Ratzlaff - Hopewell Junction NY

Assignee:

International Business Machines Corporation - Armonk NJ

International Classification:

G06K 918

US Classification:

382186, 382181, 382187, 382189, 382202, 382225

Abstract:

Systems and methods for reordering unconstrained handwriting data using both spatial and temporal interrelationships prior to recognition, and for spatially organizing and formatting machine recognized transcription results. The present invention allows a machine recognizer to generate and present a full and accurate transcription of unconstrained handwriting in its correct spatial context such that the transcription output can appear to âmirrorâ the corresponding handwriting.

US Patent:

6897851, May 24, 2005

Filed:

Jan 5, 2001

Appl. No.:

09/755787

Inventors:

Paul Robert Carini - Sherman CT, US
Paul Turquand Keyser - Mount Kisco NY, US
Michael Peter Perrone - Yorktown NY, US
David A. Sawin - Durham NC, US
Jeffrey S. Schaffer - Ridgefield CT, US
Jayashree Subrahmonia - White Plains NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G09G005/00

US Classification:

345173

Abstract:

Several methods, and related apparatus, are provided for the entry of formatted ink data (i. e. , electronic ink) such that individual items in the data may be parsed and recognized more effectively. Each method allows users to enter formatted ink data in-line, which can then be recognized with constraints and parsed for use in other application programs or databases. In addition, a method is provided for allowing user-specialization of any of these entry methods (or other similar) methods. Note that in any of these methods, the user may send the formatted ink either to the default ink-processing application, or else directly to another application or database.

US Patent:

7260779, Aug 21, 2007

Filed:

Sep 30, 2005

Appl. No.:

11/240605

Inventors:

Paul Turquand Keyser - Mount Kisco NY, US
Michael Peter Perrone - Yorktown NY, US
Eugene H. Ratzlaff - Hopewell Junction NY, US
Jayashree Subrahmonia - White Plains NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 15/00

US Classification:

715525, 382187

Abstract:

In one aspect of the present invention, page breaks are identified in the following manner. A set of ink data and a document description are processed by a variety of scoring methods, each of which generates a score for each possible insertion point in the ink. These scores are combined to produce a ranked list of hypothesized page breaks for the corresponding ink data. This ranked list is then used either to insert page breaks automatically using a predefined threshold to determine a cut-off in the list; or to present, on-line, to a human for verification/approval; or a mixture of the two based on two thresholds: one for automatic insertion and the other for human verification. It is to be understood not all scoring methods need be used, that is, one or more of the scoring methods may be used as needed.

US Patent:

7400277, Jul 15, 2008

Filed:

Apr 6, 2004

Appl. No.:

10/818567

Inventors:

Michael P. Perrone - Yorktown Heights NY, US
Eugene H. Ratzlaff - Hopewell Junction NY, US
Jianying Hu - Bronx NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

H03M 7/00

US Classification:

341107, 341106, 341 65, 341 67

Abstract:

The present invention relates to a method, computer program product and system for the compression of a probability table and the reconstruction of one or more probability elements using the compressed data and method. After determining a probability table that is to be compressed, the probability table is compressed using a first probability table compression method, wherein the probability table compression method creates a first compressed probability table. The first compressed probability table contains a plurality of probability elements. Further, the probability table is compressed using a second probability table compression method, wherein the probability table compression method creates a second compressed probability table. The second compressed probability table containing a plurality of probability elements. A first probability element reconstructed using the first compressed probability table is thereafter merged with a second probability element reconstructed using the second compressed probability table in order to produce a merged probability element.

US Patent:

7705754, Apr 27, 2010

Filed:

Jun 25, 2008

Appl. No.:

12/146310

Inventors:

Michael P. Perrone - Yorktown Heights NY, US
Eugene H. Ratzlaff - Hopewell Junction NY, US
Jianying Hu - Bronx NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

H03M 7/00

US Classification:

341107, 341 65, 341 67, 341106

Abstract:

The present invention relates to a method, computer program product and system for the compression of a probability table and the reconstruction of one or more probability elements using the compressed data and method. After determining a probability table that is to be compressed, the probability table is compressed using a first probability table compression method, wherein the probability table compression method creates a first compressed probability table. The first compressed probability table contains a plurality of probability elements. Further, the probability table is compressed using a second probability table compression method, wherein the probability table compression method creates a second compressed probability table. The second compressed probability table containing a plurality of probability elements. A first probability element reconstructed using the first compressed probability table is thereafter merged with a second probability element reconstructed using the second compressed probability table in order to produce a merged probability element.

US Patent:

7743062, Jun 22, 2010

Filed:

Nov 30, 2007

Appl. No.:

11/948809

Inventors:

Michael P. Perrone - Yorktown Heights NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/30

US Classification:

707748

Abstract:

A system and method implemented by a computer for performing query based electronic document retrieval implementing a Markov process model adapted for determining a relationship or relevance between documents. The system ranks documents for retrieval based on their relevance measure. The model calculates the measure of relevance that a document from a given database is relevant to a given query. The method learns the Markov models mixture coefficients from the document database so as to maximize the relevance measure of the documents being retrieved. The method requires only that a similarity measure, D(d,d′), between two documents be specified. Any existing method may be used for generating a model that is at least as good as the chosen similarity measure.

US Patent:

20050228778, Oct 13, 2005

Filed:

Apr 5, 2004

Appl. No.:

10/818412

Inventors:

Michael Perrone - Yorktown Heights NY, US

Assignee:

INTERNATIONAL BUSINESS MACHINES CORPORATION - ARMONK NY

International Classification:

G06F017/30

US Classification:

707003000

Abstract:

A system and method implemented by a computer for performing query based electronic document retrieval implementing a Markov process model adapted for determining a relationship or relevance between documents. The system ranks documents for retrieval based on their relevance measure. The model calculates the measure of relevance that a document from a given database is relevant to a given query. The method learns the Markov models mixture coefficients from the document database so as to maximize the relevance measure of the documents being retrieved. The method requires only that a similarity measure, D(d,d′), between two documents be specified. Any existing method may be used for generating a model that is at least as good as the chosen similarity measure.

US Patent:

63209853, Nov 20, 2001

Filed:

Jul 31, 1998

Appl. No.:

9/126893

Inventors:

Michael P. Perrone - Yorktown NY
Jayashree Subrahmonia - White Plains NY

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06K 900
G06K 918
G06K 962

US Classification:

382224

Abstract:

An apparatus and method for providing improved data classification and, in particular, an apparatus and method for improved handwriting data recognition which enables handwriting recognition devices to robustly handle and recover from the problems associated with the omission of characters from collected handwriting samples. In one aspect, a data classification apparatus comprises: means for inputting a plurality of data, the plurality of data including one of data to be recognized, generic data and user-specific data; means for augmenting the user-specific data with the generic data to generate augmented user-specific data; means for training the data classification apparatus with the augmented user-specific data to generate training data; and means for recognizing the data to be recognized in accordance with the training data.