Abstract: One embodiment of the invention pertains to a method of determining a measure of image complexity. An image is subdivided the image into a plurality of small image regions. Multiple statistical tests are performed to determine the similarity of a pair of adjacent image regions. If said pair passes the multiple statistical tests, then the pair of adjacent image regions are grouped together into one new region. The resulting merged regions may be weighted according to geometry and/or color variance, and the weights may be summed to produce an image complexity measure.

Abstract: One embodiment of the invention relates to a method of merging segments to form supersegments in an image. The image consists of a plurality of segments that are constituent portions of the image. At least one candidate segment(s) and at least one neighboring segment(s) for each candidate segment are identified. An error statistic for each pair, consisting of a candidate segment and a corresponding neighboring segment, is computed. A neighboring segment is determined that results in a smallest error statistic for a given candidate segment. A determination is also made as to whether the smallest error statistic is sufficiently small to merit merging of the corresponding pair of segments. The corresponding pair of segments is merged to create one supersegment. The supersegment is a new segment including all pixels formerly contained in one of the two segments that were merged.

Abstract: A method and apparatus for client-side detection of network congestion in a best-effort packet network comprising streaming media traffic is disclosed. Said method and apparatus provide for quality streaming media services in a congested network with constrained bandwidth over the last-mile link. A client media buffer detects at least one level of congestion and signals a server to enact at least one error mechanism. Preferred error mechanisms include packet retransmissions, stream prioritization, stream acceleration, changes in media compression rate, and changes in media resolution. Said method and apparatus allow distributed management of network congestion for networks comprising multiple clients and carrying significant streaming media traffic.

Abstract: Motion vectors encode for differences between segments of a reference frame and pixels of a current frame being encoded when the current frame is a nonkey frame. The motion vectors are encoded by grouping one or more segments of the frame into a group of segments, generating a group motion vector for the group of segments and one or more local motion vectors, wherein a local motion vector corresponds to a segment in the one or more segments and specifies a change for the segment relative to the motion vector for the group of segments and encoding the motion vector and one or more local motion vectors. The group motion vector can be determined based on a relationship between the motion vectors for the one or more segments. The grouping can be hierarchical. The motion vectors can represent translation, z-ordering, deformation, and/or lighting data.

Abstract: Video data is encoded to form compressed video data wherein at least some of the frames are encoded as nonkey frames with reference to content of reference frames. In encoding a nonkey frame, segments of a reference frame can be matched to the pixels of the nonkey frame and related by a calculated motion vector for each segment, wherein a motion vector represents a difference in position of the image area represented by the segment. Motion vectors are predicted and the encoding of the nonkey frame can omit coding for calculated motion vectors that are sufficiently close to their predicted values and encoding differences between calculated and predicted motion vectors. Differences in values can be considered residue and coded as part of residue data. A decoder making similar predictions can decode the compressed video data even when the compressed video data contains no information about the predictions for motion vectors.

Abstract: The utilization of an overflow link is envisioned within a communication network to increase bandwidth. In order to increase bandwidth when necessary, an alternate overflow network is utilized to transfer data between a local data center and an individual receiving location. In this process, a portion of the data packets are transmitted to a different receiving location with available bandwidth. The packets are then transmitted from this location to the original requesting location via a shared communications link between the two receiving locations, thus increasing the bandwidth between the local center and the individual receiving location until the additional demand is met.

Abstract: Video data is compressed using segmentation of reference frames where the segmentation results in a hierarchy of segments. The hierarchy can be generated bottom-up, where a first set of segments is generated and then a second set of segments generated by grouping segments of the first set, based on pixel value and/or segment boundaries. The hierarchy can be generated top-down, where a first set is generated and then a second set is generated by dividing up segments of the first set, based on pixel value and/or segment boundaries. The hierarchy can be included in the compressed video data or omitted such that a decoder would have to independently generate it. The hierarchy can be two or more levels. The hierarchy can be used for editing, formatting and/or compressing frames, as well as associating metadata with elements of the frame and coding motion, residue or other kinetic information.

Abstract: An encoding system encodes and decodes video data using an exposed area fill processor. A nonkey frame is encoded as a set of kinetic information relating segments of a reference frame to the nonkey frame and the nonkey frame is decoded from segments of at least one reference frame, the kinetic information and results of an exposed area fill process that estimates contents of the nonkey frame not already covered by the segments and the kinetic information. The exposed area fill results can be determined at the encoder and conveyed to the decoder or the decoder can determine the results independently. The encoded video data can include an indication of which of a plurality of fill schemes are used, or the decoder can determine the indication by itself. The exposed area fill information might include bounds of areas to be filled and/or pixel values of pixels therein.

Abstract: An encoder segments frames of video data and associates metadata with segments. The metadata elements can be associated with the segments that include areas of the frame associated with the metadata elements. A motion matcher can match segments of a reference frame to pixels of a current nonkey frame being encoded when a metadata associator associates elements of metadata with segments of the segmentation of the reference frame and associates a matched segment's metadata elements with matched areas of the current frame. The metadata elements might represent actions to be taken when a user of the video data indicates a selection of an area of an image that has that metadata element associated therewith. The metadata associations can be included in the encoded video data or deduced by a decoder. The metadata associations can be independent of segment indices or other segment changes.

Abstract: One embodiment relates to an apparatus for image processing. The apparatus includes a candidate edge chain identifier for identifying candidate edge chains in an image being processed, means for calculating a dynamic chain-based threshold function that is dependent on at least one characteristic of the image being processed, and a threshold applicator for applying the dynamic chain-based threshold function to the candidate edge chains. The characteristic of the image being processed may be global in that it is determined from the overall image being processed. A system may include an encoder or a decoder, both of which include the above apparatus. Another embodiment relates to a method for image processing. The method determines a dynamic chain-based threshold function that is dependent on at least one characteristic of the image being processed and applies the dynamic threshold to a candidate edge chain.

Abstract: A method of reconstructing a previously occluded area of a video image frame exposed by the motion of a segment within said image frame. In one embodiment the method involves approximating the color values of the pixels in the newly exposed area from the color values of the neighboring image segments. The process is refined by identifying a set of neighboring segments to the exposed area, called fill segments, that most closely resemble the color values of the pixels within the exposed area. These fill segments are then used to reconstruct the color values of the exposed area. In one embodiment, the identities of the fill segments are transmitted to an exemplary decoder.

Abstract: Video data is compressed with nonkey frames encoded with reference to segmentation of reference frames, where the encoded video data includes kinetic information relating segments of a reference frame to pixels of a nonkey frame and the kinetic information includes translations of segments and at least one of a z-order, a deformation and a lighting change. The segmentation performed during encoding can be included in whole or part in the compressed video data. If used, z-ordering could be relative or absolute, based on changes of occlusion of segments by other segments between the frames, based on content of other frames or based on z-order indications in the video data being compressed. Other kinetic information might include segment changes between frames such as rotation, dilation, affine transformations, nonlinear transformations defined by a set of deformation parameters, linear lighting offsets in one, two or three color planes, and/or residue information.

Abstract: Video data is compressed using segmentation of reference frames where the segmentation results in a hierarchy of segments. The hierarchy can be generated bottom-up, where a first set of segments is generated and then a second set of segments generated by grouping segments of the first set, based on pixel value and/or segment boundaries. The hierarchy can be generated top-down, where a first set is generated and then a second set is generated by dividing up segments of the first set, based on pixel value and/or segment boundaries. The hierarchy can be included in the compressed video data or omitted such that a decoder would have to independently generate it. The hierarchy can be two or more levels. The hierarchy can be used for editing, formatting and/or compressing frames, as well as associating metadata with elements of the frame and coding motion, residue or other kinetic information.

Abstract: An encoder segments frames of video data and associates metadata with segments. The metadata elements can be associated with the segments that include areas of the frame associated with the metadata elements. A motion matcher can match segments of a reference frame to pixels of a current nonkey frame being encoded when a metadata associator associates elements of metadata with segments of the segmentation of the reference frame and associates a matched segment's metadata elements with matched areas of the current frame. The metadata elements might represent actions to be taken when a user of the video data indicates a selection of an area of an image that has that metadata element associated therewith. The metadata associations can be included in the encoded video data or deduced by a decoder. The metadata associations can be independent of segment indices or other segment changes.

Abstract: A decoder decodes compressed video data wherein nonkey frames are decoded with reference to other frames from the video data that are reference frames. The decoder generates at least a part of a segmentation of the reference frames for use in decoding nonkey frames. A nonkey frame is regenerated using kinetic information about the current frame and the reference frame segmentation. Kinetic information might include segment translation information. Where the segmentation used in encoding the compressed video data can vary among a plurality of segmentation schemes, the decoder determines which segmentation scheme is used from selection indications in the compressed video data or from previously decoded video data. The decoder might also use partial segmentation information, segmentation hints, partial segment canonical information and/or canonical hints in its segmentation process. The decoder might also process segment-related metadata extracted the compressed video data.

Abstract: An encoding system includes an encoder that encodes uncompressed video data to form compressed video data and a decoder that decodes the compressed video data to form at least an approximation of the uncompressed video data. The video data comprises a sequence of a plurality of image frames comprising key frames and nonkey frames. In encoding a nonkey frame, reference is made to segments of a reference frame. Kinetic information, such as motion vectors, relates portions of the nonkey frame to the segments of it reference frame. The information content of the nonkey frame that is not conveyed by the segmentation, the reference frame content and the kinetic information can be encoded as residue data. Each segment's residue data, or the nonkey frame's residue data, can be encoded as coefficients of basis functions known to both the encoder and the decoder.

Abstract: The utilization of an non-QOS guaranteed network is envisioned within a communication network to increase bandwidth when necessary. In this system two locations are connected by two separate communications networks one QOS guaranteed QOS guaranteed network while the other non-QOS guaranteed packet based network without QOS guarantee. A smart buffering system integrates the two networks.

Abstract: An encoding system includes an encoder that encodes uncompressed video data to form compressed video data and a decoder that decodes the compressed video data to form at least an approximation of the uncompressed video data. The video data comprises a sequence of a plurality of image frames comprising key frames and nonkey frames. In encoding a nonkey frame, reference is made to segments of a reference frame. Kinetic information, such as motion vectors, relates portions of the nonkey frame to the segments of it reference frame. The information content of the nonkey frame that is not conveyed by the segmentation, the reference frame content and the kinetic information can be encoded as residue data. Each segment's residue data, or the nonkey frame's residue data, can be encoded as coefficients of basis functions known to both the encoder and the decoder.

Abstract: A process and apparatus for identifying abrupt cuts or scene changes in any ordered sequence of images. In one specific embodiment, two or more consecutive images from a sequence are introduced to a segmenter as digital frames. The segmenter independently divides each of these frames into pixel regions or segments according to some common characteristic so that every pixel belongs to exactly one segment. A segment analysis unit then performs some statistical analysis on the segment data for each of the frames and generates composite statistics for each frame. A frame comparison unit then examines these composite statistics to determine whether these frames belong to a consistent scene of images. If the composite statistics for these frames differ sufficiently, the comparison unit declares the latter frame in the sequence to belong to a new scene. This information may then be transmitted back to the data source for the purpose of marking the scene change or for any other purpose.

Abstract: A network for distributing broadband video content from its origination point to end users using a system of video servers, video storage devices, video caches and a broadband transmission network. Video material is initially received from content providers, encoded using a compression algorithm, and stored at a centralized location. Depending on the projected frequency of viewing of the content, it either remains stored at the centralized location for less frequently viewed content, or the projected frequently viewed content is proactively transmitted to storage systems located near the edge of the network close to the end users.