USPatent applicationPatented

Polymorphic codec system and method

Granted 12 Jun 2012 · 1 office action

Life of the application

9 dated events
⤢ drag to zoom200520102015202020252030ProsecutionOwnershipTerm & fees
ProsecutionOwnershipTerm & feeshover for detail · click to open

Abstract

An input module obtains a media signal to be communicated to a destination system, after which an identification module identifies a plurality of segments within the media signal. A codec includes a selection module that automatically selects different compression methods to respectively compress at least two of the segments. The compression methods are automatically selected to produce a highest compression quality for the respective segments according to a set of criteria without exceeding a target data rate. A compression module within the codec then compresses the segments using the automatically-selected compression methods, after which an output module delivers the compressed segments to the destination system with an indication of which compression method was used to compress each segment.

Description

9 parts
›CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 10/784,754, filed Feb. 23, 2004, now U.S. Pat. No. 7,457,358 issued on Nov. 25, 2008, which is a continuation-in-part of U.S. patent application Ser. No. 10/256,866, filed Sep. 26, 2002, now U.S. Pat. No. 7,259,608 issued on Nov. 13, 2007, which claims the benefit of Provisional Application No. 60/325,483, filed Sep. 26, 2001. U.S. patent application Ser. No. 10/784,754 is also a continuation-in-part of U.S. patent application Ser. No. 10/692,106, filed Oct. 23, 2003, now U.S. Pat. No. 7,599,434 issued on Oct. 6, 2009. All of the foregoing related applications are incorporated herein by reference.

›TECHNICAL FIELD

The present invention relates generally to the field of data compression. More specifically, the present invention relates to techniques for optimizing data compression for video communication.

›BACKGROUND OF THE INVENTION

Conventionally, a codec uses a single type of algorithm to compress videos signals. For example, many codecs, such as MPEG, use discrete cosine transfer (DCT) algorithms, while others use fractal or wavelet algorithms. In some cases, a user may be able to select a particular codec, but once the choice is made, the selected codec is used throughout a communication session.

Certain algorithms result in better compression and/or transmission quality than others for media signals having particular characteristics. Unfortunately, the characteristics of a given media signal may vary substantially during a transmission. Thus, using a single codec to compress a media signal will often produce less than optimal results.

No existing system currently allows a single codec to use multiple compression algorithms, such as DCT, fractal, wavelet, or other algorithms, within the same transmission.

›BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of a conventional communication system using a codec for data compression;

FIG. 2 is a block diagram of a communication system using a polymorphic codec according to an embodiment of the invention;

FIG. 3 is a detailed block diagram of a source system according to a first embodiment of the invention;

FIG. 4 is a detailed block diagram of a source system according to a second embodiment of the invention;

FIG. 5 is a detailed block diagram of a selection module;

FIG. 6 is a data flow diagram of a process for automatically selecting a compression method within a polymorphic codec;

FIG. 7 is a detailed block diagram of an artificial intelligence system for selecting a compression method;

FIG. 8 is a table used by a comparison module to select a compression method based, in part, on licensing cost;

FIG. 9 is a block diagram of source system changing its target data rate; and

FIG. 10 is a data flow diagram of a process for automatically selecting different compression methods for different sub-frames.

›DETAILED DESCRIPTION · 1 of 5

Reference is now made to the figures in which like reference numerals refer to like or similar elements. For clarity, the first digit of a reference numeral indicates the figure number in which the corresponding element is first used.

In the following description, numerous specific details of programming, software modules, user selections, network transactions, database queries, database structures, etc., are provided for a thorough understanding of the embodiments of the invention. However, those skilled in the art will recognize that the invention can be practiced without one or more of the specific details, or with other methods, components, materials, etc.

In some cases, well-known structures, materials, or operations are not shown or described in detail in order to avoid obscuring aspects of the invention. Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.

FIG. 1 is a block diagram of a conventional system 100 for communicating media signals, such as audio and video signals, from a source system 102 to a destination system 104 . The source and destination systems 102 , 104 may be variously embodied, for example, as personal computers (PCs), cable or satellite set-top boxes (STBs), dedicated video conferencing systems, or video-enabled portable devices, such as personal digital assistants (PDAs) or cellular telephones.

Within the source system 102 , a video camera 106 or other device captures an original media signal 108 . A codec (compressor/decompressor) 110 processes the original media signal 108 using a particular compression method (algorithm) 111 to create a compressed media signal 112 . General classifications of compression methods 111 include discrete cosine transform (DCT) methods, fractal methods, and wavelet methods. Those of skill in the art, however, will recognize that a wide variety of compression methods may be used.

The compressed media signal 112 may be delivered to the destination system 104 via a network 114 , such as a local area network (LAN) or the Internet. Alternatively, the compressed media signal 112 may be written to a storage medium, such as a CD, DVD, flash memory device, or the like.

At the destination system 104 , the same or a similar codec 110 processes the compressed media signal 112 method received through the network 114 using a corresponding decompression method 115 to generate a decompressed media signal 116 . The destination system 104 then presents the decompressed media signal 116 on a display device 118 , such as a television, computer monitor, or the like.

Conventionally, the codec 110 uses a single compression method 111 to process the entire media signal 108 during a communication session or for a particular storage medium. However, as noted above, a media signal is not a static quantity. Video signals may change substantially from scene to scene. A single compression method 111 , which may function well under certain conditions, may not fare so well under different conditions. Changes in available bandwidth, line conditions, or characteristics of the media signal, itself, may drastically change the compression quality to the point that a different compression method 111 may do much better.

In certain cases, a video engineer may be able to manually specify a change of codec 110 within a media signal 108 where, for instance, the content developer knows that one codec 110 may be superior to another codec 110 . However, this requires significant human effort and cannot be performed in real time.

FIG. 2 is a block diagram of a system 200 for communicating media signals from a source system 202 to a destination system 204 according to an embodiment of the present invention. As before, the source system 202 receives an original media signal 108 captured by a video camera 106 or other suitable device.

However, unlike the system 100 of FIG. 1 , the depicted system 200 is not limited to using a codec 110 with a single compression method 111 . Rather, each scene 206 or segment of the original media signal 108 may be compressed using one of a plurality of compression methods 111 of a polymorphic codec 208 . As explained below, the polymorphic codec 208 is capable of changing its form during a communication session to use potentially different compression methods 111 for each scene 206 .

A scene 206 may include one or more “frames” of the original media signal 108 . A frame is generally defined as a single image in a sequence of images. As used herein, a scene 206 may correspond to a fixed segment of the media signal 108 , e.g., two seconds of video or a fixed number of frames. In other embodiments, a scene 206 may be defined by characteristics of the original media signal 108 , i.e., a scene 206 may include two or more frames sharing similar characteristics.

As illustrated, four scenes 206 within the same media signal 108 may be compressed using four automatically-selected compression methods 111 a - d . The compression methods 111 a - d may be of various types known to those of skill in the art, e.g., DCT, fractal, wavelet, and the like.

Unlike conventional systems 100 , the system 200 of FIG. 2 automatically selects, from the available compression methods 111 , a particular method 111 best suited to compressing each scene 206 . Details of the selection process are described in greater detail below. Briefly, however, the system 200 records which compression methods 111 are used for scenes 206 having particular characteristics. If a subsequent scene 206 is determined to have the same characteristics, the same compression method 111 is used. However, if a scene 206 is found to have substantially different characteristics from those previously observed, the system 200 tests various compression methods 111 on the scene 206 and selects the method 111 producing the highest compression quality (i.e., how similar the compressed media signal 210 is to the original signal 108 after decompression) for a particular target data rate.

›DETAILED DESCRIPTION · 2 of 5

In addition, the source system 202 reports to the destination system 204 which compression method 111 was used to compress each scene 206 . As illustrated, this may be accomplished by associating method identifiers 209 with each scene 206 in the resulting compressed media signal 210 . The method identifiers 209 may precede each scene 206 , as shown, or could be sent as a block at some point during the transmission. The precise format of the method identifiers 209 is not crucial to the invention and may be implemented using standard data structures known to those of skill in the art.

The destination system 204 uses the method identifiers 209 to select the corresponding decompression methods 115 for decompressing the respective scenes 206 . The resulting decompressed media signal 116 may then be presented on the display device 118 , as previously described.

FIG. 3 illustrates additional details related to the source system 202 . In one embodiment, an input module 302 receives the original media signal 108 from the video camera 106 or other source device. An identification module 304 divides the original media signal 108 into scenes 206 and identifies various characteristics of each scene 206 , as described in greater detail below.

Thereafter, for each scene 206 , a selection module 306 selects the optimal compression method 111 for the scene 206 based on the characteristics or through a process of testing various compression methods 111 . As used herein, “optimal” means producing the highest compression quality for the compressed media signal 210 at a particular target data rate among the available compression methods 111 for the polymorphic codec 208 .

In one embodiment, a user may specify a particular target data rate, i.e., 128 kilobits per second (kbps), which may be selected, for instance, from a menu or the like. Alternatively, the target data rate may be automatically determined from the type of network 114 , the type of destination system 204 , etc.

The polymorphic codec 208 may provide a wide variety of compression methods 111 . Examples of possible compression methods 111 for video are provided in Table 1. Additionally, various audio codecs may be provided, such as MPEG Audio Layer 3 (MP3), MPEG-4 Structured Audio (MP4-SA), CCITT u-Law, Ogg Vorbis, and AC3. Of course, other presently-available or yet-to-be-developed compression methods may be used within the scope of the invention.

Referring again to FIG. 3 , after a compression method 111 is selected for a scene 206 , a compression module 310 compresses the scene 206 using the selected compression method 111 of the polymorphic codec 208 . An output module 312 receives the resulting compressed media signal 210 and, in one embodiment, adds method identifiers 209 to indicate which compression method 111 was used to compress each scene 206 . In other embodiments, the method identifiers 209 may be added by the compression module 310 or at other points in the compression process. The output module 312 then delivers the compressed media signal 210 (with method identifiers 209 ) to the destination system 204 via the network 114 .

In one embodiment, the input module 302 and the selection module 306 may be components of the polymorphic codec 208 . This would allow the polymorphic codec 208 to appear to a video application as a standard codec 110 with a single compression method 111 , although multiple compression methods 111 would actually be used. Many video applications support plug-in codecs 110 , which would allow an existing application to be upgraded to implement the present invention by adding a plug-in polymorphic codec 208 .

Those of skill in the art will recognize that the embodiment of FIG. 3 is primarily applicable to streaming media applications, such as video conferencing. In an alternative embodiment, as depicted in FIG. 4 , the output module 312 may be coupled to a storage device 402 , such as CD or DVD recorder, flash card writer, or the like. As depicted, the compressed media signal 210 (and method identifiers 209 ) may be stored on an appropriate storage medium 404 , which is then physically delivered to the destination system 204 . In such an embodiment, the destination system 204 would include a media reader (not shown), such as a DVD-ROM drive, for reading the compressed media signal 210 from the storage medium 404 .

Unlike conventional media compression techniques, the original media signal 108 is not compressed using a single codec, such as MPEG-2 for DVDs. Rather, each scene 206 is automatically compressed using the best compression method 111 of a polymorphic codec 208 for that scene 206 . Using the above-described technique, between 10 to 12 hours of DVD-quality video may be stored on a single recordable DVD.

FIG. 5 illustrates additional details of the selection module 306 . As noted above, the identification module 304 receives the original media signal 108 and identifies individual scenes 206 , as well as characteristics 502 of each scene 206 . The characteristics 502 may include, for instance, motion characteristics, color characteristics, YUV signal characteristics, color grouping characteristics, color dithering characteristics, color shifting characteristics, lighting characteristics, and contrast characteristics. Those of skill in the art will recognize that a wide variety of other characteristics of a scene 206 may be identified within the scope of the invention.

Motion is composed of vectors resulting from object detection. Relevant motion characteristics may include, for example, the number of objects, the size of the objects, the speed of the objects, and the direction of motion of the objects.

With respect to color, each pixel typically has a range of values for red, green, blue, and intensity. Relevant color characteristics may include how the ranges of values change through the frame set, whether some colors occur more frequently than other colors (selection), whether some color groupings shift within the frame set, whether differences between one grouping and another vary greatly across the frame set (contrast).

›DETAILED DESCRIPTION · 3 of 5

In one embodiment, an artificial intelligence (AI) system 504 , such as a neural network or expert system, receives the characteristics 502 of the scene 206 , as well as a target data rate 506 for the compressed media signal 210 . The AI system 504 then determines whether a compression method 111 of the polymorphic codec 208 has previously been found to optimally compress a scene 206 with the given characteristics at the target data rate 506 . As explained below, the AI system 504 may be conceptualized as “storing” associations between sets of characteristics 502 and optimal compression methods 111 . If an association is found, the selection module 306 outputs the compression method 111 (or an indication thereof) as the “selected” compression method 111 .

In some cases, however, a scene 206 having the specified characteristics may not have been previously encountered. Accordingly, the selection module makes a copy of the scene 206 , referred to herein as a baseline snapshot 508 , which serves as a reference point for determining compression quality.

Thereafter, a compression module 510 tests different compression methods 111 of the polymorphic codec 208 on the scene 206 . In one embodiment, the compression module 510 is also the compression module 310 of FIG. 3 . As depicted, the compression module 510 compresses the scene 206 using different compression methods 111 at the target data rate 506 to produce multiple compressed test scenes 512 .

The compression methods 111 may be tested sequentially, at random, or in other ways, and all of the compression methods 111 need not be tested. In one embodiment, input from the AI system 504 may assist with selecting a subset of the compression methods 111 for testing. In some cases, a time limit may be imposed for testing in order to facilitate real-time compression. Thus, when the time limit is reached, no additional compressed test scenes 512 are generated.

In one embodiment, a comparison module 514 compares the compression quality of each compressed test scene 512 with the baseline snapshot 508 according to a set of criteria 516 . The criteria 516 may be based on a comparison of Peak Signal to Noise Ratios (PSNRs), which may be calculated, for an M×N frame, by:

where f is the original frame and f′ is the uncompressed frame.

Alternatively, Root Mean Square Error (RMSE), Signal to Noise Ratio (SNR), or other objective quality metrics may be used as known to those of skill in the art.

In certain embodiments, a Just Noticeable Difference (JND) image quality metric calculation may be used. JND is a robust objective picture quality measurement method known to those skilled in the art. It includes three dimensions for evaluation of dynamic and complex motion sequences—spatial analysis, temporal analysis and full color analysis. By using a model of the human visual system in a picture differencing process, JND produces results that are independent of the compression process and resulting artifacts.

In one embodiment, the comparison module 514 automatically selects the compression method 111 used to generate the compressed scene 512 that has the highest compression quality when compared to the baseline snapshot 508 according to the set of criteria 516 . That compression method 111 (or an indication thereof) is then output by the selection module 306 as the selected compression method 111 .

The comparison module 514 tells the AI system 504 which compression method 111 was selected for the scene 206 . This allows the AI system 504 to make an association between the identified characteristics 502 of the scene 206 and the selected compression method 111 . Thus, in the future, the AI system 504 may automatically select the compression method 111 for a similar scene 206 without the need for retesting by the comparison module 514 .

Referring also to FIG. 3 , in one configuration, the highest-quality compressed test scene 512 a is simply passed to the output module 312 (not shown) to be included in the compressed media signal 210 . However, the compression module 310 could recompress the scene 206 using the selected compression method 111 in certain embodiments.

In an alternative approach, the AI system 504 shown in FIG. 5 or its equivalent is not used. Rather, the selection module 306 may always test various compression methods 111 on each scene 206 and select the compression method 111 that produces the highest compression quality for a scene 206 without exceeding the target data rate 506 . In such an embodiment, the identification module 304 would not need to provide characteristics 502 of a scene 206 to the selection module 306 . Moreover, the selection module 306 may simply operate on fixed-sized segments of the media signal 108 .

FIG. 6 provides an example of the above-described processes. Suppose that the identification module 304 finds a scene 206 a having a particular set of characteristics 502 a . In one embodiment, the AI system 504 searches an association 602 between the characteristics 502 a and a particular compression method 111 . While the AI system 504 is depicted as including characteristics 502 , associations 602 , and compression methods 111 , those skilled in the art will recognize that these entities may be represented by various codes, hashes, or other identifiers.

Assuming that no such association 602 is found, a baseline snapshot 508 of the scene 206 a is taken. In addition, the compression module 510 compresses the scene 206 a at the target data rate 506 using a number of different compression methods 111 a - c of the polymorphic codec 208 to create a plurality of compressed test scenes 512 a - c . These test scenes 512 a - c are then compared against the baseline snapshot 508 according to a set of criteria 516 , e.g., PSNR.

Suppose that the compressed test scene 512 a produced by one compression method 111 a (“Codec 1”) results in the highest compression quality, e.g., the highest PSNR. In such a case, the comparison module 514 would inform the AI system 504 so that an association 602 could be made between the characteristics 502 a of the scene 206 a and the selected compression method 111 a . Thus, if a scene 206 having the same characteristics 502 a is encountered in the future, the AI system 504 could simply identify the optimal compression method 111 a without the need for retesting.

›DETAILED DESCRIPTION · 4 of 5

As further illustrated in FIG. 6 , the compression module 510 may concurrently test multiple compression methods 111 in a multiprocessing environment using multiple computer processors or CPUs (central processing units) 604 . For example, the illustrated compression methods 111 a - c (or multiple instances of the compression module 510 ) may execute within separate processing threads of a multiprocessing operating system (OS), such as UNIX®, Windows XP®, or the like. The OS may utilize any number of CPUs 604 . In one embodiment, a separate CPU 604 a - c is provided for each compression method 111 a - c to be tested at the same time. This ensures that an optimal compression method 111 for a scene 206 may be selected in real time.

Referring to FIG. 7 , the AI system 504 may be implemented using a typical feedforward neural network 700 comprising a plurality of artificial neurons 702 . A neuron 702 receives a number of inputs (either from original data, or from the output of other neurons in the neural network 700 ). Each input comes via a connection that has a strength (or “weight”); these weights correspond to synaptic efficacy in a biological neuron. Each neuron 702 also has a single threshold value. The weighted sum of the inputs is formed, and the threshold subtracted, to compose the “activation” of the neuron 702 (also known as the post-synaptic potential, or PSP, of the neuron 702 ). The activation signal is passed through an activation function (also known as a transfer function) to produce the output of the neuron 702 .

As illustrated, a typical neural network 700 has neurons 702 arranged in a distinct layered topology. The “input” layer 704 is not composed of neurons 702 , per se. These units simply serve to introduce the values of the input variables (i.e., the scene characteristics 502 ). Neurons 702 in the hidden 706 and output 708 layers are each connected to all of the units in the preceding layer.

When the network 700 is executed, the input variable values are placed in the input units, and then the hidden and output layer units are progressively executed. Each of them calculates its activation value by taking the weighted sum of the outputs of the units in the preceding layer, and subtracting the threshold. The activation value is passed through the activation function to produce the output of the neuron 702 . When the entire neural network 700 has been executed, the outputs of the output layer 708 act as the output of the entire network 700 (i.e., the selected compression method 111 ).

While a feedforward neural network 700 is depicted in FIG. 7 , those of skill in the art will recognize that other types of neural networks 700 may be used, such as feedback networks, Back-Propagated Delta Rule Networks (BP) and Radial Basis Function Networks (RBF). In other embodiments, an entirely different type of AI system 504 may be used, such as an expert system.

In still other embodiments, the AI system 504 may be replaced by lookup tables, databases, or other data structures that are capable of searching for a compression method 111 based on a specified set of characteristics 502 . Thus, the invention should not be construed as requiring an AI system 504 .

In one embodiment, as shown in FIG. 8 , the comparison module 514 may consider other factors in addition to (or in lieu of) compression quality in determining which compression method 111 to automatically select for a particular scene 206 . For instance, the use of certain compression methods 111 may incur licensing costs 802 based on patents or other intellectual property rights. The licensing costs 802 may be tied to the number of times the compression method 111 is used, the amount of data compressed using the compression method 111 , or in other ways.

While one compression method 111 may provide an exceptionally high compression quality (e.g., PSNR), its licensing cost 802 may exceed the value of the transmission and would not be cost justified. Indications of the licensing costs 802 for various compression methods 111 may be stored in a table or the like that is accessible to the comparison module 514 .

In one embodiment, the licensing costs 802 are considered only when a number of the best compression methods 111 produce similar results, e.g., the compression qualities differ by no more than a threshold amount. In the example of FIG. 8 , the first three compression methods 111 produce output of similar quality. However, the compression method 111 with the highest PSNR score is more than two times more expensive than the compression method 111 with the next highest PSNR score, which is, itself, almost three times more expensive than the compression method 111 with the third highest PSNR score. In one configuration, the comparison module 514 would select the compression method 111 with the third highest PSNR score due to its much lower licensing cost 802 .

In other embodiments, the comparison module 514 may create a composite score (not shown) based on the PSNR score, the licensing cost 802 , and other possible factors. In still other embodiments, the comparison module 514 may calculate an anticipated cost (not shown) for the entire transmission and seek to minimize that cost over all of the codec selection decisions. Hence, the comparison module 514 might select a more expensive compression method 111 for certain scenes 206 , where a substantial increase in quality is realized, while selecting less expensive compression methods 111 for other scenes 206 .

Referring to FIG. 10 , a user of the source system 202 may specify a particular target data rate 506 , e.g., 512 kbps, for video communication. However, there is no guarantee that the destination system 204 may be able to process data that quickly. Moreover, there is no guarantee that the network 114 will always provide the same amount of bandwidth. As a result, there may be a need to periodically change the target data rate 506 within the selection module 306 of the source system 202 , since the target data rate 506 will affect which compression methods 111 are selected for various scenes 206 .

›DETAILED DESCRIPTION · 5 of 5

For example, the destination system 204 may be embodied as a video-enabled cellular telephone. Typically, the bandwidth over cellular networks 114 is limited. Similarly, the processing power of a cellular telephone is substantially less than that of a personal computer or dedicated video conferencing system.

Thus, although the user of the source system 202 specifies a target data rate 506 of 512 kbps, the destination system 204 and/or network 114 may not be up to the challenge. In one embodiment, in response to receiving a connection request, the destination system 204 provides the source system 202 with a modified target data rate 902 , e.g., 128 kbps. The modified rate 902 may be communicated to the source system 202 using any standard data structure or technique. Thereafter, depending on the configuration, the target data rate 506 may be replaced by the modified rate 902 .

In certain embodiments, an actual data rate is not communicated. Rather, a message is sent specifying one or more constraints or capabilities of the destination system 204 or network 114 , in which case it would be up to the source system 202 to revise the target data rate 506 as appropriate. A technique of altering the target data rate 506 in response to various conditions is referred to herein as “dynamic streaming.”

In one embodiment, dynamic streaming may be employed where no specific message is sent by destination system 204 . The source system 202 may use latency calculations, requests to resend lost packets, etc., to dynamically determine the target data rate 506 for purposes of selecting a compression method 111 .

Referring to FIG. 10 , video frames 1002 within a scene 206 may be subdivided into a plurality of sub-frames 1004 . While the depicted video frame 1002 is subdivided into four sub-frames 1004 a - d of equal size, the invention is not limited in this respect. For instance, a video frame 1002 may be subdivided into any number of sub-frames 1004 , although too many sub-frames 1004 may adversely affect compression quality. Moreover, the sub-frames 1004 need not be of equal size. For example, sub-frames 1004 near the center of the video frame 1002 may be smaller due to the relatively greater amount of motion in this area.

In certain embodiments, the sub-frames 1004 may be defined by objects represented within the video frame 1002 . As an example, the head of a person could be defined as a separate object and, hence, a different sub-frame 1004 from the background. Algorithms (e.g., MPEG-4) for objectifying a scene within a video frame 1002 are known in the art.

A set of sub-frames 1004 a - d within a scene 206 exhibit characteristics 502 a - d , and may be treated, for practical purposes, like a complete video frame 1002 . Accordingly, using the techniques described above, the characteristics 502 a - d may be used to determine an optimal compression method 111 a - d for the compressing the respective sub-frames 1004 a - d . For example, an AI system 504 (not shown) may be used to determine whether an association 602 exists between a set of characteristics 502 and a particular compression method 111 . If no association 602 exists, compression 510 and comparison 514 modules (not shown) may be used to test a plurality of compression methods 111 on the respective sub-frames 1004 to determine the optimal compression method 111 .

Thus, different sub-frames 1004 a - d of a single scene 206 may be compressed using different compression methods 111 a - d . In the illustrated embodiment, four different compression methods 111 a - d are used.

While specific embodiments and applications of the present invention have been illustrated and described, it is to be understood that the invention is not limited to the precise configuration and components disclosed herein. Various modifications, changes, and variations apparent to those of skill in the art may be made in the arrangement, operation, and details of the methods and systems of the present invention disclosed herein without departing from the spirit and scope of the present invention.

›Tables in the description — 2
TABLE 1
FOURCCNameOwner
3IV13ivx3IVX
3IV23ivx3IVX
AASCAutodesk Animator codecAutodesk
ADV1WaveCodecLoronix
ADVJAvid M-JPEGAvid Technology
AEMIArray VideoONEArray Microsystems
MPEG 1-I Capture
AFLIAutodesk Animator codecAutodesk
AFLCAutodesk Animator codecAutodesk
AMPGArray VideoONE MPEGArray Microsystems
ANIMRDXIntel
AP41AngelPotion DefinitiveAngelPotion
ASV1Asus VideoAsus
ASV2Asus Video (2)Asus
ASVXAsus Video 2.0Asus
AUR2Aura 2 Codec - YUV 422Auravision
AURAAura 1 Codec - YUV 411Auravision
AVRnAvid M-JPEGAvid Technology
BINKBink VideoRAD Game Tools
BT20Prosumer VideoConexant
BTCVComposite Video CodecConexant
BW10Broadway MPEGData Translation
Capture/Compression
CC12YUV12 CodecIntel
CDVCCanopus DV CodecCanopus
CFCCDPS PerceptionDigital Processing Systems
CGDICamcorder VideoMicrosoft
CHAMCaviara ChampagneWinnov
CMYKUncompressed CMYKColorgraph
CJPGWebCam JPEGCreative Labs
CPLAYUV 4:2:0Weitek
CRAMMicrosoft Video 1Microsoft
CVIDCinepakProvidenza & Boekelheide
CWLTColor WLT DIBMicrosoft
CYUVCreative YUVCreative Labs
CYUYATI Technologies
D261H.261DEC
D263H.263DEC
DIV3DivX MPEG-4DivX
DIV4DivX MPEG-4DivX
DIV5DivX MPEG-4DivX
DIVXDivXOpenDivX
divxDivX
DMB1Rainbow RunnerMatrox
hardware compression
DMB2Rainbow RunnerMatrox
hardware compression
DSVDDV Codec
DUCKTrueMotion SDuck Corporation
dv25DVCPROMatrox
dv50DVCPRO50Matrox
dvsdPinnacle Systems
DVE2DVE-2 VideoconferencingInSoft
Codec
DVX1DVX1000SP VideoLucent
Decoder
DVX2DVX2000S Video DecoderLucent
DVX3DVX3000S Video DecoderLucent
DX50DivX MPEG-4 version 5DivX
DXTnDirectX CompressedMicrosoft
Texture
DXTCDirectX TextureMicrosoft
Compression
ELK0Elsa Quick CodecElsa
EKQ0Elsa Quick CodecElsa
ESCPEscapeEidos Technologies
ETV1eTreppid Video CodeceTreppid Technologies
ETV2eTreppid Video CodeceTreppid Technologies
ETVCeTreppid Video CodeceTreppid Technologies
FLJPField EncodedD-Vision
Motion JPEG
FRWAForward Motion JPEGSoftLab-Nsk
with alpha channel
FRWDForward Motion JPEGSoftLab-Nsk
FVF1Fractal Video FrameIterated Systems
GLZWMotion LZWgabest@freemail.hu
GPEGMotion JPEGgabest@freemail.hu
GWLTGreyscale WLT DIBMicrosoft
H260ITU H.26nIntel
through
H269
HFYUHuffman Lossless Codec
HMCRRendition MotionRendition
Compensation Format
HMRRRendition MotionRendition
Compensation Format
i263ITU H.263Intel
IANIndeo 4 CodecIntel
ICLBCellB VideoconferencingInSoft
Codec
IGORPower DVD
IJPGIntergraph JPEGIntergraph
ILVCLayered VideoIntel
ILVRITU H.263+ Codec
IPDVGiga AVI DV CodecI-O Data Device, Inc.
IR21Indeo 2.1Intel
IRAWIntel Uncompressed UYUVIntel
IV30Indeo 3Ligos
through
IV39
IV32Indeo 3.2Ligos
IV40Indeo InteractiveLigos
through
IV49
IV50Indeo InteractiveLigos
JBYRKensington
JPEGJPEG Still ImageMicrosoft
JPGLJPEG Light
L261Lead H.26Lead Technologies
L263Lead H.263Lead Technologies
LCMWMotion CMW CodecLead Technologies
LEADLEAD Video CodecLead Technologies
LGRYGrayscale ImageLead Technologies
LjpgLEAD MJPEG CodecLead Technologies
LZO1Lempel-Ziv-Markus Oberhumer
Oberhumer Codec
M263H.263Microsoft
M261H.261Microsoft
M4S2MPEG-4 (automaticMicrosoft
WMP download)
MC12Motion CompensationATI Technologies
Format
MCAMMotion CompensationATI Technologies
Format
MJ2CMotion JPEG 2000Morgan Multimedia
mJPGMotion JPEG includingIBM
Huffman Tables
MJPGMotion JPEG
MMESMPEG-2 ESMatrox
MP2AEval downloadMedia Excel
MP2TEval downloadMedia Excel
MP2VEval downloadMedia Excel
MP42MPEG-4 (automaticMicrosoft
WMP download)
MP43MPEG-4 (automaticMicrosoft
WMP download)
MP4AEval downloadMedia Excel
MP4SMPEG-4 (automaticMicrosoft
WMP download)
MP4TEval downloadMedia Excel
MP4VEval downloadMedia Excel
MPEGMPEG
MPG4MPEG-4 (automaticMicrosoft
WMP download)
MPG4MPEG-4Microsoft
MPGIMPEGSigma Designs
MRCAMrcodecFAST Multimedia
MRLEMicrosoft RLEMicrosoft
MSVCMicrosoft Video 1Microsoft
MSZHAVImszhKenji Oshima
MTX1Matrox
through
MTX9
MV12
MWV1Aware Motion WaveletsAware Inc.
nAVI
NTN1Video Compression 1Nogatech
NVDSNVidia Texture FormatNVidia
NVHSNVidia Texture FormatNVidia
NHVUNVidia Texture FormatNVidia
NVS0-NVS5NVidia
NVT0-NVT5NVidia
PDVCDVC codecI-O Data Device, Inc.
PGVVRadius Video VisionRadius
PHMOPhotomotionIBM
PIM1Pegasus Imaging
PIM2Pegasus Imaging
PIMJLossless JPEGPegasus Imaging
PIXLVideo XLPinnacle Systems
PVEZPowerEZHorizons Technology
PVMMPacketVideoPacketVideo Corporation
Corporation MPEG-4
PVW2Pegasus WaveletPegasus Imaging
Compression
qpeqQPEG 1.1Q-Team
QPEGQPEGQ-Team
rawRaw RGB
RGBT32 bit supportComputer Concepts
RLERun Length EncoderMicrosoft
RLE44 bpp RunMicrosoft
Length Encoder
RLE88 bpp RunMicrosoft
Length Encoder
RMP4MPEG-4 ASSigma Designs
Profile Codec
RT21Real Time Video 2.1Intel
rv20RealVideo G2Real
rv30RealVideo 8Real
RVXRDXIntel
s422VideoCap C210Tekram
YUV CodecInternational
SAN3DivX 3
SDCCDigital Camera CodecSun Communications
SEDGSamsung MPEG-4Samsung
SFMCSurface Fitting MethodCrystalNet
SMSCProprietary codecRadius
SMSDProprietary codecRadius
smsvWavelet VideoWorldConnect
(corporate site)
SP54SunPlus
SPIGSpigotRadius
SQZ2VXTreme Video Codec V2Microsoft
SV10Video R1Sorenson Media
STVAST CMOS Imager DataST Microelectronics
STVBST CMOS Imager DataST Microelectronics
STVCST CMOS Imager DataST Microelectronics
(Bunched)
STVXST CMOS Imager DataST Microelectronics
STVYST CMOS Imager DataST Microelectronics
SVQ1Sorenson VideoSorenson Media
TLMSMotion Intraframe CodecTeraLogic
TLSTMotion Intraframe CodecTeraLogic
TM20TrueMotion 2.0Duck Corporation
TM2XTrueMotion 2XDuck Corporation
TMICMotion Intraframe CodecTeraLogic
TMOTTrueMotion SHorizons Technology
TR20TrueMotion RT 2.0Duck Corporation
TSCCTechSmith ScreenTechsmith Corp.
Capture Codec
TV10Tecomac Low-Tecomac, Inc.
Bit Rate Codec
TVJPPinnacle/Truevision
TVMJPinnacle/Truevision
TY2CTrident DecompressionTrident Microsystems
TY2NTrident Microsystems
TY0NTrident Microsystems
UCODClearVideoeMajix.com
ULTIUltimotionIBM Corp.
V261Lucent VX2000SLucent
V655YUV 4:2:2Vitec Multimedia
VCR1ATI Video Codec 1ATI Technologies
VCR2ATI Video Codec 2ATI Technologies
VCR3-9ATI Video CodecsATI Technologies
VDCTVideoMaker Pro DIBVitec Multimedia
VDOMVDOWaveVDONet
VDOWVDOLiveVDONet
VDTZVideoTizer YUV CodecDarim Vision Co.
VGPXVideoGramPixAlaris
VIFPVFAPI Codec
VIDSVitec Multimedia
VIVOVivo H.263Vivo Software
VIXLVideo XLPinnacle Systems
VLV1VideoLogic
VP30VP3On2
VP31VP3On2
vssvVSS VideoVanguard Software
Solutions
VX1KVX1000S Video CodecLucent
VX2KVX2000S Video CodecLucent
VXSPVX1000SP Video CodecLucent
VYU9ATI YUVATI Technologies
VYUYATI YUVATI Technologies
WBVCW9960Winbond Electronics
WHAMMicrosoft Video 1Microsoft
WINXWinnov SoftwareWinnov
Compression
WJPGWinbond JPEG
WNV1Winnov HardwareWinnov
Compression
x263Xirlink
XVIDXVID MPEG-4XVID
XLV0XL Video DecoderNetXL Inc.
XMPGXING MPEGXING Corporation
XWV0-XWV9XiWave Video CodecXiWave
XXANOrigin
Y411YUV 4:1:1Microsoft
Y41PBrooktree YUV 4:1:1Conexant
Y8Grayscale video
YC12YUV 12 codecIntel
YUV8Caviar YUV8Winnov
YUY2Raw, uncompressedMicrosoft
YUV 4:2:2
YUYVCanopus
ZLIB
ZPEGVideo ZipperMetheus
ZyGoZyGo VideoZyGo Digital
P⁢
⁢S⁢
⁢N⁢
⁢R
=
20×
log10(2551M×N⁢∑m=0M-1⁢⁢∑n=0N-1⁢⁢[f′⁡(m,n)-f⁡(m,n)]2)
Eq.
⁢1

Claims as granted

55 claims

Log in to read the claims of this application.

Log in to unlock

Classifications

8 codes
IPC · International Patent Classification
Section H — Electricity
  • H04N7/24
  • H04N7/26
  • H04L29/06
  • H04L29/08
  • H04N7/12
USPC · US Patent Classification
375/240.1375/240.12375/240

Claim changes

Soon
Coming soonHow the claims changed between publication and grant

See which claims were amended, added or cancelled during examination, with every added and removed word marked.

AmendedAddedCancelledUnchanged

The published claims of this application are not paired with the granted ones in what we hold.

File wrapper

⤢ drag to zoomJan 2009Jul 2009Jan 2010Jul 2010Jan 2011Jul 2011Jan 2012Jul 2012USPTOApplicantNon-final rejection
USPTOApplicanthover for detail · click to open
Pendency
3.5 y
1,295 days filing → grant
Office actions
1
non-final + final
Responses
1
no RCE
Examiner
Allen Wong
art unit 2488 · TC 2400
Citations: 7 back · 5 forward

See the full prosecution history — every USPTO and applicant action on this file, in order.

Log in to unlock

Documents

Log in to open the documents of this file: the application as filed, every office action and response, the notice of allowance.

Log in to unlock

Chain of title

⤢ drag to zoom201220142016201820202022202420262028Owner 1
Titlehover for detail · click to open

See the full assignment history — every owner this patent has passed through, with recordation dates and reel/frame numbers.

Log in to unlock