Abstract: A method of frame rate conversion includes receiving multiple input frames including a previous frame, a current frame and a next frame. A changing trend between the current frame and the previous frame is calculated. The current frame is used for generating one or more than one inserting frame according to the changing trend. The inserting frame is output after outputting the current frame to achieve frame conversion.

Abstract: A method of frame rate conversion includes receiving multiple input frames including a previous frame, a current frame and a next frame. A changing trend between the current frame and the previous frame is calculated. The current frame is used for generating one or more than one inserting frame according to the changing trend. The inserting frame is output after outputting the current frame to achieve frame conversion.

Abstract: A method of compressing an image is provided by saving compressed color components into temporary buffers. In different time slots, compressed color components are stored in different temporary buffer. When data in the temporary buffers reach a predetermined size, data are moved to a second buffer larger than the temporary buffers. When the second buffer stores a predetermined amount of data, data are moved to an external memory.

Abstract: The digital video referencing frame image is compressed block by block by applying lossless compression algorithm to pixel components with full length, or 1 bit, 2 bits, 3 bits or 4 bits LSB bits truncation. If a sub-block has high complexity which results in more than 3 bits error for most pixel components, a transfer algorithm with quantization and VLC coding is applied to compress this sub-block. Should the complexity is higher than a threshold or at least one sub-block having error of more than 3 bits for most pixel components, truncating 1 LSB bit of sub-block with simple pattern to save more bits to be allocate to code the sub-block with highest complex pattern.

Abstract: Applying a mechanism of image signal processing and color-space-conversion to convert the captured Green components to be Y, luminance components for only those pixels having raw Green data without interpolation, and to convert the Blue components to be U, chrominance components for only those pixels having raw Blue data, and Red components to be V, chrominance components for only those pixels having raw Red data. These converted YUV components are input to a predetermined video compression codec for reducing the intra- and inter-frame redundant information.

Abstract: A method of compressing an image by saving the compressed color components into multiple temporary buffers with each time slot saving the color component to the different buffer. A method deciding when to shift the compressed color components to another device is applied to avoid underflow and overflow of the output buffer.

Abstract: The differential value of the adjacent pixels is calculated firstly and is coded by a VLC coding. The VLC coding includes codes representing the Quotient and Remainder with a marker bit inserted in between. The divider is predicted with no code in the coded data stream. If three pixel components are presented in the same clock time, three VLC encoders and three VLD decoders are applied to encode and decode one pixel at a time. During encoding, both Remainder and Quotient of the same pixel component are encoded in parallel followed. During decoding, both Remainder and Quotient of the same pixel component are decoded in parallel and the results of the first pixel component are used a reference to decode the second pixel component which adopts the same decoding procedure and the decoded results of the second pixel component is used as reference to decode the third pixel component.

Abstract: A method of compressing an image by saving the compressed color components into multiple temporary buffers with each time slot saving the color component to the different buffer. The difference between the input data and the output data.

Abstract: A method of compressing an image by saving the compressed color components into multiple temporary buffers with each time slot saving the color component to the different buffer. A method deciding when to shift the compressed color components to another device is applied to avoid underflow and overflow of the output buffer.

Abstract: Applying a mechanism of image signal processing and color-space-conversion to convert the captured Green components to be Y, luminance components for only those pixels having raw Green data without interpolation, and to convert the Blue components to be U, chrominance components for only those pixels having raw Blue data, and Red components to be V, chrominance components for only those pixels having raw Red data. These converted YUV components are input to a predetermined video compression codec for reducing the intra- and inter-frame redundant information.

Abstract: This image compression applies a lossless compression algorithm and a lossy compression algorithm to code the differential value of the adjacent pixels. If lossy algorithm is selected, it codes the differential value of the present pixel and the reconstructed previous pixel. In quantizing the differential value of adjacent pixel components, a variable range of interval of value is predetermined with smaller interval range in values closer to “0” and larger interval range farer from “0”.

Abstract: The digital video referencing frame image is compressed block by block by applying lossless compression algorithm to pixel components with full length, or 1 bit, 2 bits, 3 bits or 4 bits LSB bits truncation. If a sub-block has high complexity which results in more than 3 bits error for most pixel components, a transfer algorithm with quantization and VLC coding is applied to compress this sub-block. Should the complexity is higher than a threshold or at least one sub-block having error of more than 3 bits for most pixel components, truncating 1 LSB bit of sub-block with simple pattern to save more bits to be allocate to code the sub-block with highest complex pattern.

Abstract: The digital video referencing frame image is compressed block by block with each block having a predetermined data rate and each block pixels are divided to be multiple sub-blocks with each sub-block having its divider to code the quotient and remainder of the differential values of adjacent pixel components. A group of blocks pixels share the same referencing pixel component with each block contributes one referencing pixel component and 2 bits to identify the block of most complex pattern falls on. A predetermined data rate is assigned to represent the first pixel component and another predetermined data rate is assigned to represent the first pixel component of a block. An extra amount of bits to represent either the first pixel component or the second and the third pixel components is allowed.

Abstract: The differential value of the adjacent pixels is calculated firstly and is coded by a VLC coding. The VLC coding includes codes representing the Quotient and Remainder with a marker bit inserted in between. The divider is predicted with no code in the coded data stream. If three pixel components are presented in the same clock time, three VLC encoders and three VLD decoders are applied to encode and decode one pixel at a time. During encoding, both Remainder and Quotient of the same pixel component are encoded in parallel followed. During decoding, both Remainder and Quotient of the same pixel component are decoded in parallel and the results of the first pixel component are used a reference to decode the second pixel component which adopts the same decoding procedure and the decoded results of the second pixel component is used as reference to decode the third pixel component.

Abstract: An image compression method and fast storage device accessing and pixel decompression is achieved by asserting the starting location of one or more groups of compress pixels. Information of at least one upper line of pixel's pattern complexity is temporarily saved into a register for predicting the code length of the targeted pixel of the current line and deciding the coding method.

Abstract: A compression method and apparatus compresses the instruction for a CPU which significantly reduces the density of storage device of storing the program. Multiple groups of instructions are compressed separately by a mapping unit indicating the starting location of a group of instructions which helps quickly recovering the corresponding instructions. In decoding, multiple instructions are decoded in parallel to quickly recover instructions to avoid running out of instruction in the file register. A mapping unit is used to translate the corresponding address of a group of data for quickly recovering the corresponding data for the file register file to avoid running out of data for a CPU to execute.

Abstract: The captured video will be compressed group by group and transmitted to the receiver through wireless transceiver. The mechanism of the wireless video communication includes the defining of whether or not to request resend when data loss or data damage happened. When the time of the data loss or data damage happened is more than the predetermined threshold, the video will be compressed by further lower bit rate. Areas of the captured image with more interest will be compressed by assigning more bit rate. The area of less interest will be compressed with less bit rate and transmitted. One of every predetermined amount of images will be shrunk and displayed in the smaller area of the display device to let the video shooter view the position the image is captured and decides whether the position results in good image quality.