Abstract: The invention relates to an image processing apparatus, method, and program that can more improve coding efficiency. In step S104, a bit shift changing unit (112) shift-changes depth data (D) acquired in step S103 by using a detected bit depth of image data, and adjust a bit depth of the depth data (D) to match a bit depth of the image data. In step S105, an encoding unit (113) encodes the image data and depth data (D). In step S106, a rate control unit (114) controls a rate of each encoding to be performed in step S105 based on a result of encoding of the image data and a result of encoding of the depth data performed in step S105. This curved face is set as a predictive image. The invention can be applied to, for example, an image processing apparatus.

Abstract: An apparatus, system, and method for image processing are disclosed, each of which obtains a mark from image data, detects additional information in the mark, determines whether the mark is detected in the mark to generate a determination result, and controls processing performed by an image processing apparatus with respect to the image data based on the determination result.

Abstract: A method and system for embedding and recovering a spatial fingerprint in a sequence of video frames. The sequence includes marked frames that include marked groups having markable positions. The embedding method selects a frame offset and marking period for the marked frames, and determines a marking strength for modifying each marked group. A portion of the spatial fingerprint is embedded in each marked group of a first subgroup of the marked groups, and an ordering of the portion embedded in the first subgroup is embedded in each marked group of a second subgroup of the marked groups. The recovering method analyzes a quality ratio of the DCT transform energy and the residual for each markable position in the frame to determine whether the frame is a marked frame. The recovering method recovers the spatial fingerprint when the marked groups maintain the quality ratio in a number of successive marked frames.

Abstract: A method and system generates and compares fingerprints for videos in a video library. The video fingerprints provide a compact representation of the spatial and sequential characteristics of the video that can be used to quickly and efficiently identify video content. Because the fingerprints are based on spatial and sequential characteristics rather than exact bit sequences, visual content of videos can be effectively compared even when there are small differences between the videos in compression factors, source resolutions, start and stop times, frame rates, and so on. Comparison of video fingerprints can be used, for example, to search for and remove copyright protected videos from a video library. Further, duplicate videos can be detected and discarded in order to preserve storage space.

Abstract: A test pattern containing plurality of patches recorded using small dot patterns and large dot patterns is printed. The dot sizes arranged in the patches are different between patches. Then the test patterns are read. The detection rate and average density of additional information embedded in each large dot pattern are obtained. A large dot pattern whose detection rate and average density fall within a reference range and are closest to ideal values is determined. The average density of each small dot pattern is obtained. A small dot pattern whose average density falls within a reference range and is closest to the average density of the determined large dot pattern is determined. A copy-forgery-inhibited pattern image is generated using these dot patterns and combined with a print target image.

Abstract: A robot vision system for outputting a disparity map includes a stereo camera for receiving left and right images and outputting a disparity map between the two images; an encoder for encoding either the left image or the right image into a motion compensation-based video bit-stream; and a decoder for extracting an encoding type of an image block, a motion vector, and a DCT coefficient from the video bit-stream. Further, the system includes a person detector for detecting and labeling person blocks in the image using the disparity map between the left image and the right image, the block encoding type, and the motion vector, and detecting a distance from the labeled person to the camera; and an obstacle detector for detecting a closer obstacle than the person using the block encoding type, the motion vector, and the DCT coefficient extracted from the video bit-stream, and the disparity map.

Abstract: Performing real-time compression on an image for target buffer fullness includes dividing the image into N macro-blocks, performing a discrete cosine transformation (DCT) on each of the N macro-blocks, defining a Quantization Parameter Scalar (Q) for each of the N macro-blocks of the image on the DCT being performed, initializing the Quantization Parameter Scalar (Q) for the first Macro-block to a value that correlates to a buffer fullness of a previously compressed image, and monitoring the buffer fullness by comparing the buffer fullness with the target buffer fullness. The N macro-blocks include 16×16 macro-blocks. The Q value is increased to a first new value when the buffer fullness is greater than the target buffer fullness. The Q value is decreased to a second new value when the buffer fullness is less than the target buffer fullness.

Abstract: Methods and apparatuses for compressing and decompressing digital data. The method for compressing digital data comprises a number of steps: a) generating a vector-valued dataset according to the digital data, b) transforming the vector-valued dataset into multiwavelet coefficients, and c) entropically coding the multiwavelet coefficients. The method for decompressing digital data is substantially made up of the same steps as the method for compressing digital data but functioning in a reverse manner.

Abstract: A computer implemented method for retrieving seismic data from a seismic section provided in a bitmap format. The method includes reconstructing a two dimensional matrix of seismic interpolated data in which a value at a given pixel in the matrix is proportional to local density of wiggles in the seismic section with an added value of a previously calculated pixel. The method may be implemented in either of computer hardware configured to perform said method and computer software embodied in a non-transitory, tangible, computer-readable storage medium. Also disclosed are corresponding computer program product and data processing system.

Abstract: An invention is disclosed for performing differencing of graphical data in post-transform space for a remote presentation session. Graphical data is transformed from a first representation to a second representation (e.g. with a DWT), and then a difference is taken of the post-transform data and the post-transform data of the frame that preceded the current frame. This difference is then encoded and transmitted to a client, which decodes it, and creates a representation of the graphical data using the delta, and a previously determined representation of the previous frame. By performing differencing in post-transform space, fidelity of the remote presentation session is retained while it may decrease bandwidth. This may occur because the entropy of the delta representation is usually lower than a non-delta representation while the scheme retains the identical data of the final decoded image of the non-delta version of the same compression scheme.

Abstract: The invention is related to encoding an image block of an image using a partitioned block transform. The inventors recognized that applying a texture-pattern associated invertible mapping to the pixels of a first partition, said first partition resulting from partitioning said image block according to a current texture pattern with which said texture-pattern associated invertible mapping is associated, allows for limiting the maximum number of required first 1-D transforms to not exceeding a number of columns in the image block as well as limiting the maximum number of required second 1-D transforms to not exceeding a number of rows in the image block, also. Achieving limitation of maximum required 1-D transforms enables more efficient implementation on hardware and improves encoding performance but also allows for further partitions according to texture patterns which comprise at least one of multiple strips, texture patterns with highly unsymmetrical pixel distribution and non-directional texture patterns.

Abstract: An image encoding method for encoding an image in an image encoding apparatus. The encoding process includes performing, in a quantization unit in the image encoding apparatus, quantization on a chroma component of transform coefficients using a chroma quantization parameter calculated on the basis of a luma quantization parameter weighted by an addition operation that adds a weight parameter; and encoding, in an encoding unit in the image encoding apparatus, a chroma component of quantized coefficients.

Abstract: The present invention relates to a system and method for data storage and retrieval, and more particularly, for indicating that ancillary data is stored in a header of a JPEG file and accessible to a user. The system comprises a JPEG file having an EXIF header and associated image data, and at least one other file of digital data, and a computer. The computer is programmed to scan the JPEG image file for a special indicator in the application marker section of the EXIF header. If the marker is present, the value of marker indicates what type of ancillary digital data is present in the header. For instance, if the marker contains the string EKC-JPEG, then the ancillary data is known to be another JPEG file. Other types of data can be indicated as appropriate. The presence of the ancillary data is then used for the appropriate type of presentation to the user. A reveal icon is then used in presenting the data to indicate whether the ancillary data is another JPEG file, video, audio, sound, document, etc.

Abstract: An information source encoding method for encoding a Gaussian integer signal includes the steps of: inputting a signal value sequence of a Gaussian integer signal as an encoding target; transforming signal values included in the input signal value sequence into integer pairs, each having two integers, arranged in the input order; regarding each of the integer pairs as a lattice point on two-dimensional coordinates, and obtaining integer values greater than or equal to zero by performing a two-dimensional-to-one-dimensional mapping in which the shorter the distance from each lattice point to the origin, the smaller the value assigned to the lattice point by the mapping; and encoding the integer values using codes which are used for encoding an information source that follows an exponential distribution.

Abstract: Various embodiments of a system are provided for detecting scrolling text in a mixed-mode video sequence. The system of certain embodiments includes a motion estimator that generates a plurality of motion vectors between blocks of two or more extracted frames of a mixed-mode video sequence. An extracted frame motion analyzer analyzes the motion vectors to detect substantially constant motion of at least some of the blocks between the two or more extracted frames, wherein the presence of substantially constant motion is indicative of the presence of scrolling text in the mixed-mode video sequence. A consecutive frame motion analyzer calculates differences in pixel values between blocks of two or more consecutive frames in the mixed-mode video sequence, wherein the differences in pixel values are further indicative of the presence of scrolling text in the mixed-mode video sequence.

Abstract: A variable guilloche includes at least two guilloche curves, printed in a common space and having at least one point of overlap. The at least two curves are plotted from equations having variables corresponding to a specified data string of steganographic information.

Abstract: The invention concerns a method for processing images, texture pattern blocks representative of a typical texture of the images being stored in a memory, the method comprising the following steps: transforming the pixel grey levels of a current block into a current block of frequency coefficients using a predefined transform; building up a merger block, each frequency coefficient positioned at a defined place of the merger block being equal either to the frequency coefficient positioned at the same place of the current block, or to the frequency coefficient positioned at the same place of a texture pattern block among the texture pattern blocks stored in the memory; selecting a merger block according to a predefined function (J); and replacing in the image the current block by the selected merger block. The invention also concerns an electronic device for processing the corresponding images.

Abstract: A method compresses an image partitioned into blocks of pixels, for each block the method converts the block to a 2D matrix. The matrix is decomposing into a column matrix and a row matrix, wherein a width of the column matrix is substantially smaller than a height of the column matrix and the height of the row matrix is substantially smaller than the width of the row matrix. The column matrix and the row matrix are compressed, and the compressed matrices are then combined to form a compressed image.

Abstract: An information processing apparatus includes a two-dimensional orthogonal transform coding data acquisition unit for sequentially acquiring two-dimensional orthogonal transform coding data acquired by transforming three-dimensional orthogonal transform coding data generated from a plurality of images, a two-dimensional orthogonal transform coefficient data generation unit for generating a plurality of pieces of two-dimensional orthogonal transform coefficient data using the plurality of pieces of acquired two-dimensional orthogonal transform coding data, and a three-dimensional transformation unit for encoding three-dimensional orthogonal transform coefficient data acquired by transforming the plurality of pieces of generated two-dimensional orthogonal transform coefficient data.

Abstract: In certain embodiments, overlap operators are applied during encoding and/or decoding of digital media, where the overlap operators have reduced DC gain mismatch and/or DC leakage between interior overlap operators and overlap operators at the edge and/or corner. In other embodiments, information indicating a selected tile boundary option for overlap processing can be encoded and/or decoded. The selected tile boundary option indicates one of a hard tile boundary option and a soft tile boundary option for processing with overlap operators. Overlap transform processing can then be applied based at least in part on the selected tile boundary option.

Abstract: On the first hierarchical layer, the input image adjuster selects an overlap processing area from a frequency-unconverted image. On the first hierarchical layer, the overlap processor performs overlap processing on the overlap processing area, and holds the image data of the remaining processing areas, which cannot be frequency-converted. The remaining processing area, which is a linear area, can have an image width reduced down to the displacement between the overlap processing area and the block areas. The processes on the second hierarchical layer are identical to those on the first hierarchical layer. As a result, the encoder maximizes the advantage of the high performance achieved by hardware implementation.

Abstract: An image encoding method for encoding an image in an image encoding apparatus. The encoding method includes: performing, in a quantization unit in the image encoding apparatus, quantization on a chroma component of transform coefficients using a chroma quantization parameter calculated on the basis of a luma quantization parameter weighted by an addition operation that adds a weight parameter; encoding, in an encoding unit in the image encoding apparatus, a chroma component of quantized coefficients and generating a bit stream; and transferring the bit stream and the weight parameter.

Abstract: This invention relates to an image processing apparatus and an image processing method for improving the processing capacity per unit time in encoding and decoding images. A coefficient line sorting portion 104 sorts coefficient lines into an order which is different from that of wavelet inverse transform process as well as from that of transmission and in which the coefficient lines are sorted for an encoding process of which the degree of difficulty of encoding can be estimated by a rate control portion 109 at the earliest possible time. An encoded line sorting portion 108 sorts encoded lines into an order which is different from that of wavelet inverse transform process and in which the encoded lines are transmitted with improved resistance to the instability of the available transmission rate. This invention can be applied to image processing apparatus, for example.

Abstract: An image is divided into subbands by wavelet transform using the Haar function as the base, and the lowest-frequency LL subband is entirely encoded. LH, HL, and HH subband coefficients which belong to the wavelet decomposition level of each hierarchy are encoded such that coefficients at the same spatial position are encoded based on a resolution or quantization accuracy mapping at each spatial coordinate. Additionally, an updated region detecting means detects an updated region from a plurality of sequential frames forming the two-dimensional signal, and obtains a changing period during which a signal value changes in each region. A resolution or quantization accuracy is set for each spatial coordinate based on the changing period, and a coefficient map is generated in which the resolution or quantization accuracy of the updated region differs from that of a region other than the updated region.

Abstract: An image information decoding method for decoding a bit stream in an image decoding apparatus. The decoding process includes decoding, in a decoding unit in the image decoding apparatus, the bit stream and generating a chroma component of quantized coefficients; and performing, in a dequantization unit in the image decoding apparatus, dequantization on the chroma component of quantized coefficients using a chroma quantization parameter calculated on the basis of a luma quantization parameter weighted by an addition operation.

Abstract: This invention provides a technique of easily encoding image data to generate encoded data having high image quality within a target code amount using a small memory capacity by image encoding processing of performing frequency transform and quantization of each pixel block. A frequency transform unit separates image data into low frequency band data and high frequency band data. A coefficient quantizing unit, coefficient encoder, and code amount controller operate to encode the high frequency band data within a predetermined amount. When the encoding processing of the high frequency band data has ended, the quantization parameter of the low frequency band data is set based on the generated code amount of the high frequency band data. A coefficient quantizing unit, coefficient encoder, code amount detector, and quantization parameter updating unit operate to encode the low frequency band data into codes within a low frequency band target code amount.

Abstract: A dimensionality reduction method and system for efficient color transform compression is disclosed. A multi-dimensional color transform with an n-dimensional input color space can be received. A projection operator can be derived and applied to the n-dimensional input color space to form a k-dimensional input color space. A functional approximation can be designed to the n-dimensional input color space and can be evaluated on the k-dimensional input color space to form an m-dimensional output color space. The projection operator and the approximation function can be combined to form a compressed transform by mapping the n-dimensional input color space to m-dimensional output color space. Such an approach provides a significant reduction in size of the color profile with respect to storage and speeds-up real-time computation.

Abstract: An image coding device including: an edge detecting section configured to perform edge detection using an image signal of a reference image for a coding object block; a transform block setting section configured to set transform blocks by dividing the coding object block such that a boundary between the blocks after division does not include an edge on a basis of a result of the edge detection; and a coding processing section configured to generate coded data by performing processing including an orthogonal transform of each of the transform blocks.

Abstract: Noise filtering data compression removes noise differences from successive frames in a video signal. This is accommodated by accessing successive frames corresponding to a video signal. Frequency domain representations, for example first row and first column coefficients in the quantized DCT result matrix, are used to determine whether the block in the current frame should be considered identical to the corresponding block in the previous frame. If such is the case, the block data is rendered identical such as by overwriting one for the other. This removes any noise differential between the corresponding blocks from the successive frames.

Abstract: A joint image compression system (200, 300) and method (100) compress a target image and a reference image under a selected transform to produce a compressed difference image. The joint image compression system includes a computer readable media (210) and a computer program (220) stored on the computer readable media. The computer program includes instructions that implement selecting (110) a transform from among a plurality of transforms that includes a subset determined projective (SDP) transform, where the selected transform minimizes a cumulative mapping error (CME) for corresponding feature points in each of a target image (302) and a reference image (304). The instructions further implement applying (120) the selected transform to one of the target image and the reference image; forming (130) a difference image under the selected transform and compressing (140) the difference image to produce a compressed difference image.

Abstract: A similar image search apparatus includes a storage unit, a search unit, a text feature selection unit, an image feature transformation unit and a similar image search unit. The storage unit stores images and pieces of text information associated with the respective images. The search unit retrieves candidate images. Each candidate image has a similar image feature to a image feature of a key image. The text feature selection unit select a text feature of the respective candidate images which satisfies a given selecting condition. The image feature transformation unit, base on the selected text feature, transforms the image features. The similar image search unit retrieves similar images from the candidate images based on the transformed image features. The image features of the similar images are similar to the image feature of the key image.

Abstract: Described herein are compression and processing optimizations by using data transformation techniques. In example embodiments, a byte-wise differential transformation is applied to columnar data represented as a list of length-value pairs to determine a list of delta pairs that is subsequently compressed and stored on persistent storage. A length separation transformation is applied to separate a list of length-value pairs into a length array and a corresponding data value array, where these two arrays are subsequently compressed and stored separately on persistent storage. A native number transformation is applied to a set of number values to remove the lengths stored in the number values, where the transformed set is stored on persistent storage instead of the original set of number values.

Abstract: In an image generation and rendering system, a quality stamp indicative of image fidelity is embedded in image data units resulting from image data compression/encoding. At decoding, the image quality stamp is captured and when the decoded image is rendered, a fidelity indicator is displayed along with the image.

Abstract: Systems and methods for identifying motion between a previous frame and a current frame. The system may include a fast Fourier transform calculator that generates low pass frequency domain outputs and high pass frequency domain outputs of previous frame data and current frame data. The system may further include a phase difference calculator that calculates a first phase difference between the low pass frequency domain outputs and a second phase difference between the high pass frequency domain outputs. An inverse Fourier transform calculator may be included to generate a first inverse Fourier result and a second inverse Fourier result based on the first and second phase difference respectively, and a motion vector calculator may be included for generating motion vectors based on the inverse Fourier results.

Abstract: A method and system for arbitrary resizing of a compressed image in the discrete cosine transform (DCT) domain. First and second scaling parameters P and Q are determined in accordance with the block numbers L and M and the scaling ratio L/M or M/L. A non-uniform, or uneven, sampling in the DCT domain is then applied to coefficients of successive blocks in the compressed image in accordance with the scaling parameters. In an embodiment, P blocks are sampled and transformed from a given block length to |P| according to a |P|-point IDCT, while Q blocks are sampled and transformed from a given block length to |Q| according to a |Q|-point IDCT. The non-uniformly sampled and transformed pixel domain samples are then regrouped into a predetermined block size and transformed back to generate the DCT coefficient of the compressed image. The proposed method significantly reduces the computational complexity compared with other DCT domain arbitrary ratio image resizing approach.

Abstract: An image processing apparatus includes: a rate control section that performs rate control of output data by preferentially deleting lower-level-side coded data, as necessary, from respective pieces of coded data where respective bit-planes with levels higher than a predetermined level of a bit-plane group, in which coefficient data obtained by orthogonally transforming image data is developed in a bit depth direction, are coded; and a synthesizing section that generates the output data by synthesizing the coded data, from which the lower-level-side coded data is preferentially deleted as necessary by the rate control section, and respective bit-planes with levels lower than the predetermined level of the bit-plane group.

Abstract: An image processor includes a quantization unit receiving first data before quantization and outputting second data after quantization, a prediction unit obtaining a difference value between the second data and third data being prediction data and outputting the difference value as fourth data, and an encoding unit encoding the fourth data. The quantization unit includes a first processing unit dividing the first data by a quantization coefficient, so as to obtain fifth data including a fraction as a result of division and a second processing unit rounding up or rounding off the fraction such that a value of the fourth data becomes smaller based on comparison between the third data and the fifth data, so as to obtain the second data.

Abstract: In a first input step from outside to an image processor, a signal input unit inputs to a pre-filter a first part of first luminance signals inputted from outside, which is a part to be processed by the pre-filter in the first input step, and stores a remaining second part of the first luminance signals in the memory unit. In a second input step following the first input step, the signal input unit inputs to the pre-filter the second part of the first luminance signals read from the memory unit and a first part of second luminance signals inputted from outside, which is a part to be processed by the pre-filter in the second input step, and stores a remaining second part of the second luminance signals in the memory unit.

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: An image coding method is disclosed by which plural code data sets each having a different code amount are generated from one image data set that includes a target code amount setting step for setting a different target code amount for each of the code data sets; an entropy code generation step for applying entropy coding processing to the image data set or data obtained by applying predetermined processing to the image data set so as to generate plural entropy codes; a code amount control step for specifying one of the entropy codes to be truncated so as to control a code amount for each different target code amount; and a code data generation step for truncating the one of the entropy codes specified in the code amount control step and generating the corresponding code data set.

Abstract: There are provided an image processing section for carrying out processing to detect high frequency components of an image, a calculating section for calculating feature data representing distribution of frequency of appearances of high frequency components, a compression parameter setting section for setting compression parameters based on feature data, and a RAW compression processing section for carrying out RAW compression processing for image data based on compression parameters. Together with data size of lossless compression data, such as RAW data, not becoming large, the processing to do this is carried out in a short time.

Abstract: A retargeted image substantially retains the context of an original image while emphasizing the information content of a determined region of interest within the original image. Image regions surrounding the region of interest are warped without regard to preserving their information content and/or aspect ratios, while the region of interest is modified to preserve its aspect ratio and image content. The surrounding image regions can be warped to fit the resulting warped image regions into the available display space surrounding the unwarped region of interest. The surrounding image regions can be warped using one or more fisheye warping functions, which can be Cartesian or polar fisheye warping functions, and more specifically linear or linear-polynomial Cartesian fisheye warping functions, which are applied along each direction or axis of the region of interest. The image region on each side of the region of interest can be modified using one or more steps.

Abstract: An image processing device, which includes: an original reception unit that receives an original image; a dot image generation unit that generates, on the basis of additive information to be added to the original image, a dot image in which a plurality of dots each formed by one or more pixels are arranged; a state alteration unit that, when any of the dots in the dot image is determined to be not extractable, alters a state of the non-extractable dot on the basis of a relationship between a position on the dot image generated by the dot image generation unit and a corresponding position on the original image; and a composite image generation unit that generates a composite image by superimposing, on the original image, the dot image having the state of the non-extractable dot altered by the state alteration unit.

Abstract: In an information processing apparatus, a synthesis filtering process is performed on image data which has been subjected to hierarchical executions of an analysis filtering process, each execution of the analysis filtering process having caused frequency components of the image data to be divided into high-frequency components and low-frequency components, the total hierarchical executions of the analysis filtering process having caused the image data to be divided into a plurality of frequency bands, the synthesis filtering process involving synthesizing frequency components of frequency bands in each division level by performing a lifting calculation. The execution of the synthesis filtering process is controlled for each lifting calculation such that the lifting calculations are performed in an order that allows image data to be produced part by part, each part including a plurality of lines.

Abstract: Inverse transforms used in video and image compression/decompression, such as DCT/IDCT used in MPEG-2 and MPEG-4, or the integer transforms used in H.264, are usually calculated with fast algorithms, which only take advantage of the symmetry existing in the transform matrix but ignores the peculiarities in the input data. While these kind of fast algorithms can apply to both forward and inverse transforms, they tend to be inefficient in calculating inverse transforms. In inverse transforms, most of the coefficients become zero after quantization, this invention takes advantage of this fact to further simplify the general fast algorithm and speed up the calculation.

Abstract: A method for reconstructing a high quality image from undersampled image data is provided. The image reconstruction method is applicable to a number of different imaging modalities. Specifically, the present invention provides an image reconstruction method that incorporates an appropriate prior image into the image reconstruction process. Thus, one aspect of the present invention is to provide an image reconstruction method that requires less number of data samples to reconstruct an accurate reconstruction of a desired image than previous methods, such as, compressed sensing. Another aspect of the invention is to provide an image reconstruction method that produces a time series of desired images indicative of a higher temporal resolution than is ordinarily achievable with the imaging system. For example, cardiac phase images can be produced with high temporal resolution (e.g., 20 milliseconds) using a CT imaging system with a slow gantry rotation speed.

Abstract: An image processing apparatus includes a horizontal analysis filtering unit that receives image data in units of lines and generates a low-frequency component and a high-frequency component by performing horizontal low-pass analysis filtering and horizontal high-pass analysis filtering every time the number of samples in a horizontal direction reaches a predetermined value; and a vertical analysis filtering unit that generates coefficient data of a plurality of subbands by performing vertical low-pass analysis filtering and vertical high-pass analysis filtering every time the number of lines in a vertical direction of low-frequency and high-frequency components generated by the horizontal analysis filtering unit reaches a predetermined value.

Abstract: A method for symmetric and inverse-consistent registration of a pair of digital images includes calculating a first update of a forward transformation of a first digital image to a second digital image from a previous update of the forward transformation and a gradient of a cost function of the first and second digital images, calculating a first update of a backward transformation of the second digital image to the first digital image from an inverse of the first update of the forward transformation, calculating a second update of the backward transformation from first update of the backward transformation and the gradient of a cost function of the second and first digital images, and calculating a second update of the forward transformation from an inverse of the second update of the backward transformation.

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.

Abstract: A method of image compression includes significance switching of DCT coefficients in block-based embedded DCT procedures. Bitwise digitized DCT coefficients are passed through successive significance sweeps of the whole image from the most significant down to the least significant coefficient bit planes. With each new sweep, newly significant coefficients may appear within a block, and block-masking is used to transmit the addresses of those newly significant coefficients. An off-mask may also be used. The invention further relates to a hardware or software-based image encoder.