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

Method of isomorphic singular manifold projection and still/video imagery compression

Assignee: United California Bank
•
Filing: 1997-07-28
•
Granted: 2000-12-26
•
Expires: 2017-07-28
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Methods and apparatuses for still image compression, video compression and automatic target recognition are disclosed. The method of still image compression uses isomorphic singular manifold projection whereby surfaces of objects having singular manifold representations are represented by best match canonical polynomials to arrive at a model representation. The model representation is compared with the original representation to arrive at a difference. If the difference exceeds a predetermined threshold, the difference data are saved and compressed using standard lossy compression. The coefficients from the best match polynomial together with the difference data, if any, are then compressed using lossless compression. The method of motion estimation for enhanced video compression sends I frames on an "as-needed" basis, based on comparing the error between segments of a current frame and a predicted frame. If the error exceeds a predetermined threshold, which can be based on program content, the next frame sent will be an I frame. The method of automatic target recognition (ATR) including tracking, zooming, and image enhancement, uses isomorphic singular manifold projection to separate texture and sculpture portions of an image. Soft ATR is then used on the sculptured portion and hard ATR is used on the texture portion.

Inventors

  • 👤 Andrew Kostrzewski
  • 👤 Igor Ternovskiy
  • 👤 Tomasz P. Jannson

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-27 07:33
CPC Classifications
G; G06; G06T; G06T9/00; G06T9/001; H; H04; H04N; H04N19/00; H04N19/10; H04N19/169

Claims Analysis

Total Claims: 33
Claim 1
Independent Claim 88 words
A method of compressing video, said method comprising the steps of: determining an actual error between corresponding blocks of a current frame and a predicted frame corresponding to the current frame; repeating said determining step for a successive pair of the corresponding blocks; accumulating the actual errors to generate an accumulated error; inserting an I-frame as the next subsequent frame after the current frame if said accumulated error exceeds a predetermined threshold; and repeating said first repeating, accumulating and inserting steps until said accumulated error exceeds said threshold.
Claim 2
Independent Claim 88 words
A method of compressing video, said method comprising the steps of: determining an actual error between corresponding blocks of a current frame and a predicted frame corresponding to the current frame; repeating said determining step for a successive pair of the corresponding blocks; accumulating the actual errors to generate an accumulated error; inserting an I-frame as the next subsequent frame after the current frame if said accumulated error exceeds a predetermined threshold; and repeating said first repeating, accumulating and inserting steps until said accumulated error exceeds said threshold.
Claim 3
Independent Claim 134 words
A method of compressing video, said method comprising the steps of: taking a frame F 0 of the video; predicting a subsequent frame based on said frame F 0 and segmenting the predicted frame into search blocks; taking an input frame F 1 of the video, and segmenting the input frame F 1 into search blocks corresponding to the search blocks of said predicted frame; determining an actual error between corresponding search blocks of the input frame F 1 and the predicted frame; accumulating the actual errors of different ones of the corresponding search blocks on a block-by-block basis to generate an accumulated error; and comparing, after each accumulation of the errors, the accumulated error to a threshold and inserting an I-frame as the next subsequent frame if the accumulated error exceeds said threshold.
Claim 4
Independent Claim 134 words
A method of compressing video, said method comprising the steps of: taking a frame F 0 of the video; predicting a subsequent frame based on said frame F 0 and segmenting the predicted frame into search blocks; taking an input frame F 1 of the video, and segmenting the input frame F 1 into search blocks corresponding to the search blocks of said predicted frame; determining an actual error between corresponding search blocks of the input frame F 1 and the predicted frame; accumulating the actual errors of different ones of the corresponding search blocks on a block-by-block basis to generate an accumulated error; and comparing, after each accumulation of the errors, the accumulated error to a threshold and inserting an I-frame as the next subsequent frame if the accumulated error exceeds said threshold.
Claim 5
Dependent Claim 34 words
The invention as defined in claim 2, further comprising the steps of segmenting the frame F 0 into microblocks within said search blocks and normalizing the error by dividing by the number of microblocks.
Claim 6
Dependent Claim 15 words
The method as defined in claim 2, wherein said threshold is based upon video content.
Claim 7
Dependent Claim 26 words
The method as defined in claim 2, wherein said I frame is inserted in place of said frame F 0 if said error exceeds said threshold.
Claim 8
Dependent Claim 27 words
The method as defined in claim 2, further comprising the step of dynamically changing the compression ratio on a frame by frame basis based upon said error.
Claim 9
Dependent Claim 28 words
The invention as defined in claim 6, wherein one of a genetic algorithm, neural network, and fuzzy logic are used to determine the necessary change in compression ratio.
Claim 10
Independent Claim 125 words
A method of compressed video transmission, the method comprising the steps of: taking a first frame F 0 ; segmenting said frame F 0 into blocks; compressing each said block by representing it with a canonical polynomial having original coefficients; predicting a frame P corresponding to said frame F 0 ; determining an error between each block in said frame F 0 and a corresponding block of said predicted frame P; accumulating the error determined between each block in said frame F 0 and said corresponding block of predicted frame P; and comparing, after accumulating each error, the accumulated error to a threshold and if the accumulated error exceeds said threshold, inserting an I-frame as the next subsequent frame to said frame F 0 .
Claim 11
Independent Claim 125 words
A method of compressed video transmission, the method comprising the steps of: taking a first frame F 0 ; segmenting said frame F 0 into blocks; compressing each said block by representing it with a canonical polynomial having original coefficients; predicting a frame P corresponding to said frame F 0 ; determining an error between each block in said frame F 0 and a corresponding block of said predicted frame P; accumulating the error determined between each block in said frame F 0 and said corresponding block of predicted frame P; and comparing, after accumulating each error, the accumulated error to a threshold and if the accumulated error exceeds said threshold, inserting an I-frame as the next subsequent frame to said frame F 0 .
Claim 12
Dependent Claim 20 words
A method as defined in claim 8 wherein said I frame was previously compressed by representing it with canonical polynomials.
Claim 13
Independent Claim 247 words
A method of compressed video transmission, the method comprising the steps of: taking a first frame F 0 ; segmenting said frame F 0 into blocks; compressing each said block by representing it with a canonical polynomial having original coefficients; predicting a frame P corresponding to said frame F 0 based on a frame prior to F 0 ; comparing each block in said frame F 0 with said predicted frame P to determine if there is a match; if a match is found in said frame P for a block in said frame F 0 , sending said coefficients of said polynomial for that block to a decoder; if a match is not found for a block in said frame F 0 , generating new coefficients of said polynomial representing said predicted frame P and sending said new coefficients to said decoder; reconstructing said frame F 0 in said decoder from said original coefficients and said new coefficients sent to said decoder; calculating an error between said frame F 0 and said predicted frame P based on said comparing each block in said frame F 0 with a corresponding block of said predicted frame P; comparing said error to a threshold; if said error does not exceed said threshold, sending a B or P frame as the next subsequent frame to said frame F 0 ; if said error exceeds said threshold, inserting an I-frame as the next subsequent frame to said frame F 0 .
Claim 14
Independent Claim 247 words
A method of compressed video transmission, the method comprising the steps of: taking a first frame F 0 ; segmenting said frame F 0 into blocks; compressing each said block by representing it with a canonical polynomial having original coefficients; predicting a frame P corresponding to said frame F 0 based on a frame prior to F 0 ; comparing each block in said frame F 0 with said predicted frame P to determine if there is a match; if a match is found in said frame P for a block in said frame F 0 , sending said coefficients of said polynomial for that block to a decoder; if a match is not found for a block in said frame F 0 , generating new coefficients of said polynomial representing said predicted frame P and sending said new coefficients to said decoder; reconstructing said frame F 0 in said decoder from said original coefficients and said new coefficients sent to said decoder; calculating an error between said frame F 0 and said predicted frame P based on said comparing each block in said frame F 0 with a corresponding block of said predicted frame P; comparing said error to a threshold; if said error does not exceed said threshold, sending a B or P frame as the next subsequent frame to said frame F 0 ; if said error exceeds said threshold, inserting an I-frame as the next subsequent frame to said frame F 0 .
Claim 15
Dependent Claim 24 words
The method as defined in claim 10, further comprising the steps of replacing said original coefficients, and said new coefficients with an I frame.
Claim 16
Independent Claim 148 words
A method of compressing a video image, said method comprising the steps of: taking a frame F 0 ; segmenting F 0 into blocks and defining motion vectors for said blocks to predict a subsequent frame P comprising a plurality of blocks; taking a subsequent frame F 1 of the video corresponding to said predicted frame P and segmenting F 1 into blocks corresponding to said blocks of said predicted frame; defining an actual error between each said block in said frame F 1 and said corresponding block in said frame P; accumulating the actual errors one error at a time to generate an accumulated error; based on said accumulated error, sending an I-frame as the next subsequent frame to said frame F 0 ; and repeating said defining, accumulating and sending steps for each corresponding pair of blocks of said frame F 1 and said frame P.
Claim 17
Independent Claim 148 words
A method of compressing a video image, said method comprising the steps of: taking a frame F 0 ; segmenting F 0 into blocks and defining motion vectors for said blocks to predict a subsequent frame P comprising a plurality of blocks; taking a subsequent frame F 1 of the video corresponding to said predicted frame P and segmenting F 1 into blocks corresponding to said blocks of said predicted frame; defining an actual error between each said block in said frame F 1 and said corresponding block in said frame P; accumulating the actual errors one error at a time to generate an accumulated error; based on said accumulated error, sending an I-frame as the next subsequent frame to said frame F 0 ; and repeating said defining, accumulating and sending steps for each corresponding pair of blocks of said frame F 1 and said frame P.
Claim 18
Independent Claim 93 words
A method of video compression utilizing motion estimation comprising the steps of: (a) comparing a segment of the current frame to be encoded to a corresponding segment of the previous frame to arrive at an error difference; (b) repeating the calculation of Step (a) until error differences have been determined for all segments of the frame; (c) summing said error differences to arrive at a cumulative error difference for that frame; (d) comparing said cumulative error difference to a threshold and inserting a new I frame if said cumulative error exceeds said threshold.
Claim 19
Independent Claim 93 words
A method of video compression utilizing motion estimation comprising the steps of: (a) comparing a segment of the current frame to be encoded to a corresponding segment of the previous frame to arrive at an error difference; (b) repeating the calculation of Step (a) until error differences have been determined for all segments of the frame; (c) summing said error differences to arrive at a cumulative error difference for that frame; (d) comparing said cumulative error difference to a threshold and inserting a new I frame if said cumulative error exceeds said threshold.
Claim 20
Dependent Claim 32 words
The method of claim 13 further comprising adjusting the compression ratio on a frame by frame basis based on feedback and further using such feedback to change parameters of the compression engine.
Claim 21
Dependent Claim 26 words
The method of claim 13 further comprising lowering bandwidth by increasing the compression ratio based on feedback indicating that there is a high bit error rate.
Claim 22
Dependent Claim 27 words
The method of claim 14 wherein the change in compression ratio and bandwidth are determined by one of, a genetic algorithm, a neural network and fuzzy logic.
Claim 23
Dependent Claim 32 words
The method of claim 13 further comprising the step of presetting said threshold based upon the program content or type of video images to be compressed such as action, documentary, or nature.
Claim 24
Independent Claim 66 words
A method of video compression, said method comprising the steps of: deriving a plurality of errors between microblocks in a current frame of video and corresponding microblocks in a predicted frame; accumulating said errors to generate an accumulated error; comparing said accumulated error to a threshold after each said error is added to said accumulated error; and sending an I frame when said threshold is exceeded.
Claim 25
Independent Claim 66 words
A method of video compression, said method comprising the steps of: deriving a plurality of errors between microblocks in a current frame of video and corresponding microblocks in a predicted frame; accumulating said errors to generate an accumulated error; comparing said accumulated error to a threshold after each said error is added to said accumulated error; and sending an I frame when said threshold is exceeded.
Claim 26
Dependent Claim 21 words
The method of claim 18 further comprising sending the I frame as the current frame so as to replace error data.
Claim 27
Dependent Claim 33 words
The method of claim 18 wherein the threshold is varied in accordance with statistical information of the video based on program content such as the number of cuts, the amount of action, etc.
Claim 28
Dependent Claim 14 words
The method of claim 18 further comprising varying said threshold by using genetic algorithms.
Claim 29
Dependent Claim 14 words
The method of claim 18 further comprising varying said threshold by using fuzzy logic.
Claim 30
Independent Claim 83 words
A method of video compression, said method comprising the steps of: deriving a plurality of errors between microblocks in a current frame of video and corresponding microblocks in a predicted frame; accumulating said errors to generate an accumulated error; comparing said accumulated error to a threshold after each said error is added to said accumulated error; sending an I frame when said threshold is exceeded; and applying spatial hypercompression utilizing isomorphic singular manifold representations to each I frame inserted into the video bitstream.
Claim 31
Independent Claim 83 words
A method of video compression, said method comprising the steps of: deriving a plurality of errors between microblocks in a current frame of video and corresponding microblocks in a predicted frame; accumulating said errors to generate an accumulated error; comparing said accumulated error to a threshold after each said error is added to said accumulated error; sending an I frame when said threshold is exceeded; and applying spatial hypercompression utilizing isomorphic singular manifold representations to each I frame inserted into the video bitstream.
Claim 32
Independent Claim 192 words
A method of compressing video, said method comprising the steps of: (a) calculating the actual error between a first block of a current frame and a corresponding block of a predicted frame; (b) storing the calculated actual error as a first block actual error; (c) calculating the actual error between a second block of the current frame and a corresponding block of the predicted frame to create a second block actual error; (d) adding the second block actual error to the stored first block actual error to create an accumulated actual block error; (e) calculating the actual error between a subsequent block of the current frame and a corresponding block of the predicted frame to create a subsequent block error; (f) adding the subsequent block actual error to the accumulated actual block error to create a new accumulated actual block error; (g) repeating steps (e) and (f) with respect to each additional subsequent block of the current frame, one at a time, until the accumulated actual error exceeds a predetermined threshold; and (h) inserting an I-frame if the accumulated actual block error or the new accumulated actual block error exceeds the threshold.
Claim 33
Independent Claim 192 words
A method of compressing video, said method comprising the steps of: (a) calculating the actual error between a first block of a current frame and a corresponding block of a predicted frame; (b) storing the calculated actual error as a first block actual error; (c) calculating the actual error between a second block of the current frame and a corresponding block of the predicted frame to create a second block actual error; (d) adding the second block actual error to the stored first block actual error to create an accumulated actual block error; (e) calculating the actual error between a subsequent block of the current frame and a corresponding block of the predicted frame to create a subsequent block error; (f) adding the subsequent block actual error to the accumulated actual block error to create a new accumulated actual block error; (g) repeating steps (e) and (f) with respect to each additional subsequent block of the current frame, one at a time, until the accumulated actual error exceeds a predetermined threshold; and (h) inserting an I-frame if the accumulated actual block error or the new accumulated actual block error exceeds the threshold.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2003-12-26 2004-06-26 2004-12-26 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2007-12-26 2008-06-26 2008-12-26 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2011-12-26 2012-06-26 2012-12-26 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag