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

Method and apparatus for image-type determination to enable choice of an optimum data compression procedure

Assignee: Hewlett Packard Development Co LP
•
Filing: 1994-07-28
•
Granted: 1996-07-09
•
Expires: 2014-07-28
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method for identifying an image type of a multi-pixel image is employed in an apparatus that includes multiple data compression procedures. The data compression procedures operate with varying efficiencies on different image types. Pixels defining an image are represented by binary 1/0 values that are arranged in n-bit data segments (e.g., bytes). The method includes the steps of: counting a number of 1-to-0 and 0-to-1 transitions in each data segment; finding an average number of transitions over all data segments wherein such transitions occur; determining for all data segments in the multi-pixel image, a transition array comprising cumulative numbers of data segments having 0, 1, 2, . . . n-1 transitions, respectively; and employing the average number of transitions per data segment and the transition array to identify a data compression procedure to be employed for the multi-pixel image.

Inventors

  • 👤 Gary Zimmerman

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-09 23:08
CPC Classifications
H; H04; H04N; H04N1/00; H04N1/40; H04N1/40062; G; G06; G06T; G06T9/00; G06T9/005; H03; H03M; H03M7/00; H03M7/30; H03M7/3084; H03M7/46; H03M7/48; H04N1/41; H04N1/411

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 135 words
A method for identifying an image type of a multi-pixel image and assigning a compression procedure therefor, said method performed by apparatus that includes multiple data compression procedures, said method analyzing an image portion comprising plural data segments, each data segment including plural binary pixel values, said method comprising the steps of: counting a number of transitions of binary value in each said data segment; finding an average number of transitions of binary value over all data segments that include at least one transition; determining for all data segments in said multipixel image, a transition array comprising cumulative sums of data segments having like numbers of transitions of binary value; and employing said average number of transitions of binary value and said cumulative sums of pixels from said transition array to identify said image type.
Claim 2
Independent Claim 135 words
A method for identifying an image type of a multi-pixel image and assigning a compression procedure therefor, said method performed by apparatus that includes multiple data compression procedures, said method analyzing an image portion comprising plural data segments, each data segment including plural binary pixel values, said method comprising the steps of: counting a number of transitions of binary value in each said data segment; finding an average number of transitions of binary value over all data segments that include at least one transition; determining for all data segments in said multipixel image, a transition array comprising cumulative sums of data segments having like numbers of transitions of binary value; and employing said average number of transitions of binary value and said cumulative sums of pixels from said transition array to identify said image type.
Claim 3
Dependent Claim 20 words
The method as recited in claim 1 wherein identification of said image type determines a dither pattern of said image.
Claim 4
Dependent Claim 26 words
The method as recited in claim 1 wherein said image type identification enables selection of a data compression procedure to be applied to said multi-pixel image.
Claim 5
Dependent Claim 51 words
The method as recited in claim 3 wherein if said transition array indicates a single local maxima value and said average number of transitions per byte for bytes having transitions is less than approximately 1.3, said employing step selects a Lempel-Ziv data compression procedure to data compress said multi pixel image.
Claim 6
Dependent Claim 59 words
The method as recited in claim 3 wherein if said transition array indicates one or two local maxima values and said average number of transitions per byte for bytes having transitions is greater than approximately 1.3 and is less than approximately 1.75, said employing step selects a Cache-based predictor data compression procedure to data compress said multi pixel image.
Claim 7
Dependent Claim 58 words
The method as recited in claim 3 wherein, if said transition array indicates three or four local maxima values and said average number of transitions per byte for bytes having transitions is greater than approximately 2.75 and is less than approximately 4, said employing step selects a Cache-based predictor data compression procedure to data compress said multi-pixel image.
Claim 8
Dependent Claim 57 words
The method as recited in claim 3 wherein, if said transition array evidences plural local maxima of even numbers of transitions, and said average transitions per data segment of data segments with transitions is greater than approximately 2.5 per data segment, said employing step selects a lossy data compression procedure to be employed with said multi-pixel image.
Claim 9
Dependent Claim 62 words
The method as recited in claim 3 wherein, if said transition array evidences plural local maxima of odd numbers of transitions, and said average transitions per data segment of data segments with transitions is greater than approximately 2.5 and less than approximately 3 per data segment, said employing step selects a cache-based predictor compression procedure to be employed with said multi-pixel image.
Claim 10
Dependent Claim 16 words
The method as recited in claim 1 wherein each said data segment is an 8-bit byte.

References Cited (Backward Citations)

US4942390A Cited
US5247357A Cited
US5207517A Cited
US5293466A Cited
US5208676A Cited
US5228118A Cited
US5179378A Cited
US5155484A Cited
US5231485A Cited
US5247348A Cited
US5375204A Cited
US5408542A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1999-07-09 2000-01-08 2000-07-09 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2003-07-09 2004-01-08 2004-07-09 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2007-07-09 2008-01-08 2008-07-09 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag