← Back to Patent Explorer
US6549675B2 Expired / Lapsed US ⏱️ 0.0 years remaining

Compression of digital ink

Assignee: Motorola Solutions Inc
•
Filing: 2000-12-20
•
Granted: 2003-04-15
•
Expires: 2020-12-20
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Compression of digital ink is achieved by calculating second order differences between consecutive elements in the digital ink and applying the differences to a Huffman encoder to produce a compressed bitstream. For digital ink that is not highly correlated, compression may be achieved by representing segments of the digital ink by mathematical shapes such as a Bezier curve or orthogonal elements and transmitting the shape instead of the digital ink.

Inventors

  • 👤 Manjirnath Chatterjee

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-03 10:03
CPC Classifications
H; H04; H04L; H04L69/00; H04L69/04; G; G06; G06V; G06V10/00; G06V10/20; G06V30/00; G06V30/10; G06V30/14; G06V30/142; G06V30/1423

Claims Analysis

Total Claims: 34
Claim 1
Independent Claim 73 words
A method for lossless compression of digital ink, comprising the steps of: (a) subdividing digital ink comprising a plurality of digital ink strokes into digital ink points comprising coordinates; (b) separating the digital ink points comprising coordinates into separate coordinate arrays comprising array elements; (c) computing second order differences between consecutive array elements in each coordinate array; and (d) applying the second order differences to a Huffman encoder to generate a compressed bitstream.
Claim 2
Independent Claim 73 words
A method for lossless compression of digital ink, comprising the steps of: (a) subdividing digital ink comprising a plurality of digital ink strokes into digital ink points comprising coordinates; (b) separating the digital ink points comprising coordinates into separate coordinate arrays comprising array elements; (c) computing second order differences between consecutive array elements in each coordinate array; and (d) applying the second order differences to a Huffman encoder to generate a compressed bitstream.
Claim 3
Dependent Claim 18 words
The method of claim 1 wherein the coordinates are X-axis and Y-axis values representing coordinates of a display.
Claim 4
Dependent Claim 26 words
The method of claim 2 wherein the coordinates further include a time value representing a moment in time when the point was entered on the display.
Claim 5
Dependent Claim 54 words
The method of claim 1 wherein the step of separating further comprises the steps of: obtaining a X-axis coordinate for each digital ink point and storing the X-axis coordinate in a X-axis coordinate array; and obtaining a Y-axis coordinate for each digital ink point and storing the Y-axis coordinate in a Y-axis coordinate array.
Claim 6
Dependent Claim 29 words
The method of claim 4 further comprising the step of obtaining a T-axis coordinate for each digital ink point and storing the T-axis coordinate in a T-axis coordinate array.
Claim 7
Dependent Claim 66 words
The method of claim 1 wherein the step of computing second order differences further comprises the steps of: (a) subtracting consecutive elements in each coordinate array to calculate a first order difference; (b) storing each first order difference in an array of first order differences comprising array elements; and (c) subtracting consecutive elements in the array of first order differences to calculate a second order difference.
Claim 8
Dependent Claim 15 words
The method of claim 6 wherein the coordinate array comprises X-axis, Y-axis, and T-axis elements.
Claim 9
Dependent Claim 83 words
The method of claim 1 wherein the step of computing second order differences further comprises the steps of: (a) computing the maximum number of bits to store the first two elements in each coordinate array; (b) obtaining three consecutive elements, termed A, B, and C, in each coordinate array; (c) computing a second order difference from the equation C−2B+A from the three consecutive elements; and (d) collecting the maximum number of bits to store the first two elements and the second order difference.
Claim 10
Dependent Claim 14 words
The method of claim 8 wherein the coordinates include X-axis, Y-axis, and T-axis elements.
Claim 11
Dependent Claim 56 words
The method of claim 1 wherein the step of subdividing further comprises the steps of: (a) locating points in digital ink for segments that may be represented by shapes in an alphabet; (b) representing the points as shape segments; and (c) transmitting the representation of the shape used to represent the points in the digital ink.
Claim 12
Independent Claim 63 words
A method for lossless decompression of digital ink, comprising the steps of: (a) applying a compressed bitstream to a Huffman decoder to generate second order differences; (b) computing consecutive array elements from the second order differences; (c) combining array elements to form digital ink points; and (d) joining the digital ink points to form digital ink comprising a plurality of digital ink strokes.
Claim 13
Independent Claim 63 words
A method for lossless decompression of digital ink, comprising the steps of: (a) applying a compressed bitstream to a Huffman decoder to generate second order differences; (b) computing consecutive array elements from the second order differences; (c) combining array elements to form digital ink points; and (d) joining the digital ink points to form digital ink comprising a plurality of digital ink strokes.
Claim 14
Dependent Claim 22 words
The method of claim 11 wherein the digital ink points are represented by X-axis and Y-axis coordinates representing coordinates of a display.
Claim 15
Dependent Claim 28 words
The method of claim 12 wherein the digital ink points further include a time coordinate representing a moment in time when the point was entered on the display.
Claim 16
Dependent Claim 41 words
The method of claim 11 wherein the step of computing consecutive array elements further comprises the steps of: (d) adding consecutive second order differences to calculate first order differences; and (e) adding consecutive first order differences to calculate consecutive array elements.
Claim 17
Dependent Claim 44 words
The method of claim 11 wherein the step of combining further comprises the steps of obtaining an array element from an array of X-axis coordinates and obtaining an array element from an array of Y-axis coordinates to form a digital ink point comprising coordinates.
Claim 18
Dependent Claim 30 words
The method of claim 15 further comprising the step of obtaining an array element from an array of T-axis coordinates to form a digital ink point comprising a time value.
Claim 19
Independent Claim 105 words
A method for lossless compression of digital ink, comprising the steps of: (a) separating each stroke in the digital ink into digital ink points; (b) separating each digital ink point into X-axis and Y-axis elements; (c) collating each X-axis element into an X-axis array and collating each Y-axis element into a Y-axis array; (d) calculating the maximum number of bits to represent the first two elements in the X-axis and Y-axis arrays, respectively; (e) calculating second order differences for each remaining element in the X-axis and Y-axis arrays, respectively; and (f) applying the second order differences to a Huffman encoder to generate a compressed bitstream.
Claim 20
Independent Claim 105 words
A method for lossless compression of digital ink, comprising the steps of: (a) separating each stroke in the digital ink into digital ink points; (b) separating each digital ink point into X-axis and Y-axis elements; (c) collating each X-axis element into an X-axis array and collating each Y-axis element into a Y-axis array; (d) calculating the maximum number of bits to represent the first two elements in the X-axis and Y-axis arrays, respectively; (e) calculating second order differences for each remaining element in the X-axis and Y-axis arrays, respectively; and (f) applying the second order differences to a Huffman encoder to generate a compressed bitstream.
Claim 21
Independent Claim 71 words
A method for lossless decompression of digital ink, comprising the steps of: (a) applying a compressed bitstream to a Huffman decoder to generate second order differences; (b) calculating X-axis and Y-axis array elements for X-axis and Y-axis arrays, respectively; (c) separating X-axis and Y-axis elements into X-axis and Y-axis arrays, respectively; (d) combining X-axis and Y-axis elements into digital ink points; and (e) combining digital ink points into digital ink strokes.
Claim 22
Independent Claim 71 words
A method for lossless decompression of digital ink, comprising the steps of: (a) applying a compressed bitstream to a Huffman decoder to generate second order differences; (b) calculating X-axis and Y-axis array elements for X-axis and Y-axis arrays, respectively; (c) separating X-axis and Y-axis elements into X-axis and Y-axis arrays, respectively; (d) combining X-axis and Y-axis elements into digital ink points; and (e) combining digital ink points into digital ink strokes.
Claim 23
Independent Claim 86 words
A device for compression of digital ink, comprising: (a) a display interface comprising capture means for retrieving digital ink; (b) an analog to digital converter that translates captured digital ink into digital ink points comprising coordinates; (c) a digital processor which separates the coordinates into coordinate arrays (d) a difference analyzer to compute the offset between coordinates in each coordinate array to produce second order differences; and (e) a Huffman encoder generating a histogram of occurrences of the second order differences to produce an encoded bitstream.
Claim 24
Independent Claim 86 words
A device for compression of digital ink, comprising: (a) a display interface comprising capture means for retrieving digital ink; (b) an analog to digital converter that translates captured digital ink into digital ink points comprising coordinates; (c) a digital processor which separates the coordinates into coordinate arrays (d) a difference analyzer to compute the offset between coordinates in each coordinate array to produce second order differences; and (e) a Huffman encoder generating a histogram of occurrences of the second order differences to produce an encoded bitstream.
Claim 25
Dependent Claim 18 words
The device of claim 19 wherein the coordinates are X-axis and Y-axis values representing coordinates of a display.
Claim 26
Dependent Claim 26 words
The device of claim 19 wherein the coordinates further include a time value representing a moment in time when the point was entered on the display.
Claim 27
Independent Claim 24 words
The device of 19 further includes a bitstream processor that encapsulates the encoded bitstream into a data packet for transmitting to a remote computer.
Claim 28
Independent Claim 24 words
The device of 19 further includes a bitstream processor that encapsulates the encoded bitstream into a data packet for transmitting to a remote computer.
Claim 29
Independent Claim 81 words
A device for decompression of digital ink, comprising: (a) a Huffman decoder which takes an encoded bitstream to produce a histogram of occurrences of second order differences; (b) a summation analyzer to compute coordinates from the second order differences; (c) a digital processor to form digital ink comprising coordinates; (d) a digital to analog converter that translates digital ink comprising coordinates into digital ink points; and (e) a display interface comprising means for presenting the digital ink points on a display.
Claim 30
Independent Claim 81 words
A device for decompression of digital ink, comprising: (a) a Huffman decoder which takes an encoded bitstream to produce a histogram of occurrences of second order differences; (b) a summation analyzer to compute coordinates from the second order differences; (c) a digital processor to form digital ink comprising coordinates; (d) a digital to analog converter that translates digital ink comprising coordinates into digital ink points; and (e) a display interface comprising means for presenting the digital ink points on a display.
Claim 31
Dependent Claim 18 words
The device of claim 23 wherein the coordinates are X-axis and Y-axis values representing coordinates of a display.
Claim 32
Dependent Claim 26 words
The device of claim 23 wherein the coordinates further include a time value representing a moment in time when the point was entered on the display.
Claim 33
Independent Claim 22 words
The device of 23 further includes a bitstream processor that retrieves an encoded bitstream with compressed digital ink from a remote computer.
Claim 34
Independent Claim 22 words
The device of 23 further includes a bitstream processor that retrieves an encoded bitstream with compressed digital ink from a remote computer.

References Cited (Backward Citations)

US5392447A Cited
US5926567A Cited
US5696563A Cited
US5610995A Cited
US5751860A Cited
US5920647A Cited
US6373974B2 Cited
US6011873A Cited
US6373411B1 Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2006-04-14 2006-10-14 2007-04-15 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2010-04-14 2010-10-14 2011-04-15 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2014-04-14 2014-10-14 2015-04-15 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag