Patent US2034076A successfully refreshed from Google Patents.
Patent US5101445A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5101445A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus for filtering digital data by concatenating preprocessed overlapping groups of the data

Assignee: Unisys Corp
•
Filing: 1989-03-16
•
Granted: 1992-03-31
•
Expires: 2009-03-16
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An image, of the type that is comprised of an array of pixels, is filtered by the steps of: (a) reading a respective group of pixels from the array for each individual pixel that is in the array, with each pixel group overlapping other pixel groups and consisting of pixels that are contiguous with the individual pixel; (b) quantizing each of the respective groups of pixels; (c) retrieving from a memory, a single pixel for each quantized group of pixels, with the single pixel being the result of a pre-performed transformation on the quantized group of pixels; and (d) concatenating the retrieved pixels to form the filter image.

Inventors

  • 👤 Roger W. Call
  • 👤 Benjamin V. Cox, Jr.

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-30 15:42
CPC Classifications
G; G06; G06T; G06T5/00; G06T5/20

Claims Analysis

Total Claims: 11
Claim 1
Independent Claim 155 words
A method of filtering an array of data samples, including the steps of: selecting several standard data sample groups; transforming each standard data sample group into a respective single data sample, and storing each transformed data sample in a memory; reading a respective input group of data samples from said array for each individual sample in the array; each input group of samples being a subset of all of the samples in said array, being contiguous with the individual sample, and overlapping other input groups of samples; generating an identifier for each input data sample group that identifies which one of said standard data sample groups most closely matches the input data sample group; retrieving from said memory, for each generated identifier, the single data sample which is stored as the transformation of the standard data input group that is identified by the identifier; and, concatenating the retrieved data samples to form the filtered array.
Claim 2
Independent Claim 155 words
A method of filtering an array of data samples, including the steps of: selecting several standard data sample groups; transforming each standard data sample group into a respective single data sample, and storing each transformed data sample in a memory; reading a respective input group of data samples from said array for each individual sample in the array; each input group of samples being a subset of all of the samples in said array, being contiguous with the individual sample, and overlapping other input groups of samples; generating an identifier for each input data sample group that identifies which one of said standard data sample groups most closely matches the input data sample group; retrieving from said memory, for each generated identifier, the single data sample which is stored as the transformation of the standard data input group that is identified by the identifier; and, concatenating the retrieved data samples to form the filtered array.
Claim 3
Dependent Claim 24 words
A method according to claim 1 wherein said array and said standard data sample groups on which said transforming step is performed are two-dimensional.
Claim 4
Dependent Claim 13 words
A method according to claim 2 wherein said data samples are image pixels.
Claim 5
Dependent Claim 47 words
A method according to claim 3 wherein said transforming step is performed with a transformation of the form ##EQU1## where p i is a pixel in a standard group of n pixels, and k 1 , K 2 , h i , and g i are constants.
Claim 6
Dependent Claim 39 words
A method according to claim 3 wherein said transforming step is performed with a transformation of the form ##EQU2## where p i is a pixel in a standard group of n pixels and k and h i are constants.
Claim 7
Dependent Claim 47 words
A method according to claim 3 wherein said transforming step is performed with a transformation of the form ##EQU3## where p i is a pixel in a standard group of n pixels, and k 1 , k 2 , h i , and g i are constants.
Claim 8
Dependent Claim 24 words
A method according to claim 1 wherein said array and said standard data sample groups on which said transforming step is performed are three-dimensional.
Claim 9
Dependent Claim 15 words
A method according to claim 7 wherein said data samples are image pixels with color.
Claim 10
Dependent Claim 24 words
A method according to claim 1 wherein said array and said standard data sample groups on which said transforming step is performed are one-dimensional.
Claim 11
Dependent Claim 40 words
A method according to claim 9 wherein said transforming step is performed with a transformation of the form ##EQU4## where d i is a data sample in a standard group of n samples, and k and h i are constants.

References Cited (Backward Citations)

US4288779A Cited
US4703513A Cited
US4720871A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1995-03-31 1995-09-30 1996-03-31 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1999-03-31 1999-09-30 2000-03-31 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2003-03-31 2003-09-30 2004-03-31 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag