Abstract: The present disclosure provides a methodology for multimodal profiling of extracellular vesicles at single-particle resolution, including technique, workflow, and analytical algorithm.

Abstract: An adhesive composition includes an organic adhesive material and a sand. The organic adhesive material includes a water-soluble adhesive and a starch, wherein a weight of the organic adhesive material accounts for 4 wt % to 70 wt % of an overall weight of the adhesive composition, and a weight of the sand accounts for 30 wt % to 96 wt % of the overall weight of the adhesive composition. A water-soluble adhesive mixture includes the adhesive composition and an aqueous solution, which are mixed to form a viscous mixture (i.e., the water-soluble adhesive mixture). The water-soluble adhesive mixture has an adhering function for users to apply to and adhere to a surface of toys, so that the toys could be adhered together to form a toy model. As the water-soluble adhesive could be softened and dissolved when the water-soluble adhesive mixture is immersed in water, the toy model could be disassembled easily.

Abstract: Methods and systems for obtaining a motion vector between two frames of video image data are disclosed. Specifically, methods and systems of the present invention may be used to perform a block-matching algorithm over a two-dimensional search area in a manner that reduces number of comparisons. In particular, the method determines a best candidate block for each strip based by searching in a first dimension of a two-dimensional search area and based on a predetermined difference criterion. The method then determines a second set of best candidate blocks by performing a limited search in the other direction based on the results from the search in the first dimension. The method then determines a motion vector for the best candidate block. Integral projection arrays may be used to further optimize the search. The methods and systems of the present invention may be used in optimizing digital video encoders, decoders, and format converters.

Abstract: Methods and systems for obtaining a motion vector between two frames of video image data are disclosed. Specifically, methods and systems of the present invention may be used to estimate a motion vector for each macroblock of a current frame with respect to a reference frame in a multi-stage operation. In a transcoder, motion estimation may be performed in the compressed domain eliminating the need to fully decode the compressed data in the first format before reencoding in a second format. In a first stage, an application implementing the process of the present invention obtains a motion vector between first and second pictures of video image data in a video sequence. Each picture includes a plurality of supermacroblocks, each having a plurality of macroblocks. For each supermacroblock of the first picture, a match supermacroblock in the second picture is determined that best matches the supermacroblock of the first picture.

Abstract: Methods and systems for obtaining a motion vector between two frames of video image data are disclosed. Specifically, methods and systems of the present invention may be used to estimate a motion vector for each macroblock of a current frame with respect to a reference frame in a multi-stage operation. In a transcoder, motion estimation may be performed in the compressed domain eliminating the need to fully decode the compressed data in the first format before reencoding in a second format. In a first stage, an application implementing the process of the present invention obtains a motion vector between first and second pictures of video image data in a video sequence. Each picture includes a plurality of supermacroblocks, each having a plurality of macroblocks. For each supermacroblock of the first picture, a match supermacroblock in the second picture is determined that best matches the supermacroblock of the first picture.

Abstract: In image encoding methods or systems, first and second motion vectors are determined for the two fields comprising a frame based on a field search. The first and second motion vectors then may be used to determine whether a frame prediction search is necessary. If the difference between motion vectors for the two fields of the frame is less than a threshold, the frame search should be performed. A suitable threshold may be calculated or described in any number of ways, however, in one embodiment of the present invention, the threshold is dynamic that changes in response to the changing information in either preceding or succeeding fields.

Abstract: An MPEG video decoder adapted to decode an incoming MPEG coded video data stream to form decoded MPEG video data and to reconstruct from the decoded MPEG video data a raw video signal, utilizes: an n×n block of decoded video data discrete cosine transform values forming an original matrix having a non-zero value in a preselected corner location in the matrix; and a modified matrix forming apparatus adapted to form a modified matrix having the same content as the original matrix with the exception of a zero in the preselected corner value position; a dummy matrix forming apparatus adapted to form a dummy matrix having zero in each of its matrix positions with the exception of the preselected corner position; an inverse discrete cosine transform apparatus adapted to perform an inverse discrete cosine transform algorithm on the modified matrix and the dummy matrix; and an adder which adds the inverse discrete cosine transform of the modified matrix and the dummy matrix to produce the inverse discrete cosin

Abstract: A method and apparatus for selecting a quantization table containing quantization coefficients for encoding image data. A set of quantization tables is examined to determine a quantization table which meets a predetermined selection criteria. If such a quantization table is not the first table examined, other tables in the vicinity of a neighborhood of tables are examined utilizing linear searching techniques. If a quantization table which meets the selection criteria is not determined in the vicinity of the neighborhood of tables, quantization tables outside the vicinity of the neighborhood of tables are examined utilizing binary searching techniques.

Abstract: Methods and systems for data compression and decompression are disclosed. Specifically, the method for data compression of the present invention receives four inputs representing pixel information of an image and performs a combination of a 4-point discrete cosine transform (DCT) and a weighting function to obtain four outputs representing digital representations of an image. The method for data decompression receives four inputs representing digital representations of an image and performs a combination of an inverse weighting function and a 4-point inverse discrete cosine transform (IDCT) to obtain pixel components of an image. The methods and systems of the present invention may be used in optimizing digital video encoders and decoders.

Abstract: Methods and systems for data compression and decompression are disclosed. Specifically, the method for data compression of the present invention receives eight inputs representing pixel information of an image and performs a combination of an 8-point discrete cosine transform (DCT) and weighting function to obtain eight outputs representing digital representations of an image. The method for data decompression receives eight inputs representing digital representations of an image and performs a combination of an inverse weighting function and an 8-point inverse discrete cosine transform (IDCT) to obtain pixel components of an image. The methods and systems of the present invention may be used in optimizing digital video encoders and decoders.

Abstract: Methods and systems of the present invention obtain a motion vector between two frames of video image data. Specifically, methods and systems of the present invention may be used to estimate a motion vector for each macroblock of a current frame with respect to a reference frame in a multi-stage operation. In a first stage, an application implementing the process of the present invention coarsely searches a first search area of the reference frame to obtain a candidate supermacroblock that best approximates a supermacroblock in the current frame. In a second stage, the supermacroblock is divided into a plurality of macroblocks. Each of the macroblocks is used to construct search areas which are then searched to obtain a candidate macroblock that best appropriates a macroblock in the current frame. Additional stages may be used to further fine-tune the approximation to the macroblock.

Abstract: Methods and systems for obtaining a motion vector between two frames of video image data are disclosed. Specifically, methods and systems of the present invention may be used to perform a block-matching algorithm over a two-dimensional search area in a manner that reduces number of comparisons. In particular, the method determines a best candidate block for each strip based by searching in a first dimension of a two-dimensional search area and based on a predetermined difference criterion. The method then determines a second set of best candidate blocks by performing a limited search in the other direction based on the results from the search in the first dimension. The method then determines a motion vector for the best candidate block. Integral projection arrays may be used to further optimize the search. The methods and systems of the present invention may be used in optimizing digital video encoders, decoders, and format converters.

Abstract: A system and method to decode encoded video images in such a manner as to maintain high quality images while reducing the computation time needed to decode the images. The system takes into account that the resultant display generated may only have a fraction (1/4) of the resolution of the original image. Thus, optimizations are realized by modifying and combining the inverse discrete cosine transform (IDCT) and inverse weighting (IW) processes to process only the portion of the image to be displayed.

Abstract: A system and method to decode encoded video images in such a manner as to maintain high quality images while reducing the computation time needed to decode the images. The system takes into account that the resultant display generated may only have a fraction (1/16) of the resolution of the original image. Thus, optimizations are realized by modifying the inverse discrete cosine transform (IDCT) and inverse weighting (IW) processes to process only the portion of the image to be displayed.

Abstract: An apparatus and method for post processing image data which previously was encoded using a discrete cosine transform in order to remove resulting blocking effects. Possible blocking points are examined to determine whether blocking points exist. If blocking points are determined, an adjustment value for each blocking point is computed and proportionately utilized to adjust the adjacent and neighboring pixels.

Abstract: An apparatus and method for post processing image data which previously was encoded using a discrete cosine transform in order to remove resulting blocking effects. Correction coefficients are generated by determining the least mean square error of the blocking error. The correction coefficients are adjusted to be within the quantization range of the quantization step size used during the coding process. The adjusted correction coefficients are then used to generate the correction terms which are subsequently combined with the original image data to generate an image exhibiting reduced blocking effects when the image is displayed.

Abstract: Digital video tape recorder which operates to receive an advanced television (ATV) signal to be recorded, provide a portion such as a low-band coefficient of an intra-coded frame of the ATV signal as variable-speed data, and record the digital video data and the variable-speed data in a main and a marginal area, respectively, of successive tracks on the record medium in which the marginal area is located on each track at a position which is reproducible in a fast-speed reproducing mode. The digital video tape recorder reproduces the recorded data in the fast-speed reproducing mode by reproducing the portion of the signal stored from the marginal area of each track which is located at specific reproducible areas.

Abstract: A method and apparatus to post process decompressed image data to minimize blocking effects without affecting the sharpness of the image.

Abstract: Digital video tape recorder which operates to receive an advanced television (ATV) signal to be recorded, provide a portion such as a low-band coefficient of an intra-coded frame of the ATV signal as variable-speed data, and record the digital video data and the variable-speed data in a main and a marginal area, respectively, of successive tracks on the record medium in which the marginal area is located on each track at a position which is reproducible in a fast-speed reproducing mode. The digital video tape recorder reproduces the recorded data in the fast-speed reproducing mode by reproducing the portion of the signal stored from the marginal area of each track which is located at specific reproducible areas.

Abstract: A method and apparatus in which image data are pre-processed before undergoing block-basis image compression to compensate at least partially for the artifact known as the blocky effect that would otherwise be apparent upon decoding of the compressed data. The input data are pre-processed by combining error-correction data therewith, before block-basis compression is performed thereon. Blocky effect errors introduced during block-basis compression (e.g., standard MPEG compression) of the pre-processed input data and subsequent decoding will cancel (at least partially) the error-correction data, thereby compensating (at least partially) for the blocky effect that would otherwise occur without pre-processing.