Video compression system and method using differencing and clustering

• US 9,071,818 B2
• Filed: 08/30/2011
• Issued: 06/30/2015
• Est. Priority Date: 08/30/2011
• Status: Active Grant

• Current Assignee: Hendricks Corp. Pte. Ltd.
• Original Assignee: Organizational Strategies International Pte. Ltd.
• Inventors: Morris, Mark
• Primary Examiner(s): Goodarzi, Nasser
• Assistant Examiner(s): PIERORAZIO, MICHAEL
• Application Number:
  US13/220,812
• Publication Number:
  US 20130051476A1
• Time in Patent Office: 1,400 Days
• Field of Search: 725/95, 382/199, 709/225
• US Class Current: 1/1
• CPC Class Codes: H04N 19/132 Sampling, masking or truncation of coding units, e.g. adaptive resampling, frame skipping, frame interpolation or high-frequency transform coefficient masking
• CPC Class Codes: H04N 19/137 Motion inside a coding unit, e.g. average field, frame or block difference
• CPC Class Codes: H04N 19/182 the unit being a pixel
• CPC Class Codes: H04N 19/20 using video object coding

Abstract

A video compression system and method to isolate and capture video data for video compression, thereby eliminating the need for motion vectors and blocks. When data is captured from a video input device, such as a video camera, the data is captured and isolated into clusters of difference image data. The clusters are then scanned, filled, marked, split and blended in in order to compress the video data.

Claims

1. A method for compressing video data in a network system, comprising:

receiving a current video frame from a video input;

calculating differences between the current video frame and a previous video frame;

processing the calculated differences to capture and isolate distinct clusters of image data for compression;

determining unprocessed difference points in the clusters of image data, thereby eliminating use of motion vectors;

scanning the clusters of image data to locate outer rim nodes surrounding the cluster of image data; and

when the unprocessed difference points are found, marking the points as outer rim nodes surrounding the cluster of image data, and when all of the unprocessed difference points have been found, compressing outer rim data representing the outer rim nodes.

2. The system for sharing secure information according to claim 1, further comprising:

eliminating redundant rim nodes;

scanning along an interior of the outer rim nodes to detect adjacent internal rims;

scanning the outer rim nodes and adjacent rim nodes to locate unfilled internal points;

recursively filling unfilled internal points and color capture; and

locating floating internal rims using the recursive fill.

3. The method according to claim 1, further comprising:

placing a sum of the current video frame and a future video frame captured colors in blocks;

placing a difference of the current video frame and the future video frame capture colors in blocks; and

compressing the blocks.

4. A non-transitory computer readable medium storing a program for compressing video data in a network system, the network system including a computer receiving a current video frame, the program executable by the computer and comprising:

calculating differences between the current video frame and a previous video frame;

processing the calculated differences to capture and isolate distinct clusters of image data for compression;

determining unprocessed difference points in the clusters of image data, thereby eliminating use of motion vectors;

scanning the clusters of image data to locate outer rim nodes surrounding the cluster of image data; and

when the unprocessed difference points are found, marking the points as outer rim nodes surrounding the cluster of image data, and when all of the unprocessed difference points have been found, compressing outer rim data representing the outer rim nodes.

5. The method according to claim 4, further comprising:

eliminating redundant rim nodes;

scanning along an interior of the outer rim nodes to detect adjacent internal rims;

scanning the outer rim nodes and adjacent rim nodes to locate unfilled internal points;

recursively filling unfilled internal points and color capture; and

locating floating internal rims using the recursive fill.

6. The method according to claim 4, further comprising:

placing a sum of the current video frame and a future video frame captured colors in blocks;

placing a difference of the current video frame and the future video frame capture colors in blocks; and

compressing the blocks.

7. A network system for compressing video data in a network system, comprising:

a transmitter transmitting a current video frame;

a receiver receiving a current video frame from the transmitter; and

a processor;

calculating differences between the current video frame and a previous video frame;

processing the calculated differences to capture and isolate distinct clusters of image data for compression;

determining unprocessed difference points in the clusters of image data, thereby eliminating use of motion vectors;

scanning the clusters of image data to locate outer rim nodes surrounding the cluster of image data; and

when the unprocessed difference points are found, marking the points as outer rim nodes surrounding the cluster of image data, and when all of the unprocessed difference points have been found, compressing outer rim data representing the outer rim nodes.

8. The system for sharing secure information according to claim 7, further comprising:

eliminating redundant rim nodes;

scanning along an interior of the outer rim nodes to detect adjacent internal rims;

scanning the outer rim nodes and adjacent rim nodes to locate unfilled internal points;

recursively filling unfilled internal points and color capture; and

locating floating internal rims using the recursive fill.

9. The method according to claim 7, further comprising:

placing a sum of the current video frame and a future video frame captured colors in blocks;

placing a difference of the current video frame and the future video frame capture colors in blocks; and

compressing the blocks.