Abstract: Fast transforms that use early aborts and precision refinements are disclosed. When to perform a corrective action is detected based upon testing the incremental calculations of transform coefficients. Corrective action is then performed. The corrective action includes refining the incremental calculations to obtain additional precision and/or aborting the incremental calculations when the resulting numbers are sufficient.

Abstract: At least a system and data structure for the scaling of data is provided. An exemplary use of the disclosed embodiments involves the scaling up in size or the scaling down in size of computer images. n-dimensional transformed data representing some original n-dimensional real data is received. An m-dimensional inverse transform on the n-dimensional transformed data is performed to produce hybrid data, where 1?m<n. The hybrid data is scaled in p dimensions to produce scaled hybrid data representing a desired p-dimensional change in the n-dimensional real data where p?m. Finally, an m-dimensional forward transform is performed on the scaled hybrid data to produce n-dimensional scaled transformed data.

Abstract: Provided are a method, system, and program for decoding compressed data. Compressed data is received and decoded. An error is detected while decoding a first location in the compressed data. A reentry data set is accessed having a pointer to a second location in the compressed data following the first location and decoding information that enables decoding to start from the second location. The second location in the compressed data is accessed and the decoding information in the accessed reentry data set is used to continue decoding the compressed data from the second location.

Abstract: Fast transforms that use early aborts and precision refinements are disclosed. When to perform a corrective action is detected based upon testing the incremental calculations of transform coefficients. Corrective action is then performed. The corrective action includes refining the incremental calculations to obtain additional precision and/or aborting the incremental calculations when the resulting numbers are sufficient.

Abstract: The present invention provides methods, apparatus and articles of manufacture for performing a transform equation in which at least two sub-transform equations can be identified. According to the invention, each sub-transform is considered separately and the constants of each sub-transform are replaced with an approximation which is a function of an integer value and a second value, where the second value is common to each constant in a sub-transform. The transform equation is then performed with the integer values in place of the constants. As a result either the input to the transform equation or at least one of the result of the transform and a value to be compared the result, is modified with a value which is a function of the second values for each sub-transform. By considering each sub-transform separately the second values of each sub-transform can be different thus allowing more accurate approximations to be used with minimal degradation in performance.

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: The invention provides a method, data compression system, apparatus, and article of manufacture which reduce the error in transform equations in which constants are replaced by approximations. According to the invention transform constants are replaced with approximations which are a function of an integer and a floating point value. The transform equation is then performed with the integers in place of the constants. The floating point value may be applied either to the result of the equation or to the data to be processed by the transform equation before the equation is performed. Further the floating point value may be applied using a fixed precision version of the value or a fixed precision value into which the floating point value has been factored.

Abstract: A computer implemented method, data processing system, and computer program product for preserving temporal associations between assets located across a plurality of datastores in a network. Metadata about each asset located in the plurality of datastores is stored, wherein the metadata includes one or more time attributes of each asset. Temporal associations are created between the assets using the time attributes of each asset. The temporal associations between the assets are then stored. Responsive to receiving a request from a user to view a set of assets in the datastores, the temporal associations of the set of assets or links to associated assets may be displayed to the user.

Abstract: Provided are a method, system, and article of manufacture for converting image data in an input color space to an output color space in a transform domain. An input block of coefficients in an input color space is generated, wherein the input block includes a first type coefficient and a plurality of second type coefficients. The first type coefficient in the input block is converted to an output value in an output color space. The output value is used to determine a scaling factor for the second type coefficients. The scaling factor is applied to the second type coefficients to determine second type coefficients in the output color space. A component output block of coefficients in the output color space is formed from the output value for the first type coefficient and the determined second type coefficients in the output color space.

Abstract: Provided are a method, system, and article of manufacture for determining whether to convert image data in an input color space to an output color space in a transform domain or real domain. An input block of coefficients in an input color space is generated, wherein the input block includes a first type coefficient and a plurality of second type coefficients. The first type coefficient in the input block is converted to an output value in an output color space. A determination is made as to whether real domain processing is required. The input block is converted in a transform domain to an output block of coefficients in the transform domain in an output color space in response to determining that the output value does not require real domain processing.

Abstract: A method, system, and program for decoding cached compressed data. Compressed data is received and decoded. An error is detected while decoding a first location in the compressed data. A reentry data set is accessed having a pointer to a second location in the compressed data following the first location and decoding information that enables decoding to start from the second location. The second location in the compressed data is accessed and the decoding information in the accessed reentry data set is used to continue decoding the compressed data from the second location.

Abstract: An apparatus, system, and method are disclosed for managing transactional data for consumers, employers, merchants, and financial institutions. A profile module is included to receive a profile created from client input. The profile comprises user client information, transactional information chosen by the client to be gathered from the client's transactions, and client preferences. The client is any of a consumer, a merchant, an employer, and a financial institution. A transaction gathering module is included to receive transactional information of a transaction from a point of sale. A transaction storage module is included to store the received transactional information in a database. A comparison module is included to compare the received transactional information with a client profile and to identify information from the received transactional information matching the client profile.

Abstract: Provided are a method, system, and program for decoding compressed data. Compressed data is received and decoded. An error is detected while decoding a first location in the compressed data. A reentry data set is accessed having a pointer to a second location in the compressed data following the first location and decoding information that enables decoding to start from the second location. The second location in the compressed data is accessed and the decoding information in the accessed reentry data set is used to continue decoding the compressed data from the second location.

Abstract: This invention solves problems due to employing error degraded data in digital processing. It particularly solves multi-generation problems wherein transform data degrade during each inverse transform and forward transform cycle even without any processing due to the rounding and clipping errors. It provides methods, systems and devices for reduced-error processing of transform-coded data. After inverse transformation of transform data, high-precision numbers are manipulated. The converting to integers and clipping to an allowed range steps are executed at any stage in the manipulation to obtain integer representation of the inverse transformed data such as for displaying of the data. However, further processing including forward transforming back to the transform domain is executed on the high-precision numbers. Thus, the rounding and clipping errors are not present in the processed data.

Abstract: Provided are a method, system and program for fractionally shifting input data subject to a first transform process without first applying an inverse transformation by using a second transform process. The second transform process applies a transformed matrix to the transformed data. At least one transformed matrix is provided in non-volatile storage, wherein each transformed matrix is generated by applying the first transform process to a fractional shift matrix operator. The input data that was transformed using the first transform process is received and the at least one transformed matrix is applied to the transformed input data to generate transformed data that represents fractionally shifted transformed output data.

Abstract: A method, apparatus and article of manufacture for modifying printing based upon direct on-the-fly media characteristic parameters is disclosed. The present invention on-the-fly directly measures a media characteristic parameter and performs real-time print modification in response thereto. The measured characteristic parameters include paper texture and composition, as well as adhesion and penetration of print. The modification of print in response to these measured parameters may allow a customer to maintain observed print quality with lower-cost materials. Adjustments may include the addition of coating, hot rolling, or adjustment of toner concentration. Measured parameters may include mottle, paper texture, and bleed through.

Abstract: We present a communication system which enables two or more parties to secretly communicate through an existing digital channel which has a primary function other than this secret communication. A first party receives a series of cover data sets, hides a certain amount of auxiliary data in the cover data sets, and then relays these cover data sets containing hidden data to a second party, aware of the hidden data. This second party may then extract the hidden data and either restore it to its original state (the state it was in before the first party received it) and send it along to its original intended destination, or may just simply extract the hidden auxiliary data. There exist a plethora of techniques for hiding auxiliary data in cover data, and any of these can be used for the hiding phase of the system. For example, in a JPEG cover data set, a Huffman table may be modified in such a way as to have no impact on the observable nature of the image, and several such schemes are presented here.

Abstract: A halftone threshold matrix includes a plurality of submatrices, wherein a first group of the plurality of submatrices has a line screen frequency different from a second group of the plurality of submatrices. The halftone method and apparatus removes the restriction that at most one pel is turned on per basic cell for the next constant input level and allows the pels in some basic cells to be turned on much sooner that the corresponding positions in other basic cells. This creates a dominant low frequency line screen simultaneously with the higher frequency line screen of the other basic cells. The present invention also allows the basic cells inside the threshold matrix to have different shapes and sizes. Thus, the cells participating in the low frequency screen could be larger than the cells generating the higher frequency screen. For example, the low frequency screen's pleasing patterns can distract the eye from noticing less pleasing patterns in the high frequency grid and vice versa.

Abstract: A system and method for generating bounded-loss color transformation employed in the compression and decompression of multi-spectral images is provided. The bounded-loss color space transformations provide transformations from a first color space to a second color space and back to the first color space with bounded loss or error. The bounded loss or error allows for the near lossless compression and reconstruction of multi-spectral images transformed from a first color space to a second color space and ultimately back to the first color space.

Abstract: Apparatus and methods are provided for encoding independently decodable pieces of compressed data to accommodate reordering of the pieces of compressed data before or after manipulation. Encoding can occur before or after manipulation of the source information. For example, in the context of a JPEG image, MCUs can be rotated and promptly compressed with restart markers without extra buffering to put the MCUs in the correct rotated order. Later, the order of the independently decodable pieces can be changed to accommodate proper output. Alternatively, pointers to the independently decodable pieces can be used to present the data to the decoder in the proper order. Additional reentry information within the independently decodable pieces of compressed data can allow initiation of decoding at other than the independently decodable points. Such reentry information preferably would include bit-level pointers and sufficient state information to initialize the decoder properly.