Abstract: A method includes dividing an input range of color values of a first color space into a plurality of sub-ranges, wherein at least one of the sub-ranges comprises an over-range color value. The method also includes determining for each sub-range a level of accuracy in converting color values within each sub-range. The method further includes determining a processing step to be applied to input color values in each sub-range based on the determined level of accuracy.

Abstract: A method and computer program product for generating a warping effect in an image having a plurality of regions, each associated with a distortion vector. The method includes defining a path segment vector in response to user movement of a brush cursor; modifying one or more distortion vectors having originations covered by the cursor based on the path segment vector; and repeating defining and modifying to produce a warping effect.

Abstract: Methods and apparatus implementing a technique for adding an interface to a boss object at run-time. A boss object includes one or more interfaces and each interface has a corresponding implementation class. In general, in one aspect, the technique includes: reading a first boss class having a first interface, defined in a first software component; reading a second interface, defined in a separate second software component; and binding the second interface to the first boss class, so that instantiating the first boss class creates a first boss object including the first interface and the second interface.

Abstract: Given an image with an unwanted feature, a collection of pixels (a defined region) entirely containing the unwanted feature is designated, and replacement data values for the defined region are generated, thereby healing the unwanted feature. A selected image region is healed by propagating values in a boundary region into replacement data values for the selected image region by iteratively applying a procedure or algorithm (e.g., iteratively applying one or more kernels), such that values in the boundary region are continuously put back into the iterative calculations. An example of such a function uses kernels to generate replacement data values having multiple orders of continuity at the boundary. Optionally, replacement data values for an image region to be healed are generated based on a difference between existing data values and texture data values, thereby introducing texture (e.g., pattern, noise) components to a resulting healed region in the image.

Abstract: Methods and apparatus for calculating paragraph layout. A method begins with a first node in a paragraph and calculates an optimal line break scheme for paragraph layout that ended in the node. For every subsequent node in the paragraph, the method calculates an optimal line break scheme for paragraph layout that ends respectively in every subsequent node. Each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines. The preceding penalties of all preceding lines are defined by a previously calculated optimal line break scheme.

Abstract: A computer-implemented system performs a conformal warp operation using a unique warping function to map a first area to a second area. The first area is defined by a first enclosing contour and the second area is defined by a second enclosing contour. The system defines the first enclosing contour; modifies the first enclosing contour into the second enclosing contour; generates an analytic function to conformally warp the first area into the second area; and performs the conformal warp using the analytic function.

Abstract: Methods and apparatus for calculating paragraph layout. A method begins with a first node in a paragraph and calculates an optimal line break scheme for paragraph layout that ended in the node. For every subsequent node in the paragraph, the method calculates an optimal line break scheme for paragraph layout that ends respectively in every subsequent node. Each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines. The preceding penalties of all preceding lines are defined by a previously calculated optimal line break scheme.

Abstract: A system generates a smoothed curve from a noisily drawn, multi-segmented curve by minimizing an energy function for a smoothed curve which fits between end-points of the drawn curve. The energy function has three components: a distortion component, a smoothing component and a shrink component. Numerical analysis methods are applied to evaluate the energy function and to identify the smoothed curve with the lowest energy. The transposed curve with the lowest energy value is selected as the smoothed curve.

Abstract: Methods and apparatus, including computer program products, for erasing in a digital image. A method includes identifying a plurality of tip regions on the image, establishing an erasure color, and completely erasing pixels in the tip region that have a color matching the erasure color. Pixels having partially matching colors are partially erased and color decontaminated.

Abstract: A computer-implemented method alters component colors of art work associated with a drawing stroke on an electronic document. In one aspect, the invention generates a darkness value for each component color of each original color; generates a new color to substitute for each original color, the component color values of the new color being generated according to the corresponding darkness value and a reference color; and alters the component colors of the art work based on the new color values. In a second aspect, the invention provides a computer-implemented method for altering a component color of art work by mapping the component color to a new color based on a color space associated with the component color and applying the resulting color to components of the art work.