Abstract: A receiving apparatus and method for performing carrier detection in a frequency domain for a digital wavelet multi-carrier transmission. A wavelet transform of received data is performed to output complex data and then the complex data is delayed for one sampling period. Subsequently, the delayed complex data and delayed complex data are divided. A number of the divided complex data present within each of plural quadrants on orthogonal coordinates is calculated and a maximum number of data present within one of the quadrants is selected and compared with a threshold in order to decide whether the received data is intended data.

Abstract: A method of data compression. A multiple-level wavelet transform transforms image data of an original image. Motion compensation is performed on a low-frequency band of the transformed image data. This band is then inversely transformed and used to reconstruct a portion of the original image. The remaining portions of the original image are then reconstructed from that portion. This image data then becomes the basis of the next level of the wavelet transform and is transformed back into the wavelet domain. This process is repeated until all of the levels of the wavelet transform have been used.

Abstract: A method includes generating first difference frames and compressing the first difference frames to form compressed difference frames. The compressed difference frames are decompressed to form decompressed difference frames, and the decompressed difference frames are used in the generation of the first difference frames.

Abstract: A method of preparing an image for efficient wavelet transform compression includes the steps of separating the image into foreground and background image layers, and a mask layer. A smoothing filter is applied to interpolate irrelevant pixel values in the foreground and background layers for coder efficiency. The irrelevant pixel values are interpolated as a function of relevant pixels and causal irrelevant pixels within the smoothing filter window.

Abstract: An image signal is input from an image input unit and is divided into different spatial frequency bands by applying a discrete wavelet transform thereto using a discrete wavelet transformation unit. On the basis of values of spatial frequency components, a region-of-interest extracts a region of interest by obtaining a distribution of motion vectors in the input image. A quantization unit applies quantization processing to the extracted region of interest and different quantization processing to other regions, and an encoder encodes the quantized image signal. Alternatively, motion of an image contained in the input image may be detected and the region of interest may be obtained based upon motion of this image.

Abstract: A method and apparatus is disclosed for efficiently encoding data representing a video image, thereby reducing the amount of data that must be transferred to a decoder. The method includes transforming data sets utilizing a tensor product wavelet transform which is capable of transmitting remainders from one subband to another. Collections of subbands, in macro-block form, are weighted, detected, and ranked enabling prioritization of the transformed data. A motion compensation technique is performed on the subband data producing motion vectors and prediction errors which are positionally encoded into bit stream packets for transmittal to the decoder. Subband macro-blocks and subband blocks which are equal to zero are identified as such in the bit stream packets to further reduce the amount of data that must be transferred to the decoder.

Abstract: A method of encoding an input video signal for communication over a computer network, the method comprising the steps of: i) applying a three-dimensional wavelet-based temporal and spatial decomposition to produce a plurality of spatio-temporal subbands; ii) quantizing the coefficients of the spatio-temporal subbands with a uniform scalar quantizer to produce a significance map; and iii) run-length and adaptive arithmetic coding of the signal by encoding the significance map, encoding the signs of all significant coefficients, and encoding the magnitudes of significant coefficients, in bit-plane order starting with the most significant bit-plane.

Abstract: An apparatus for image coding using tree-structured vector quantization based on a wavelet transform and a method therefor are provided. The apparatus for image coding using a tree-structured vector quantization based on wavelet transform has a wavelet transform unit, a vector construct unit, an error vector unit, a scan unit, a first quantization unit and a second quantization unit. The wavelet transform unit wavelet transforms an input image signal. The vector construct unit constructs vectors, each having a tree structure in a different direction, using the wavelet transformed result. The error vector generation unit generates a plurality of error vectors by setting one of the vectors as a basic vector and performing a calculation on each of the vectors remaining with respect to the basic vector. The scan unit scans the coefficients of each of the basic vector and error vectors in a different direction.

Abstract: The disclosed method provides a new resolution of the aperture problem, which is one of the basic problems present in motion estimation technology. The method constitutes a resolution of this problem by means of adaptive transfer to smaller blocks. The approach consists of adaptive partitioning of the picture with the use of quadratic trees. If an aperture problem is detected in the block, then the block partitions with the help of quadratic trees into smaller blocks. The partitioning continues until either the aperture problem is resolved or the smallest size block is reached. Through the use of this method, the aperture problem is successfully resolved without substantial loss in the degree of compression.

Abstract: An apparatus for and a method of coding the bit-planes of an array of numbers. The values in the array of numbers are converted to binary. The binary values are truncated to a predetermined level of accuracy. The number of bit-planes is determined based on the largest absolute value. A tree structured description of the array is generated based on a modified quad-tree coding technique. An SNR (signal to noise ratio) scalable encoding of the significance information for each bit-plane is generated by describing new branches and leaves of the tree corresponding to each bit-plane in a bottom-up-depth-first manner. An encoding of refinement information for each bit-plane is generated. A SNR scalable description of the array is generated by concatenating the encoding of the significance information and the refinement information generated for each bit-plane.

Abstract: The invention relates to an encoding method for the compression of a video sequence. Said method, using a three-dimensional wavelet transform, is based on a hierarchical subband coding process in which the subbands to be encoded are scanned in an order that preserves the initial subband structure of the 3D wavelet transform. According to the invention, a temporal (resp. spatial) scalability is obtained by performing a motion estimation at each temporal resolution level (resp. at the highest spatial resolution level), and only the part of the estimated motion vectors necessary to reconstruct any given temporal (resp. spatial) resolution level is then encoded and put in the bitstream together with the bits encoding the wavelet coefficients at this given temporal (resp. spatial) level, said insertion in the bitstream being done before encoding texture coefficients at the same temporal (resp. spatial) level.

Abstract: Images are subband transformed to create a plurality of subband images. Each subband image includes a plurality of pixels. Each pixel is represented by a plurality of bits with each bit associated to a certain quantization level. Encoding of an image requires scanning essentially all the bits of essentially all the pixels of the image. While scanning in a particular order, one can exploit dependencies within groups of bits consecutively scanned for encoding purposes. Thus, bits of groups can be encoded together. In a subband and transformed image, the scanning order or scanning curve is defined by indicating in which order the system traverses the several subbands and the several quantization levels. One method is characterized in that the set of scanned bits which will be encoded together, and which thus form a group, bits of at least two different sub-images and at least two different quantization levels are recognized.

Abstract: A digital signal is transformed in at least two different frequency bands according to at least two different resolutions. The signal is divided into first blocks all having the same predetermined first number of samples. Each of the first blocks is transformed into a plurality of second blocks, any second block under consideration having a second respective number of samples which depends on the resolution of the second block under consideration, and containing samples selected according to their frequency. Second blocks issuing from the transformation of different first blocks are grouped in order to form third blocks all having the same predetermined third number of samples which is at least equal to the largest of the second numbers.

Abstract: A wavelet domain half-pixel motion compensation process that reduces aliasing effects that down sampling causes in the wavelet transform uses an H-transform and provides motion estimation and compensation in wavelet domain without requiring an inverse wavelet transform. For encoding, a q-dimensional (e.g., q=2) H-transform is applied in a conventional manner to non-overlapping q×q matrices in a first frame. When determining motion vectors for a second frame, “half-pixel” interpolation of the wavelet data of the first frame determines generates half-pixel data corresponding to q×q space-domain matrices that are offset (e.g., 1 pixel) horizontally and/or vertically from the q×q matrices that were transformed. Motion estimation techniques can then identify object motion by comparing wavelet domain object data in one frame to actual and interpolated wavelet domain data for another frame.

Abstract: A method for motion compensation adaptive image processing, which processes an image data received from an external source, stores the processed image data and restores the stored data to the received image data, the method comprising the steps of analyzing the received image data into image data having relatively high frequency component and relatively low frequency component, compressing/coding the image data having relatively high frequency component and relatively low frequency component by allocating predetermined bits, dividing the compressed/coded image data into a value corresponding to relatively high frequency component and a value corresponding to relatively low frequency component, and decoding the values and restoring the received image data based on the decoded image data.

Abstract: The invention relates to a color video coding method using the so-called 3D-SPIHT algorithm applied to the color space constituted by the luminance plane Y and the chrominance planes U and V in the 4:2:0 format. A wavelet decomposition of the U and V planes is performed over a number of resolution levels which is the number of resolution levels of the wavelet decomposition of the luminance plane minus one. The full resolution color U or V plane may be seen as an approximation of the full resolution luminance plane, and, the size of said full resolution color U or V plane being the same as the size of the first level approximation in the multiresolution decomposition of the Y plane, the n-th resolution level of the luminance has the same size as the (n?1)-th level of the chrominance. Each pixel (i,j) of the approximation sub-band at the lowest resolution of the Y plane is associated with the pixel at the same location in the corresponding sub-band of the U and V planes.

Abstract: A video encoding system and method utilizes a three-dimensional (3-D) wavelet transform and entropy coding that utilize motion information in a way to reduce the sensitivity to motion. In one implementation, the coding process initially estimates motion trajectories of pixels in a video object from frame to frame in a video sequence to account for motion of the video object throughout the frames. After motion estimation, a 3-D wavelet transform is applied in two parts. First, a temporal 1-D wavelet transform is applied to the corresponding pixels along the motion trajectories in a time direction. The temporal wavelet transform produces decomposed frames of temporal wavelet transforms, where the spatial correlation within each frame is well preserved. Second, a spatial 2-D wavelet transform is applied to all frames containing the temporal wavelet coefficients. The wavelet transforms produce coefficients within different sub-bands. The process then codes wavelet coefficients.

Abstract: A method and system for high resolution formatting of video images and dynamically adjusting the transmission resolution of the high-resolution images is presented. The method first downscales the high-resolution images and encodes the downscaled images into base layer frames. Quality enhancement layer data is generated from the downscaled video images and the encoded data contained in corresponding base layer frames. The quality enhancement layer data is encoded into quality enhancement layer frames. The data contained in the base layer frames and corresponding quality layer frames are then upscaled and spatial scalability data is determined from the upscaled data and the original image. The spatial scalability data is then encoded into spatial scalability data. During transmission of the encoded video image, each available encoded frame is transmitted using different amounts or portions of the enhancement layers so as to occupy the available bandwidth.

Abstract: Methods and apparatus for processing n-dimensional digitized signals with a foveal processing which constructs a sparse representation by taking advantage of the geometrical regularity of the signal structures. This invention can compress, restore, match and classify signals. Foveal coefficients are computed with one-dimensional inner products along trajectories of an n-directional trajectory list. The invention includes a trajectory finder which computes an n-directional trajectory list from the input n-dimensional signal, in order to choose optimal locations to compute the foveal coefficients. From foveal coefficients, a foveal reconstruction processor recovers a signal approximation which has the same geometrical structures as the input signal along the trajectories and which is regular away from these trajectories. A foveal residue can be calculated as a difference with the input signal.

Abstract: A video coding system and method utilizes a 3-D wavelet transform that is memory efficient and reduces boundary effect across frame boundaries. The transform employs a lifting-based scheme and buffers wavelet coefficients at intermediate lifting steps towards the end of one GOP (group of pictures) until intermediate coefficients from the beginning of the next GOP are available. The wavelet transform scheme does not physically break the video sequence into GOPs, but processes the sequence without intermission. In this manner, the system simulates an infinite wavelet transformation across frame boundaries and the boundary effect is significantly reduced or essentially eliminated. Moreover, the buffering is very small and the scheme can be used to implement other decomposition structures. The wavelet transform scheme provides superb video playback quality with little or no boundary effects.

Abstract: Device and method for coding an image for compressing a digital video signal, including the steps of (1) transforming a spatial domain of the video signal into frequency domain, and dividing the frequency domain into subband regions having relatively much meaningful information on an original video signal and subband regions having no relatively much meaningful information on the original video signal, (2) classifying the divided-subband regions into a plurality of scan blocks each having a block size, and (3) scanning in a scan block unit, whereby increasing a probability of consecutive zero run statistically, to improve the compression ratio.

Abstract: An object finder program for detecting presence of a 3D object in a 2D image containing a 2D representation of the 3D object. The object finder uses the wavelet transform of the input 2D image for object detection. A pre-selected number of view-based detectors are trained on sample images prior to performing the detection on an unknown image. These detectors then operate on the given input image and compute a quantized wavelet transform for the entire input image. The object detection then proceeds with sampling of the quantized wavelet coefficients at different image window locations on the input image and efficient look-up of pre-computed log-likelihood tables to determine object presence. The object finder's coarse-to-fine object detection strategy coupled with exhaustive object search across different positions and scales results in an efficient and accurate object detection scheme. The object finder detects a 3D object over a wide range in angular variation (e.g.

Abstract: A digital imaging system is described that provides techniques for reducing the amount of processing power required by a given digital camera device and for reducing the bandwidth required for transmitting image information to a target platform. The system defers and/or distributes the processing between the digital imager (i.e., digital camera itself) and the target platform that the digital imager will ultimately be connected to. The system only performs a partial computation at the digital imager device and completes the computation somewhere else, such as at a target computing device (e.g., desktop computer) where time and size are not an issue (relative to the imager). This image processing technique employs an efficient color conversion process, using a GUV color space. After an RGB mosaic (image) is captured, the image may be “companded” or quantized by representing it with less bits (e.g., companding from 10 bits to 8 bits).

Abstract: An object of this invention is to efficiently attain noise removal. In order to achieve the object, the discrete wavelet transforms of an input image are computed to output wavelet coefficients of respective subbands (S301). Appropriate threshold values are respectively set for subbands HL, LH, and HH indicating high-frequency components (S302a, S302b, S302c). The wavelet coefficients of the subbands HL, LH, and HH then undergo threshold value processes using the set threshold values for the respective subbands (S303a, S303b, S303c). Pixels to be processed in a coefficient conversion process are determined based on the threshold value processing results of the respective subbands (S304). The wavelet coefficients of the respective subbands corresponding to the pixels to be processed determined in step S304 undergo coefficient conversion (S305), and the converted transformation coefficients undergo inverse discrete wavelet transformation, thus reconstructing and outputting a noise-removed image (S306).

Abstract: A moving image compression/decompression apparatus and method that uses, for example, a wavelet transform technique in order to improve a compression rate is disclosed. The moving image compression/decompression apparatus includes an A/D converter for converting moving image data into digital data. The digital data is divided into a plurality of level regions using a wavelet transformer. The apparatus also includes a quantizer for quantizing the data that has been transform with a predetermined weight that corresponds to each of the regions. The apparatus also includes an SZT coder for performing a lossless DPCM coding with respect to the data quantized sequentially form a high level region to a low level regionusing a similarity between the level regions based on a predetermined SZT map.

Abstract: A wavelet pyramid-based still-image and video compression apparatus uses line-vectors, context-dependent quantization thresholds, hierarchical tree-structured displacement coding, synchronous prediction, and conditional zerotree branch updates to improve intra- and inter-frame coding speed and efficiency, and to improve video stream noise resilience. The disclosed intra-frame coding methods can be used to improve the coding efficiency of wavelet-based still-image compression algorithms.

Abstract: The invention disclosed in this application uses a method of modulation named Integer Cycle Frequency Hopping (ICFH) wherein a carrier signal, comprised of a continuum of sine waves is generated on a single frequency. A data bit representing either a “1” or a “0”, depending upon the logic polarity chosen by the builder is imposed upon the carrier signal by modifying the carrier signal at precisely the zero crossing point or the zero degree angle. The method of imposing the data is to cause either a lengthening or shortening of the proceeding 360 degrees of phase angle, thus effectively either raising or lowering the frequency of the carrier signal for just the one, or a succession of cycles at hand. Upon completion of the 360-degree cycle(s), the carrier will return to the original frequency. The main carrier frequency is only modulated beginning at the zero degree phase angle and ending at the 360-degree phase angle.

Abstract: Embodiments of the present invention provide a method and system for a dynamic data correction appliance. A plurality of data points in a first domain may be sampled. The sampled data points may be transformed from the first domain to a second domain. The transformed data points may include a plurality of identified data points of interest in the second domain. Future data points may be predicted based on a forecast rule set and the plurality of data points of interest transformed to the second domain. The plurality of data points of interest transformed to the second domain may be compared with corresponding data points of interest included in the predicted future data points. An error measure based on the comparison may be calculated. It may be determined whether the error measure exceeds an error threshold. If the error measure exceeds the error threshold, a re-initialization process may be invoked.

Abstract: There is disclosed a wireless communication device capable of receiving an incoming RF data signal and generating therefrom a base layer data stream and at least one enhancement layer data stream. The wireless communication device comprises: 1) a base layer decoder, 2) at least one enhancement layer decoder, 3) a variable mode receiver for demodulating the RF incoming RF data signals in a plurality of physical modes, such as BPSK, QPSK, QAM, and the like, and at a plurality of code rates and 4) a receiver mode controller for controlling the physical modes of the variable mode receiver. The receiver mode controller causes a first demodulated output signal of the variable mode receiver to be transferred to the base layer decoder when the variable mode receiver is operating in a first physical mode and causes a second demodulated output signal of the variable mode receiver to be transferred to the at least one enhancement layer decoder when the variable mode receiver is operating in a second physical mode.

Abstract: The invention relates to an encoding method for the compression of a video sequence including successive frames organized in groups of frames. Each frame is decomposed by means of a three-dimensional (3D) wavelet transform leading to a given number of successive resolution levels. This method is based on the SPIHT algorithm that transforms the original set of picture elements (pixels) of each group of frames into transform coefficients constituting a hierarchical pyramid in which a spatio-temporal orientation tree—in which the roots are formed with the pixels of the approximation subband resulting from the 3D wavelet transform and the offspring of each of these pixels is formed with the pixels of the higher subbands corresponding to the image volume defined by these root pixels—defines the spatio-temporal relationship.

Abstract: A video coding system and method utilizes a 3-D wavelet transform that is memory efficient and reduces boundary effect across frame boundaries. The transform employs a lifting-based scheme and buffers wavelet coefficients at intermediate lifting steps towards the end of one GOP (group of pictures) until intermediate coefficients from the beginning of the next GOP are available. The wavelet transform scheme does not physically break the video sequence into GOPs, but processes the sequence without intermission. In this manner, the system simulates an infinite wavelet transformation across frame boundaries and the boundary effect is significantly reduced or essentially eliminated. Moreover, the buffering is very small and the scheme can be used to implement other decomposition structures. The wavelet transform scheme provides superb video playback quality with little or no boundary effects.

Abstract: A method for the geometric transcoding of a compressed data file containing a digital signal of dimension N coded by means of a coding method including at least one step of spectral breakdown into frequency subbands of the digital signal (S). The method includes the steps of extracting symbols associated with the coefficients of the frequency sub-bands of the digital signal and applying a geometric transformation to the symbols. The method further includes the steps of updating N indicator or indicators representing a normal or reversed order of the symbols respectively in N direction or directions of the digital signal and reconstituting the digital signal coded by reversal of the extracting step.

Abstract: A wavelet domain filtering technique is disclosed that removes or at least minimizes checkerboard-like noise artifacts that result from capturing a composite NTSC video signal. A Haar basis filter bank is used to obtain a two-level wavelet decomposition. Low-pass filtering is performed on the high-high (HH) and the high-low (HL) bands of the wavelet decomposition since the checkerboard-like noise artifact is primarily visible on the vertical and the diagonal edges of the captured composite NTSC video frame.

Abstract: An image processing apparatus and method perform an efficient wavelet transform to provide sub-bands having a unit size for being encoded in an encoding device in a post-stage. In accordance with one embodiment of the present invention, the image processing apparatus includes a transform unit for performing a two-dimensional discrete wavelet transform on an input image to generate a plurality of frequency components, and an entropy encoding unit for performing entropy encoding on each of the frequency components in M×N-sized units. In a first encoding mode, the transform unit performs the two-dimensional discrete wavelet transform on the image either a predetermined number of times or for a number of times which allows a lowest frequency component (LL) to have a size of M×N, and in a second encoding mode, the transform unit performs the two-dimensional discrete wavelet transform on the image the predetermined number of times.

Abstract: Techniques to overlap states for efficient multilevel wavelet decompositions to reduce memory and delay in discrete wavelet transform in a block-by-block fashion. The input data is segmented into blocks and each block is processed separately, either sequentially or in parallel. Results of partially completed computations in each block is saved and used to complete computations in an adjacent block.

Abstract: First digital data (4) obtained by encoding a low-resolution digital video signal at a low-resolution compression encoder (13) and second digital data (5) obtained by encoding a high-resolution digital video signal at a high-resolution compression encoder (16) are multiplexed and transmitted with information relating to programs wherein identification information for identifying both digital data (4, 5) is described, and at a receiving (22) side, the first and second digital data are identified on the basis of the identification information, and are reproduced by corresponding decoders (28, 30). Therefore, when image of different resolutions is transmitted by multiplexing, it is possible to reproduce data correctly at the receiving side, thereby increasing freedom in program composition.

Abstract: It is, therefore, an object of the present invention to provide a structure and method of processing signals, which includes transforming a signal into subbands by applying a forward discrete wavelet transform (FDWT) to the signal, partitioning the subbands into overlapping subband subsets, inverse transforming the overlapping subband subsets into signal subsets by applying at least one inverse discrete wavelet transform (IDWT) to the overlapping subband subsets, and combining the signal subsets to reproduce the signal. The IDWT is applied to all of the subband subsets in parallel.

Abstract: The invention relates to an encoding method for the compression of a video sequence divided in flames decomposed by means of a wavelet transform. Said method, based on the hierarchical subband encoding process called “set partitioning in hierarchical trees” (SPIHT), leads from the original set of picture elements of the video sequence to wavelet transform coefficients encoded with a binary format. These coefficients are organized in trees and ordered into partitioning sets respectively corresponding to levels of significance, by means of magnitude tests leading to a classification into three ordered lists called list of insignificant sets (LIS), list of insignificant pixels (LIP) and list of significant pixels (LSP). According to the invention, a specific initialization order of the LIS is proposed.

Abstract: The invention relates to a video coding method applied to a sequence of frames and based on a tridimensional (3D) wavelet decomposition with motion estimation and compensation on couples of frames. The method comprises the steps of organizing the wavelet coefficients resulting from said decomposition in a structure of macroblocks, separated by resolution flags, and blocks with a size fitting the lowest approximation sub-band of the decomposition, scanning the coefficients of each 3D macroblock in a predefined order connected to the spatial orientation and the location of each of its blocks, and encoding said scanned coefficients bitplane by bitplane. Moreover, the encoding step includes a global bitrate allocation sub-step between the macroblocks, by means of a global distortion minimization.

Abstract: A gray scale image or a color image is entered for wavelet transformation. A layout feature is determined from a coefficient of the lowest frequency band after the wavelet transformation. A shape feature is determined from a coefficient of the second lowest frequency band after wavelet transformation. Furthermore, a texture feature is determined from the average and deviation of frequency bands excepting the lowest frequency band after wavelet transformation.

Abstract: A digital data system (100) provides 1-D, 2-D and 3-D capability and multi-band channel capability. Improved filter banks are created by generating a filter bank having an analysis portion and synthesis portion and obtaining wavelet coefficients (302) for each portion. The wavelet coefficients are expressed in a format capable of canonical signed digit (CSD) representation, such as integers (302). The canonical signed digit (CSD) representation is controlled by a value, N, selected to control resolution of the CSD coding. Optimized CSD-coded wavelet coefficients are used as filters for data signals (318).

Abstract: An encoding data processing apparatus generates at least one water marked version of an original item of material formed by introducing one of a predetermined set of code words into a copy of the original material item. The apparatus has a bandwidth adaptation processor operable to adapt a bandwidth of the code word to at least part of a bandwidth of the original material item, and an encoder operable to combine the bandwidth adapted code word with a copy of the original material item.

Abstract: Methods and devices for applying motion compensation to wavelet encoded video images and for transmitting the motion compensated wavelet encoded video images. One aspect of the invention involves an encoding device and method operable for organizing wavelet encoded images into a plurality of bit-planes, inverse wavelet transforming selected ones of the bit-planes wherein an image corresponding to the inverse wavelet transformed bit-planes is representative of said video image and estimating motion between the video image and the inverse wavelet transformed images. Another aspect involves, a transmitting device and method for identifying a type of frame and initiating a first significance based transmission process when a first type of frame is determined and initiating a second significance based transmission process when a second type of frame is determined.

Abstract: There are described an image processing method, an image processing apparatus, an image processing program and an image recording apparatus characterized by reduced computation loads and capable of suppressing the mottled granular noise contained in color image signals and enhancing the sharpness of the image, without generating noises similar to color misregistration and false color contour appearing close to the edge.

Abstract: A method for transmitting a vector having at least two vector components, each of the vector components described in a frequency. Each vector is represented as a bit number with a predetermined number of bit levels. The bit numbers are encoded according to a priority of the bit levels and the encoded bit numbers are transmitted.

Abstract: A motion detection block includes a wavelet transform section which receives a current image I1 and a reference image I2 as inputs. The motion detection section detects a motion vector using size-reduced images RI1 and RI2 generated by transform in the wavelet transform section. Thus, the search range of a motion vector can be apparently extended at the same processing amount.

Abstract: A quadrature mirror filter is applied to decompose an image into at least two sub-images each having a different resolution. These decomposed sub-images pass through self-organizing map neural networks for performing a non-supervisory classification learning. In a testing stage, the recognition process is performed from sub-images having a lower resolution. If the image can not be identified in this low resolution, the possible candidates are further recognized in a higher level of resolution.

Abstract: A digital information embedding apparatus comprises a band divider, a block divider, a key generator, an information embedder and a band synthesizer. The band divider divides the digital image signal into a plurality of frequency bands to obtain wavelet coefficients. The block divider divides the frequency band in which the digital information is to be embedded into a plurality of blocks in a predetermined block size. The key generator respectively generates secondary keys having different values from a key having a predetermined value using a predetermined function. The information embedder specifies the block in the embedding object region based on each of the generated secondary keys, and respectively embeds the corresponding information composing the digital information in the wavelet coefficients in the specified block in the embedding object region. The band synthesizer reconstructs a digital image signal.

Abstract: A method of encoding an input video signal for communication over a computer network, the method comprising the steps of: i) applying a three-dimensional wavelet-based temporal and spatial decomposition to produce a plurality of spatio-temporal subbands; ii) quantizing the coefficients of the spatio-temporal subbands with a uniform scalar quantizer to produce a significance map; and iii) ran-length and adaptive arithmetic coding of the signal by encoding the significance map, encoding the signs of all significant coefficients, and encoding the magnitudes of significant coefficients, in bit-plane order starting with the most significant bit-plane.

Abstract: A 5,3 wavelet filter is disclosed.