Abstract: A method of rendering an image using a number of threads, by receiving edge data for the image comprising edges identified by indices, each edge having edge scan line crossing coordinates, arranging the coordinates into partitions indexed by the indices to form a data structure that is randomly accessible by a coordinate of a portion of the image; each partition comprising a list of edge scan line crossing coordinates associated with an edge that is identified by the edge index indexing the partition, and rendering the portions of the image concurrently, using corresponding threads by identifying, by randomly accessing a partition in the indexing data structure using a coordinate of said portion in the image, at least one edge in the indexing data structure associated with said portion of the image.

Abstract: A method of rendering an image using a number of threads, by receiving edge data for the image comprising edges identified by indices, each edge having edge scan line crossing coordinates, arranging the coordinates into partitions indexed by the indices to form a data structure that is randomly accessible by a coordinate of a portion of the image; each partition comprising a list of edge scan line crossing coordinates associated with an edge that is identified by the edge index indexing the partition, and rendering the portions of the image concurrently, using corresponding threads by identifying, by randomly accessing a partition in the indexing data structure using a coordinate of said portion in the image, at least one edge in the indexing data structure associated with said portion of the image

Abstract: A method (400) and system (200) for classifying a audio signal are described. The method (400) operates by first receiving a sequence of audio frame feature data, each of the frame feature data characterising an audio frame along the audio segment. In response to receipt of each of the audio frame feature data, statistical data characterising the audio segment is updated with the received frame feature data. The received frame feature data is then discarded. A preliminary classification for the audio segment may be determined from the statistical data. Upon receipt of a notification of an end boundary of the audio segment, the audio segment is classified (410) based on the statistical data.

Abstract: A method of determining a quality value for an image frame is disclosed. The method comprises dividing (in a step 202) the frame into a plurality of tiles (906) and determining attributes (in a step 206) of each said tile based upon pixel values of the tile, and pixel values of a corresponding tile of a preceding frame. The method then establishes (in steps 210, 212) the quality value of the frame by testing the tile attributes of the frame against pre-determined criteria. The method then defines (in a step 220) the quality value of the frame depending upon results of the testing.

Abstract: A method (400) and system (200) for classifying a audio signal are described. The method (400) operates by first receiving a sequence of audio frame feature data, each of the frame feature data characterising an audio frame along the audio segment. In response to receipt of each of the audio frame feature data, statistical data characterising the audio segment is updated with the received frame feature data. The received frame feature data is then discarded. A preliminary classification for the audio segment may be determined from the statistical data. Upon receipt of a notification of an end boundary of the audio segment, the audio segment is classified (410) based on the statistical data.

Abstract: A method of creating an image is disclosed. The image is formed by rendering and compositing at least a plurality of graphical objects whereby each of the objects has a predetermined outline. The method comprises the following steps. Firstly, dividing a space in which the outlines are defined into a plurality of regions whereby each of the regions is defined by at least one region outline. The region outline substantially follows at least one of the predetermined outlines or parts thereof and is substantially formed by segments of a virtual grid encompassing the space. Secondly, manipulating the regions to determine a plurality of further regions whereby each of the further regions has a corresponding compositing expression. Fourthly, classifying the further regions according to at least one attribute of the graphical objects within the further regions.

Abstract: A method of determining a quality value for an image frame is disclosed. The method comprises dividing (in a step 202) the frame into a plurality of tiles (906) and determining attributes (in a step 206) of each said tile based upon pixel values of the tile, and pixel values of a corresponding tile of a preceding frame. The method then establishes (in steps 210, 212) the quality value of the frame by testing the tile attributes of the frame against pre-determined criteria. The method then defines (in a step 220) the quality value of the frame depending upon results of the testing.

Abstract: A method of compositing two input image components (101, 102) to form at least one output image component (103, 104, 105) is disclosed. Each of the image components (101-105) is formed of run-based data and categorised by one of a plurality of data types and at least one of the input data types is a non-flat colour or non-flat opacity blend of at least linear degree. An output data type is determined from the input data types and a predetermined compositing operation to be applied to the input image components (101, 102). An output run (103, 104, 105) of the output data type is produced at an area of intersection of the two input runs (101, 102).

Abstract: Determining a displayable color in a self-overlapping region of a variable color object by determining for each point in the region, the color of each portion of the object present at that point. At each point averaging the colors present at that point and outputting the averaged colors for reproduction within the region.

Abstract: A method of automatically positioning one or more images within a region. The method comprises of computing (101) a field at each image due to every other image, wherein the field at any image due to any other image is a function of the distance between any image and any other image and the surface area of that any other image. The method then computates (102) a net force exerted on each image by every other image, wherein the net force acting on any one image is a function of the field acting on the said any one image and a characteristic of the said any one image. The method then moves (104) each image a distance, which is a function of the net force acting on the image, in the direction of the net force.

Abstract: A method (800) of rendering a graphical object comprising a region of shaded color and/or opacity is disclosed. The method (800) specifies the shaded region in terms of a triangle mesh (e.g. 100) and identifies regions of the object where triangles overlap. In areas of the graphical object where overlap exists, the method (800) provides for both order-dependent and order-independent combining of color and opacity. The method (800) does not construct or scan convert an outline shape in order to determine winding counts. Instead, the method (800) works directly with the triangle mesh. The triangle mesh (100) can be derived from any source, for example, from the subdivision of Coons patches, or by direct construction without an intermediate representation of the color blend associated with the graphical object to be rendered. The method (800) can be used to render an object as conventional pixel output, or the object can be rendered in another form, for example, run-length encoded blends.

Abstract: A convolution operator is applied to an input image to produce an output image. Image pixel data corresponding to at least a predetermined number of scan lines of the input image is provided to a buffer memory adapted to store a portion of the image. The image data may be provided from a source of such data, or alternatively it may be rendered from an object graphics environment. A finite convolution mask is applied to the image pixel data to produce a scan line of the output image. The finite convolution mask has a plurality of coefficients arranged in a predetermined number of rows and a predetermined number of columns, and the predetermined number of scan lines substantially equals at least one of the number of rows or the number of columns of the convolution mask. In a preferred implementation, a scan line of the input image is discarded and a next scan line is provided for each scan line of the output image produced by the convolution.

Abstract: A method of conversion of a quadtree representation of image data into a corresponding representation of edges of regions within the image is disclosed. In one configuration the method comprises recursively processing (70) each quadrant using a number of steps. A first step examines if the quadrant is of a first particular uniform type (74), and if so, the method forms a series of lists (76) defining the boundary structure of the quadrant. A second step examines if the quadrant is of a second particular uniform type (80), and if so, the method forms a series of empty lists (82). A third step is applied where a quadrant is of an intermediate type containing data values of the first particular uniform type and the second particular uniform type, and the method divides the quadrant into a series of sub-quadrants (84,88) and recursively (86) applies the first, second and third steps to each of the sub-quadrants in accordance with the quadtree representation.

Abstract: Disclosed are method and apparatus for applying a convolution operator to an input image to produce an output image. Image pixel data corresponding to at least a predetermined number of scan lines of the input image is provided to a buffer memory adapted to store a portion of said image. The image data may be provided from a source of such data, or alternatively it may be rendered from a object grahics environment. A finite convolution mask is applied to the image pixel data to produce a scan line of the output image. The finite convolution mask has a plurality of coefficients arranged in a predetermined number of rows and a predetermined number of columns and the predetermined number of scan lines substantially equals at least one of the number of rows or the number of columns of the convolution mask. In a preferred implementation, a scan line of the input image is discarded and a next scan line is provided for each scan line of the output image produced by the convolution.

Abstract: A method and apparatus for creating a blend from one arbitrary edge (20) to a second arbitrary edge (21) in a computer graphic image creation is disclosed. A color along each of the edges (20,21) is determined. A parametric equation is then formed for a color of each pixel (23) within the area bounded by the edges (20,21), and the parametric equation is solved to derive a color for each of the pixels (23). In another aspect, after determining the color along each edge (20,21), each of the edges (20,21) is vectorised into corresponding line segments (31 to 34). Pairs of the line segments (31 to 34) are then matched to form polygons (29) having a defined color at each of vertices, A color is then determined for each pixel of the polygon (29) from the defined colors of the vertices.

Abstract: A system, method and language for compositing or creating images is disclosed. The images typically comprise a plurality of graphical elements each including color and opacity information. The system utilizes operators having the graphical elements as operands in which the operators combine the operands according to a function defined by the operators, the color information, and the opacity information, to produce new graphical elements. One part of the system includes interpreting the language by parsing and executing a sequence of statements and forming an expression tree the nodes of which comprise the graphical elements. Instructions are then derived from the tree. Another part permits the compositing of opaque graphical elements and associated clipping operations. Bounding box method are used for locating active areas of graphical elements from the nodes. Manipulation of the expression tree is used to reduce the expected execution time of the compositing commands.

Abstract: The present invention relates to a method, apparatus and system for optimizing an expression tree (101,902,1102) for compositing an image. Such an expression tree (101,902,1102) can comprise at least two nodes. Each node is either a graphical element (102,104) or image compositing operator ((103,104) and has a region of the image represented by the node (102,103,104). In the method, for at least one node in the tree, several steps are carried out. The region represented by the node (103,104) is compared to a region representation data structure, which is preferably a quadtree representation, corresponding to one or more regions represented by at least one other node. A determination is then made if the region represented by the node (102,103,104) is totally or partially obscured by the one or more regions. If the region represented by the node is at least partially or totally obscured, the expression tree (101,902,1102) is modified.

Abstract: An image signal in filtered to provide a filtered image signal representing a filtered image, and a mapping function is determined from a predetermined arbitrary function of the image signal. The filtered image signal and the image signal are interpolated in accordance with the mapping function to produce a final image signal representing a final image. The interpolation includes adjusting an opacity of each picture element of the image signal and the filtered image signal in accordance with the mapping function. In a final image, a smoothed transition is produced between the filtered image signal and the image signal. Preferably, the determination of the mapping function is also dependent upon the filtered image signal, and the mapping function is an absolute value of a difference between the image signal and the filtered image signal.

Abstract: A method of dealing with self-overlapping objects in a system for creating computerised images, which are made up of objects, by means of a scan line process is described. For each of the overlapping objects (1,2), a number of steps are performed. A first step (702) is to determine a directional border of the object (1). Another step (704) involves determining intersections of the directional border (8 to 10) with a current scan line (7). A further step is to determine, for each pixel within the scan line (7), a count of the number of preceding intersections, wherein the count is incremented for a directional border (8,9) crossing in a first direction and is decremented for a directional border crossing (10,11) in a second direction. Still, a further step (706) is to render each pixel of the object (1) a number of times equal to the count.

Abstract: The present invention relates to a method, apparatus and system for optimizing an expression tree (101,902,1102) for compositing an image. Such an expression tree (101,902, 1102) can comprise at least two nodes. Each node is either a graphical element (102,104) or image compositing operator ((103,104) and has a region of the image represented by the node (102,103,104). In the method, for at least one node in the tree, several steps are carried out. The region represented by the node (103,104) is compared to a region representation data structure, which is preferably a quadtree representation, corresponding to one or more regions represented by at least one other node. A determination is then made if the region represented by the node (102,103,104) is totally or partially obscured by the one or more regions. If the region represented by the node is at least partially or totally obscured, the expression tree (101,902,1102) is modified.