Abstract: It is decided whether a processing target block includes an edge in accordance with an edge detection result of the processing target block. In the case where the edge is included, it is then detected whether there is a flat portion. It is decided whether the processing target block includes the flat portion in accordance with a flat portion detection result. In the case where the flat portion is included, one of a first group of orthogonal transform sizes is selected. In the case where the edge is not included or the flat portion is not included, one of a second group of orthogonal transform sizes greater than the first group of orthogonal transform sizes is selected.

Abstract: A method of and a system for finding similarities between major boundaries of images using a wavelet detector is described herein. Unimportant edges of the image are disregarded by eliminating Gaussian wavelet coefficients and Haar wavelet coefficients of lower significance. Comparison between the images is made on the basis of quantized color, sign and magnitude of the Haar wavelet coefficients. The method performs the comparison between images in two steps. First, the method checks for exact matches between the Haar wavelet coefficients to determine whether the images are very similar. This is followed by binning of the coefficients into nine spatial bins in the image. A representative is assigned to each of the bins in terms of color, orientation and sign. Each bin of one image is compared with all the bins of the other image. Thus, images that are similar but not identical are still detected.

Abstract: A wavelet transform unit performs a wavelet transform on original images and a quantization unit quantizes wavelet transform coefficients. A ROI selector selects a region of interest or regions of interest in the original image, and a ROI mask generator generates ROI masks with which the wavelet transform coefficients (which are also called ROI transform coefficients) corresponding to the regions of interest are specified. By referring to the ROI masks, a lower-bit zero substitution unit substitutes low-order bits of non-ROI transform coefficients with zeros. An entropy coding unit entropy-codes the wavelet transform coefficients sequentially from high-order bit-planes, after the substitution. A coded data generator turns coded data into streams together with parameters and then outputs coded images.

Abstract: According to this method, for the formulation and recording of the retrieval data, each of the images (2) taking the form of a two-dimensional array of rows and columns of pixels, the image is divided into blocks (4) of pixels, each block (4) comprising pixels of at least two rows and two columns, retrieval data are calculated for each block (4) on the basis of at least the image data contained in the pixels of this block (4) and the retrieval data calculated is recorded in the form of at least one pixel (5) exhibiting a value dependent on the retrieval data.

Abstract: A wavelet transformation device for performing wavelet transformation at a plurality of division levels as to image signals. A horizontal filtering unit subjects the image signals to horizontal direction lowband analysis filtering and highband analysis filtering. Buffers which are independent for each of the division levels, hold frequency components, which are generated as the results of the horizontal direction analysis filtering by the horizontal filtering unit, for each of the division levels. Interleaving devices comprising at least one interleaving unit interleaving brightness components and color difference components of the image signals and interleaving highband components and lowband components of buffered filter results.

Abstract: An adaptive scan method for image/video coding in accordance with the present invention comprises acts of calculating an average power of the transformed coefficients vector and acts rearranging the powers of the transformed coefficients with descending order in the data block according to the power of transformed coefficients; Therefore, the adaptive scan method is dependent on different prediction mode witch has been coded in H.264 standard, and provides better rate-distortion performance in entropy coding to the conventional zig-zag scan.

Abstract: Provided are intelligent water ring scan apparatus and method thereof, image encoding/decoding apparatus using the water ring scanning and method thereof, and a computer-readable recording medium for recording a program that implements the methods. The apparatus or method of this research selectively improves the image quality of a particular image part that needs to be encoded with priority by transmitting the image data of the particular image part suitably for a human visual system so as to provide a visually improved image. The encoding apparatus of this research differentiates the amount of image data depending on the significance of a certain image part to process the image in various qualities suitably for the human visual system. The methods of this research can be applied to an image encoding/decoding process.

Abstract: A method of extracting information parts, and a recorded medium recording the method, for retrieving image sequence data are disclosed. According to an embodiment of the present invention, image frames included in an image sequence are converted to frames, in a quantity of n, including only the object that is separated from a background, and the corresponding shape descriptors, in a quantity of n, are extracted. The shape descriptors, in a quantity of n, are aligned according to a temporal order, to generate a shape sequence, which is frequency-converted along the time axis to obtain conversion coefficients having frequency information. Using coefficients in a low frequency area among the obtained conversion coefficients, a shape sequence descriptor is extracted. With this invention, video data expressing the motion of an object can be captured as an image sequence, and the similarity between video data can be distinguished by extracting information parts from each image sequence.

Abstract: Embodiments describe a method, apparatus and system for processing images using block based compression. In one embodiment, a method comprises determining whether two blocks are neighboring blocks, determining whether the two neighboring blocks are both subdivided, if the two blocks are neighboring blocks; performing deblocking filtering on one or more edge pixels of the two neighboring blocks, if it is determined that both of the two neighboring blocks are not subdivided.

Abstract: Pixels in a provided image for which the content has been provided in error are identified. This image content is processed to provide a version of the image wherein the error is at least partially concealed while also creating ancillary information regarding the errored pixel(s) and the spatial location to which such pixel(s) corresponds to thereby provide a record that describes which pixels in the image content were provided in error. An optional user-selectable option can permit displaying either of the aforementioned corrected version of the image wherein the error is at least partially concealed and a version of the image wherein the ancillary information is used to depict the errored pixel(s) such that provided-in-error pixels are readily distinguished from correctly-provided pixels.

Abstract: Non-rigidly coupled, overlapping, non-feedback optical systems for spatial filtering of Fourier transform optical patterns and image shape characterization comprises a first optical subsystem that includes a lens for focusing a polarized, coherent beam to a focal point, an image input device that spatially modulates phase positioned between the lens and the focal point, and a spatial filter at the Fourier transform pattern, and a second optical subsystem overlapping the first optical subsystem includes a projection lens and a detector. The second optical subsystem is optically coupled to the first optical subsystem.

Abstract: A method for compressing an initial dataset may be implemented on a data processing system. The method may include generating a group of bootstrap samples of wavelet coefficients from the initial dataset using a wavelet basis function. An average quantile of the group of bootstrap samples of wavelet coefficients may be determined. The group of wavelet coefficients may be compressed by deleting initial wavelet coefficients having magnitudes less than the coefficient cutoff value equal to the average quantile. The compressed group of wavelet coefficients and the wavelet basis function may be used to approximate the initial dataset.

Abstract: A method, system and computer program product that involves receiving and initializing a digital image. Quantization is preformed on the digital image using at least two multiplication operations. Finally, a compressed version of the digital image is presented for viewing and/or storage or transport.

Abstract: Data compression methods include an adaptive context sensitive compression (ACSC) method for data compression, a generalized discrete wavelength transform (GDWT) method for data compression, and a data compression method combining both the ACSC method and the GDWT method. The ACSC method improves upon the conventional CSC method with the development of a more informed adaptive estimate of the relative bandwidth, and hence the corresponding sampling rate, for each row of an image, rather than a global decimation rate for all the rows of the image. The GDWT method may be successful with N is an arbitrary number and may result in reduced computational complexity and reduced storage requirements, as compared to conventional DWT, when N is not a power of two.

Abstract: An image processing apparatus is disclosed which includes: an analysis filtering section configured to transform a line block into coefficient data decomposed into frequency bands by performing an analysis filtering process hierarchically, the line block including image data of as many lines as needed for generating the coefficient data of at least one line in a subband of the lowest-frequency component; an encoding section configured to encode the coefficient data generated by the analysis filtering section; and an alignment section configured to align, in increments of a predetermined data length, the encoded data obtained by encoding the coefficient data by the encoding section.

Abstract: To provide a code amount estimating device which can perform, at high speed and with high precision, estimation of code amount obtained after arithmetic coding. The code amount estimating device includes a context index calculation unit which calculates a context index of a binary symbol included in binary data, and an estimate code amount calculation unit which calculates an estimate code amount for the binary data based on symbol occurrence probability information stored in association with the calculated context index and on a held probability interval range. The estimate code amount calculation unit estimates the code amount for the binary data according to code amount information indicating an association between (i) a combination of a binary symbol string including one or more binary symbols, symbol occurrence probability information, and a probability interval range and (ii) an estimate code amount for the binary symbol string.

Abstract: Coding quantized transform coefficients as occur in image compression combines a position identifying method to identify the relative position of clusters of consecutive non-zero-valued coefficients, an amplitude event identifying method to identify amplitude events in the clusters of non-zero-valued coefficients, and a coding method to code the position events, amplitude events, and signs of the amplitudes in the clusters. The method is particularly applicable to a series of quantized transform coefficients where clusters are likely-to-occur.

Abstract: There is provided a decoding apparatus that decodes data encoded by transform coding in units of predefined image areas, including a coefficient setting unit that sets modification coefficients for each of the image areas; and a dequantized value generating unit that generates a dequantized value corresponding to a first quantized index value of a target area which is an image area to be modified, based on the first quantized index value of the target area, a second quantized index value of other image area in predetermined relative position to the target area, and the modification coefficients set by the coefficient setting unit.

Abstract: A Hadamard transform-based image compression method includes performing a Hadamard transform on 2k pixel values according to a product of a 2k×2k stage Hadamard matrix and a 2k×2k adjustment matrix to generate 2k conversion values, where k is a positive integer and at least one of the 2k conversion values is zero. The adjustment matrix satisfies a condition that: when the 2k pixel values are divided into G pixel groups each comprising 2k/G adjacent pixels values and the adjustment matrix is multiplied with a first 2k×1 matrix formed by the 2k pixel values to transform the first 2k×1 matrix to a second 2k×1 matrix, each pixel value of the first matrix is transformed to an average of a pixel group comprising the pixel value to form the second 2k×1 matrix.

Abstract: A method and apparatus is disclosed herein for decoding data (e.g., video data) using transforms. In one embodiment, the decoding process comprises scaling a block of coefficients using a scaling factor determined for each coefficient by computing an index for said each coefficient and indexing a look-up table (LUT) using the index. The index is based on a quantization parameter, a size of the block of coefficients, and a position of said each coefficient within the block. The method also comprises applying a transform to the block of scaled coefficients.

Abstract: A method for constructing an image includes acquiring image data in a first domain. The acquired image data is transformed from the first domain into a second domain in which the acquired image data exhibits a high degree of sparsity. An initial set of transform coefficients is approximated for transforming the image data from the second domain into a third domain in which the image may be displayed. The approximated initial set of transform coefficients is updated based on a weighing of where substantial transform coefficients are likely to be located relative to the initial set of transform coefficients. An image is constructed in the third domain based on the updated set of transform coefficients. The constructed image is displayed.

Abstract: There is provided a method for compressing images and an image format. The method comprises performing a transform on pixel portions of image data and evaluating resulting coefficients from each transform in terms of a flatness condition. If the transform is found to be flat then the result from the transform is quantized according to a first quantizing scheme. If the transform is found not to be flat then the result from the transform is quantized according to a second quantizing scheme being different from the first quantizing scheme. Different block arranging schemes are proposed for the quantizing schemes. An indicator is stored in the block indicating that the image block is flat or not flat. The resulting bits are written into a compression data structure.

Abstract: A data compressor for compressing a data signal and a corresponding data decompressor are disclosed. The data compressor comprises: compression circuitry for compressing said data signal using a plurality of variable length compression codes; a digital code select signal generator for generating a digital code select signal from an indicator signal indicative of a preferred compression distribution, a frequency of said digital code select signal being higher than a frequency of said indicator signal and an average value of said digital code select signal corresponding to an average value of said indicator signal; said compression circuitry being responsive to said digital code select signal to select between one of said plurality of compression codes in dependence upon a current value of said digital code select signal and to compress said data signal using said selected compression code.

Abstract: An image encoding method includes generating a first frequency coefficient matrix by transforming a predetermined block to a frequency domain; determining whether the first frequency coefficient matrix includes coefficients whose absolute values are greater than a predetermined value; generating a second frequency coefficient matrix by selectively partially switching at least one of rows and columns of the first frequency coefficient matrix according to an angle parameter based on a determination result; and selectively encoding the second frequency coefficient matrix based on the determination result.

Abstract: Systems and methods for communication systems with compressive sensing are disclosed. In one embodiment, a method of signal processing includes receiving a data packet at a processor. The data packet includes compressively measured data in wavelet transform coefficients of a signal. The signal is reconstructed using a clustering property of the wavelet transform coefficients.

Abstract: A coding apparatus includes: a wavelet transform section which transforms image data into coefficient data for every sub-band; a code blocking section which divides a region of the sub-band of the coefficient data generated by the wavelet transform section into code blocks; a state transition section which transits a state of the coefficient data which is a process target according to the value and state of surrounding binary coefficient data adjacent to the coefficient data which is the process target; a selection section which selects a coding pass according to the state of the coefficient data transited by the state transition section; and a coding section which codes the coefficient data for every code block generated by the code blocking section according to the coding pass selected by the selection section.

Abstract: To always maintain good image quality no matter whether the target bit rate for encoding is high or low. An encoder 210 includes: a converting section 103 for converting picture data representing a moving picture into a coefficient including a plurality of frequency components on a predetermined unit basis; a determining section 212 for determining a matrix to define a frequency bit allocation characteristic based on the resolution of the moving picture and a target bit rate for encoding that has been specified in advance; a quantization section 204 for quantizing each coefficient based on the matrix determined, thereby generating a quantized value; and an encoding section 105 for encoding the quantized value to generate encoded data of the moving picture.

Abstract: A variable block transform system, medium, and a system, medium, and method for video encoding/decoding using the variable block transform. The system includes a transform block size determination unit that determines the transform block size for components of an input video based on a format, defining the components, of the input video or characteristics of the components, and a transform coding unit that performs transform coding on each of the color components of the input video according to the determined transform block sizes and outputs transform coefficients.

Abstract: A display device includes a wavelet transform unit for transforming an original image into wavelet coefficients using a Harr wavelet transform formula, a level obtaining unit for obtaining a mipmap level of a mipmap image. The display device also includes an inverse wavelet transform unit for receiving and subjecting at least a portion of the wavelet coefficients obtained by the transformation by the wavelet transform unit, to an inverse transform using an inverse Harr wavelet transform formula until an order having a value equal to the mipmap level is obtained, and outputting an image represented by at least a portion of a low-frequency component of wavelet coefficients having the order having the value equal to the mipmap level. Additionally, the display device includes a polygon drawing unit for drawing the image output by the inverse wavelet transform unit, as a mipmap image, on the polygon image.

Abstract: The scaling down of data is provided. At least two blocks of transformed data samples representing at least two blocks of original data samples are received. One of at least two tables of constants is selected wherein each table of constants is capable of reducing the number of transformed data samples by a different factor. The constants taken from the selected table are applied to the at least two blocks of transformed data samples to produce one block of transformed data samples representing one block of final data samples. The data is processed one dimension at a time by multiplying the data in one dimension with selected constants taken from previously developed tables corresponding to the desired scale down factor. Scaling down by different factors in each dimension as well as scaling down in one dimension and scaling up in the other dimension may be achieved.

Abstract: A data transformation device including a pre-processing unit, a calculating unit and a post-processing unit is disclosed. The pre-processing unit performs a first pre-process with received image data to generate pre-processed image data, and performs a second pre-process with received result data to generate pre-processed result data. The calculating unit generates first calculated data and second calculated data according to the pre-processed image data and the pre-processed result data, by both a first calculating component and a second calculating component respectively. The post-processing unit performs a first post-process to generate the result data according to the first calculating data, and performs a second post-process to generate the image data according to the second calculating data.

Abstract: Embodiments of the present invention are directed to efficient encoding of digital data using combinations of encoding techniques. In certain embodiments of the present invention, images or other data are encoded using both source coding and channel coding. Memoryless-closet-based encoding is used to generate symbol planes, the least significant of which is block-by-block entropy coded, and the remaining of which are channel coded, in their entirety, for each of a number of block classes. A prefix code is used to entropy code least-significant symbol-plane blocks. Coding parameters are obtained by optimization, using statistics collected for each block class, and coded for inclusion in the output bitstream of the encoding methods.

Abstract: The disclosure relates to receiving original image data decomposing the original image data into a plurality of layers, compressing a dynamic range of each of the plurality of layers, and integrating the plurality of compressed layers to form a final image.

Abstract: A system and method for processing an image is provided. The system includes an encoder configured to subdivide the image into N subregions. The value of N is computed based upon a spatial resolution of the image, a granularity value and a level of wavelet decomposition. The encoder is configured to perform wavelet decomposition on each of the N subregions. The system includes memory circuitry configured to store image data resulting from the decomposition for later transmission.

Abstract: This invention provides an image generating apparatus including a composite image generating unit that generates a composite image in which an image of an object to be printed onto a medium is combined with an image for coordinate address information for locating a position on the medium and an image for address identification information for identifying the coordinate address information.

Abstract: Embodiments of the invention provide methods to calculate compression noise statistics of decompressed images in transform coding. They can be used in compressed image quality assessment, compression algorithm optimization, compression noise reduction, and other quantization and compression related applications.

Abstract: A system and method for effectively performing an adaptive encoding procedure includes a texture analyzer that initially determines texture characteristics for blocks of input image data. An image transformer converts the blocks of image data into sets of coefficients that represent the various blocks. A block categorizer utilizes the texture characteristics to associate texture categories with the sets of coefficients from the various blocks. Deadzone tables are provided for storing deadzone values that define deadzone regions for performing appropriate quantization procedures. A quantizer may then access the deadzone values from the deadzone tables to adaptively convert the coefficients into quantized coefficients according to their corresponding texture characteristics.

Abstract: An image coding apparatus includes: a transformation unit that transforms spatial domain image data having plural pixels, by a pixel block including plural pixels as a unit, into plural coefficient groups each including plural frequency domain coefficients; a grouping unit that classifies the plural coefficient groups into plural groups for classification of values in these coefficient groups; a quantization coefficient calculation unit that calculates a quantization coefficient used for quantizing plural coefficients included in the respective plural coefficient groups based on the number of coefficient groups classified in the plural groups and the values of the coefficient groups classified in the plural groups; a quantization unit that quantizes the respective plural coefficients included in the respective plural coefficient groups obtained by the transformation by using the calculated quantization coefficient; and a coding unit that encodes the plural coefficients included in the plural quantized coeffic

Abstract: Embodiments of the present invention provide a coding system that codes data according to a pair of coding chains. A first coding chain generates coded video data that can be decoded by itself to represent a source video sequence of a small size, such as a size sufficient to support the real time playback and display features of a video editing application. The second coding chain generates coded video data representing supplementary data, which when decoded in conjunction with the coded video data of the first coding chain, yields the source video sequence for full-size display. The output of the first coding chain may be stored in memory in a file structure that can be accessed independently of the second chain's output and, therefore, it facilitates real time decoding and playback.

Abstract: For the reduction of the rounding error, a first and a second non-integer input value are provided and combined, for example by addition, in non-integer state to obtain a non-integer result value which is rounded and added to a third input value. Thus, the rounding error may be reduced at an interface between two rotations divided into lifting steps or between a first rotation divided into lifting steps and a first lifting step of a subsequent multi-dimensional lifting sequence.

Abstract: A video encoding method and apparatus is shown wherein image information is represented as a plurality of pixels, the pixels are organized into blocks, pixels transposition is performed on image information at the boundaries of the blocks, the blocks are transform coded and quantized. Pixel transposition involves transposition of alternate pixels at the boundaries of blocks with pixels of neighboring blocks found in a pre-determined direction. The pre-determined direction may be fixed by a system or may be applied on an image by image basis. In the event that the pre-determined direction is not established by a system, a pixel transposition circuit includes a transposition keyword in the output bit stream which is used by a decoded to determine the direction of pixel transposition.

Abstract: A system and method for assisting a visually impaired individual are disclosed. In one embodiment, when the visually impaired individual encounters a situation with an obstacle, the visually impaired individual employs a first wireless device to transfer audiovisual information about the situation to an assistant with a second wireless device. The assistant analyzes the rendered audiovisual information and provides audio information to the visually impaired individual which presents a solution to the obstacle.

Abstract: A color transformation method which accounts for colorant interactions includes establishing a plurality of tone reproduction curves (TRCs), for one or more of the color separations forming a digital image. Each TRC accounts for colorant interactions between a primary colorant with which the first color separation is to be rendered and at least one secondary colorant with which at least a second of the plurality of color separations is to be rendered. The TRCs include input values and their corresponding modified input values. In a given TRC, the input values of the second and optionally other color separations are fixed. For a pixel of the digital image having a given input values for the first and second color separation one or more of the TRCs are selected which bound the fixed input value for the second color separation and a modified input value is determined therefrom.

Abstract: A quantization matrix used in inverse quantization is generated. A received bitstream includes a coded truncated quantization matrix. The coded truncated quantization matrix has first coded bits and second coded bits. The first coded bits include bits obtained by coding a transmitting part of quantization elements and the second coded bits includes bits obtained by coding an end code. The coded truncated quantization matrix is decoded until the second coded bits corresponding to the end code are read out, to obtain the transmitting part of quantization elements. At least one additional quantization element is obtained. A complete quantization matrix is generated, using the transmitting part of quantization elements and at least one additional quantization element, by ordering the transmitting part of quantization elements and at least one additional quantization element in a zig-zag scan.

Abstract: A color image encoding and/or decoding system, medium, and method using inter-color-component prediction in a frequency domain. To encode an original image, including at least two or more image components, frequency domain transform may be performed with of each component of a color image, color component transform of the frequency domain transform coefficients, in frequency domain, may be performed based on the relationship between transform coefficients of the color image components in order to remove redundant information between color components, performing, and entropy encoding the removed redundant information data. According to the method, medium, and system, a color image or video data can be directly compressed effectively without a conventional color transform process. Furthermore, by using the relationship between image components, redundant information between color components varying with respect to the encoding mode may be removed so that the encoding efficiency can be enhanced.

Abstract: The invention is related to a method for compressing images. The proposed method comprises associating perceptual importance parameters with pixels of the image, applying a transform on the image, partitioning the transformed image into code blocks and encoding coefficient bits of a given code block together from a most significant bit plane towards a least significant bit plane, wherein encoding of at least one coefficient is truncated at a truncation bit plane depending on the perceptual importance parameter associated with the pixel to which said code block coefficient corresponds. Truncating encoding of coefficients in dependency on the perceptual importance of the pixel associated with the coefficient allows for truncating coefficients corresponding to perceptually less important pixels at more significant bit planes. So, the overall perceptual quality of the compressed image is enhanced.

Abstract: A system, medium, and method encoding and/or decoding image data. The image data encoding may include a transformer transforming pixel values of an image in the time domain to pixel values in the frequency domain, a quantization coefficient determiner determining a quantization coefficient corresponding to the number of bits per pixel of the image by adjusting a quantization variable defined by a user, a quantization unit quantizing the pixel values transformed by the transformer based on the quantization coefficient determined by the quantization coefficient determiner, and an entropy encoder generating a bitstream of the quantized pixel values.

Abstract: A method of and a system for finding similarities between major boundaries of images using a wavelet detector is described herein. Unimportant edges of the image are disregarded by eliminating Gaussian wavelet coefficients and Haar wavelet coefficients of lower significance. Comparison between the images is made on the basis of quantized color, sign and magnitude of the Haar wavelet coefficients. The method performs the comparison between images in two steps. First, the method checks for exact matches between the Haar wavelet coefficients to determine whether the images are very similar. This is followed by binning of the coefficients into nine spatial bins in the image. A representative is assigned to each of the bins in terms of color, orientation and sign. Each bin of one image is compared with all the bins of the other image. Thus, images that are similar but not identical are still detected.

Abstract: The present invention relates to a method for transforming a feature vector comprising a first and a second feature represented by a first and a second feature value, respectively, into a feature code using an encoder, said feature code usable in an algorithm and having a predetermined number of bits, said method comprising the steps of determining for each of the first and the second features the performance as a function of the length of the feature code, and using the dependency between the performance and the feature code length for each of the individual features derived in the step of determining to find feature code lengths for the first and the second features in such a way that the sum of the bit length of the first and the second feature codes has a length equaling said predetermined bit length.

Abstract: A method and apparatus is disclosed herein for decoding data (e.g., video data) using transforms. In one embodiment, the decoding process comprises scaling a block of coefficients using a scaling factor determined for each coefficient by computing an index for said each coefficient and indexing a look-up table (LUT) using the index. The index is based on a quantization parameter, a size of the block of coefficients, and a position of said each coefficient within the block. The method also comprises applying a transform to the block of scaled coefficients.