Abstract: A hybrid matching approach can be used for computer vision that balances accuracy with speed and resource consumption. Stereoscopic image data can be rectified and downsampled, then analyzed using a semi-global matching (SGM) process. The use of downsampled images greatly reduces time and bandwidth requirements, while providing high accuracy disparity results. These disparity results can be provided as external hints to a fast module that can perform a robust matching process in the time needed for applications such as real time navigation. The external hints can be used, along with potentially other hints, to define a search space for use by the fast module, which can result in higher quality disparity results obtained within specified timing constraints and with limited resources. The disparity results can be used to determine distances to various objects, as may be important for vehicle navigation or robotic task performance.

Abstract: Apparatuses, systems, and techniques to generate one or more confidence values associated with one or more objects identified by one or more neural networks. In at least one embodiment, one or more confidence values associated with one or more objects identified by one or more neural networks are generated based on, for example, one or more neural network outputs.

Abstract: Systems and methods are disclosed that use a geometric approach to detect objects on a road surface. A set of points within a region of interest between a first frame and a second frame are captured and tracked to determine a difference in location between the set of points in two frames. The first frame may be aligned with the second frame and the first pixel values of the first frame may be compared with the second pixel values of the second frame to generate a disparity image including third pixels. One or more subsets of the third pixels that have an disparity image value about a first threshold may be combined, and the third pixels may be scored and associated with disparity values for each pixel of the one or more subsets of the third pixels. A bounding shape may be generated based on the scoring that corresponds to the object.

Abstract: Embodiments of the present invention are directed to methods and systems for performing automatic noise reduction in video. According to one aspect of the invention, a video noise-reducing system is provided consisting of a noise estimator, a motion classifier, two stages of filters, each including a spatial and temporal filter, and a combiner. The system adapts to noise level and to scene content to find at each location in the image a balance of noise reduction and detail preservation. Temporal Infinite Impulse Response (IIR) filtering provides a high level of detail-preserving noise reduction where motion allows, while non linear spatial filtering provides edge-preserving noise reduction in areas where the temporal filter would introduce motion artifacts. A spatial-temporal combiner provides smooth transition and balance between the two filtering modes; this block also enables use of external cues to produce a visually pleasing output based on ambient conditions.

Abstract: Embodiments of the present invention are directed to methods and systems for performing automatic noise reduction in video. According to one aspect of the invention, a video noise-reducing system is provided consisting of a noise estimator, a motion classifier, two stages of filters, each including a spatial and temporal filter, and a combiner. The system adapts to noise level and to scene content to find at each location in the image a balance of noise reduction and detail preservation. Temporal Infinite Impulse Response (IIR) filtering provides a high level of detail-preserving noise reduction where motion allows, while non linear spatial filtering provides edge-preserving noise reduction in areas where the temporal filter would introduce motion artifacts. A spatial-temporal combiner provides smooth transition and balance between the two filtering modes; this block also enables use of external cues to produce a visually pleasing output based on ambient conditions.

Abstract: In one aspect, a method for encoding pictures is provided. The method is applied to each picture in a sequence of pictures, and the method comprises the steps of assigning a pre-decoder buffer removal time to the picture; selecting, for the picture, a number of bits, wherein the time-equivalent of the number of bits is no greater than a difference based on the pre-decoder buffer removal time of the picture and an initial arrival time of the picture into a pre-decoder buffer; and compressing the picture to generate the number of bits. The method may further include the step of allocating a first number of bits for compressing the picture and one or more number of bits for compressing one or more future pictures, wherein the future pictures are in the pre-decoder buffer at the pre-decoder buffer removal time of the current picture.

Abstract: A system (and a method) are disclosed for adaptively selecting quantization parameter for each region of input video signal to be encoded within a video processing system. The system includes a frame partition module, an edge feature detector, a macroblock adaptive quantization energy (AQEnergy) evaluator and a macroblock adaptive quantization parameter selector. The frame partition module partitions a frame of an input video signal into smaller blocks of pixel data. The edge feature detector generates an edge direction histogram for each block to be encoded. The macroblock AQEnergy evaluator receives the edge direction histogram of the block, calculates the AQEnergy of the block and generates the adaptive quantization score (AQScore) of the macroblock. The macroblock adaptive quantization parameter selector selects an appropriate macroblock quantization parameter corresponding to the macroblock AQScore by a combination of programmable scaling and threshold logic.

Abstract: In one aspect, a method for encoding pictures is provided. The method is applied to each picture in a sequence of pictures, and the method comprises the steps of assigning a pre-decoder buffer removal time to the picture; selecting, for the picture, a number of bits, wherein the time-equivalent of the number of bits is no greater than a difference based on the pre-decoder buffer removal time of the picture and an initial arrival time of the picture into a pre-decoder buffer; and compressing the picture to generate the number of bits. The method may further include the step of allocating a first number of bits for compressing the picture and one or more number of bits for compressing one or more future pictures, wherein the future pictures are in the pre-decoder buffer at the pre-decoder buffer removal time of the current picture.

Abstract: In one aspect, a method for encoding pictures is provided. The method is applied to each picture in a sequence of pictures, and the method comprises the steps of assigning a pre-decoder buffer removal time to the picture; selecting, for the picture, a number of bits, wherein the time-equivalent of the number of bits is no greater than a difference based on the pre-decoder buffer removal time of the picture and an initial arrival time of the picture into a pre-decoder buffer; and compressing the picture to generate the number of bits. The method may further include the step of allocating a first number of bits for compressing the picture and one or more number of bits for compressing one or more future pictures, wherein the future pictures are in the pre-decoder buffer at the pre-decoder buffer removal time of the current picture.

Abstract: One method for analyzing a bitstream having a plurality of compressed pictures comprises computing an initial arrival time and a final arrival time of a compressed picture, wherein the initial arrival time is equal to an earlier of the final arrival time of the immediately previous compressed picture or equal to a sum of a fixed time plus a sum of removal delays of all of the compressed pictures between the first compressed picture following the buffering period message and the compressed picture, including the compressed picture, and wherein the final arrival time is equal a sum of the initial arrival time and a time calculated based on the number of bits associated with the compressed picture at the bit rate; and verifying that a difference between the final removal time and the initial arrival time does not exceed the time for reaching the buffer size at the bit rate.

Abstract: A video quantizer provides for performing quantization adaptively in accordance with perceptual masking characteristics of the human visual system. In a preferred MPEG encoder-IC, a block-based activity quantization modification or “activity-modification” is formed from the combined correlation of block-energy and edge analyses. A luminance-sensitivity modification is then formed and correlated with the activity modification to form an intermediate modification. A nominal-quantization modification is further formed and correlated with the intermediate modification, which is then limited and correlated with a nominal quantization value to form a base modification. Next, a positional-sensitivity modification is formed as a perimeter offset, which offset is correlated with the base modification to form a modified quantization value, and which modified quantization value is then rounded and returned to a rate controller.

Abstract: In one aspect, a method for encoding pictures is provided. The method is applied to each picture in a sequence of pictures, and the method comprises the steps of assigning a pre-decoder buffer removal time to the picture; selecting, for the picture, a number of bits, wherein the time-equivalent of the number of bits is no greater than a difference based on the pre-decoder buffer removal time of the picture and an initial arrival time of the picture into a pre-decoder buffer; and compressing the picture to generate the number of bits. The method may further include the step of allocating a first number of bits for compressing the picture and one or more number of bits for compressing one or more future pictures, wherein the future pictures are in the pre-decoder buffer at the pre-decoder buffer removal time of the current picture.

Abstract: One method for analyzing a bitstream having a plurality of compressed pictures comprises computing an initial arrival time and a final arrival time of a compressed picture, wherein the initial arrival time is equal to an earlier of the final arrival time of the immediately previous compressed picture or equal to a sum of a fixed time plus a sum of removal delays of all of the compressed pictures between the first compressed picture following the buffering period message and the compressed picture, including the compressed picture, and wherein the final arrival time is equal a sum of the initial arrival time and a time calculated based on the number of bits associated with the compressed picture at the bit rate; and verifying that a difference between the final removal time and the initial arrival time does not exceed the time for reaching the buffer size at the bit rate.

Abstract: The invention supports visual fast-forward play and rewind at multiple speeds using a single ancillary data stream. The storage required by this data stream is approximately the same as the storage required by a single ancillary data stream used in conventional single speed fast-forward and rewind schemes. The method of the invention includes the following steps. A bitstream of the original sequence of MPEG compressed pictures is stored for normal play. Then a sub-sequence of the original sequence, consisting of every n-th picture, is compressed as I-pictures, while ensuring that all pictures in the compressed stream have equal numbers of bits. This is the ancillary stream. A client request for fast-forward play is responded to by transmitting a subset of I-pictures from the ancillary stream. A fast-reverse play request is satisfied in the same manner except that the I-frames are transmitted in the reverse order.

Abstract: A system and method of using multiple processors to perform video compression is provided. A video sequence is partitioned into subsequences and processing assignments for the subsequences are distributed among a plurality of processors. A picture type is then determined for each picture in each subsequence and the encoding complexity of each picture is modeled, based on the picture type. Based on the modeling, a number of bits is allocated to each picture. Each picture is then compressed in accordance with the bits allocated. Another aspect provides for encoding of pictures in a video sequence using dynamic modeling of the encoding complexity of future pictures in the video sequence. Bits are allocated to the encoding of a current picture in the video sequence based on the dynamic model. The current picture is then encoded based on the bits allocated.

Abstract: A system and method of using multiple processors to perform video compression is provided. A video sequence is partitioned into subsequences and processing assignments for the subsequences are distributed among a plurality of processors. A picture type is then determined for each picture in each subsequence and the encoding complexity of each picture is modeled, based on the picture type. Based on the modeling, a number of bits is allocated to each picture. Each picture is then compressed in accordance with the bits allocated. Another aspect provides for encoding of pictures in a video sequence using dynamic modeling of the encoding complexity of future pictures in the video sequence. Bits are allocated to the encoding of a current picture in the video sequence based on the dynamic model. The current picture is then encoded based on the bits allocated.

Abstract: A system and methods for implementing a video encoder which for each picture guarantees that the number of bits produced will not exceed a limit. In a preferred embodiment, the system includes two cooperating components or subsystems that together with other components of a video encoder operate to encode the input video, detect when the limit on the number of bits produced so far is close to exceeding the limit on the number of bits that may be produced and reduce the bit rate when such a condition is detected. One aspect of the current invention embodies a macroblock (MB) bit stream generator that can operate in a "low bit rate mode" Another aspect embodies a subsystem for detecting when the number of bits in the picture is close to exceeding the limit.

Abstract: A system and method for repeat field detection for use in rate conversion and video encoding of the type contemplated by the MPEG standards. Before encoding a frame, first field in the current frame is compared to the previously occurring field of the same parity. Next, a single number (the inter-field parameter) is generated, which is a measure of the difference between the two fields. If the inter-field parameter is below a threshold a signal is generated to indicate that the current field is a repeat of the previous field of the same parity. Otherwise, the signal is generated to indicate that the field is not a repeat of the previous field of the same parity (i.e. the field likely contains at least one small area of motion).

Abstract: A system and method for processing a stream of video image data so as to create a video representation that multiplexes data corresponding to resolution or bitstream scales. This representation is such that the identity of the basic MacroBlock (MB) structure of the MPEG-1 ISO standard is preserved across all resolution and bitstream scales, e.g. by scaling across four levels of resolution. A MacroBlock is associated with a series of attributes which contribute to the amount of overhead data incorporated in an MPEG-1 compressed data stream, so that by preserving the MacroBlock identify across multiple resolutions and bitstream scales, these scales can share this overhead, thus requiring it to be included only once in the data stream. Preserving the MacroBlock identify also simplifies significantly the derivation of motion estimation vector data for all resolution scales other than the highest resolution.

Abstract: An apparatus and method for encoding of a video picture is disclosed. The video picture has a plurality of pictures. The pictures each have a plurality of macroblocks. The macroblocks each have a plurality of sub-blocks. The apparatus comprising a first module configured to generate a transform coefficient C.sub.ij for each of the sub-blocks of the macroblock. The apparatus further comprises a second module configured to variably quantize the transform coefficient by a scaling factor Q.sub.p based on the complexity of the picture and any rate control requirements.