Abstract: Various aspects of the present disclosure generally relate to wireless communication. In some aspects, a communication device may classify a plurality of packets of streaming video content based at least in part on one or more video characteristics; generate a plurality of code blocks based at least in part on classifying the plurality of packets, wherein each code block includes at least some subset of the plurality of packets having different effect on the quality of experience; and provide the plurality of code blocks for transmission. Numerous other aspects are provided.

Abstract: Various embodiments concern video patient monitoring with detection zones. Various embodiments can comprise a camera, a user interface, and a computing system. The computing system can be configured to perform various steps based on reception of a frame from the camera, including: calculate a background luminance of the frame; monitor for a luminance change of a zone as compared to one or more previous frames, the luminance change indicative of patient motion in the zone; and compare the background luminance to an aggregate background luminance, the aggregate background luminance based on the plurality of frames. If the background luminance changed by more than a predetermined amount, then the aggregate background luminance can be set to the background luminance, luminance information of the previous frames can be disregarded, and motion detection can be disregarded.

Abstract: The present invention relates to an encoding device and a method, a decoding device and a method, an editing device and a method, a storage medium, and a program which can perform encoding and decoding so that buffer failure does not occur. Information, such as a minimum bit rate, a minimum buffer size, and a minimum initial delay time, is contained in a random access point header contained in an accessible point in a bitstream. A bitstream analyzing unit 72 analyzes an input bitstream, sets the above-mentioned information, and outputs the resulting information to a buffer-information adding unit 73. The buffer-information adding unit 73 adds the input information to the input bitstream and outputs the resulting bitstream. The present invention is applicable to an encoding device and a decoding device which process bitstreams.

Abstract: The present invention relates to an encoding device and a method, a decoding device and a method, an editing device and a method, a storage medium, and a program which can perform encoding and decoding so that buffer failure does not occur. Information, such as a minimum bit rate, a minimum buffer size, and a minimum initial delay time, is contained in a random access point header contained in an accessible point in a bitstream. A bitsteam analyzing unit 72 analyzes an input bitstream, sets the above-mentioned information, and outputs the resulting information to a buffer-information adding unit 73. The buffer-information adding unit 73 adds the input information to the input bitstream and outputs the resulting bitstream. The present invention is applicable to an encoding device and a decoding device which process bitstreams.

Abstract: A GOP-independent dynamic bit-rate controller system includes a user interface to receive one or more input parameters, a bit-rate controller and an encoder. The bit-rate controller regulates a bit-rate of an output bit-stream. The bit-rate controller includes multiple bit-rate modules to determine a bit-estimate and a quantization parameter, and a control module to calculate a convergence period based on the received input parameters and a frame rate. The control module selects a bit rate module based on the convergence period and the encoder generates the output bit-stream using the quantization parameter determined by the bit rate module.

Abstract: A path detection-use graph structure is generated based on a plurality of nodes representing the plurality of linear structures, and a path that is included in the generated path detection-use graph structure and connects a plurality of root nodes representing points of origin of the plurality of linear structures to each other is detected. Then, based on a predetermined condition representing a feature of an erroneous connection edge erroneously connecting two nodes that are to belong to different graph structures to each other, a connection cost is set for each of edges forming the path so that the erroneous connection edge is hard to connect, and based on the set connection costs, the plurality of graph structures corresponding respectively to the plurality of linear structures are generated.

Abstract: A system, method, base station, and computer program product for coordinating communication of data packets between a user device and an application server is described. The data packets may correspond to a bit-stream of encoded video data. In one aspect, the base station includes a memory and a computer processor operatively coupled to the memory, to a radio transmitter, and to a radio receiver. The processor is configured to detect a video frame type of the data packets and transmit one or more of the plurality of data packets based on the detected video frame type. For example, the processor may transrate, drop, or schedule the data packet for transmission based on the detected video frame type.

Abstract: A method, a system, and a computer-readable medium are provided which provide interactive editing of image data. Image data is sampled, by a computing device, at a first resolution. The first resolution is lower than a full resolution of the image data. Gradients for the sampled image data are calculated by the computing device. The computing device solves a system equation for color pixel data for each pixel of the sampled image data using the sampled image data and the calculated gradients. The computing device controls a display of the color pixel data on a display.

Abstract: An image processing apparatus includes a criteria setter that sets selection criteria for selecting quantization intensities on the basis of feature indices of an inputted image; an intensity selector that selects, on the basis of the selection criteria set by the criteria setter, one of plural quantization intensities for each partial image area of the inputted image; and a quantizer that quantizes image information on each partial image area with the quantization intensity selected by the intensity selector.

Abstract: A data processing method for a high density multimedia interface (HDMI) includes receiving video and audio data, sampling the receiving data according to a sample clock, outputting a sampling pattern according to the sampled receiving data and the sample clock, comparing the sampling pattern with a plurality of predetermined patterns, deciding the timing sequence of the receiving data when the sampling pattern and one of the plurality of predetermined patterns are the same, and outputting the video and audio data according to the correct timing sequence.

Abstract: According to an embodiment of the invention, even if a sample-and-hold circuit samples a signal from a signal processor to a display unit, an image quality reduction is hard to occur. According to an embodiment of the invention, there is provided a flat-panel display device includes a phase control circuit setting a state that a first parallel arrangement RGB pixel signal shifts by 120 degrees, a sample-and-hold circuit sampling a second parallel arrangement RGB pixel signal parallel-output from the phase control circuit to obtain a series arrangement RGB pixel signal, which is three times as much as a single pixel signal, and a driver supplying the series arrangement RGB pixel signal to the corresponding display pixel.

Abstract: An image encoding method includes generating a predictive signal and encoding mode information according to each encoding mode from a macroblock signal corresponding to each macroblock, selecting a quantization code table corresponding to each macroblock, generating a predictive error signal for each encoding mode based on the macroblock signal and the predictive signal, subjecting the predictive error signal to orthogonal transformation, quantizing the orthogonal-transformed predictive error signal while changing a quantization parameter for every plural sub-pixel-blocks, using the quantization code table corresponding to the macroblock, encoding quantization transformation coefficient, calculating an encoding cost, selecting one encoding mode based on the encoding cost, selecting one quantization code table based on the encoding cost, and encoding information of an index indicating the selected quantization code table for every frame of the input image signal or every region of the frame.

Abstract: Embodiments of the invention provide an instruction that computes the horizontal and vertical values (H,V) based upon the predefined equations. Based upon the horizontal and vertical values (H,V) and the current sign bit being processed at [m,n], the output context and decision pair (CX,D) is determined placed into a destination register.

Abstract: Low complexity (16 bit arithmetic) H.264 video compression replaces a single quantization table for all quantization parameters with multiple quantization tables and thereby equalizes quantization shifts and round-off additions; this eliminates the need for 32-bit accesses.

Abstract: A digital camera has a signal processor, a high-frequency detector, a sampling processor, and a compression processor. The signal processor generates luminance and color difference data on the basis of image-pixel signals read from an image sensor. The high-frequency detector detects high-frequency components in the color difference data. The sampling processor carries out a sampling process to the luminance and color difference data in accordance with a given ratio of sampling frequencies. Then, the compression processor compresses the sampled luminance and color difference data. When there is a relatively low number of high-frequency components in the color difference data, the sampling processor samples the color difference data with a low sampling frequency.

Abstract: It is possible to control the number of generated codes while retraining deterioration of an image quality by an encoding circuit constituted so as to select any of a first image signal not decreasing information quantity and a second image signal decreasing information quantity in accordance with the accumulated value of the number of codes.

Abstract: An improved loss recovery method for coding streaming media classifies each data unit in the media stream as an independent data unit (I unit), a remotely predicted unit (R unit) or a predicted data unit (P unit). Each of these units is organized into independent segments having an I unit, multiple P units and R units interspersed among the P units. The beginning of each segment is the start of a random access point, while each R unit provides a loss recovery point that can be placed independently of the I unit. This approach separates the random access point from the loss recovery points provided by the R units, and makes the stream more impervious to data losses without substantially impacting coding efficiency. The most important data units are transmitted with the most reliability to ensure that the majority of the data received by the client is usable. The I units are the least sensitive to transmission losses because they are coded using only their own data.

Abstract: Transcoding of a video stream to reduce the size of the video stream with little, if any, loss in video quality after subsampling. After accessing a video stream of video pictures (i.e., video frames or fields), the blocks of the video picture are each subject to matrix pre-multiplication and post-multiplication. Such matrix multiplication does degrade the video quality if subsampling was not to occur. However, the pre-multiplication and post-multiplication matrices are calculated based on the subsampling matrices that will be used to ultimately subsample the video stream such that after subsampling eventually occurs, the matrix multiplications result in minimal loss of video quality.

Abstract: A technique wherein the number and position of a quantization parameter node is determined in response to the quantization parameters and a preselected error. The size of scene graph and the corresponding amount of memory required to store the scene graph can be reduced by selective placement of quantization parameter nodes in a scene graph. The scene graph is traversed depth first to establish an order and then traversed in reverse. At each node, a calculation relating to (1) the relative cost of inserting a quantization parameter node and (2) the relative savings that result from insertion of a quantization node is performed. Quantization parameter nodes are selectively placed in response to a result of these calculations. The maximum degree of acceptable error value is chosen for each quantization type. This error value limits the number of quantization parameter nodes that can be placed in a scene graph.

Abstract: The invention relates to a method of coding motion information associated to an image sequence, comprising the steps of subdividing each image into blocks and applying to each block a block-matching algorithm for defining a shifted block as the prediction of the current block, the motion vector between said shifted and current blocks being the predicted vector associated to said current block and all the motion vectors similarly predicted for a whole current image constituting a motion vector field associated to said current image. For each current image, the motion information constituted by said associated motion vector field is finally coded. According to the invention, the motion vector C to be coded is approximated by a spatio-temporal predictor P defined by a relation of the type: P=&agr;·S+&bgr;·T, where S and T are spatial and temporal predictors respectively, and (&agr;, &bgr;) are weighting coefficients respectively associated to said spatial and temporal predictors.

Abstract: A multi-layer embedded bitstream is generated from a subband decomposition by partitioning each subband of the decomposition into a plurality of blocks; and encoding the blocks of each subband. The blocks of each subband are coded independently of each other. Resulting is a block bitstream corresponding to each block. Truncation points may be identified on the block bitstreams, and selected portions of the block bitstreams may be concatenated, layer-by-layer, to form the single-layer or multi-layer bitstream. Syntax information may also be added to the multi-layer bitstream. An image can be reconstructed from the embedded bitstream at a desired bit-rate or resolution by reading the syntax information, randomly accessing desired portions of the block bitstreams, decoding the randomly accessed portions, dequantizing the decoded portions, and applying an inverse transform to the dequantized portions.

Abstract: Techniques for classifying video frames using statistical models of transform coefficients are disclosed. After optionally being decimated in time and space, image frames are transformed using a discrete cosine transform or Hadamard transform. The methods disclosed model image composition and operate on grayscale images. The resulting transform matrices are reduced using truncation, principal component analysis, or linear discriminant analysis to produce feature vectors. Feature vectors of training images for image classes are used to compute image class statistical models. Once image class statistical models are derived, individual frames are classified by the maximum likelihood resulting from the image class statistical models. Thus, the probabilities that a feature vector derived from a frame would be produced from each of the image class statistical models are computed.

Abstract: A technique wherein the number and position of a quantization parameter node is determined in response to the quantization parameters and a preselected error. The size of scene graph and the corresponding amount of memory required to store the scene graph can be reduced by selective placement of quantization parameter nodes in a scene graph. The scene graph is traversed depth first to establish an order and then traversed in reverse. At each node, a calculation relating to (1) the relative cost of inserting a quantization parameter node and (2) the relative savings that result from insertion of a quantization node is performed. Quantization parameter nodes are selectively placed in response to a result of these calculations. The maximum degree of acceptable error value is chosen for each quantization type. This error value limits the number of quantization parameter nodes that can be placed in a scene graph.

Abstract: The invention comprises a method an apparatus for allocating processing resources in an information stream decoder in response to format indicia included within a compressed information stream. Specifically, the invention comprises an apparatus and method for decoding a video stream having an associated source video format to produce a decoded video stream having the same format or a different format, in which a computational resource is allocated in response to a change in format between the associated video format and the resultant video format.

Abstract: A method encodes a video a video objects. For each candidate object, a quantizer parameter and a skip parameter that jointly minimizes an average total distortion in the video are determined while satisfying predetermined constraints. The average total distortion includes spatial distortion of coded objects and spatial and temporal distortion of uncoded objects. Then, the candidate objects is encoded as the coded objects with the quantizer parameter and the skip parameter, and the candidate objects is skipped as the uncoded objects with the skip parameter.

Abstract: A video compression process speeds the optimal choice of quantizers for compressing a data stream by setting up the optimization problem as a path-optimization problem in configuration space and finding the lowest cost path through the configuration space. The process begins with a starting node (or “state”) and propagates least-cost waves through the space until a path is completed to the end. The process may continue using uncompleted paths while their costs are less than the end state, beginning with the lowest cost incomplete path, until an improved path is found. The process may further continue, for a time constrained process, until time runs out or all useful possibilities are exhausted.

Abstract: Processing is applied to convert an input compressed video bitstream into an output compressed video bitstream having a different bit rate and/or representing different imagery from the input bitstream. The bitstream conversion processing is adjusted based on control parameters that are generated by comparing analogous measurements made to the input and output bitstreams so that subsequent measurements of the output bitstream will more closely match subsequent measurements of the input bitstream. In certain embodiments, the bitstream conversion processing involves decoding the input bitstream, optionally applying image processing functions to the resulting decoded video data, and re-encoding the resulting processed video data to generate the output bitstream.

Abstract: A bus compression apparatus for compressing data is provided to suppress an EMI signal and to simplify a data bus structure. In the apparatus, the voltage levels of the digital output signals are summed in accordance with the resistance values of the data compression circuit to produce a compressed analog signal. The compressed analog signal is transmitted through a bus lines to a data decompressor which reproduces the digital data in response to the voltage levels of the compressed analog signal.

Abstract: A method is provided for transcoding, i.e., decoding, and re-encoding, a previously encoded video signal, to a second encoded representation. A number k>1 of previously encoded pictures of the previously encoded video signal are received in a buffer. Each of the k previously encoded pictures in the buffer is scanned to gather information on each of the k previously encoded pictures. An encoding parameter is allocated to a first one of the k previously encoded pictures which precedes each other one of the k previously encoded pictures in encoded order of the previously encoded video signal. The encoding parameter is allocated based on the information gathered for each of the k previously encoded pictures. The first previously encoded picture is decoded to produce a decoded picture. The decoded picture is re-encoded to generate a re-encoded picture in a second encoded representation of the video signal. The re-encoding is performed in a fashion which depends on the encoding parameter allocated thereto.