Abstract: Systems and methods for detecting hidden messages and information in digital files are described. In an embodiment, a method of detecting steganography in a compressed digital image includes extracting neighboring joint density features from the image under scrutiny. Steganography in the image may be detected based on differences in a neighboring joint density feature of the image.

Abstract: A first set of discrete cosine transform (DCT) blocks is obtained. Each DCT block from the first set of DCT blocks has a first block size. When performing a split operation on the first set of DCT blocks, a filter is applied to the first set of DCT blocks. A second set of data blocks is generated based on the first set of DC blocks using a transform function. Each block in the second set of data blocks has a second block size. When performing a merge operation, the filter is applied to the second set of data blocks.

Abstract: A binary image downsampling method, including the steps of generating a gray-scale image from a binary image having a background and one or more foreground portions, locating skeleton pixels in the one or more foreground portions, manipulating values of certain foreground pixels in the gray-scale image such that the differences between the values of the skeleton pixels and the background pixels become more significant, downsampling the gray-scale image with the manipulated values of the certain foreground pixels, and generating a downsampled binary image from the downsampled gray-scale image.

Abstract: A method of storing an image is disclosed. A frequency-domain representation of the image is received, the frequency-domain representation having a plurality of bit-planes. The frequency-domain representation is divided into a first set of bit-planes and a second set of bit-planes, the first set of bit-planes being a higher set of bit-planes than the second set of bit-planes. The first set of bit-planes and the second set of bit-planes is partitioned into a plurality of partitions. At least one partition from the second set of bit-planes is inserted into the plurality of partitions of the first set of bit-planes to produce a plurality of arranged partitions of the image. The arranged partitions of the image are stored.

Abstract: Systems and methods configured to store images synthesized from light field image data and metadata describing the images in electronic files and render images using the stored image and the metadata in accordance with embodiments of the invention are disclosed. One embodiment includes a processor and memory containing an encoding application and light field image data, where the light field image data comprises a plurality of low resolution images of a scene captured from different viewpoints. In addition, the encoding application configures the processor to: synthesize a higher resolution image of the scene from a reference viewpoint using the low resolution images, where synthesizing the higher resolution image involves creating a depth map that specifies depths from the reference viewpoint for pixels in the higher resolution image; encode the higher resolution image; and create a light field image file including the encoded image and metadata including the depth map.

Abstract: There is provided an image processing system and an image processing method able to suppress block distortion in the case of decoding image data encoded in unit of blocks. A controlling unit selects a filtering content to be applied to the block image data based on the encoding types of the block image data to be filtered, and a filtering unit applies filtering to the block image data to be processed according to the filtering content selected by the controlling unit.

Abstract: A system and method for generating a second reduced size digital image from a first digital image, the method including iteratively compressing the first digital image to an extent determined by a quality measure comprising at least a blockiness measure quantifying added artifactual edges along coding block boundaries of the second image and/or use of a quantization matrix generated by computing a weighted average of the quantization matrix of the first digital image and a scaled second quantization matrix.

Abstract: Down-sampling of an image may be performed in the DCT domain. A multiple layered network is used to select transform matrices for down-sampling a DCT image of size M×N to a DCT image of size I×J. A spatial domain down-sampling method is selected and applied to the DCT image to produce a down-sampled DCT reference image. A learning with forgetting algorithm is used to apply a decay to the elements of the transform matrix and select a transform matrices which solve an optimization problem. The optimization problem is a function of the visual quality of images obtained using the transform matrices and the computational complexity associated with using the transform matrices. The visual quality is a measure of the difference between the down-sampled DCT image obtained using the transform matrices and the visual quality of the DCT reference image obtained using a spatial domain down-sampling method.

Abstract: A system and method for image and video compression using compressive sensing is provided. An embodiment method for compressing an image having a plurality of image blocks includes selecting an image block from the plurality of image blocks to compress, computing a sum of sinusoidal signals at different frequencies and amplitudes representation for the selected image block, quantizing the amplitudes of the sinusoidal signals at different frequencies, and saving the quantized amplitudes as a first compressed image block. The method also includes truncating the quantized amplitudes, thereby producing truncated quantized amplitudes, saving the truncated quantized amplitudes as a second compressed image block, and selecting either the first compressed image block or the second compressed image block as a final compressed image block. The selecting is based on a measure of the quality of the first compressed image block and the second compressed image block.

Abstract: Some aspects of the disclosure relate to a compression technique that can permit determining dynamically a satisfactory quantization matrix based at least on properties intrinsic to a digital object being compressed and a predetermined compression quality criterion, wherein the quantization matrix is associated with a specific space-domain-to-frequency-domain transforms. In one aspect, the compression technique can permit creation of a compressed digital object that can satisfy a predetermined a compression quality criterion.

Abstract: An apparatus for decoding an image includes an encoding information extractor which extracts split information indicating whether to split a coding unit of an upper depth into coding units of deeper depths and skip information indicating whether a prediction mode of a current coding unit is a skip mode, from image data and a decoding unit which determines a split structure of a maximum coding unit, according to the split information so that the maximum coding unit is hierarchically split as a depth increases and determines whether the prediction mode of the current coding unit is the skip mode according to the skip information.

Abstract: A decoding method decodes a bit stream in an image decoding apparatus. The method includes receiving a weight parameter that is added to a luma quantization parameter as the bit stream. The method also includes decoding, in a decoding unit in the image decoding apparatus, the bit stream, and generating a luma component of quantized coefficients and a chroma component of quantized coefficients. Further, the method includes performing, in a dequantization unit in the image decoding apparatus, dequantization on the luma component of quantized coefficients using the luma quantization parameter and the chroma component of quantized coefficients using a chroma quantization parameter calculated on the basis of the luma quantization parameter weighted by an add operation of the weight parameter. In addition, the method includes performing, in a transform unit in the image decoding apparatus, an inverse orthogonal transform.

Abstract: A hierarchical system and method of encoding and compressing image data, or video data including a sequence of images. In one embodiment, a line buffer is used to hold a line of an image, and as the second line of the image is read from the input data stream, 2×2 blocks of the image are transformed, e.g., by a Hadamard transform. Each transform results in a low-frequency component and three high-frequency component. The high-frequency components are encoded, e.g., using entropy coding, and sent out to the output bit stream. The low-frequency components are pushed to the line buffer. This process is continued until enough low-frequency components have been formed to complete a 2×2 block of low-frequency components, which is then transformed. The process may be repeated hierarchically for multiple layers.

Abstract: A display system includes: a display device, a transmitting device which generates compressed data by performing a compression process on image data corresponding to a display image, and a driver which drives the display device in response to the compressed data received from the transmitting device. The driver includes: a decompression circuit which generates decompressed data by decompressing the compressed data, an FRC circuit configured to perform an FEC process on the decompressed data to generate display data and a drive circuit which drives the display device in response to the display data. The following relation holds: m2>m3>m1, where m1 is a number of bits of the compressed data per pixel, m2 is a number of bits of the decompressed data per pixel and m3 is a number of bits of the display data per pixel.

Abstract: In the printer, the correction content setting portion sets equal to or more than one correction contents, the decimation rate setting portion sets decimation rates for respective planes of Y, Cb, and Cr of JPEG data (compressed data) based on the set correction contents. Pixels are decimated at the set decimation rates and the decompression processing unit decompresses the JPEG data so as to generate image data. In this manner, decimation processing is performed in accordance with the plurality of correction contents. Therefore, for example, inverse quantization processing, inverse DCT operation processing, and the like, can be omitted in accordance with the correction contents. The decompression processing may be executed on a sampling image to be used for sampling when the contents of correction to be performed on the image data are determined and on a print image to be used for printing.

Abstract: A method and device for encoding an image into a scalable bitstream, the method including acts of dividing the Image in image blocks; encoding each image block in accordance with one of a plurality of different encoding modes, to obtain corresponding block bitstreams comprising one or more types of data representative of said encoding mode; and forming the scalable bitstream by iteratively scanning the block bitstreams, each scan including acts of: selecting at least on of said types of data, including in the scalable bitstream data of the selected types from the block bitstreams and including in the scalable bitstream flags indicating the selected types of data.

Abstract: A video coding system that codes video objects as scalable video object layers. Data of each video object may be segregated in to one or more layers. A base layer contains sufficient information to decode a basic representation of the video object. Enhancement layers contain supplementary data regarding the video object that, if decoded, enhance the basic representation obtained from the base layer. The present invention thus provides a coding scheme suitable for use with decoders of varying processing power. A simple decoder may decode only the base layer of the video objects to obtain the basic representation. However, more powerful decoders may decode the base layer data of video objects and additional enhancement layer data to obtain improved decoded output. The coding scheme supports enhancement of both the spatial resolution and the temporal resolution of video object.

Abstract: A pixel block is compressed by providing a respective color component prediction for each pixel in the block. A difference between color components of two neighboring pixels is calculated and compared to a threshold. If the difference is smaller than the threshold, the prediction is calculated based on a first linear combination of the color components of these two neighboring pixels. However, if the difference exceeds the threshold, a second or third linear combination of the color components of the neighboring pixels is employed in the prediction. A guiding bit associated with the selected linear combination may be used. A prediction error is calculated based on the color component of the pixel and the provided prediction. The compressed block comprises an encoded representation of the prediction error and any guiding bit.

Abstract: A method for determining a shift between two images, determining a first correlation in a first direction, the first correlation being derived from a first image projection characteristics and a second image projection characteristics, and a second correlation in a second direction, the second correlation being derived from the first image projection characteristics and the second image projection characteristics. The method determines a set of hypotheses from a first plurality of local maxima of the first correlation and a second plurality of local maxima of the second correlation. The method then calculates a two-dimensional correlation score between the first image and the second image based on a shift indicated in at least one of the set of hypotheses, and selecting one of the set of hypotheses as the shift between the first image and the second image based on the calculated two-dimensional correlation score.

Abstract: A portable electronic device is provided. The portable electronic device includes a processor for providing encoding data and an LCD module coupled to the processor. The processor includes an encoder for encoding a frame data to generate the encoding data. The LCD module includes a driver and an LCD coupled to the driver. The driver includes a decoder for decoding the encoding data to obtain an image data. The LCD displays the image data.

Abstract: An image coding method includes: (i) determining, for each of one or more associated blocks, whether to add a motion vector of the associated block to a list, and (ii) adding the motion vector of the associated block to the list when determining that the motion vector of the associated block is to be added to the list; selecting, from the list, a motion vector which is to be merged to a current block; and (i) merging the selected motion vector to the current block, and (ii) coding the current block using the merged motion vector as a motion vector of the current block, and in the determining, it is determined that the motion vector of the associated block is not to be added to the list when an associated picture and an associated reference picture match temporally or when a current picture and a current reference picture match temporally.

Abstract: A method of noise filtering of a digital video sequence is provided that includes computing a motion image for a frame, wherein the motion image includes a motion value for each pixel in the frame, and wherein the motion values are computed as differences between pixel values in a luminance component of the frame and corresponding pixel values in a luminance component of a reference frame, applying a first spatial noise filter to the motion image to obtain a final motion image, computing a blending factor image for the frame, wherein the blending factor image includes a blending factor for each pixel in the frame, and wherein the blending factors are computed based on corresponding motion values in the final motion image, generating a filtered frame, wherein the blending factors are applied to corresponding pixel values in the reference frame and the frame, and outputting the filtered frame.

Abstract: A JPEG decoder having a scaling function includes an inverse discrete cosine transform block, wherein the JPEG decoder selectively performs an inverse discrete cosine transform on a part of pixel data of a macroblock through the inverse discrete cosine transform block and outputs a scaled image file. The JPEG decoder and the scaling method using the JPEG decoder increase a decoding speed, thereby enabling an image to be output in real time, especially when the JPEG decoder and/or the scaling method are applied to a mobile field. Also, the JPEG decoder and the scaling method using the JPEG decoder can achieve an efficient scaling, even without a separate circuit for scaling, thereby reducing a circuit size and the number of components.

Abstract: A system and method for image and video compression and decompression using compressive sensing is provided. A method for decompressing a compressed image, where the compressed image having a plurality of compressed image blocks, and the method is performed on a processor, includes selecting a compressed image block, entropy decoding the selected compressed image block, and recovering an image block corresponding to the decoded selected compressed image block using compressive sensing recovery.

Abstract: A dynamic data compression system for forming and transmitting data from a downhole location within a borehole penetrating the earth to a surface location includes a data source that forms raw data sets of a formation contacting the borehole, the raw data sets being formed at a fixed rate and a data rate sampler that determines a transmission rate of a transmission channel. The system also includes a compression engine configured to compress the raw data sets according to compression parameters to form compressed data sets. The compression parameters are dynamically changed based on the transmission rate.

Abstract: A video processor is described, which is useful for implementing a forward transform process, in compliance with the H.264 standard. The video processor includes an input, for receiving a block of image data. The image data is loaded into an internal register. In response to receiving a SIMD instruction, a multiplier, which incorporates the H.264 forward transform matrix in its associated hardware, processes the block of image data, and writes the resulting partially transformed pixel data back to the internal register, transposing the data during the process.

Abstract: System and method for converting source image data to tile data including (a) selecting a source image set; (b) computing a scaling value for the source image set; (c) establishing tile set geographic bounds of a tile set that is created based on the scaling value; (d) converting the tile set geographic bounds to discrete tile bounds; (e) for each source image (i) determining source image geographic bounds; (ii) if there is an intersection between the source image geographic bounds and the tile set geographic bounds, (1) extracting image data from the source image at the intersection; (2) scaling the image data based on a pre-selected scale; (3) storing the scaled image data to a tile storage mechanism; and (f) repeating steps (a) through (e) for each of the source image sets.

Abstract: A method for transcoding from an H.264 format to an MPEG-2 format is disclosed. The method generally comprises the steps of (A) decoding an input video stream in the H.264 format to generate a picture having a plurality of macroblock pairs that used an H.264 macroblock adaptive field/frame coding; (B) determining a mode indicator for each of the macroblock pairs; and (C) coding the macroblock pairs into an output video stream in the MPEG-2 format using one of (i) an MPEG-2 field mode coding and (ii) an MPEG-2 frame mode coding as determined from the mode indicators.

Abstract: An image coding method including constructing a plurality of edge models with a Forward Discrete Cosine Transform (FDCT) algorithm; creating adjustment equations each matching one of the edge models; capturing an image comprising pixels; selecting the pixels of the image to define image blocks; detecting by block-edge detection (BED) a pattern collectively exhibited by the pixels in the each of the image blocks and then comparing the detected pattern with patterns of the edge models; changing the patterns of the image blocks to the patterns of the edge models and adjusting the dominating coefficient by the adjustment factor after determining that the patterns of the image blocks approximate to the patterns of the edge models; and performing a coding process on the edge models by LLEC to generate a compressed image corresponding to the edge models. An embedded system is applicable to the image coding method.

Abstract: A scaling device for receiving and scaling a digital image signal includes a scaling module and a data quantity control logic. The scaling module scales the digital image signal and then outputs a scaled output signal according to a scaling ratio. The data quantity control logic controls output quantity of the scaled output signal according to a scaling ratio. Thus, when the data quantity outputted from the scaling module is controlled within the data quantity that may be processed by the post stage of the scaling module per unit time, the data quantities that may be processed per unit time in the post stage processing devices of the scaling module approximate a constant value such that the post stage processing speed of the scaling module may be increased.

Abstract: A method and device that uses transform matrices to down-sample a DCT image directly in the DCT domain. The transform matrices have been selected to minimize an optimization problem which is a function of the visual quality of down-sampled images obtained using the matrices and the computational complexity associated with using the transform matrices. The transform matrices comprise a row transform matrix and a column transform matrix. A down-sampled image is produced by determining an intermediary matrix as the product of the DCT image and one of either the row transform matrix or the column transform matrix and then determining the down-sampled image as the product of the intermediary matrix and the transform matrix not already used to determine the intermediary matrix.

Abstract: This invention optimizes the entropy encoding part of JPEG (Joint Photographic Experts Group) image compression by modifying the run length encoding method that performs the actual compression by removing the redundancy from transformed and quantized image data. Using the fact that the preceding processes of run length coding, in JPEG compression algorithm, produces a large number of zeros, the original run length coding uses an ordered pair (a,b), where ‘a’ is the length of consecutive zeros preceding the ASCII character ‘b’. The proposed run length encoding scheme removes an unintended redundancy, from the original run length encoding scheme, by using an ordered pair only when a zero occurs and using the same EOB (End of Block) parameter at the end of each block. The proposed encoding scheme does not alter the value of PSNR but is found to be very effective in reducing the size of JPEG compressed image data.

Abstract: A video processor is described, which is useful for implementing a Hadamard transform process, in compliance with the H.264 standard. The video processor includes an input, for receiving a block of image data. The image data is loaded into an internal register. In response to receiving a SIMD instruction, a multiplier, which incorporates the H.264 Hadamard transform matrix in its associated hardware, processes the block of image data, and writes the resulting partially transformed pixel data back to the internal register, transposing the data during the process.

Abstract: This invention is directed to a method for decoding coded video data in which decoder performance is regulated based on perceptual masking. The method includes, upon receipt of coded video data, applying the coded video data to a multi-stage decoding process; computing perceptual masking measures for the coded video data; and switching a stage of the decoding process to a lower performance level based on the computed perceptual masking measures. The method may be applied to non-reference frames and reference frames with low numbers of dependent frames. The method provides scalability among decoders to allow for various decoder and/or coded data complexity.

Abstract: Encoding data includes: determining multiple patterns for computing one-dimensional transforms over a first array of data elements. Each pattern includes multiple subsets of data elements of the first array. Each subset included in a first pattern has substantially the same number of data elements as each of the other subsets included in the first pattern. Each data element of the first array is included in a single one of the subsets included in the first pattern. At least one subset included in the first pattern consists of data elements that are not in a contiguous sequence along a single dimension. Encoding the data includes: computing, for each pattern, multiple one-dimensional transforms over data elements of respective subsets included in the pattern; selecting a set of transform coefficients from a group of multiple sets of transform coefficients; and encoding the selected set of transform coefficients to represent the first array.

Abstract: The invention provides method of embedding a watermark image in a host image. The method includes generating a matrix code symbol, wherein the matrix code symbol includes information associated with the watermark image and the host image. The method further includes embedding the watermark image and the matrix code symbol in the host image at non-overlapping positions in the host image.

Abstract: A method, system and computer software product for improving rate-distortion performance while remaining faithful to JPEG/MPEG syntax, involving joint optimization of Huffman tables, quantization step sizes and quantized coefficients of a JPEG/MPEG encoder. This involves finding the optimal coefficient indices in the form of (run, size) pairs. By employing an interative process including this search for optimal coefficient indices, joint improvement of run-length coding, Huffman coding and quantization table selection may be achieved. Additionally, the compression of quantized DC coefficients may also be improved using a trellis-structure.

Abstract: The present invention relates to an image enhancement apparatus for enhancing an input image of a sequence of input images. To provide the ability to increase the resolution of an input image and/or to temporally reduce artifacts and/or noise in an input image, the apparatus comprises a motion compensation unit, a weighted selection unit, a feature analysis unit, an image model unit configured to generate a modelled image by applying an image model on said input image and/or said weighted selection image, a spatio-temporal detail signal generation unit configured to generate a detail signal from said input image and said weighted selection image, and a combination unit configured to generate said enhanced output image from said input image, said detail signal and said modelled image.

Abstract: Encoding input data includes: generating a first block of coefficients based on a transform performed on a residual block of data for multiple pixels; generating reference information based on a reference block of data corresponding to the residual block of data; and determining losslessly decodable code values representing the first block of coefficients based on the reference information.

Abstract: A system and method for the identification and analysis of cadence pattern is disclosed. The method uses previous and current fields to generate the difference between the field values. The difference of these values along with the field relations is passed to the state machine to generate the state of the top and bottom fields. Based on the top and bottom state the cadence signature is generated and by using the Fourier analysis the principle frequency of repeated cadence pattern signature sequence is identified. Each of the cadence signatures present in the cadence pattern signature sequence is decoded to calculate the pull-down value of the cadence pattern. The pull down value then gives the actual cadence pattern.

Abstract: The invention relates to a scalable video (de)coding method for wireless transmission of high definition television signals. Scalable means that the bitstream contains successively smaller quality refinements and that the bitstream can be truncated. The video images are divided in slices, and each slice is divided in blocks of 8×8 pixels. For each block, an optimal encoding method is chosen. Depending on whether the block is found to contain natural or synthetic image content, transform coding (DCT) or graphic coding is applied. Because the different encoding modes have different properties as regards picture quality, the bitstream format has to enable the encoder to very flexibly choose which bits to send first. The bitstream format in accordance with the invention consists of a multitude of scans (31-34) through the coded data of a series of individual blocks, e.g. a slice. In each scan, the encoder decides whether it will include data for natural blocks (BS1,BS2), for synthetic blocks (BS0,BS1), or both.

Abstract: An exemplary embodiment of the invention relates to a method of using pattern vectors for image coding and decoding. The method comprises converting a block of image data into a set of transform coefficients, quantizing the transform coefficients such that a number of the coefficients become zero, constructing a single entity or bit vector indicating which coefficients are non-zero, coding the single entity or bit vector as an integer using an adaptive, semi-adaptive or non-adaptive arithmetic coder, coding the values of the coefficients in any fixed order, using an adaptive, semi-adaptive or non-adaptive arithmetic coder, or some other coder, and coding all coefficients except the zero coefficients. The system and method of decoding data relate to the corresponding hardware and process steps performed by the decoder when decoding a bitstream coded as described herein.

Abstract: An image encoding device includes: a first encoding unit for encoding image data using a fixed-quantizing parameter to calculate a generated code amount; a second encoding unit for encoding the image data using multiple different quantizing parameters for each of the quantizing parameters as the image data of an intra picture to calculate a generated code amount; a code amount control unit for determining a quantizing parameter by predicting a quantizing parameter for realizing a target generated code amount, and a generated code amount when employing this quantizing parameter based on the generated code amount calculated at the first encoding unit, and correcting this predicted generated code amount according to the generated code amount calculated at the second encoding unit so as to realize the target generated code amount; and a third encoding unit for encoding the image data using the quantizing parameter determined at the code amount control unit.

Abstract: Hierarchical data in which image data that represents an image at different resolutions is arranged according to the resolution comprises three types of data including a header, index blocks, and tile images. The header defines a plurality of areas produced by dividing the pyramidal hierarchical structure in the virtual space in which the hierarchical data is generated. A pointer pointing to one of the index blocks is set in each area. The index blocks are generated for the respective areas in the structure defined by the header. A pointer pointing to one of the tile images is defined for a position in the images in a plurality of layers belonging to each area. The images are image data actually used to render an image.

Abstract: A geometric transformation parameter computing unit computes a geometric transformation parameter which represents the geometric transformation of an image from the previous frame to the current frame, and calculates the level of reliability in that geometric transformation parameter. A super-resolution image prediction unit generates a prediction of a super-resolution image in the current frame by transforming a super-resolution image in the previous frame on the basis of the geometric transformation parameter. A super-resolution image generation unit calculates a low-resolution image in the current frame from the prediction result of the super-resolution image in the current frame by a simulation, calculates a difference between a low-resolution image, which is an input image for the current frame, and the simulation result, and calculates a weighted mean between a result of upsampling the difference and the prediction result of the super-resolution image in the current frame.

Abstract: The display driving circuit includes: an OD (OverDrive) calculation circuit operable to generate an OD driving signal for improving the response characteristic of a display device according to display image data; a drive-output circuit operable to supply an OD driving signal to the display device; and a compression circuit operable to store compressed display data in a memory. The compression circuit includes a DCT calculation module operable to execute DCT (Discrete Cosine Transform) of display image data, and an entropy coding module operable to execute variable length entropy coding of DCT conversion display data. Preferably, the display driving circuit further includes a decompression circuit operable to supply an OD calculation circuit with display data resulting from decompression of compressed display data read out the memory.

Abstract: Techniques are described to approximate computation of an inverse discrete cosine transform using fixed-point calculations. According to these techniques, matrixes of scaled coefficients are generated by multiplying coefficients in matrixes of encoded coefficients by scale factors. Next, matrixes of biased coefficients are generated by adding a midpoint bias value to a DC coefficient of the matrix of scaled coefficients. Fixed-point arithmetic is then used to apply a transform to the matrixes of biased coefficients. Values in the resulting matrixes are then right-shifted in order to derive matrixes of pixel component values. Matrixes of pixel component values are then combined to create matrixes of pixels. The matrixes of pixels generated by these techniques closely resemble matrixes of pixels decompressed using the ideal inverse discrete cosine transform (“IDCT”).

Abstract: A video transmission method is provided, which includes receiving state information from at least one mobile terminal that intends to perform a video stream service through a wireless network, determining a size of an image by selecting a specified spatial layer bit stream on the basis of the state information of the mobile terminal from a plurality of spatial layer bit streams generated at different bit rates during encoding of the bit stream, selecting a specified time and an SNR layer bit stream by increasing or decreasing time of the image and a layer position of the SNR layer bit stream on the basis of network parameters included in the state information of the mobile terminal, and transmitting the bit stream generated by extracting the specified layer bit stream of the selected layer to the mobile terminal.

Abstract: An image processing apparatus and method providing a high speed pipeline structure having a low level of complexity is described. The image processing apparatus includes a memory configured to store a plurality of data in a plurality of memory locations, where an ordinally specified data is in a corresponding ordinal memory location.

Abstract: Adjacent blocks are identified in an image. Coding parameters for the adjacent blocks are identified. Deblock filtering between the identified adjacent blocks is skipped if the coding parameters for the identified adjacent blocks are similar and not skipped if the coding parameters for the identified adjacent blocks are substantially different.