JP2009532741A6 - Preprocessor method and apparatus - Google Patents

Abstract

The present invention relates generally to multimedia data processing and, more particularly, to processing operations performed prior to or concurrently with data compression processing. A method of processing multimedia data includes receiving an interlaced video frame, obtaining metadata for the interlaced video frame, and converting the interlaced video frame to progressive video using at least a portion of the metadata. Converting and providing the encoder with the progressive video and at least a portion of the metadata for use in encoding the progressive video. The method may also include generating spatial information and bi-directional motion information for an interlaced video frame and generating progressive video based on the interlaced video frame using the spatial information and the bi-directional motion information. it can.

Description

Priority claim

  This patent application includes provisional application 60 / 789,048 filed April 3, 2006, provisional application 60 / 789,266 filed April 4, 2006, and April 2006. Claiming priority of provisional application 60 / 789,377 filed on the 4th, all of the above provisional applications are assigned to the assignee of the present invention and are expressly incorporated herein by reference. Incorporated.

  The present invention relates generally to multimedia data processing and, more particularly, to processing operations performed prior to or concurrently with data compression processing.

Provisional Application No. 60 / 789,048 Provisional Application No. 60 / 789,266 Provisional Application No. 60 / 789,377 P. Haavisto, J.M. Juhola, Y. et al. Neuvo, “Scan rate up-conversion using adaptive media filtering”, Signal Processing of HDTV II, pages 703-710, 1990. R. Simonetti, S.M. Carrato, G.G. Ramponi, A.M. Polo Filisan, “Deinterlacing of HDTV Images for Multimedia Applications”, Signal Processing of HDTV IV, pages 765-772, 1993 D. L. Donoho, I.D. M.M. Johnstone, “Ideal spatial adaptation by wavelet shrinkage”, Biometrica, vol. 8, pp. 425-455, 1994 S. P. Ghael, A.M. M.M. Sayeded, R.M. G. Baraniuk, "Improvement Wavelet denoising via Emperor Wiener filtering", Proceedings of SPIE, vol 3169, pages 389-399, San Diego, July 1997. G. D. Haan, E .; B. Bellers, “De-interlacing of video data”, IEEE Transactions on Consumer Electronics, Vol. 43, no. 3, pp. 819-825, 1997 Specification for Safe Action and Safe Title Area Test Pattern for Television Systems, SMPTE Recommended Practice RP 27.3-1989

Summary of the Invention

  Each of the inventive devices and methods described herein have several aspects, one of which is by no means responsible for its desired attributes. Without limiting the scope of the invention, its more prominent features will now be briefly described. After reviewing this description, and particularly after reading the section entitled “Detailed Description”, the reader will understand how the features of the present invention provide improvements to multimedia data processing apparatus and methods. I will.

  In one aspect, a method of processing multimedia data includes receiving an interlaced video frame, converting the interlaced video frame to progressive video, generating metadata associated with the progressive video, and progressive Providing progressive video and at least a portion of the metadata to the encoder for use in encoding the video. The method can further include encoding progressive video using metadata. In some aspects, the interlaced video frame comprises NTSC video. Converting the video frame may include deinterlacing the interlaced video frame.

  In some aspects, the metadata can include bandwidth information, bidirectional motion information, specific bandwidth, complexity values such as time or space complexity values, or both, and luminance information, , Luminance and / or chrominance information. The method may also include generating spatial information and bi-directional motion information for an interlaced video frame and generating progressive video based on the interlaced video frame using the spatial information and the bi-directional motion information. it can. In some aspects, converting the interlaced video frame comprises inverse telecine the 3/2 pull-down video frame and / or resizing the progressive video. The method can further comprise segmenting the progressive video to determine group of picture information, wherein the segmentation can include progressive video shot detection. In some aspects, the method also includes progressive video using a noise reduction filter.

  In another aspect, an apparatus for processing multimedia data includes a receiver configured to receive interlaced video frames, a deinterlacer configured to convert interlaced video frames into progressive video, A partitioner configured to generate metadata associated with the progressive video and to provide the progressive video and the metadata to the encoder for use in encoding the progressive video. In some aspects, the apparatus can further include an encoder configured to receive progressive video from the communication module and encode the progressive video using the provided metadata. The deinterlacer can be configured to perform space-time deinterlacing and / or inverse telecine. The partitioner can be configured to perform shot detection and generate compression information based on the shot detection. In some aspects, the partitioner can be configured to generate bandwidth information. The apparatus can also include a resampler configured to resize the progressive frame. The metadata may include bandwidth information, bidirectional motion information, specific bandwidth, luminance information, spatial complexity values related to content, and / or temporal complexity values related to content. In some aspects, the deinterlacer generates spatial information and bidirectional motion information for interlaced video frames, and uses the spatial information and bidirectional motion information to generate progressive video based on the interlaced video frames. Composed.

  Another aspect includes means for receiving an interlaced video frame, means for converting the interlaced video frame into progressive video, means for generating metadata associated with the progressive video, An apparatus for processing multimedia data, comprising means for providing progressive video and at least a portion of metadata to an encoder for use in encoding. In some aspects, the conversion means comprises an inverse telecine device and / or a space-time deinterlacer. In some aspects, the generating means is configured to perform shot detection and generate compression information based on the shot detection. In some aspects, the generating means is configured to generate bandwidth information. In some aspects, generating includes means for resampling to resize the progressive frame.

  Another aspect comprises a machine-readable medium comprising instructions for processing multimedia data, said instructions causing the machine to receive interlaced video frames and convert the interlaced video frames to progressive video when executed. And generating metadata associated with the progressive video and providing the encoder with the progressive video and at least a portion of the metadata for use in encoding the progressive video.

  Another aspect is to receive interlaced video, convert the interlaced video to progressive video, generate metadata associated with the progressive video, and use progressive video and metadata for use in encoding progressive video. Including a processor having a configuration for providing at least a portion of The conversion of interlaced video can include performing space-time deinterlacing. In some aspects, interlaced video conversion comprises performing inverse telecine. In some aspects, generating metadata includes generating compression information based on shot change detection. In some aspects, generating metadata includes determining compression information for progressive video. In some aspects, the configuration includes a configuration for resampling a video to generate a resized progressive frame. In some aspects, the metadata may include bandwidth information, interactive motion information, complexity information such as content-based temporal or spatial complexity information, and / or compression information.

Detailed description

  The following description includes details to provide a thorough understanding of the examples. However, one of ordinary skill in the art will appreciate that the examples may be practiced even if not all of the details of the process or device in one example or aspect are described or illustrated herein. For example, an electrical component may be shown in a block diagram where not all electrical connections or electrical elements of that component are shown, so that examples are not obscured by unnecessary details. In other examples, such components, other structures and techniques may be shown in detail to further explain the examples.

  Certain aspects of the present invention, as well as aspects for preprocessors and methods of operating preprocessors that improve the performance of existing preprocessing and encoding systems, are described herein. Such preprocessors process metadata and video in preparation for encoding, including performing deinterlacing, inverse telecine, filtering, shot type identification, metadata processing and generation, and bandwidth information generation. Can do. References herein to “one aspect”, “aspect”, “some aspects”, or “an aspect” are one or more particular features, structures, or structures described in connection with an aspect. It means that the characteristic can be included in at least one aspect of the preprocessor system. The appearances of such phrases in various places in the specification are not necessarily all referring to the same aspect, nor are they referring to separate or alternative aspects that are mutually exclusive with other aspects. Furthermore, various features are described that may be presented in some aspects and not in others. Similarly, various steps are described which may be steps of some aspects and not steps of other aspects.

  “Multimedia data” or “multimedia” as used herein is a broad term that includes video data (which may include audio data), audio data, or both video and audio data. As used herein, “video data” or “video” is a broad term that refers to an image or one or more image sequences or sequences that contain text, images, and / or audio data, and is a multimedia term. Unless otherwise indicated, “multimedia data” and “video data” may be used interchangeably.

  FIG. 1 is a block diagram of a communication system 100 for delivering streaming multimedia. Such a system finds application in the transmission of digitally compressed video to multiple terminals as shown in FIG. The digital video source can be, for example, a digital cable or satellite supply, or an analog source that is digitized. The video source is processed in transmission mechanism 120 and encoded and modulated onto a carrier wave for transmission to one or more terminals 160 over network 140. Terminal 160 decodes the received video and typically displays at least a portion of the video. Network 140 refers to any type of wired or wireless communication network suitable for transmitting encoded data. For example, the network 140 can be a cell phone network, a wired or wireless local area network (LAN) or a wide area network (WAN), or the Internet. Terminal 160 is a cell phone, PDA, home or commercial video display device, computer (portable, laptop, handheld, PC, and larger server-based computer systems), and individuals capable of using multimedia data. It can be any type of communication device capable of receiving and displaying data including, but not limited to, amusement-oriented entertainment devices.

  2 and 3 show sample aspects of the preprocessor 202. FIG. In FIG. 2, the preprocessor 202 resides in the digital transmission mechanism 120. Decoder 201 decodes the encoded data from the digital video source and provides metadata 204 and video 205 to preprocessor 202. The preprocessor 202 performs certain types of processing on the video 205 and metadata 204, and processed metadata 206 (eg, base layer reference frames, enhancement layer reference frames, bandwidth information, content information) and video 207. Is provided to the encoder 203. Such preprocessing of multimedia data can improve the visual clarity, antialiasing, and compression efficiency of the data. In general, the preprocessor 202 receives the video sequence provided by the decoder 201 and converts the video sequence to a progressive video sequence for further processing (eg, encoding) by the encoder. In some aspects, the preprocessor 202 may perform inverse telecine, deinterlacing, filtering (eg, artifact removal, deringing, deblocking, and noise reduction), resizing (eg, a standard video graphics array (QVGA) from a standard definition). Spatial resolution downsampling to Video Graphics Array), and GOP structure generation (eg, complexity map generation, scene change detection, and fade / flash detection calculations) can be configured for numerous operations.

  FIG. 3A performs pre-processing operations on received metadata 204 and video 205, and then provides processed metadata 206 and progressive video 207 (eg, to an encoder) for further processing. 1 illustrates a preprocessor 202 configured with modules or components (collectively referred to herein as “modules”). A module may be implemented in hardware, software, firmware, or a combination thereof. The preprocessor 202 includes one or more of: an inverse telecine 301, a deinterlacer 302, a noise reducer 303, an alias suppressor 304, a resampler 305, a deblocker / deringer 306, and a GOP partitioner 307, all further described below. Various modules can be included, including the modules shown. Preprocessor 202 can also include other suitable modules that can be used to process video and metadata, including memory 308 and communication module 309. A software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, removable disk, CD-ROM, or other form of storage medium known in the art. it can. An exemplary storage medium is coupled to the processor such that the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium can reside in an ASIC. The ASIC can exist in the user terminal. In the alternative, the processor and the storage medium may reside as discrete components in a user terminal.

  FIG. 3B is a flow diagram illustrating a process 300 for processing multimedia data. When process 300 begins, it proceeds to block 320 and receives interlaced video. The preprocessor 202 shown in FIGS. 2 and 3 can perform this step. In some aspects, a decoder (eg, decoder 201 in FIG. 2) may receive interlaced data and provide it to preprocessor 202. In some aspects, the data receiving module 330 shown in FIG. 3C, which is part of the preprocessor 202, can perform this step. Process 300 then proceeds to block 322 where the interlaced video is converted to progressive video. The preprocessor 202 of FIGS. 2, 3A, and the module 332 of FIG. 3C can perform this step. If the interlaced video is telecined, block 322 processing can include performing inverse telecine to generate progressive video. The process 300 then proceeds to block 324 and generates metadata associated with the progressive video. The GOP partitioner 307 in FIG. 3A and the module 334 in FIG. 3C can perform such processing. Process 300 then proceeds to block 326 where progressive video and at least a portion of the metadata are provided to the encoder for encoding (eg, compression). The preprocessor 202 shown in FIGS. 2, 3A, and the module 336 of FIG. 3C can perform this step. After providing progressive video and associated metadata to another component for encoding, the process 300 can end.

  FIG. 3C is a block diagram illustrating means for processing multimedia data. Here, such means are shown incorporated in the preprocessor 202. Preprocessor 202 includes means for receiving video, such as module 330. Preprocessor 202 also includes means for converting interlaced data into progressive video, such as module 332. Such means may include, for example, a space-time deinterlacer and / or an inverse telecine device. Preprocessor 202 also includes means for generating metadata related to progressive video, such as module 334. Such means can include a GOP partitioner 307 (FIG. 3A) that can generate various types of metadata as described herein. Preprocessor 202 also includes means for providing progressive video and metadata to the encoder for encoding, as indicated by module 336. Such means may include, in some aspects, the communication module 309 shown in FIG. 3A. As will be appreciated by those skilled in the art, such means can be implemented in a number of standard ways.

  The preprocessor 202 can use the obtained metadata (eg, obtained from the decoder 201 or another source) for one or more preprocessing operations. The metadata can include information relating to the content of the multimedia data, describing the content, or classifying (“content information”). In particular, the metadata can include content classification. In some aspects, the metadata does not include content information that is desirable for the encoding operation. In such cases, preprocessor 202 is configured to determine content information, use the content information for pre-processing operations, and / or provide the content information to other components, eg, decoder 203. be able to. In some aspects, the preprocessor 202 may use such content information to influence GOP partitioning, determine an appropriate type of filtering, and / or determine encoding parameters communicated to the encoder. Can be used.

  FIG. 4 shows an illustrative example of process blocks that may be included in the preprocessor and illustrates the processing that can be performed by the preprocessor 202. In this example, preprocessor 202 receives metadata and video 204, 205 and provides output data 206, 207 comprising (processed) metadata and video to encoder 228. In general, there are three types of video received by the preprocessor. First, the received video can be progressive video, and deinterlacing does not need to be performed. Secondly, the video data can be telecine interlaced video converted from a 24 fps movie sequence, in this case video. Third, the video can be non-telecine interlaced video. The preprocessor 226 can process these types of video as described below.

  In block 401, the preprocessor 202 determines whether the received videos 204, 205 are progressive video. In some cases, this can be determined from the metadata if the metadata includes such information, or can be determined by processing the video itself. For example, the inverse telecine process described below can determine whether the received video 205 is progressive video. If it is progressive video, the process proceeds to block 407 and a filtering operation is performed on the video to reduce noise, such as white Gaussian noise. In block 401, if the video is not progressive video, the process proceeds to block 404, which is a phase detector.

  The phase detector 604 discriminates between video derived from telecine and video that begins with the standard broadcast format. If a determination is made that the video is telecine (YES decision path exiting from phase detector 404), the telecine video is returned to its original format at inverse telecine 406. Redundant fields are identified and removed, and fields from the same video frame are reassembled into a complete image. Since the sequence of reconstructed film images was taken and recorded at regular intervals of 1/24 of a second, the motion estimation process performed in the GOP partitioner 412 or decoder is Rather, it would be more accurate to use an inverse telecine image with a regular time base.

In one aspect, phase detector 404 makes a determination after receiving a video frame. These determinations are: (i) the current video is from the telecine output and the 3: 2 pulldown phase of the five phases P ₀ , P ₁ , P ₂ , P ₃ , and P ₄ shown in FIG. (Ii) whether the video was generated as a conventional NTSC. Its determination is denoted as phase _{P 5.} These decisions appear as the output of the phase detector 404 shown in FIG. The path from the phase detector 404 with the label “YES” activates the inverse telecine 406, which provides the correct pull-down phase, which sorts out the fields formed from the same captured image and Represents combining. The path from phase detector 404 with the label “NO” activates deinterlacer 405 and divides the apparent NTSC frame into fields for optimal processing. Inverse telecine is a co-pending US patent application entitled “INVERSE TELECINE ALGORITHM BASED ON STATE MACHINE” [Docket No. QFDM. 021A (050943)], which is owned by the assignee of the present invention and is hereby incorporated by reference in its entirety.

  Since the phase detector 404 can receive different types of video at any time, it can continuously analyze the video frames. For example, a video compliant with the NTSC standard may be inserted into the video as a commercial. After inverse telecine, the resulting progressive video is sent to a noise reducer (filter) 407 that can be used to reduce white Gaussian noise.

  If conventional NTSC video is recognized (NO path from phase detector 401), the video is transmitted to deinterlacer 405 for compression. The deinterlacer 405 converts the interlaced field into progressive video, and then a noise reduction operation can be performed on the progressive video.

  After appropriate inverse telecine or deinterlacing processing, at block 408, the progressive video is subjected to processing for alias suppression and resampling (eg, resizing).

  After resampling, the progressive video then proceeds to block 410 where deblocker and deringing operations are performed. Two types of artifacts commonly occur in video compression applications: “blocking” and “ringing”. Blocking artifacts occur because the compression algorithm splits each frame into several blocks (eg, 8 × 8 blocks). Each block is reconstructed with some slight error, and the error in the edge portion of the block shows a marked difference from the error in the edge portion of the adjacent block, visualizing the block boundary. In contrast, ringing artifacts appear as distortion around the edges of image features. Ringing artifacts occur because the encoder discards too much information when quantizing high frequency DCT coefficients. In some illustrative examples, deblocking and deringing can use low-pass FIR (Finite Impulse Response) filters to make these visible artifacts less noticeable.

  After deblocking and deringing, the progressive video is processed by the GOP partitioner 412. GOP positioning can include detecting shot changes, generating a complexity map (eg, a temporal, spatial bandwidth map), and adaptive GOP partitioning. Shot detection relates to determining when a frame in a group of pictures (GOP) presents data indicating the occurrence of a scene change. Scene change detection can be used to insert an I frame based on the GOP length instead of the video encoder determining an appropriate GOP length and inserting I frames at fixed intervals. The preprocessor 202 can also be configured to generate a bandwidth map that can be used to encode multimedia data. In some aspects, a content classification module located external to the preprocessor generates a bandwidth map instead. Adaptive GOP partitioning can adaptively change the structure of the group of pictures that are encoded together. An illustrative example of the operation shown in FIG. 4 is described below.

Inverse Telecine Inverse telecine processing is described below and an illustrative example of inverse telecine is provided with reference to FIGS. Video compression gives the best results when the source characteristics are known and used to select an ideally harmonized processing form. For example, a non-broadcast video can be created in several ways. Broadcast video that is conventionally generated by a video camera, a broadcast studio, or the like conforms to the NTSC standard in the United States. According to this standard, each frame is composed of two fields. One field consists of odd lines and the other consists of even lines. This is sometimes referred to as an “interlaced” format. Frames are generated at approximately 30 frames / second, while fields are recordings of television camera images at 1/60 second intervals. On the other hand, film is filmed at 24 frames / second, each frame consisting of a complete image. This is sometimes referred to as a “progressive” format. For transmission on NTSC equipment, “progressive” video is converted to an “interlaced” video format via a telecine process. In one aspect described further below, the system advantageously determines when the video has been telecined and performs the appropriate transformations to regenerate the original progressive frame.

FIG. 4 shows the result of telecine the progressive frame converted to interlaced video. F ₁ , F ₂ , F ₃ , and F ₄ are progressive images that are input to the telecine unit. The numbers “1” and “2” below each frame indicate whether the field is an odd field or an even field. Note that some fields are repeated due to differences between frame rates. FIG. 4 also shows pull-down phases P ₀ , P ₁ , P ₂ , P ₃ , P ₄ . Phase P ₀ is marked by the first frame of two NTSC compatible frames having the same first field. The subsequent four frames correspond to phases P ₁ , P ₂ , P ₃ , P ₄ . Note that the frames marked by P ₂ and P ₃ have the same second field. Since the film frames F ₁ is scanned three times, the first field of two identical NTSC compatible continuously outputted is formed. All NTSC fields derived from film frames F ₁ are those obtained from the same film image, therefore, it is those taken at the same instant. Other NTSC frames from film can have adjacent fields that are 1/24 second apart.

The phase detector 404 shown in FIG. 4 makes a determination after receiving a video frame. These decisions are: (i) the current video is from the telecine output, and the 3: 2 pulldown phase is the five phases P ₀ , P ₁ , P ₂ , P ₃ , P shown in definition 512 of FIG. whether one of the _4, wherein the or not (ii) video was generated as conventional NTSC, the determination is shown as phase P _5.

  These determinations appear as the output of the phase detector 401 shown in FIG. The path from the phase detector 401 with the label “YES” activates the inverse telecine 406, which provides the correct pull-down phase, which sorts out the fields formed from the same captured image and Represents combining. The path from the phase detector 401 with the label “NO” activates the deinterlacer block 405 in the same way and divides the apparent NTSC frame into fields for optimal processing.

  FIG. 6 is a flow diagram illustrating a process 600 for inverse telecine of a video stream. In one aspect, process 600 is performed by inverse telecine 301 of FIG. Beginning at step 651, inverse telecine 301 determines a plurality of metrics based on the received video. In this aspect, four metrics are formed that are the sum of differences between fields taken from the same frame or adjacent frames. The four metrics are further summarized for each of the six hypothesized phases to the Euclidian measure of distance between the four metrics derived from the received data and the most likely values of these metrics. . The Euclidean sum is called branch information, and there are six such quantities for each received frame. Each hypothesized phase has a subsequent phase, which changes with each received frame in the case of a possible pull-down phase.

A possible path of transition is shown in FIG. There are six such paths. The decision process maintains six measures equal to the sum of the Euclidean distances for each path of the hypothesized phase. In order to make the procedure respond to the changed state, each Euclidean distance in the sum becomes smaller as it gets older. The phase track that minimizes the sum of the Euclidean distances is considered to be a valid phase track. The current phase of this route is called the “applicable phase”. Unless the selected phase is not P _5, it can be inverse telecine based on the phase is performed now. If P ₅ is selected, the current frame is de-interlaced using the deinterlacer in block 405 (FIG. 4). In summary, the applicable phase is used as the current pull-down phase or as an indication to order deinterlacing of frames presumed to have a valid NTSC format.

For every frame received from the input video, a new value for each of the four metrics is calculated. These are defined as follows:

The term SAD is an abbreviation for “summed absolute differences”. The fields from which the difference is taken to form the metric are shown schematically in FIG. A subscript number indicates a field number, and a character indicates immediately preceding (= P) or present (= C). The range symbols in FIG. 8 indicate the differences between the paired fields. SAD _FS indicates the difference between field 1 of the current frame labeled with C ₁ and field 1 of the previous frame labeled with label P _1, and in the definition provided in FIG. The SAD _SS indicates the difference between the field 2 of the current frame labeled C ₂ and the field 2 of the previous frame labeled P ₂ , and is labeled SS. range symbol interval is represented by, SAD _CO represents the difference between the field 1 of the current frame, labeled fields 2 and labeled C ₁ of the current frame is marked with label C _2, labeled labeled CO The range symbol is represented by a range symbol, SAD _PO indicates the difference between field 1 of the current frame and field 2 of the previous frame, and is a range symbol labeled PO Represents the interval.

The computational load for evaluating each SAD is described below. There are about 480 active horizontal lines in a conventional NTSC. For the same horizontal resolution, there is a vertical line or degree of freedom equal to 480 × 4/3 = 640 at a 4: 3 aspect ratio. The 640 × 480 pixel video format is one of the formats approved by the Advanced Television Standards Committee. Thus, for every 1/30 second, which is the duration of the frame, 640 × 480 = 307200 new pixels are generated. New data is generated at a rate of 9.2 × 10 ⁶ pixels / second, which implies that the hardware or software running this system processes the data at a rate of about 10 MB or higher. This is one of the fast parts of the system. It can be implemented by hardware, software, firmware, middleware, microcode, or any combination thereof. The SAD calculator can be a stand-alone component, can be embedded in a component of another device as hardware, firmware, middleware, or can be implemented in microcode or software running on a processor, Or they can be a combination thereof. When implemented in software, firmware, middleware, or microcode, program code or code segments that perform computations can be stored on machine-readable media such as storage media. A code segment can correspond to a procedure, function, subprogram, program, routine, subroutine, module, software package, class, or any combination of instructions, data structures, or program statements. A code segment can be coupled to another code segment or a hardware circuit by passing and / or receiving information, data, arguments, parameters, or memory contents.

The flowchart 900 of FIG. 9 clarifies the relationship of FIG. 8 and is a schematic representation of Equations 1-4. Flow diagram 900 shows storage locations 941, 942, 943, 944 where the most recent values of SAD _FS , SAD _CO , SAD _SS , and SAD _PO are held, respectively. Each of these is generated by four calculators 940 that determine the sum of the absolute differences, and the four calculators 940 are the luminance value 931 of the previous first field data, the luminance value 932 of the current first field data, The luminance value 933 of the current second field data and the luminance value 934 of the immediately preceding second field data are processed. In the addition defining a metric, the term “value (i, j)” means the value of the luminance at position i, j, and the addition spans all active pixels, but a meaningful subset of active pixels The above addition is not excluded.

  The flowchart 100 of FIG. 10 is a detailed flowchart illustrating a process for detecting telecine video and reverse processing the telecine video to recover the original scanned film image. In step 1030, the metrics defined in FIG. 9 are evaluated. Proceeding to step 1083, the four envelope lower envelope values are found. The lower envelope of the SAD metric is a dynamically determined quantity that is the highest numerical lower bound at which the SAD never falls below it. Proceeding to step 1085, the amount of branch information defined by Equations 5 through 10 below is determined, using the previously determined metric, the lower envelope value, and the experimentally determined constant A. be able to. Since the subsequent value of the phase can be inconsistent, in step 1087 the quantity Δ is determined to reduce this apparent instability. A phase is considered consistent if the sequence of phase determinations is consistent with the problem model shown in FIG. Following that step, the process proceeds to step 1089 where the decision variable is calculated using the current value of Δ. The decision variable calculator 1089 evaluates the decision variable using all the information generated in the 1080th generation block up to that point. Steps 1030, 1083, 1085, 1087, and 1089 are extensions of the metric determination 651 of FIG. From these variables, an applicable phase is found by the phase selector 1090. Decision step 1091 uses the applicable phase to reverse the telecine video or to deinterlace it, as shown. This is a more explicit statement of the operation of the phase detector 404 of FIG. In one aspect, the process of FIG. 10 is performed by the phase detector 404 of FIG. Detector 404 begins at step 1030 and determines a plurality of metrics according to the process described above with reference to FIG. 8 and proceeds through steps 1083, 1085, 1087, 1089, 1090, and 1091.

  Flow diagram 1000 illustrates a process for estimating the current phase. The flow diagram states that in step 1083, the determined metric and lower envelope value are used to calculate branch information. The branch information can be recognized as the Euclidean distance described above. Exemplary equations that can be used to generate branch information are Equations 5 through 10 below. The amount of branch information is calculated in block 1209 of FIG.

The processed video data may be stored on a storage medium that may include, for example, a chip configuration storage medium (eg, ROM, RAM) or a disk type storage medium (eg, magnetic or optical) connected to the processor. it can. In some aspects, inverse telecine 406 and deinterlacer 405 may each include some or all of the storage medium. The amount of branch information is defined by the following equation.

Further details of the branch calculation are shown in the branch information calculator 1209 of FIG. As shown in calculator 1209, to generate branch information, a quantity L _S that is the lower envelope value of SAD _FS and SAD _SS , a quantity L _P that is the lower envelope value of SAD _{PO, and} a lower value of SAD _CO using the amount L _C is an enveloped value. The lower envelope is used alone or in conjunction with a predetermined constant A as a distance offset in the branch information calculation to generate H _S , H _P and H _C. These values are kept up to date in the lower envelope tracker described below. The H offset is defined as follows:

A process for tracking the values of L _S , L _P , and L _C is presented in FIGS. 13A, 13B, and 13C. For example, consider the tracking algorithm 1300 for between _{L P} shown at the top of FIG. 11A. Metric _{SAD PO} is, in the comparator 1305 are compared with the current value obtained by adding the threshold _{T P} in the value of _{L P.} If is larger the SAD _PO, as shown in block 1315, the current value between _{L P} is not changed. Smaller towards SAD _PO, as shown in block 1313, the new value between _{L P} becomes a linear combination of _{SAD PO} and _{L P.} In another embodiment of the block 1315, a new value between _{L P will} L _P + _T P.

The quantities L _S and L _{C in} FIGS. 13B and 13C are calculated similarly. The processing blocks of FIGS. 13A, 13B, and 13C having the same function are numbered the same, but are accompanied by a prime code ('or ") to indicate that they operate on different sets of variables. For example, if a linear combination of SAD _PO and L _C is formed, the operation is shown in block 1313′.As in the case of L _P , another aspect of 1315 ′ allows L _C to be L _C + it is replaced by _{T C.}

However, if the _{L S,} the lower envelope, because it is applied to both variables _{SAD FS} and _{SAD SS,} as an alternative, the algorithm of FIG. 13B, while labeled sequentially to each X, _{SAD FS} and _{SAD SS} Process. The alternation of the SAD _FS and SAD _SS values occurs when the current value of the SAD _FS at block 1308 is read into the X location at block 1303, followed by the current value of the SAD _SS at block 1307. Occurs when read into the X location at block 1302. As with L _P , another aspect of 1315 ″ is that L _S is replaced by L _S + T _{S. The} quantity A and threshold used in testing the current lower envelope value are , Determined in advance by experiment.

FIG. 11 is a flow diagram illustrating an exemplary process for performing step 1089 of FIG. FIG. 11 shows the process for updating the decision variable as a whole. There are six decision variables (corresponding to six possible decisions) that are updated with new information derived from the metric. The decision variable is found as follows.

The quantity α is less than 1 (unity), limiting the dependence of the decision variable on past values, and the use of α is equivalent to reducing the effect of each Euclidean distance as the data becomes older. In flowchart 1162, the updated decision variables are listed on the left as available on lines 1101, 1102, 1103, 1104, 1105, and 1106. Each decision variable in one of the phase transition paths is then multiplied by a less than 1 in one of the blocks 1100, after which the decay value of the old decision variable is added to the current value of the branch information, and the variable is Attenuation decision variable is indexed by the next phase on the phase transition path that is on it. This is done at block 1110. The variable D ₅ is shifted by an amount Δ in block 1193 and Δ is calculated in block 1112. As explained below, this amount is chosen to reduce inconsistencies in the sequence of phases determined by the system. The smallest decision variable is found at block 1120.

  In summary, new information specific to each decision is added to the previous value of the appropriate decision variable multiplied by α to obtain the current decision variable value. A new decision can be made when a new metric is available, so this technique can make a new decision when fields 1 and 2 of all frames are received. These decision variables are the sum of the Euclidean distances mentioned above.

The applicable phase is selected to be the phase with the subscript of the smallest decision variable. A decision based on the decision variable is made explicitly in block 1090 of FIG. Certain decisions are allowed in the decision space. As described in block 1091, these decisions are made at (i) the applicable phase is not P _5- video inverse telecine, (ii) the applicable phase is P _5- video deinterlace. is there.

Because metrics are derived from videos that are inherently variable, there may be occasional errors in the consistent decision sequence. This technique detects phase sequences that are not consistent with FIG. The operation is outlined in FIG. The algorithm 1400 saves the current phase determination subscript (= x) at block 1405 and the previous phase determination subscript (= y) at block 1406. In block 1410, it is tested whether x = y = 5, and in block 1411 the following values are obtained:

It is tested whether it is. If either of the two tests gives a positive result, at block 1420 the decision is declared consistent. If neither test is a positive result, the offset shown in block 1193 of FIG. 11 is calculated in FIG. 15 and added to the decision variable D ₅ associated with P ₅ .

Changes to D ₅ also has appeared in Figure 15 as part of the process 1500, process 1500 provides a correction action for mismatch sequence of phases. Assume that the consistency test at block 1510 of flowchart 1500 has failed. Proceeding along the “NO” branch extending from block 1510, the next test in block 1514 is D ₅ > D _i for all i <5, or alternatively, at least 1 for i <5. One variable D _i is greater than D ₅ . If the first case is valid, then in block 1516, the parameter δ, whose initial value is δ ₀ , is changed to 3δ ₀ . If the second case is valid, at block 1517 δ is changed to 4δ ₀ . In 152B block, the value of delta is updated, becomes delta _B, wherein

It is.

Returning again to block 15210, assume that the decision sequence is determined to be consistent. The parameter δ is

Is changed to δ ₊ defined by.

The new value of δ, in block 152A, is inserted into an updated relationship is delta _A of delta. this is

That's it. Thereafter, the updated value of Δ is added to decision variable D ₅ at block 1593.

  FIG. 16 shows how the inverse telecine process proceeds once the pull-down phase is determined. With this information, fields 1605 and 1605 'are identified as representing the same field of the video. The two fields are averaged together and combined with field 1606 to reconstruct frame 1620. The reconstructed frame is 1620 '. A similar process reconstructs frame 1622. The fields derived from frames 1621 and 1623 do not overlap. These frames are reconstructed by assembling their first and second fields together.

  In the aspect described above, each time a new frame is received, four new values of the metric are found and a set of six hypotheses is tested using the newly calculated decision variable. . Other processing structures can be adapted to calculate decision variables. A Viterbi decoder adds the metrics of the branches that together make up the path to form a path metric. The decision variables defined here are formed by similar rules, each of which is a “leaky” sum of new information variables. (In leaky addition, the previous value of the decision variable is multiplied by a number less than 1 and then new information data is added to it). The structure of the Viterbi decoder can be modified to support the operation of this procedure.

Although this aspect has been described with respect to conventional video processing where new frames appear every 1/30 second, it is noted that this process can also be applied to frames that are recorded and processed retrospectively. I want. The decision space remains the same, but there are small changes that reflect the time reversal of the sequence of input frames. For example, a consistent telecine decision sequence in time reversal mode (shown here)

Even has been reversed in time.

  The use of this variant of the first aspect tries to make the decision process twice-one time forward in time and once in the backward direction when making a valid decision. Make it possible. The two attempts are not independent but differ in that each attempt processes the metrics in a different order.

  This idea can be applied in conjunction with a buffer that is maintained to store future video frames that may additionally be needed. If a video segment is found to give an inconsistent result that is unacceptable in the forward direction of processing, the procedure is difficult for the video by retrieving future frames from the buffer and processing the frames in the reverse direction. Try to overcome stretch.

  The video processing described in this patent can also be applied to PAL format video.

Deinterlacer As used herein, a “deinterlacer” processes interlaced multimedia data in whole or in a significant portion to form progressive multimedia data (eg, configured to perform a process). A broad term that can be used to describe a deinterlacing system, device, or process (including software, firmware, or hardware).

  Broadcast video that is conventionally generated by a video camera, a broadcast studio, or the like conforms to the NTSC standard in the United States. A common method for compressing video is to interlace the video. In interlaced data, each frame consists of one of two fields. One field consists of odd lines of the frame and the other consists of even lines. Frames are generated at approximately 30 frames / second, while fields are recordings of television camera images at 1/60 second intervals. Each frame of the interlaced video signal represents every other horizontal line of the image. When the frame is projected on the screen, the video signal alternates between even and odd lines. If this is fast enough, for example at 60 frames per second, the video image will appear smooth to the human eye.

  Interlace has been used for decades in analog television broadcasts based on NTSC (US) and PAL (Europe) formats. Since only half of the image is transmitted with each frame, interlaced video uses approximately half the bandwidth compared to transmitting the entire image. The final video display format inside the terminal 16 is not necessarily NTSC compatible, and the interlaced data cannot always be displayed immediately. Instead, modern pixel-based displays (eg, LCD, DLP, LCOS, plasma, etc.) are progressively scanned and display progressively scanned video sources (while many older video devices are more Using old interlaced scanning technique). Some examples of commonly used deinterlacing algorithms are P.I. Haavisto, J.M. Juhola, Y. et al. Neuvo's “Scan rate up-conversion using adaptive media filtering”, Signal Processing of HDTV II, pages 703-710, 1990; Simonetti, S.M. Carrato, G.G. Ramponi, A.M. Polo Filisan, “Deinterlacing of HDTV Images for Multimedia Applications”, Signal Processing of HDTV IV, pages 765-772, 1993.

  Examples of deinterlacing aspects for systems and methods that can be used alone or in combination to improve deinterlacing performance and that can be used in deinterlacer 405 (FIG. 4) are described below. Such an aspect can use space-time filtering to determine a first tentative deinterlaced frame and deinterlace the selected frame and determine a second tentative deinterlaced frame from the selected frame. Using bi-directional motion estimation and motion compensation for combining and then combining first and second provisional frames to form a final progressive frame. Spatio-temporal filtering may use a weighted median filter (“Wmed” filter) that may include a horizontal edge detector that prevents blurring around or near the horizontal edge. Spatio-temporal filtering of the leading and trailing neighboring fields of the “current” field is an intensity motion-level map that classifies portions of the selected frame into different motion levels, eg, stationary, slow motion, and fast motion. ) Is generated.

  In some aspects, the intensity map is generated by Wmed filtering using a filter aperture that includes pixels of five neighboring fields (two leading fields, current field, and two trailing fields). Wmed filtering can determine forward, backward, and bi-directional stationary region detection that can effectively handle scene changes and objects that appear and disappear. In various aspects, the Wmed filter can be utilized between one or more fields of the same even-oddness in inter-field filtering mode and can be adjusted within the field by fine-tuning the threshold criteria. It can be switched to (intra-field) filtering mode. In some aspects, motion estimation and compensation is performed with a luma (pixel brightness or brightness) to improve the de-interlaced region of the selected frame, where the brightness levels are almost uniform but differ in color. ) And chroma (pixel color information) data. A noise reduction filter can be used to improve the accuracy of motion estimation. The noise reduction filter can be applied to Wmed deinterlaced provisional frames to remove alias artifacts generated by Wmed filtering. The deinterlacing methods and systems described below have a relatively low computational complexity that yields good deinterlacing results and enables high speed deinterlacing implementations, such as cell phones, computers, and It makes such an implementation suitable for various deinterlacing applications, including systems used to provide data to other types of electronic or communication devices that utilize a display.

  Aspects of deinterlacers and deinterlacing methods are described herein with reference to various components, modules, and / or steps used to deinterlace multimedia data.

  FIG. 17 is a block diagram illustrating one aspect of a deinterlacer 1700 that can be used as the deinterlacer 405 of FIG. Deinterlacer 1722 includes a spatial filter 1730 that filters at least a portion of the interlaced data spatially and temporally (“spatiotemporal”) to generate spatiotemporal information. For example, in the spatial filter 1730, Wmed can be used. In some aspects, deinterlacer 1700 also includes a noise reduction filter (not shown), such as, for example, a Weiner filter or a wavelet shrinkage filter. Deinterlacer 1700 also includes a motion estimator 1732 that provides motion estimation and compensation for selected frames of interlaced data and generates motion information. A combiner 1734 receives the spatio-temporal information and motion information and combines them to form a progressive frame.

  FIG. 18 is another block diagram of deinterlacer 1700. The processor 1836 of the deinterlacer 1700 includes a spatial filter module 1838, a motion estimation module 1840, and a combiner module 1842. Interlaced multimedia data from the external source 48 can be provided to the communication module 44 of the deinterlacer 1700. The deinterlacer and its components or steps can be implemented by hardware, software, firmware, middleware, microcode, or any combination thereof. For example, a deinterlacer can be a stand-alone component, can be embedded in a component of another device as hardware, firmware, middleware, or can be implemented in microcode or software running on a processor, Or they can be a combination thereof. When implemented in software, firmware, middleware, or microcode, program code or code segments that perform deinterlacer tasks can be stored on machine-readable media such as storage media. A code segment can correspond to a procedure, function, subprogram, program, routine, subroutine, module, software package, class, or any combination of instructions, data structures, or program statements. A code segment can be coupled to another code segment or a hardware circuit by passing and / or receiving information, data, arguments, parameters, or memory contents.

  The received interlaced data may include, for example, a chip configuration storage medium (eg, ROM, RAM) or a disk type storage medium (eg, magnetic or optical) connected to the processor 1836. 1846 can be stored. In some aspects, the processor 1836 may include some or all of the storage media. The processor 1836 is configured to process the interlaced multimedia data to form a progressive frame, after which the progressive frame is provided to another device or process.

Conventional analog video devices, such as televisions, draw video in an interlaced manner, that is, such devices transmit even numbered scan lines (even fields) and odd numbered scan lines (odd fields). From a signal sampling perspective, this is

Is equivalent to the spatiotemporal subsampling in the pattern shown by where Θ represents the original frame image, F represents the interlaced field, and (x, y, n) is the horizontal, vertical and Each time position is represented.

Without loss of generality, anywhere in this disclosure it can be assumed that n = 0 is an even field, so that

It is simplified as follows.

  Since decimation is not performed in the horizontal dimension, the sub-sampling pattern can be expressed by the following ny coordinates. In FIG. 19, both circles and stars represent locations where the original full frame image has sample pixels. The interlace process decimates the star pixels, leaving the circular pixels intact. Note that the vertical positions are indexed starting from 0, so the even field is the most significant field and the odd field is the least significant field.

The goal of the deinterlacer is to convert interlaced video (sequence of fields) into non-interlaced progressive frames (sequence of frames). In other words, the even and odd fields are interpolated to “recover” or generate the full frame image. This can be represented by Equation 25:

Where F _i represents the deinterlace result for the lost pixel.

FIG. 20 is a block diagram illustrating some aspects of one aspect of a deinterlacer that uses Wmed filtering and motion estimation to generate progressive frames from interlaced multimedia data. The upper portion of FIG. 20 is a motion intensity map 2052 that can be generated using information from the current field, two previous fields (PP field and P field), and two subsequent fields (next field and next field). Is shown. The motion intensity map 2052 can be generated by space-time filtering that classifies or partitions the current frame into two or more different motion levels and is described in further detail herein below. In some aspects, the motion intensity map 2052 is generated to identify stationary regions, slow motion regions, and fast motion regions, as described below with reference to equations 4-8. A space / time filter, such as the Wmed filter 2054, filters the interlaced multimedia data using criteria based on the motion intensity map to generate a spatiotemporal temporary deinterlaced frame. In some aspects, the Wmed filtering process includes a horizontal neighborhood [-1, 1], a vertical neighborhood [ ^-3 , 3], and the five fields shown in FIG. 20 where Z ^-1 represents a delay of one field. It includes a time neighborhood consisting of five adjacent fields represented by (PP field, P field, current field, next field, next field). For the current field, the next field and the P field are fields that do not match even-oddity, and the PP field and the next field are fields that match even-oddity. “Neighborhood” as used with respect to spatio-temporal filtering refers to the spatial and temporal positions of the fields and pixels that are actually used during the filtering operation, and are shown as “apertures” as shown, for example, in FIGS. be able to.

  The deinterlacer can also include a noise reducer (noise reduction filter) 2056. The noise reducer 2056 is configured to filter the space-time provisional deinterlaced frame generated by the Wmed filter 2056. The noise reduction of the space-time provisional deinterlaced frame makes the subsequent motion search process more accurate, especially when the source interlaced multimedia data sequence is contaminated with white noise. Noise reduction can also at least partially remove aliases between even and odd rows in the Wmed image. The noise reducer 2056 can be implemented as a variety of filters, including wavelet reduction and wavelet winer filter based noise reducers, also described further herein below.

  The lower part of FIG. 20 illustrates one aspect of determining motion information (eg, motion vector candidates, motion estimation, motion compensation) of interlaced multimedia data. In particular, FIG. 20 generates a tentative progressive frame with motion compensation of the selected frame, and then combines it with the Wmed tentative frame to produce the resulting “final” progressive frame shown as a deinterlaced current frame 2064. The motion estimation and motion compensation scheme used to form is described. In some aspects, motion vector (“MV”) candidates (or estimates) of interlaced multimedia data are provided from an external motion estimator to a deinterlacer, and a bidirectional motion estimator and compensator (“ME / MC” ") Used to provide a starting point for 2068. In some aspects, the MV candidate selector 2072 is for MV candidates for the processed block, for neighboring blocks such as, for example, an MV of a previously processed block, such as a block in the deinterlace previous frame 2070. Use the previously determined MV. Motion compensation can be performed bi-directionally based on the previous deinterlace frame 70 and the next (eg, future) Wmed frame 2058. The current Wmed frame 2060 and the motion compensation (“MC”) current frame 2066 are merged or combined by a combiner 2062. The resulting deinterlaced current frame 2064 is now a progressive frame and is returned to the ME / MC 2068 for use as a deinterlace previous frame 2070 for further processing, eg compression and transmission to a display terminal. Therefore, it is also transmitted to the outside of the deinterlacer. Various aspects shown in FIG. 20 are described in more detail below.

  FIG. 25 shows a process 2500 for processing multimedia data to generate a sequence of progressive frames from a sequence of interlaced frames. In one aspect, the progressive frame is generated by the deinterlacer 405 shown in FIG. At block 2502, process 2500 (process “A”) generates spatio-temporal information for the selected frame. The spatio-temporal information can include information used to classify the motion level of the multimedia data and generate a motion intensity map, and is used to generate the Wmed interim deinterlace frame and its frame Information (for example, information used in Expression 26 to Expression 33) is included. This process can be performed by the Wmed filter 2054 as shown in the upper portion of FIG. 20 and its associated processing described in more detail below. In process A shown in FIG. 26, at block 2602, the regions are classified into different motion level fields, as further described below.

  Next, at block 2504 (process “B”), process 2500 generates motion compensation information for the selected frame. In one aspect, a bi-directional motion estimator / motion compensator 2068 shown in the lower portion of FIG. 20 can perform this process. Process 2500 then proceeds to block 2506 and deinterlaces the fields of the selected frame based on the spatio-temporal information and motion compensation information to form a progressive frame associated with the selected frame. This can be done by the coupler 2062 shown in the lower part of FIG.

Motion Intensity Map A motion intensity map 2052 can be determined by processing the pixels of the current field for each frame to determine different “motion” regions. One exemplary manner of determining three categories of motion intensity maps is described below with reference to FIGS. The motion intensity map can indicate the region of each frame as a stationary region, a slow motion region, and a fast motion region based on a comparison of pixels of the same even and odd fields.

Still region The determination of the still region of the motion map comprises processing pixels in the neighborhood of neighboring fields to determine if the luminance difference of a pixel meets a certain criterion. In some aspects, the determination of the static region of the motion map may include determining whether a luminance difference of a pixel satisfies a certain threshold by using five adjacent fields (current field (C), time from current field). In the vicinity of the first two fields (and two frames later in time than the current field). These five fields are shown in FIG. 20 where Z ⁻¹ represents a delay of one field. In other words, the five adjacent fields are typically displayed in such a sequence with a delay time of Z- ¹ .

FIG. 21 illustrates an aperture that identifies a pixel in each of the five fields that can be used for space-time filtering, according to some aspects. From left to right, the aperture includes a 3 × 3 pixel group of a first field (PP), a previous field (P), a current field (C), a next field (N), and a next field (NN). In some aspects, the region of the current field corresponds to the criteria shown in Equations 26-28 for the pixel location and corresponding field shown in FIG.

And

Or

If it satisfies, it is considered stationary in the motion map, where
T ₁ is a threshold value,
L _P is the luminance of pixel P located in the P field,
L _N is the luminance of pixel N located in the N field,
L _B is the luminance of pixel B currently in the field,
L _E is the luminance of the pixel E positioned currently in the field,
L _BPP is the luminance of pixel B _PP located in the PP field,
L _EPP is the luminance of the pixel E _PP located in the PP field,
L _BNN is the luminance of the pixel B _NN located in the NN field, and L _ENN is the luminance of the pixel E _NN located in the NN field.

The threshold T ₁ can be predetermined, set to a specific value, determined by a process other than deinterlacing, and provided (eg, as metadata for deinterlaced video). Or can be determined dynamically during deinterlacing.

  The static region criteria shown in Equations 26, 27, and 28 above use more fields than conventional deinterlacing techniques for at least two reasons. First, comparisons between fields with the same even-oddity have lower alias and phase mismatch than comparisons between fields with different even-oddity. However, the minimum time difference (and thus the correlation) between the field being processed and the nearest neighbor field with the same even-oddity is two fields, which is greater than the minimum time difference between neighboring fields with different even-oddity. The combination of a field with higher even-oddity with higher reliability and a field with the same even-oddity with lower alias can improve the accuracy of still region detection.

  In addition, the five fields can be symmetrically distributed in the past and future with respect to the pixel X of the current field C, as shown in FIG. The rest area may be subdivided into three categories: forward rest (still with respect to the previous frame), rear rest (still with respect to the next frame), or bi-directional rest (when both forward and rear criteria are met). it can. This finer classification of still areas can improve performance especially during scene changes and when objects appear / disappear.

Slow motion region A region of a motion map can be considered as a slow motion region in a motion map if the luminance value of a pixel does not meet the criteria indicating a still region, but meets the criteria indicating a slow motion region. Equation 29 below defines a criterion that can be used to determine the slow motion region. Referring to FIG. 22, the positions of the pixels Ia, Ic, Ja, Jc, Ka, Kc, La, Lc, P, N identified by Equation 29 are shown in the aperture centered on pixel X. The aperture includes a 3 × 7 pixel neighborhood of the current field (C) and a 3 × 5 neighborhood of the next field (N) and the previous field (P). Pixel X does not meet the criteria listed above for the static region, and the pixel in the aperture is

Is considered to be part of the slow motion region, where
T ₂ is a threshold value,
L _Ia , L _Ic , L _Ja , L _Jc , L _Ja , L _Jc , L _Ka , L _Kc , L _La , L _Lc , L _P , L _N are pixels Ia, Ic, Ja, Jc, Ka, Kc, respectively. , La, Lc, P, N luminance values.

Threshold T ₂ are again pre determined, can be set to a particular value, as determined by the deinterlacing process other than are provided (e.g., as metadata for video to be de-interlaced) Or can be determined dynamically during deinterlacing.

Note that the filter may blur horizontal edges (eg, the angle formed by the vertical line is greater than 45 °) due to the angle-dependent edge detection capability. For example, the edge detection capability of the aperture (filter) shown in FIG. 22 is affected by the angle formed by pixels “A” and “F” or “C” and “D”. Edges such as horizontal rather than such angles are not optimally interpolated and therefore staircase artifacts may appear at such edges. In some aspects, the slow motion category can be divided into two sub-categories, “Horizontal Edge” and “Other”, to account for this edge detection result. Slow motion pixels can be classified as horizontal edges if the criteria in Equation 30 shown below are met, and in the so-called “other” category if the criteria in Equation 30 are not met.

Here, _{T 3} is the threshold, LA, LB, LC, LD , LE, LF is the luminance value of the pixels A, B, C, D, E, F.

  Different interpolation methods can be used for each of the horizontal edges and other categories.

Fast Motion Region If a criterion for a stationary region and a criterion for a slow motion region are not met, the pixel can be considered to be in a fast motion region.

After classifying the pixels of the selected frame, process A (FIG. 26) proceeds to block 2604 and generates a provisional deinterlaced frame based on the motion intensity map. In this aspect, the Wmed filter 2054 (FIG. 20) filters the selected field and the necessary neighboring fields to provide a candidate full frame image F ₀ that can be defined as:

Here, α _i (i = 0, 1, 2, 3) is an integer weight calculated as follows.

The Wmed filtered provisional deinterlace frame is provided for further processing in cooperation with motion estimation and motion compensation processing, as shown in the lower part of FIG.

As described above and shown in Equation 31, static interpolation comprises inter-field interpolation, and slow and fast motion interpolation comprises intra-field interpolation. In certain aspects where temporal (eg, field-to-field) interpolation of fields with the same oddity is not desired, temporal interpolation sets threshold T ₁ (Equations 4-6) to zero (T ₁ = 0). By doing so, it can be made “unusable”. Processing of the current field with temporal interpolation disabled results in no region of the motion level map being classified as stationary, and the Wmed filter 2054 (FIG. 20) is a combination of the three shown in the aperture of FIG. Uses a field and operates on a field that differs from the current field by two adjacent oddities.

Noise Reduction In some aspects, a noise reducer can be used to remove noise from the candidate Wmed frame before the candidate Wmed frame is further processed using motion compensation information. The noise reducer can remove the noise present in the Wmed frame and keep the signal regardless of the frequency content of the signal. Various types of noise reduction filters can be used, including wavelet filters. Wavelets are a class of functions used to localize a given signal, both in space and in the scaling domain. The basic idea behind wavelets is to analyze signals at different scales or resolutions so that small changes in the wavelet representation produce corresponding small changes in the original signal.

In some aspects, the noise reduction filter is based on one aspect of a (4,2) biorthogonal cubic B-spline wavelet filter. One such filter has the following forward and inverse transforms:

and

Can be defined by

  The application of the noise reduction filter can improve the accuracy of motion compensation in a noisy environment. The noise in the video sequence is assumed to be additive white Gaussian. The estimated variance of noise is represented by σ. It can be estimated as the median absolute deviation of the highest frequency subband coefficient divided by 0.6745. Implementation of such a filter is described in D.C. L. Donoho, I.D. M.M. Johnstone's “Ideal spatial adaptation by wavelet shrinkage”, Biometrica, vol. 8, pages 425-455, 1994, which is incorporated herein by reference in its entirety.

  Wavelet reduction or wavelet Wiener filters can also be applied as noise reducers. Wavelet reduced noise reduction can include reducing the wavelet transform domain and generally comprises three steps: linear wavelet forward transformation, nonlinear reduced noise reduction, and linear wavelet inverse transformation. The Wiener filter is an MSE optimal linear filter that can be used to improve images degraded by additive noise and blur. Such filters are generally known in the art and are described, for example, in “Ideal spatial adaptation by wavelet shrinkage” referenced above, and in S.A. P. Ghael, A.M. M.M. Sayeded, R.M. G. Baraniuk, “Improvement Wavelet Denaturing Via Emperoral Wiener Filtering”, Proceedings of SPIE, vol 3169, pages 389-399, San Diego, July 1997.

Motion Compensation Referring to FIG. 27, at block 2702, process B performs bi-directional motion estimation, and then at block 104, using motion estimation, is further illustrated in FIG. Motion compensation, described in a general manner, is performed. There is a “lag” of one field between the Wmed filter and the motion compensation based deinterlacer. The motion compensation information for the “lost” data of the current field “C” (pixel data of non-original rows) is the previous frame “P” and the next frame as shown in FIG. Predicted from both “N” information. In the current field (FIG. 23), the solid line represents the line where the original pixel data exists, and the broken line represents the line where the Wmed interpolated pixel data exists. In one aspect, motion compensation is performed in the vicinity of 4 rows by 8 columns of pixels. However, this pixel neighborhood is an illustrative example, and motion compensation can be performed in other ways based on pixel neighborhoods with different numbers of rows and different numbers of columns, and their selection is It will be apparent to those skilled in the art that it can be based on many factors including, for example, computational speed, available processing power, or characteristics of the deinterlaced multimedia data. Since the current field is only half of the row, the 4 rows to be matched actually correspond to an area of 8 pixels by 8 pixels.

  Referring to FIG. 20, the bidirectional ME / MC 2068 measures the similarity between the prediction block and the prediction block to compare the Wmed current frame 2060 with the Wmed next frame 2058 and the deinterlaced current frame 2070. The sum of squared errors (SSE) that can be used can be used. Generation of the motion compensated current frame 2066 then uses the pixel information from the most similar match block to fill in the missing data locations between the original pixel rows. In some aspects, the bi-directional ME / MC 2068 biases or gives greater weight to pixel information from the information in the deinterlaced previous frame 2070, which means that the deinterlaced previous frame 2070 is motion compensated. This is because the Wmed next frame 2058 is only deinterlaced by space-time filtering, whereas it is generated by information and Wmed information.

  In some aspects, one or more luma group of pixels (e.g., one 4 row x 1) to improve matching performance in areas of fields that have similar luma but different chroma areas. A metric can be used that includes pixel value contributions of 8 column luma blocks) and one or more chroma group of pixels (eg, 2 2 × 4 luma blocks U, V). . Such an approach effectively reduces mismatches in color sensitive areas.

  The motion vector (MV) has a 1/2 pixel granularity in the vertical dimension and 1/2 or 1/4 pixel granularity in the horizontal dimension. An interpolation filter can be used to obtain fractional pixel samples. For example, some filters that can be used to acquire half-pixel samples are bilinear filters (1,1), H. Includes interpolation filters (1, -5, 20, 20, -5, 1) recommended by H.263 / AVC and 6-tap Hamming window sinc function filters (3, -21, 147, 147, -21, 3) . Quarter pixel samples can be generated from full and half pixel samples by applying a bilinear filter.

  In some aspects, motion compensation may be used to match data at one location in the current frame (eg, drawing of an object) with corresponding data at different locations in another frame (eg, the next or previous frame). Any type of search process can be used, and the difference in position within each frame indicates the movement of the object. For example, the search process can be a full motion search that can cover a larger search area, or a fast motion search that can use fewer pixels and / or selected pixels used in a search pattern that can have a particular shape, such as a diamond. Is used. In the case of fast motion search, the center of the search area can be placed in a motion estimation or motion candidate that can be used as a starting point for searching for adjacent frames. In some aspects, MV candidates may be generated with an external motion estimator and provided to the deinterlacer. The motion vector of the macroblock belonging to the corresponding neighborhood in the adjacent frame that has been previously subjected to motion compensation can also be used as motion estimation. In some aspects, MV candidates can be generated from searching for macroblock neighborhoods (eg, 3 macroblocks × 3 macroblocks) of corresponding previous and next frames.

FIG. 24 shows an example of two MV maps, MV _P and MV _N , that can be generated during motion estimation / compensation by searching for neighborhoods of the previous and next frames as shown in FIG. Show. In both MV _P and MV _N, the block processed to determine motion information is the central block represented by “X”. There are nine MV candidates in both MV _P and MV _N that can be used during motion estimation for the current block X being processed. In this example, four MV candidates from the previously performed motion search are present in the same field, indicated by lighter colored blocks in MV _P and MV _N (FIG. 24). The other five MV candidates indicated by the darker colored blocks are copied (or mapped) from previously processed frame motion information.

After the motion estimation / compensation is completed, one interpolation result (Wmed current frame 2060 in FIG. 20) generated by the Wmed filter and another interpolation result (MC current frame generated by the motion estimation process of the motion compensator). The two interpolation results of 2066) result in a lost line. Combiner 2062 generally merges Wmed current frame 2060 and MC current frame 2066 by using at least a portion of Wmed current frame 2060 and MC current frame 2066 to generate current deinterlaced frame 2064. . However, under certain conditions, combiner 2062 may generate a current deinterlaced frame using only one of current frame 2060 or MC current frame 2066. In one example, combiner 2062 merges Wmed current frame 2060 and MC current frame 2066 as shown in Equation 36 to produce a deinterlaced output signal,

here,

Is used for the luminance value at the position x = (x, y) t field n i, t denotes the transpose.

With clip function defined as, k _i is

Where C ₁ is a robust parameter and Diff is the luma difference between the predicted frame pixel and the available pixel in the predicted frame (taken from an existing frame). By appropriately selecting C1, it is possible to adjust the relative importance of the mean square error. k ₂ can be calculated as shown in Equation 39,

here,

Is a motion vector, and δ is a small constant to prevent division by zero. Deinterlacing using clip functions for filtering is D. Haan, E .; B. Bellers, “De-interlacing of video data”, IEEE Transactions on Consumer Electronics, Vol. 43, no. 3, pages 819-825, 1997, which is incorporated herein in its entirety.

In some aspects, the combiner 2062 can be configured to try and maintain the following equation to achieve high PSNR and robust results.

  It is possible to decouple the deinterlace prediction scheme with inter-field interpolation from intra-field interpolation using the Wmed + MC deinterlace scheme. In other words, spatio-temporal Wmed filtering can be used primarily for intra-field interpolation purposes, while inter-field interpolation can be performed during motion compensation. This reduces the peak signal-to-noise ratio of the Wmed result, but the bad quality from inaccurate inter-field prediction mode determination is removed from the Wmed filtering process, so the visual quality after motion compensation is applied is More preferred.

  Chroma processing can be consistent with coexisting luma processing. For motion map generation, chroma pixel motion levels are obtained by observing the motion levels of four coexisting luma pixels. The operation can be based on voting (the chroma motion level borrows the dominant luma motion level). However, the inventors propose to use a conventional technique as follows. If any one of the four luma pixels has a fast motion level, the chroma motion level is fast, otherwise if any one of the four luma pixels has a slow motion level, the chroma motion level is slow. It is motion, otherwise the chroma motion level is stationary. Conventional approaches may not achieve the highest PSNR, but avoid the risk of using INTER prediction whenever there is ambiguity in chroma motion levels.

The multimedia data sequence is deinterlaced using the described Wmed algorithm alone and using the combined Wmed and motion compensation algorithm described herein. The same multimedia data series is also deinterlaced using a pixel blending (or average) algorithm, and in the case of “no deinterlacing”, the fields are simply combined without any interpolation or blending. . The resulting frame was analyzed to determine PSNR and is shown in the table below.

  As mentioned above, the combination of the Wmed result and the MC result is an even field, even though the improvement in PSNR due to deinterlacing using MC in addition to Wmed is only insufficient. The visual quality of the deinterlaced image generated by combining the Wmed and MC interpolation results is more favorable because it suppresses aliasing and noise between the and odd fields.

  In some resampling aspects, a polyphase resampler is implemented for resizing the image size. In one example of downsampling, the ratio between the original image and the resized image can be p / q, where p and q are relatively prime integers. The total number of phases is p. In some aspects, when the resizing factor is about 0.5, the cutoff frequency of the polyphase filter is 0.6. The cut-off frequency does not exactly match the resizing ratio in order to raise the high frequency response of the resizing sequence. This inevitably allows some aliasing. However, it is well known that the human eye prefers a clear image with a slight alias over a blurry image without an alias.

FIG. 42 shows an example of multi-phase resampling showing the phase when the resizing ratio is 3/4. The cut-off frequency shown in FIG. 42 is also 3/4. The original pixel is shown in FIG. 42 above using the vertical axis. A sinc function is also drawn around the axis to represent the filter waveform. Since the cut-off frequency was selected to be exactly the same as the resampling ratio, the sinc function zero overlaps with the resized pixel position, as shown in FIG. To find the resized pixel value, the contributions from the original pixel can be summed, as shown in the equation below,

Here, f _c is the cutoff frequency. The ID polyphase filter described above can be applied in both horizontal and vertical dimensions.

  Another aspect of resampling (resizing) considers overscan. For NTSC television signals, an image can have 486 scan lines, and for digital video, it can have 720 pixels on each scan line. However, not all of the entire image is visible on the television because of a mismatch between size and screen format. The part of the image that is not visible is called overscan.

  To help broadcasters put useful information in areas that are visible on as many televisions as possible, the Society of Motion Picture & Television Engineers (SMPTE) has created safe action areas and safe titles. A specific size of action frame called area was defined. Please refer to SMPTE Recommended Practice RP27.3-1989 from Specifications for Safe Action and Safe Title Area Test Pattern for Television Systems. The safe action area is defined by SMPTE as the "all important actions must take place" area. The safe title area is defined as an area where “all useful information can be stored there to guarantee visibility in the majority of home television receivers”. For example, as shown in FIG. 43, the safe action area 4310 occupies the center 90% of the screen and leaves a 5% edge area around it. The safe title area 4305 occupies the center 80% of the screen and leaves a 10% edge area. Figure.

  Referring now to FIG. 44, the safe title area is so small that some broadcasts include text in the safe action area inside the white rectangular window 4415 to add more content to the image. Usually, a black edge region may be seen in overscan. For example, in FIG. 44, black edge regions appear on the upper side 4420 and the lower side 4425 of the image. H. Since H.264 video uses boundary extension in motion estimation, these black edge regions can be removed in overscan. The expanded black border area can increase the residue. Conservatively, the border can be cut by 2% and then resized. Resizing filters can be generated accordingly. Truncation is performed to remove overscan prior to polyphase downsampling.

Deblocking / Deringing In one example of the deblocking process, the deblocking filter is applied to all 4x4 block edges of the frame except for the edge of the frame boundary and the edge where the deblocking filter is disabled. Can do. This filtering process is performed based on the macroblock after completion of the frame construction process, and all macroblocks in the frame are processed in ascending order of macroblock addresses. For each macroblock, the vertical edges are first filtered from left to right and then the horizontal edges are filtered from top to bottom. As shown in FIG. 39, for horizontal and vertical directions, the luma deblocking filter process is performed on four 16 sample edges, and the deblocking filter process for each chroma component is performed on two eight sample edges. Executed. The sample values above and to the left of the current macroblock, which may have been changed by a deblocking process operation on the preceding macroblock, are used as input to the deblocking filter process on the current macroblock, It may change further during the current macroblock filtering. Sample values modified during vertical edge filtering can be used as input for horizontal edge filtering of the same macroblock. The deblocking process can be started separately for luma and chroma components.

  In one example of deringing processing, a 2-D filter can be adaptively applied to smooth the region near the edge. Edge pixels are filtered little or not at all to avoid blurring.

GOP Partitioner An illustrative example of processing that includes bandwidth map generation, shot detection, and adaptive GOP partitioning is described below, and such processing can be included in the GOP partitioner.

Bandwidth Map Generation Human visual quality V can be a function of both encoding complexity C and allocated bits B (also called bandwidth). FIG. 29 is a graph showing this relationship. Note that the coding complexity metric C takes into account the spatio-temporal frequency from the perspective of human vision. In the case of strain, the more sensitive the human eye is, the correspondingly higher the value of complexity. It can generally be assumed that V monotonically decreases for C and monotonically increases for B.

In order to achieve a constant visual quality, a bandwidth (B _i ) that meets the criteria expressed by the two equations below is allocated to the i th object (frame or MB) to be encoded.

The immediate two equations above, C _i is the complexity of the encoding of the i object, B is the total available bandwidth, V is a visual quality achieved with respect to the object.

Human visual quality is difficult to formulate as a formula. Therefore, the above set of equations is not precisely defined. However, if the 3-D model is assumed to be continuous across all variables, the ratio band (B _i / B) can be treated as having no change within the vicinity of the (C, V) pair. . The ratio band β _i is defined by the following equation.

Bit allocation can be defined as expressed by the following equation:

Here, δ represents “neighborhood”.

Coding complexity is affected by human visual sensitivity, both spatially and temporally. Girod's human visual model is an example of a model that can be used to define spatial complexity. This model takes into account local spatial frequencies and ambient lighting. The resulting metric is called D _csat . Since it is not known at the pre-processing time of the process whether the image is intra-coded or inter-coded, a ratio band for both is generated. Bits are allocated according to the ratio between β _INTRA of different video objects. In the case of an intra-coded image, the ratio band is expressed by the following equation.

In the above equation, Y is the average luminance component of the macroblock, α _INTRA is the weighting factor for the square of the luminance, followed by the D _csat term, and β 0 _INTRA is

Is a normalization coefficient for guaranteeing For example, a value of α _INTRA = 4 achieves good visual quality. Content information (eg, content classification) can be used to set α _INTRA to a value that corresponds to a good visual quality level desired for the particular content of the video. In one example, if the video content comprises a news broadcast with a “speaker's face”, the visual quality level is set lower because the information image or viewable part of the video can be considered less important than the audio part. Fewer bits can be allocated to encode the data. In another example, if the video content comprises a sporting event, the display information can be more important to the viewer, so the content information can be used to set α _INTRA to a value corresponding to a higher visual quality level. Thus, more bits can be allocated to encode the data.

  To understand this relationship, note that bandwidth is allocated according to the logarithm of encoding complexity. The luminance squared term Y reflects the fact that the larger magnitude coefficient uses more bits to encode. To prevent the logarithm from taking a negative value, 1 is added to the term in parentheses. Logarithms with other bases can also be used.

  Time complexity is determined by measuring a frame difference metric that measures the difference between two consecutive frames considering the amount of motion (eg, motion vector) in addition to a frame difference metric such as the sum of absolute differences (SAD). Is done.

In addition to spatial complexity, bit allocation of inter-coded images can take into account time complexity. This is expressed as follows.

In the above equation, MV _P and MV _N are the forward and backward motion vectors of the current MB. Note that Y ^{2 in the} intra-coding bandwidth formula is replaced by the sum of squared residuals (SSD). To understand the role of ‖MV _P + MV _N ‖ ² in the above formula, the following features of the human visual system, namely, the area experiencing predictable motion smooth (small ‖MV _P + MV _N ‖ ² ) Can be caught and tracked by the eye, and is generally characterized by being able to withstand only as much strain as the rest region. However, regions experiencing fast or unpredictable motion (large ‖MV P ₊ MV _N || ²⁾ can not be tracked and can tolerate significant quantization. Experiments have shown that α _INTER = 1, γ = 0.001 achieves good visual quality.

Shot Detection An illustrative example of shot detection is described below. Such components and processes can be included in GOP partitioner 412 (FIG. 4).

  Motion compensator 23 can be configured to determine bi-directional motion information for frames in the video. The motion compensator 23 determines one or more difference metrics, eg, sum of absolute differences (SAD) or sum of absolute differences (SSD), and provides luminance information (eg, macroblock ( MB) luminance average or difference), luminance histogram difference, and other information, including frame difference metrics, examples of which are described with reference to Equations 1-3, can also be configured to calculate. The shot classifier can be configured to classify the frames in the video into two or more “shot” categories using information determined by the motion compensator. The encoder is configured to adaptively encode the plurality of frames based on the shot classification. The motion compensator, shot classifier, and encoder are described below with reference to Equations 1-10.

  FIG. 28 is a block diagram of a preprocessor 202 comprising a processor 2831 configured for shot detection and other preprocessing operations according to some aspects. The digital video source can be provided by a source external to the preprocessor 202 as shown in FIG. 4 and communicated to the communication module 2836 in the preprocessor 202. Preprocessor 202 includes a storage medium 2825 that communicates with processor 2831, both of which communicate with communication module 2836. The processor 2831 includes a motion compensator 2032, a shot classifier 2833, and another module 2034 for preprocessing, which generates motion information, classifies shots within a frame of video data, It can operate to perform other pre-processing tests as described in the document. Motion compensators, shot classifiers, and other modules can include processes similar to the corresponding modules of FIG. 4 and can process the video to determine the information described below. In particular, the processor 2831 obtains a metric that represents a difference between adjacent frames of the plurality of video frames comprising bidirectional motion information and luminance information, and determines shot changes in the plurality of video frames based on the metric. And may have a configuration for adaptively encoding multiple frames based on shot changes, and in some aspects the metrics are not only external to the processor 2831 but also external to the preprocessor 202. Can be computed by a device or process and can be communicated to the processor 2831 either directly or indirectly through another device or memory. The metric can be calculated by the processor 2831, for example, by the motion compensator 2832.

  Preprocessor 202 provides video and metadata for further processing, encoding, and transmission to other devices such as terminal 6 (FIG. 1). The encoded video may in some aspects be a scalable multi-layer encoded video that may comprise a base layer and an enhancement layer. Scalable layer coding is further described in a co-pending US patent application entitled "SCALABLE VIDEO CODING WITH TWO LAYER ENCODER AND SINGLE LAYER DECODER" owned by the assignee of the present invention [Docket No. 050078] This application is incorporated herein by reference in its entirety.

  Various exemplary logic blocks, components, modules, and circuits described in connection with FIG. 28 and other examples and figures disclosed herein, in some aspects, are described herein. A general purpose processor, digital signal processor (DSP), application specific integrated circuit (ASIC), field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, It can be implemented or performed using discrete hardware components, or any combination thereof. A general purpose processor such as the processor shown in FIG. 28 may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor is a combination of computing devices such as, for example, a combination of a DSP and a microprocessor, a combination of a plurality of microprocessors, a combination of one or more microprocessors that cooperate with a DSP core, or any other such configuration. May be implemented.

  Video coding typically operates on a structured group of pictures (GOP). A GOP typically starts with an intra-coded frame (I frame), followed by a series of P (predictive) or B (bidirectional) frames. In general, an I frame can store all data for displaying the frame, and a B frame depends on the data in the previous and subsequent frames (eg, data modified from the previous frame or in the next frame). P frame includes data changed from the previous frame.

  In general use, I frames are interleaved with P and B frames within the encoded video. With respect to size (eg, the number of bits used to encode a frame), an I frame is generally larger than a P frame, which is larger than a B frame. For efficient encoding, transmission, and decoding processes, the length of the GOP must be long enough to reduce the efficient loss from a large I-frame, and a mismatch between encoder and decoder or Must be short enough to cope with channel failure. In addition, macroblocks (MB) in P frames can be intra-coded for similar reasons.

  Scene change detection can be used to insert an I frame based on the GOP length instead of the video encoder determining the appropriate GOP length and inserting the I frames at fixed intervals. In real streaming video systems, the communication channel is usually damaged by bit errors or packet loss. Where to place I frames or I MBs can greatly affect the decoded video quality and viewing experience. One encoding scheme is to use intra encoded frames for images or image portions that have significant changes from the coexisting previous image or image portion. Typically, these regions cannot be predicted effectively and efficiently using motion estimation and if such regions are excluded from interframe coding techniques (eg, B and P frames). Encoding used), the encoding can be performed more efficiently. In channel failure situations, these regions are likely to suffer from the adverse effects of error propagation, but error propagation can be reduced or eliminated (or nearly eliminated) by intraframe coding.

  The portions of the GOP video can be classified into two or more categories, and each region can have a different intraframe coding standard that can depend on the particular implementation. As an example, videos can be divided into three categories: sudden scene changes, crossfades and other slow scene changes, and camera flashlights. Sudden scene changes include frames that differ significantly from the previous frame and are usually caused by camera manipulation. Since the content of these frames is different from the content of the previous frame, the sudden scene change frame should be encoded as an I frame. Crossfades and other slow scene changes include slow switching of scenes and are usually caused by computer processing of camera shots. The gentle mixing of two different scenes may appear more favorable to the human eye, but presents a challenge to video coding. Motion compensation cannot effectively reduce the bit rate of those frames, and more intra MBs may be updated for these frames.

  A camera flashlight or camera flashlight event occurs when the contents of a frame include a camera flash. Such flashes are relatively short in duration (e.g., one frame) and are very bright, and the pixels in the frame that represent the flash exhibit an abnormally high luminance compared to the corresponding region on the adjacent frame. Camera flashlights suddenly and quickly change the luminance of the image. Typically, the duration of a camera flashlight is shorter than the human visual system (HVS) time masking duration, which is generally defined as 44 ms. The human eye is not sensitive to the quality of these short brightness bursts, so they can be coded coarsely. Since flashlight frames cannot be handled effectively using motion compensation, they are unsuitable prediction candidates for future frames, and the coarse coding of these frames can affect the coding efficiency of future frames. Will not be reduced. Scenes categorized as flashlights should not be used to predict other frames due to “artificial” high luminance, as other frames predict these frames for the same reason Cannot be used effectively. Once identified, these frames can be removed because they may require relatively high throughput. One option is to remove the camera flashlight frames and encode the DC coefficients at those locations, such a solution is simple, fast and saves a lot of bits.

  If any of the above frames are detected, a shot event is declared. Shot detection is not only useful for increasing coding quality, but can also help identify video content during searching and indexing. One aspect of the scene detection process is described herein below.

  FIG. 30 illustrates a process 3000 that operates on a GOP and, in some aspects, can be used to encode a video based on shot detection within a video frame, and a portion (or sub-portion) of the process 3000. Process) is described and illustrated with reference to FIGS. The processor 2831 can be configured to incorporate the process 3000. After the process 3000 begins, the process proceeds to block 3042 where metrics (information) about the video frame are obtained, including information representing differences between adjacent frames. Metrics include bi-directional motion information and luminance-based information that can be used for shot classification to later determine changes that occur between adjacent frames. Such a metric can be obtained from another device or process, or can be calculated, for example, by the processor 2831. An illustrative example of metric generation is described with reference to process A in FIG.

  Process 3000 then proceeds to block 3044 where shot changes in the video are determined based on the metric. Video frames can be classified into two or more categories as to what type of shots are included in the frame, for example, sudden scene changes, slowly changing scenes, or scenes containing high luminance values (camera flash). . Certain implementations of encoding may require other categories. An illustrative example of shot classification is described with reference to process B in FIG. 32, and more specifically with reference to processes D, E, and F in FIGS.

  Once the frame is classified, process 3000 proceeds to block 3046 where the frame can be encoded or designated for encoding using the result of the shot classification. Such a result can affect whether the frame is encoded using an intra-coded frame or a predicted frame (eg, a P-frame or a B-frame). Process C in FIG. 33 shows an example of an encoding method using shot results.

  FIG. 31 shows an example of a process for obtaining video metrics. FIG. 31 illustrates several steps that occur at block 3042 of FIG. Still referring to FIG. 31, at block 3152, process A obtains or determines video bi-directional motion estimation and compensation information. The motion compensator 2832 of FIG. 28 can be configured to perform bi-directional motion estimation on the frame to determine motion compensation information that can be used for subsequent shot classification. Process A then proceeds to block 3154 and generates luminance information including a luminance difference histogram for the current frame or selected frame and one or more adjacent frames. Finally, process A proceeds to block 3156 where a metric representing the shot contained within the frame is calculated. One such metric is a frame difference metric, two examples shown in Equation 4 and Equation 10. An illustrative example of determining motion information, luminance information, and frame difference metrics is described below.

Motion Compensation To perform bi-directional motion estimation / compensation, the video sequence is bi-directional that matches all 8x8 blocks of the current frame with the two nearest neighboring frames, one past and one future. A motion compensator can be used for preprocessing. The motion compensator generates motion vectors and difference metrics for all blocks. FIG. 37 illustrates this concept by showing an example of matching the pixels of the current frame C with the past frame P and the future (or next) frame N. The motion vector (past motion vector MV) to the matched pixel is illustrated in FIG. _P and future motion vector MV _N ). A brief description of exemplary aspects of bi-directional motion vector generation and related encoding follows.

  FIG. 40 shows an example of a motion vector determination process and prediction frame encoding in MPEG-4, for example. The process shown in FIG. 40 is a more detailed description of an example process that may be performed in block 3152 of FIG. In FIG. 40, the current image 4034 is composed of 5 × 5 macroblocks, and the number of macroblocks in this example is arbitrary. The macro block is composed of 16 × 16 pixels. A pixel can be defined by an 8-bit luminance value (Y) and two 8-bit chrominance values (Cr and Cb).

  In MPEG, Y, Cr, and Cb components can be stored in 4: 2: 0 format, and Cr and Cb components are downsampled by 2 in the X and Y directions. Thus, each macroblock consists of 256 Y components, 64 Cr components, and 64 Cb components. A macroblock 4036 of the current image 4034 is predicted from a reference image 4032 at a different point in time from the current image 4034. A search is performed in reference image 4032 to find the best matching macroblock 4038 that is closest to the current macroblock 4036 to be encoded with respect to Y, Cr, and Cb values. The position of the best matching macroblock 138 in the reference image 4032 is encoded in the motion vector 4040. The reference image 4032 may be an I frame or a P frame that is reconstructed by the decoder prior to the construction of the current image 4034. The best matching macroblock 4038 is subtracted from the current macroblock 40 (difference is calculated for each of the Y, Cr, and Cb components), resulting in a residual error 4042. The residual error 4042 is encoded 4044 using a 2D discrete cosine transform (DCT) and then quantized 4046. Quantization 4046 can be performed, for example, to provide spatial compression by assigning fewer bits to high frequency coefficients while assigning more bits to low frequency coefficients. The quantization coefficient of the residual error 4042 is encoded information representing the current macro block 4036 together with a motion vector 4040 and a reference image 4032 for identifying information. The encoded information can be stored in memory for future use, for example, can be manipulated for error correction or image enhancement purposes, or can be transmitted over the network 140.

  The encoded quantized coefficients of residual error 4042 are encoded motion vector 4040 to reconstruct current macroblock 4036 and use it as part of a reference frame for subsequent motion estimation and compensation at the encoder. Can be used with. Because of this P-frame reconstruction, the encoder can emulate the decoder procedure. Decoder emulation results in both the encoder and decoder working with the same reference picture. Regardless of whether it is performed at the encoder or at the decoder for further inter-coding, a reconstruction process is presented here. P frame reconstruction can begin after a reference frame (or a referenced image or part of a frame) has been reconstructed. The coded quantized coefficients are dequantized 4050 and then a 2D inverse DCT or IDCT 4052 is performed, resulting in a decoded or reconstructed residual error 4054. The encoded motion vector 4040 is decoded and used to find the best-matched macroblock 4056 that has already been reconstructed in the reference image 4032 that has already been reconstructed. Next, the reconstructed residual error 4054 is added to the reconstructed best matching macroblock 4056 to form a reconstructed macroblock 4058. Reconstruction macroblock 4058 can be stored in memory, can be displayed independently or together with other reconstruction macroblocks in the image, or can be further processed for image enhancement.

  Coding using B-frames (or any partition encoded using bi-directional prediction) will best match the region in the current image with the best matching prediction region in the previous image and the subsequent image. Time redundancy between prediction regions can be used. The subsequent best matching prediction area and the preceding best matching prediction area are combined to form a combined bi-directional prediction area. The difference between the combined bi-directional prediction region that best matches the region of the current image is the residual error (or prediction error). The position of the best matching prediction region in the subsequent reference image and the position of the best matching prediction region in the preceding reference image can be encoded in two motion vectors.

Luminance Histogram Difference The motion compensator can generate a difference metric for every block. The difference metric can be a sum of squared residuals (SSD) or a sum of absolute differences (SAD). Without loss of generality, SAD is used here as an example.

For all frames, the SAD ratio is calculated as follows:

Here, SAD _P and SAD _N are the sums of absolute differences of the forward and backward difference metrics, respectively. Note that the denominator contains a small positive number ε to prevent “divide-by-zero errors”. The numerator also contains ε to balance the effects of units in the denominator. For example, if the previous frame, the current frame, and the next frame are identical, the motion search should yield SAD _P = SAD _N = 0. In this case, the above calculation produces γ = 1 instead of 0 or infinity.

  A luminance histogram can be calculated for every frame. In general, multimedia images have an 8-bit luminance depth (eg, the number of “bins”). The luminance depth used to calculate the luminance histogram according to some aspects may be set to 16 to obtain the histogram. In other aspects, the luminance depth can be set to an appropriate number that may depend on the type of data being processed, the available computing power, or other predetermined criteria. In some aspects, the luminance depth can be set dynamically based on calculated metrics or received metrics, such as data content.

Equation 49 shows an example of calculating the luminance histogram difference (lambda),

Where N _Pi is the number of blocks in the i th bin for the previous frame, N _Ci is the number of blocks in the i th bin for the current frame, and N is the total number of blocks in the frame. It is. If the luminance histogram differences of the previous frame and the current frame are completely different (or independent), λ = 2.

The frame difference metric D described with reference to block 56 of FIG. 5 can be calculated as shown in Equation 50:

Where A is a constant selected according to the application example.

It is.

  FIG. 32 shows an example of Process B that uses the metrics obtained or determined for the video to determine three categories of shot (or scene) changes. FIG. 32 illustrates some steps that occur in one aspect of block 3044 of FIG. Referring again to FIG. 32, at block 3262, process B first determines whether the frame meets the criteria for indicating a sudden scene change. Process D in FIG. 34 shows an example of this determination. Process B then proceeds to block 3264 and determines whether the frame is part of a slowly changing scene. Process C in FIG. 35 shows an example of determining a slowly changing scene. Finally, at block 3366, Process B determines whether the frame includes a camera flash, in other words, a large luminance value that is different from the previous frame. Process F of FIG. 36 shows an example of determining a frame including a camera flash. An illustrative example of these processes is described below.

Sudden Scene Change FIG. 34 is a flow diagram illustrating the process of determining a sudden scene change. FIG. 34 further details some steps that may occur in some aspects of block 3262 of FIG. At block 3482, check if the frame difference metric D meets the criteria shown in Equation 51;

Here, A is a constant selected according to the application example, and T ₁ is a threshold value. If the criteria are met, at block 3484, Process D indicates the frame as a sudden scene change and no further shot classification is required in this example.

In one example, the simulation shows that the setting A = 1, T ₁ = 5 achieves good detection performance. If the current frame is a sudden scene change frame, γ _C should be large and γ _P should be small. A ratio rather than γ _C alone so that the metric is normalized to the activity level of the context

Can be used.

Note that the above criteria use the luminance histogram difference lambda (λ) in a non-linear manner. FIG. 39 shows that λ × (2λ + 1) is a convex function. If λ is small (eg close to zero), it is hardly preemphasis. The larger λ, the greater the emphasis is performed by the function. When threshold T ₁ is set to 5, sudden scene changes are detected for any λ greater than 1.4 using this pre-emphasis.

Crossfade and Slow Scene Changes FIG. 35 further illustrates further details of some aspects that may occur at block 3264 of FIG. Referring to FIG. 35, at block 3592, process E determines whether the frame is part of a series of frames that represent a slow scene change. Process E, for a certain number of consecutive frames, when the frame difference metric D is less than the first threshold T ₁ and greater than or equal to the _second threshold T ₂ as shown in Equation 52 , Determine that the current frame is a crossfade or other slow scene change,

Where T ₁ is the same threshold used above and T ₂ is another threshold. In general, the exact values of T ₁ and T ₂ are determined by baseline experiments due to possible implementation differences. If the criteria are met, at block 94, process E classifies the frame as part of the slowly changing scene shot classification for the selected frame end.

Camera Flashlight Event Process F shown in FIG. 36 is an example of a process that can determine whether the current frame comprises a camera flashlight. In this exemplary aspect of the camera, luminance histogram statistics are used to determine whether the current frame comprises a camera flashlight. Process F determines that a camera flash event is present in the selected frame by first determining whether the luminance of the current frame is greater than the luminance of the previous frame and the next frame, as shown in block 3602. decide. If not large, the frame is not a camera flash event, but if large, the frame may be a camera flash event. In block 3604, the process F indicates whether reverse differential metrics is greater than the threshold value T _3, the forward difference metric to determine whether greater than the threshold value T _4, are satisfied these conditions are both If so, at block 3606, Process F classifies the current frame as having a camera flashlight. In one example, at block 3602, the process F, as shown in Formula 53 and Formula 54, a value obtained by subtracting the average luminance of the previous frame from the average luminance of the current frame to determine whether the threshold T ₃ or more, process F is a value obtained by subtracting the average luminance of the next frame from the average luminance is determined whether the threshold T ₃ or more.

If the criteria are not met, the current frame is not classified as having a camera flashlight and process F returns. If the criteria is met, the process F proceeds to block 3604, as shown in Formula 55 and Formula 56 below, the rear differential metric SAD _P and forward difference metric SAD _N is greater than a certain threshold value T4 Determine whether

here,

Is the average luminance of the current frame,

Is the average luminance of the preceding frame,

Is the average luminance of the next frame, and SAD _P and SAD _N are the forward and backward differential metrics associated with the current frame. If the criteria are not met, process F returns.

Since implementation of the described process can result in differences in operating parameters including thresholds, the value of T ₃ is generally determined by baseline experiments. Although the SAD value is included in the determination, it generally requires only one frame for the camera flash, and because of the luminance difference, this frame cannot be predicted well using motion compensation from both the forward and reverse directions. Because.

In some aspects, one or more thresholds T ₁ , T ₂ , T ₃ , and T ₄ are predetermined and such values are incorporated into a shot classifier in the encoding device. In general, these thresholds are selected through testing specific implementations of shot detection. In some aspects, the one or more thresholds T ₁ , T ₂ , T ₃ , and T ₄ may be based on use of information (eg, metadata) provided to the shot classifier or shot classification It can be set during processing (eg, dynamically) based on information calculated by the instrument itself.

  Referring now to FIG. 33, FIG. 33 illustrates process C for determining video encoding parameters or encoding video based on shot classification of a selected frame. At block 3370, process C determines whether the selected frame is classified as a sudden scene change. If so, at block 3371, the current frame is classified as a sudden scene change, the frame can be encoded as an I-frame, and a GOP boundary can be determined. If not, process C proceeds to block 3372 and if the current frame is classified as part of a slowly changing scene, then in block 3373 the current frame and the other frames in the slowly changing scene are predicted frames (eg, , P frame or B frame). Process C then proceeds to block 3374 and checks whether the current frame is classified as a flashlight scene with a camera flash. If so, at block 3375, the frame can be identified for special processing, such as removal of previous frames, duplication, or encoding of specific coefficients of the frame. If not classified, the current frame is not classified, and the selected frame can be encoded according to other criteria, encoded as an I-frame, or deleted. Process C can be performed in the encoder.

In the above aspect, the amount of difference between the frame to be compressed and the two adjacent frames is represented by the frame difference metric D. If a significant amount of unidirectional luminance change is detected, it indicates a crossfade effect in the frame. The more pronounced crossfading, the more gain can be achieved by using B frames. In some aspects, a modified frame difference metric is used, as shown in Equation 57:

Where d _P = | Y _C −Y _P | and d _N = | Y _C −Y _N | are the luma difference between the current frame and the previous frame and the luma difference between the current frame and the next frame, respectively. , Δ is a constant that can be determined in a baseline experiment because it can depend on the implementation, and α is a weight variable having a value between 0 and 1.

The modified frame difference metric D ₁ differs from the original frame difference metric D only when a consistent trend of luma shift is observed and the shift intensity is sufficiently large. D ₁ is D or less. If the luma change is constant (d _P = d _N ), the modified frame difference metric D ₁ is lower than the original frame difference metric D and the lowest ratio is (1−α).

  Table 1 below shows the performance improvement due to the sudden addition of scene change detection. The total number of I frames in both the scene unchanged (NSC) and scene changed (SC) cases is approximately the same. In the NSC case, I frames are evenly distributed throughout the sequence, while in the SC case, I frames are assigned only to sudden scene change frames.

In general, it can be seen that an improvement of 0.2-0.3 dB can be achieved with respect to PSNR. The simulation results show that the shot detector is very accurate in determining the shot event described above. Simulations of 5 clips with normal cross-fade effects show that a PSNR gain of 0.226031 dB is achieved at the same bit rate at Δ = 5.5 and α = 0.4.

Adaptive GOP Structure An illustrative example of adaptive GOP structure operation is described below. Such an operation can be included in the GOP partitioner 412 of FIG. The old video compression standard MPEG2 does not require the GOP to have a regular structure, but can also impose a regular structure. An MPEG2 sequence always starts with an I frame, ie, a frame that is encoded without reference to a previous image. The MPEG2 GOP format is usually pre-configured in the encoder by fixing the spacing in the GOP of P or predicted images following an I frame. A P frame is an image that is partially predicted from a preceding I or P image. Frames between the start I frame and subsequent P frames are encoded as B frames. A “B” frame (B represents bi-directional) can use the previous I or P image and the next I or P image independently or simultaneously as a reference. The number of bits used to encode an I frame, on average, exceeds the number of bits used to encode a P frame, as well as used to encode a P frame The number of bits on average exceeds the number of bits in a B frame. If skip frames are used, it is possible not to use bits for their representation.

  One advantage of using P-frames and B-frames and using frame skipping in modern compression algorithms is that the video transmission size can be reduced. A previously decoded I or P image is later used as a reference for decoding other P or B images, so if temporal redundancy is high, for example, only a small change between images If not present, the use of P, B, or skipped images efficiently represents video streaming.

  The group of picture partitioners adaptively encode the frames so as to minimize temporal redundancy. Differences between frames are quantified and the determination of whether an image is represented by I, P, B, or skip frames is automatically made after the appropriate test is performed on the quantified difference. Done. The processing at the GOP partitioner is assisted by other operations of the preprocessor 202 that provide filtering for denoising.

  The adaptive encoding process has the advantage that it is not available in a “fixed” encoding process. The pinning process ignores the possibility of little change in the content, but the adaptation procedure is that much more B frames are inserted between each I and P frame or two P frames. Thereby reducing the number of bits used to fully represent the sequence of frames. Conversely, for example, in the fixed encoding process, if the change in the video content is significant, the difference between the predicted frame and the reference frame is so great that the efficiency of the P frame is greatly reduced. Under these circumstances, the matching object may fall out of the motion search area, or the similarity of the matching object is reduced due to distortion caused by camera angle changes. The adaptive encoding process can be conveniently used to optionally determine when a P frame is to be encoded.

In the system disclosed herein, the type of situation described above is automatically sensed. The adaptive encoding process described herein is flexible and is created to adapt to these changes in the content. The adaptive encoding process evaluates a frame difference metric, which can be thought of as a measure of the distance between frames, using the additive properties of the same distance. Conceptually, given frames F ₁ , F ₂ , and F ₃ having interframe distances d ₁₂ and d ₂₃ , the distance between F ₁ and F ₃ is at least d ₁₂ + d _23. Considered. Frame allocation is based on this distance metric and other metrics.

  When the GOP partitioner 412 receives a frame, it operates by assigning an image type to the frame. The image type indicates a prediction method that can be used to encode each block.

  I images are encoded without reference to other images. Since an I-picture can exist alone, it provides an access point in the data stream where decoding can begin. The I encoding type is assigned to a frame when the “distance” to the previous frame exceeds the scene change threshold.

  The P image can use the preceding I or P image for motion compensated prediction. The P picture uses the preceding field or block in the frame that can be shifted from the predicted block as the basis for encoding. After the reference block is subtracted from the considered block, the residual block is typically encoded using a discrete cosine transform to eliminate spatial redundancy. The P encoding type is used for a frame when the “distance” between a frame and the last frame assigned as a P frame exceeds a second threshold, which is generally less than the first threshold. Assigned.

  A B-frame image can use the previous P or I image and the next P or I image for motion compensation as described above. Blocks in a B picture can be forward, backward, and bi-directionally predicted, or intra-coded without reference to other frames. H. In H.264, the reference block can be a linear combination of as many as 32 blocks from as many as 32 frames. If a frame is not assigned to type I or P, it is assigned to type B if the “distance” from that frame to the previous frame is greater than a third threshold, which is generally less than the second threshold. It is done. If a frame cannot be assigned to be an encoded B frame, it is assigned a “skip frame” status. Since this frame is essentially a copy of the previous frame, it can be skipped.

  Evaluation of a metric that quantifies the difference between adjacent frames in the display order is the first part of this process performed in the GOP partitioner 412. This metric is the distance mentioned above, with which all frames are evaluated to the appropriate type. Thus, the spacing between I and adjacent P frames or between two consecutive P frames can be variable. Metric calculation begins by processing the video frame with a block-based motion compensator, where the block is the basic unit of video compression, usually consisting of 16x16 pixels, but 8x8, 4 Other block sizes such as x4 and 8x16 are possible. In the case of a frame consisting of two deinterlace fields present at the output, motion compensation is performed on the basis of the field and the search for the reference block is performed in the field, not the frame. For blocks in the first field of the current frame, the forward reference block is found in the field of the subsequent frame, and similarly, the backward reference block is in the field of the frame immediately preceding the current field. Found in The current block is grouped in the compensation field. The process continues for the second field of the frame. The two compensation fields are combined to form a forward and reverse compensation frame.

  For frames generated in inverse telecine 406, only reconstructed film frames are generated, so the search for reference blocks can be based only on frames. Two reference blocks and two differences, forward and reverse, are found, also resulting in forward and reverse compensation frames. In summary, the motion compensator generates motion vectors and difference metrics for all blocks. The metric difference depends on the field or block in the field considered and whether the forward difference or the backward difference is evaluated. Note that the best matching block is evaluated. For this calculation, only the luminance value is input.

Accordingly, the motion compensation step generates two sets of differences. These are between the current value block of luminance and the luminance value in the reference block taken from the frame immediately before and immediately after the current frame in time. The absolute value of each forward difference and each backward difference is determined for each pixel in the block, each summed separately over the entire frame. If the deinterlaced NTSC fields that make up the frame are processed, the two totals include both fields. In this way, the sum of the absolute values of the forward and backward differences are found SAD _P and SAD _N.

For all frames, the SAD ratio is related

Where SAD _P and SAD _N are the sums of the absolute values of the forward and backward differences, respectively. A small positive number is added to the numerator to prevent "divide by zero" errors. A similar ε term is added to the denominator, further reducing the sensitivity of γ when SAD _P or SAD _N is close to zero.

  In one alternative, the difference may be SSD, which is the sum of squared residuals, and SAD, which is the sum of absolute differences, or SATD, where the difference between the pixel values is taken before the block element difference is taken. Blocks are transformed by applying a two-dimensional discrete cosine transform to them. The sum is evaluated over the area of active video, but in other aspects a smaller area may be used.

Luminance histograms for all frames as received (no motion compensation) are also calculated. Histograms operate on DC coefficients, if available, ie on (0,0) coefficients in a 16 × 16 coefficient array that is the result of applying a two-dimensional discrete cosine transform to a block of luminance values. To do. Equivalently, an average value of 256 luminance values within a 16 × 16 block may be used in the histogram. For an image with a luminance depth of 8 bits, the number of bins is set to 16. The next metric evaluates the histogram difference.

In the above equation, N _Pi is the number of blocks from the previous frame in the i th bin, N _Ci is the number of blocks from the current frame belonging to the i th bin, and N is in the frame The total number of blocks.

These intermediate results are used to form a differential metric for the current frame.

Where γ _C is the SAD ratio based on the current frame and γ _P is the SAD ratio based on the previous frame. If the scene has a smooth motion and its luma histogram hardly changes, then M≈1. If the current frame suddenly displays a scene change, γ _C should increase and γ _P should decrease. A ratio rather than γ _C alone so that the metric is normalized to the activity level of the context

Is used.

The data flow 4100 of FIG. 40 illustrates several components that can be used to calculate the frame difference metric. The preprocessor 4125 sends an interlace field to the bi-directional motion compensator 4133 if the video has an NTSC source, or a film image frame if the video source is the result of inverse telecine. Bi-directional motion compensator 4133 divides the field (or frame if the video source is a movie) into 16 × 16 pixel blocks, and each block is all 16 × 16 within the defined area of the field of the previous frame. Operate on the field by comparing with blocks. The block that provides the best match is selected and subtracted from the current block. The absolute value of the difference is taken and the result is summed over the 256 pixels that make up the current block. When this is done for all current blocks of the field and for both fields, the backward difference metric quantity SAD _N is calculated by the backward difference module 4137. A similar procedure may be performed by the forward difference module 4136. Forward difference module 4136, to generate a SAD _P is a front differential metric is used as a source of temporal reference block the previous frame of the current frame. Although performed using recovered film frames, the same estimation process is performed when an input frame is formed in inverse telecine. A histogram that can be used to complete the calculation of the frame difference metric can be formed in the histogram difference module 4141. Each 16x16 block is assigned to a bin based on its luminance average. This information is formed by summing all 256 pixel luminance values in the block, normalizing it by 256 as necessary, and incrementing the count of bins into which the average value is placed. The calculation is performed once for each pre-motion compensation frame, and the histogram of the current frame becomes the histogram of the previous frame when a new current frame arrives. To form λ defined by Equation 59, the two histograms are differenced and normalized by the number of blocks in a histogram difference module 4141. These results are combined in a frame difference combiner 4143, which in the histogram difference module 4139, forward and backward difference modules 4136, 4136 to evaluate the current frame difference defined in Equation 60. Use the intermediate results found.

  The system of flowchart 4100 and its components or steps may be implemented by hardware, software, firmware, middleware, microcode, or any combination thereof. Each functional component of flowchart 4100, including preprocessor 4135, bi-directional motion compensator 4133, forward and backward difference metric modules 4136, 4137, histogram difference module 4141, and frame difference metric combiner 4143 can be implemented as a stand-alone component. Can be embedded in a component of another device as hardware, firmware, middleware, or implemented in microcode or software running on a processor, or a combination thereof. When implemented in software, firmware, middleware, or microcode, program code or code segments that perform a desired task can be stored on a machine-readable medium, such as a storage medium. A code segment can correspond to a procedure, function, subprogram, program, routine, subroutine, module, software package, class, or any combination of instructions, data structures, or program statements. A code segment can be coupled to another code segment or a hardware circuit by passing and / or receiving information, data, arguments, parameters, or memory contents.

  The received and processed data is stored in a storage medium, which may include, for example, a chip configuration storage medium (eg, ROM, RAM) or a disk type storage medium (eg, magnetic or optical) connected to the processor In some aspects, the combiner 4143 can include some or all of the storage medium. The flowchart 4200 of FIG. 41 illustrates the process of assigning compression types to frames. In one aspect M, the current frame difference defined in Equation 3 is the basis for all decisions made regarding frame allocation. As decision block 4253 shows, if the frame under consideration is the first in the sequence, the decision path marked YES is followed to block 4255, thereby declaring the frame to be an I frame. The accumulated frame difference is set to zero at block 4257 and the process returns to start block 4253 (at block 4258). If the frame under consideration is not the first frame in the sequence, the path marked NO is followed from the determined block 4253, and in test block 4259 the current frame difference is tested against the scene change threshold. Is done. If the current frame difference is greater than the scene change threshold, the decision path marked YES is followed to block 4255, again resulting in I frame allocation. If the current frame difference is less than the scene change threshold, the NO path is traced to block 4261 and the current frame difference is added to the accumulated frame difference.

  Proceeding with the flowchart, at decision block 4263, the accumulated frame difference is compared to a threshold t, which is generally less than the scene change threshold. If the accumulated frame difference is greater than t, control passes to block 4265 where the frame is assigned to be a P frame, and then in step 4267, the accumulated frame difference is reset to zero. If the accumulated frame difference is less than t, control passes from block 4263 to block 4269. Therefore, the current frame difference is compared with τ smaller than t. If the current frame difference is less than τ, the frame is assigned to be skipped at block 4273, and if the current frame difference is greater than τ, the frame is assigned to be a β frame.

In an alternative aspect, another frame coding complexity indication M ^* is

Is defined as, where, alpha is a scaler, SAD _P is the SAD with forward motion compensation, MV _P is an total length measured in the motion vector pixels from forward motion compensation , s and m, if the SAD _P is low or MV _P than s is less than m, to zero frame encoding complexity display, a two threshold number. M ^* is used in place of the current frame difference in the flowchart 4200 of FIG. As will be appreciated, M ^* differs from M only if the forward motion compensation shows a low level of motion. In this case, M is smaller than M.

  It should be noted that the shot detection and encoding aspects described herein may be described as a process represented as a flowchart, flow diagram, structure diagram, or block diagram. Although the flowcharts shown in the figures may describe the operations as a sequential process, many operations can also be performed in parallel or concurrently. In addition, the order of operations can be reconfigured. A process generally ends when its operation is complete. A process can correspond to a method, function, procedure, subroutine, subprogram, and the like. If the process corresponds to a function, its termination corresponds to the return of the function to the calling function or main function.

  It will also be apparent to those skilled in the art that one or more elements of the devices disclosed herein can be reconfigured without affecting the operation of the device. Similarly, one or more elements of the devices disclosed herein can be combined without affecting the operation of the device. Those skilled in the art will appreciate that information and multimedia data can be represented using any of a variety of different technologies and techniques. Further, the various exemplary logic blocks, modules, and algorithm steps described in connection with the examples disclosed herein may be electronic hardware, firmware, computer software, middleware, microcode, or Those skilled in the art will also understand that they can be implemented as a combination. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described broadly above in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the specific application and design constraints imposed on the overall system. One of ordinary skill in the art can implement the functionality described in various ways for each specific application, but such implementation decisions are interpreted as causing deviations from the scope of the disclosed methods. Should not.

  For example, the method or algorithm steps described in connection with the shot detection and encoding examples and figures disclosed herein may be performed directly in hardware, in software modules executed by a processor, or in a combination of the two Can be implemented. In particular, the methods and algorithms are applicable to communication technologies including wireless transmission of video to cell phones, computers, laptop computers, PDAs, and all types of personal and commercial communication devices. A software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, removable disk, CD-ROM, or other form of storage medium known in the art. it can. An exemplary storage medium is coupled to the processor such that the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium can reside in an application specific integrated circuit (ASIC). An ASIC can reside in a wireless modem. In the alternative, the processor and the storage medium may reside as discrete components in the wireless modem.

  In addition, the various exemplary logic blocks, components, modules, and circuits described in connection with the examples disclosed herein were designed to perform the functions described herein. General purpose processor, digital signal processor (DSP), application specific integrated circuit (ASIC), field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any of them It can be implemented or carried out using combinations. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor is a combination of computing devices such as, for example, a combination of a DSP and a microprocessor, a combination of a plurality of microprocessors, a combination of one or more microprocessors that cooperate with a DSP core, or any other such configuration. May be implemented.

  The previous description of the disclosed examples is provided to enable any person skilled in the art to make or use the disclosed methods and apparatus. Various modifications to these examples will be readily apparent to those skilled in the art, and the principles defined herein may be applied to other examples and may be derived from the spirit or scope of the disclosed methods and apparatus. Additional elements can be added without departing. The description of the embodiments is intended to be illustrative and is not intended to limit the scope of the claims.

1 is a block diagram of a communication system for delivering streaming multimedia data. The block diagram of the digital transmission mechanism containing a preprocessor. FIG. 3 is a block diagram of exemplary aspects of a preprocessor. 5 is a flow diagram illustrating a process for processing multimedia data. FIG. 3 is a block diagram illustrating means for processing multimedia data. FIG. 3 is a block diagram illustrating the operation of an exemplary preprocessor. The figure of the phase determination in an inverse telecine process. 6 is a flowchart showing a process for performing reverse processing on telecine video. The figure of the trellis which shows a phase transition. FIG. 6 is a diagram of guidance for identifying each frame used to generate multiple metrics. FIG. 9 is a flowchart illustrating how the metrics of FIG. 8 are generated. 6 is a flow diagram illustrating the processing of metrics to reach the estimation phase. The data flow figure explaining the system for producing | generating a decision variable. The block diagram which shows the variable used in order to evaluate branch information. Flow chart showing how the lower envelope is calculated. Flow chart showing how the lower envelope is calculated. Flow chart showing how the lower envelope is calculated. The flowchart which shows operation | movement of a consistency detector. 5 is a flow diagram illustrating a process for calculating an offset for a decision variable used to compensate for inconsistencies in phase decisions. The figure which shows the operation | movement of the inverse telecine after the pull-down phase is estimated. The block diagram of a deinterlacer device. FIG. 4 is a block diagram of another deinterlacer device. The figure of the subsampling pattern of an interlaced image. FIG. 4 is a block diagram of a deinterlacer device that uses Wmed filtering motion estimation to generate a deinterlaced frame. The figure which shows the one aspect | mode of the aperture for determining the still area of multimedia data. The figure which shows the one aspect | mode of the aperture for determining the slow motion area | region of multimedia data. The figure which shows the one aspect | mode of motion estimation. The figure which shows the two motion vector maps used when determining motion compensation. 6 is a flow diagram illustrating a method for deinterlacing multimedia data. 5 is a flowchart illustrating a method for generating a deinterlace frame using spatiotemporal information. 6 is a flow diagram illustrating a method for performing motion compensation for deinterlacing. FIG. 4 is a block diagram of a preprocessor comprising a processor configured for shot detection and other preprocessing operations according to some aspects. FIG. 4 shows the relationship between encoding complexity C and assigned bit B. FIG. 7 is a flow diagram illustrating a process that operates on a group of pictures and that, in some aspects, can be used to encode video based on shot detection within a video frame. 6 is a flowchart illustrating a process for shot detection. 6 is a flow diagram illustrating a process for determining different classifications of shots in a video. 6 is a flowchart illustrating a process for assigning a frame compression scheme to a video frame based on a shot detection result. 6 is a flow diagram illustrating a process for determining a sudden scene change. 6 is a flow diagram illustrating a process for determining a slowly changing scene. 6 is a flow diagram illustrating a process for determining a scene that includes a camera flash. Shows the motion compensation vector MV _N between the motion compensation vector MV _P and the current frame and the next frame between the current frame and the preceding frame. A graph showing the relationship for variables used in determining a frame difference metric. FIG. 3 is a block diagram showing data encoding and residual calculation. The block diagram which shows determination of a frame difference metric. 6 is a flowchart illustrating a procedure in which a compression type is assigned to a frame. The figure which shows an example of 1-D multiphase resampling. The pictorial diagram which shows the safe action area | region and safe title area | region of the flame | frame of data. The pictorial diagram which shows the safe action area | region of the flame | frame of data.

Claims (50)

A method for processing multimedia data, comprising:
Receiving interlaced video frames;
Converting the interlaced video frame to progressive video;
Generating metadata associated with the progressive video;
Providing the progressive video and at least a portion of the metadata to an encoder for use in encoding the progressive video.   The method of claim 1, further comprising encoding the progressive video using the metadata.   The method of claim 1, wherein converting the video frame comprises deinterlacing the interlaced video frame.   The method of claim 1, wherein the metadata comprises bandwidth information.   The method of claim 1, wherein the metadata comprises bidirectional motion information. Deinterlacing
Generating spatial information and bidirectional motion information of the interlaced video frame;
Generating the progressive video based on the interlaced video frame using the spatial information and bidirectional motion information.   The method of claim 4, wherein the bandwidth information comprises luminance information.   The method of claim 1, wherein the metadata comprises a spatial complexity value.   The method of claim 1, wherein the metadata comprises a time complexity value.   The method of claim 1, wherein converting the interlaced video frame comprises inverse telecine a 3/2 pulldown video frame.   The method of claim 10, wherein the metadata comprises specific band information.   The method of claim 1, further comprising resizing the progressive video.   The method of claim 12, further comprising segmenting the progressive video to determine group of picture information.   The method of claim 13, wherein the segmentation comprises shot detection of the progressive video.   The method of claim 14, further comprising filtering the progressive video using a noise reduction filter.   The method of claim 1, wherein the metadata comprises luminance and chroma information. An apparatus for processing multimedia data,
A receiver configured to receive interlaced video frames;
A deinterlacer configured to convert the interlaced video frame to progressive video;
A partitioner configured to generate metadata associated with the progressive video and to provide the progressive video and the metadata to an encoder for use in encoding the progressive video. apparatus.   The apparatus of claim 17, further comprising an encoder configured to receive the progressive video from a communication module and to encode the progressive video using the provided metadata.   The apparatus of claim 17, wherein the deinterlacer is configured to perform space-time deinterlacing.   The apparatus of claim 17, further comprising a noise reduction filter for performing noise reduction of progressive video.   The apparatus of claim 17, wherein the deinterlacer comprises an inverse telecine device.   The apparatus of claim 17, wherein the partitioner is configured to perform shot detection and generate compression information based on the shot detection.   The apparatus of claim 17, wherein the metadata comprises group of picture information.   The apparatus of claim 17, further comprising a resampler configured to resize the progressive frame.   The apparatus of claim 17, wherein the metadata comprises bandwidth information.   The apparatus of claim 17, wherein the metadata comprises bidirectional motion information. Deinterlacer
Generating spatial information and bidirectional motion information of the interlaced video frame;
The apparatus of claim 17, configured to generate progressive video based on the interlaced video frame using the spatial information and bidirectional motion information.   24. The apparatus of claim 23, wherein the metadata comprises a bandwidth ratio.   24. The apparatus of claim 23, wherein the metadata comprises luminance information.   The apparatus of claim 17, wherein the metadata comprises a spatial complexity value.   The apparatus of claim 17, wherein the metadata comprises a time complexity value.   The apparatus of claim 17, wherein the metadata comprises luminance and chroma information. An apparatus for processing multimedia data,
Means for receiving interlaced video;
Means for converting the interlaced video to progressive video;
Means for generating metadata associated with the progressive video;
Means for providing the progressive video and at least a portion of the metadata to an encoder for use in encoding the progressive video.   34. The apparatus of claim 33, wherein the converting means comprises an inverse telecine device.   34. The apparatus of claim 33, wherein the conversion means comprises a spatiotemporal deinterlacer.   34. The apparatus of claim 33, wherein the generating means is configured to perform shot detection and generate compression information based on the shot detection.   34. The apparatus of claim 33, wherein the generating means is configured to generate bandwidth information.   34. The apparatus of claim 33, further comprising means for resampling to resize the progressive frame.   34. The apparatus of claim 33, further comprising means for encoding the progressive video using the provided metadata.   34. The apparatus of claim 33, further comprising means for performing noise reduction of the progressive video.   34. The apparatus of claim 33, wherein the metadata comprises group of picture information.   34. The apparatus of claim 33, wherein the metadata comprises bidirectional motion information. The converting means is
Generating spatial information and bidirectional motion information of the interlaced video frame;
34. The apparatus of claim 33, configured to generate progressive video based on the interlaced video frame using the spatial information and bidirectional motion information.   34. The apparatus of claim 33, wherein the metadata comprises a bandwidth ratio.   34. The apparatus of claim 33, wherein the bandwidth information comprises luminance information.   34. The apparatus of claim 33, wherein the metadata comprises a spatial complexity value.   34. The apparatus of claim 33, wherein the metadata comprises a time complexity value.   34. The apparatus of claim 33, wherein the metadata comprises luminance and chroma information. A machine-readable medium comprising instructions for processing multimedia data, wherein when the instructions are executed, the machine receives an interlaced video frame;
Converting the interlaced video frame to progressive video;
Generating metadata related to the progressive video;
A machine-readable medium that causes an encoder to provide the progressive video and at least a portion of the metadata for use in encoding the progressive video. Receive interlaced video,
Convert the interlaced video to progressive video,
Generating metadata related to the progressive video;
A processor comprising an arrangement for providing an encoder with the progressive video and at least a portion of the metadata for use in encoding the progressive video.

Images