AU2002237406A1 - Texturing method and apparatus - Google Patents

Description

Texturing Method And Apparatus

The present invention relates to the surface texturing of graphic images for display on a screen. More particularly, the present invention relates to compact methods for applying surface textures to graphic images.

A key feature of most three-dimensional computer models, for viewing in two dimensions on a screen, is the selection of suitable texture maps. Texture maps are used to provide details of various surface properties, such as colour, opacity, roughness, shading, transparency, and so on. Often, texture maps are created from photographs or scanned images. This can result in very large file sizes.

New applications of texture maps, such as in images transmitted to be viewed on mobile telephone displays, require a very small bandwidth. There is simply not enough time to send large files. The present invention seeks to provide a method and apparatus apt for use with mobile telephones.

It is a problem of image storage on discs that the images take up very large amounts of space. The texturing information forms a large part of the required storage. The present invention seeks to provide an improved method and apparatus for image storage on discs, allowing storage of more images on the same disc.

In a limited band width or capacity situation, the present invention seeks to provide a means whereby more surface texture can be transmitted in a fixed time, or over a fixed bandwidth, or stored in a fixed space.

Users of the World Wide Web are often, with good reason, impatient. A user will wait only a certain amount of time before abandoning a web page and going elsewhere. By allowing the rapid transmission of texture data, the present invention seeks to provide a means whereby web pages are more rapidly made available.

In general terms, the present invention applies to any application which relies on the general appearance of an image rather than the specifics of an image itself, and which relies on limited storage or bandwidth. The present invention is particularly useful for display of background images and spot graphical effects on web pages, generation of a wide range of paper texture effects for paint programmes, display of pleasing images on storage limited devices such as palm top computers, and efficient storage and transmission of very large high resolution textures for printing.

According to a first aspect, the present invention consists in a method of generating a surface texture in an image, comprising the steps of: employing a texture of pixels; allocating a random value for each pixel in the field; moving the pixels; dividing the texture into wrappable cells; and allocating a colour to each pixel.

The first aspect further provides that the step of allocating a random value to each pixel includes controlling the roughness of the random values.

The first aspect further provides that the step of moving the pixels includes warping the pixels.

The first aspect further provides that the step of moving the pixels includes distorting the pixels.

The first aspect, further provides that the step dividing the texture into wrappable cells includes the step of selecting the shape of the cells. The first aspect, further provides that the step dividing the texture into wrappable cells includes the step of selecting the size of the cells.

The first aspect of the invention, further, provides that the step of allocating a colour to each pixel includes taking account of the position of the pixel.

The first aspect of the invention, further, provides that the step of allocating a colour to each pixel includes taking account of the movement of the pixel.

The first aspect of the invention, further, provides that the step of allocating a colour to each pixel includes taking allocating from within a selected range of colours.

The first aspect of the invention further provides for use of a computer program to generate the surface texture.

The first aspect of the invention further provides for use of a texture data string to generate the surface texture.

According to a second aspect, the present invention consists in an apparatus, operating according to the method of the first aspect.

According to a third aspect, the present invention consists in a computer program, operating according to the first aspect,

According to a fourth aspect, the present invention consists in a memory device, bearing a copy of the computer program.

According to a fifth aspect, the present invention consists in a texture string message. According to a sixth aspect, the present invention consists in a computer device, containing a program to cause it to operate according to the first aspect.

According to a seventh aspect, the present invention consists in a computer, operative to generate the texture data string.

The invention is further explained, by way of an example, by the following description, read in conjunction with the appended drawings in which:

Figure 1 shows a schematic view of the general situation wherein the preferred embodiment of the invention is employed.

Figure 2A-Figure 2E show examples of different textures, having different styles of cell, used in the present invention.

Figure 3A and Figure 3B show the wrapping feature of the textures of Figure 1, in this instance showing tessellating cells .

Figure 4A and Figure 4B illustrate the wrapping of textures of Figure 1 using matching cells.

Figure 5 shows an object, to be covered with a surface texture, in relation to the cells of a texture.

Figure 6 shows individual pixels within a texture.

Figure 7 shows individual pixels prior to a randomising process . Figures 8A to 8D are project views illustrating the randomising process and Figure 8E is a flow chart of the randomising process.

Figures 9A to Figures 9F show various degrees of roughness which can be achieved using the present invention.

Figure 10A shows a linear interpolation method employed in a warping process.

Figure 10B shows a smooth interpolation method used in a warping process.

Figures 11A to HE show various examples of the effects that can be achieved with warping.

Figure 12 is a flow chart illustrating the manner in which warping is achieved.

Figure 13 is a flow chart showing how distortion is achieved.

Figure 14A to Figure 14F illustrate the effect of various degrees of warping.

Figure 15 shows how pixels are allocated to a cell.

Figure 16 shows how weighting functions are applied to pixel properties for use in colour selection.

Figure 17 illustrates, in general terms, how the weighting functions of Figure 16 are actually applied in the formulae thereon.

Figure 18 is a diagram illustrating the meaning of some of the pixel properties used in relation to Figure 17. Figure 19 is a diagram illustrating the meaning of the term "radial" in Figure 17.

Figure 20 is a diagram illustrating the meaning of the terms "edgewards", "angle", "cell plasma", "pixel plasma" and "pixel plasma 2", shown in Figure 17.

Figure 21 shows a diagram illustrating how the colour values derived according to the flow chart of Figure 16, are applied to select the colour of a pixel in the final texture.

Figure 22A to Figure 22L illustrate different textured effects which can be achieved using the present invention.

Figure 23 is a flow chart illustrating how the image generation source of Figure 1 provides the receiving apparatus with a copy of the texture programme should the receiving apparatus not already possess the texture programme.

Figure 24 shows the manner in which the texture information is conveyed to the apparatus which is to generate and display a texture.

Figure 25 is a flow chart showing how the apparatus, which is to display the textured image, achieves that effect.

Figure 26 is a schematic diagram showing various ways in which the texturing information and method of the present invention may be transmitted and/or stored.

Figure 27 is an example of a texture string, a sequence of binary digits, which can be sent to a receiving apparatus so that a texture can be generated therein and displayed. Attention is drawn to Figure 1 which shows one of the environments wherein the present invention can be applied. An image generation source 10, here shown as a computer, sends image date to the telephone network 12, which, in turn, sends image data to the mobile telephone network 14 and thence to a mobile telephone 16 which displays the image 18 represented by the data from the image generation source 10. It is the object of the present invention to provide the image 18 which can have a wide range of surface textures for a very small amount of image data.

Figures 2A to 2E show the starting point of the surface texture generation process. A texture 20 is provided. The texture 20, in this instance, is square. In general, this is a rectangle the same height and width as the final texture.

The texture 20 is divided into cells 22. The cells 22 form a regular pattern in the texture 20 and have the property of "wrapping". That is to say that when the top edge 24 is, figuratively speaking, wrapped around to join the bottom edge 26, the pattern of cells 22 is continuous. Equally, when the right edge 28 is wrapped around to the left edge 30 the pattern of cells 22 is again continuous.

Different kinds of cell 22 are possible. Figure 2A shows a pattern of cells called "Weave". Figure 2B shows a pattern called "Brick". Figure 2C shows a pattern called "Rectangular". Figure 2D shows a "Hexagonal" cell 22 in the texture 20. Figure 2E shows a cell 22 pattern "Rings".

Attention is drawn to 3A showing the wrapping feature in more detail. Figure 3A shows the Hexagonal cell 22 texture 20 and, immediately below, a tessellation of five textures 20 in Figure 3B showing how the Hexagonal cells 22 form a continuous pattern at every edge 24, 26, 28, 30 of the texture. In this case, the Hexagonal cells 22 form a complete tessellation.

Figures 4A and 4B show the same process as Figures 3A and 3B, this time using the "Rings" cells 22 otherwise shown in Figure 2E. In this case the Rings simply match at the edges 24, 26, 28, 30 and do not form, in the classic sense, a ' tessellation. Figures 4A and 4B show that the essence, of the "wrapping" process wrapability depends on there being a match across the edges 24, 26, 28, 30.

The surface, to be textured, is covered with a texture 20. One of the various types of texture 20 is selected. The cell 22 types , being simple, can either be generated by a mathematical algorithm or simply stored and retrieved with little use of memory. One of the cell 22 types is selected.

Figure 5 illustrates one possible way how cells 22 can cover an object. An object 32, generally represented in this example as a heptagon, is covered in an array of cells 22 of a single texture 20 to at least its edge. The cells 22 will be visible, in the completed image, only to the edge of the object 32, (cropped at the edge of the object 32) . There must, however, be a degree of overlapping so that this condition can be fulfilled. In practice, it is assumed that the texture repeats infinitely many times across the whole plane. Alternatively, the texture 20 can be "wrapped" around the object or "projected onto" the object, in a manner known in the art.

The object 32 is either a two dimensional surface, or a two dimensional projection of a three dimensional surface, being part of an image generated by, for example, but not restricted to, United Kingdom Patent Application Number 9926131.5 "Image Enhancement" filed 5 November 1999 by the same applicants. Any other object 32 generated by any other means can be the subject of the present invention. All that is required is that the object 32 has a surface capable of accepting a texture.

Figure 6 shows a texture 20. The texture 20 comprises a plurality of spaced pixels 34 (here shown more widely spaced and fewer in number than in reality) each having its own coordinates within the texture 20. As an example, shown in Figure 6 is the individual mth pixel, 34m, has its X and Y coordinates X (m) , Y (m) . The texturing process, the subject of the present invention, is effectively a mapping from the pixel coordinates X (m) Y (m) to a new positional and colour value.

In Figure 7 is a projected view of a section of the individual pixels 34, as otherwise shown in Figure 6. A set of axes 36 is shown imposed, where the X Y plane is the plane of the pixel 34, and is located on the plane surface at Z=0. Also shown is a lower bounding plane 38, located at the value Z=- 0.5 and an upper bounding plane 40, located at the value

Z=+0.5. The first action in the texturing operation is to assign a number to each of the pixels 34. The assigned number is illustrated, in a figurative way in Figure 8, as a Z value on the axes 36. Each pixel 34 is shown displaced along the Z axis by its assigned value.

Figures 8A to 8D show successive stages in the assignment of Z values to a pixel 34, and figure 8E shows a flowchart of the assignment process.

Attention is drawn to figures 8A to 8D. A value is assigned to each pixel 34 using a pseudo random methos which generates a set of values known as a plasma field. A seed number is selected, and a roughness value. The seed number is applied to a pseudo-random number generation process, which supplies pseudo-random values when required. Initially, a pseudorandom value between -0.5 and +0.5 is assigned to each corner pixel 34' in the plasma field, and an initial step value of is assigned.

Three pseudo-random values, P,Q and R, between -0.5 and +0.5 are selected such that their sum is 0.

The midpoint pixel 34'' along the top edge is selected and assigned a value which is the average of the two values of the adjacent corner pixels 34', added to the previously selected pseudo-random value P multiplied by the current step value.

The midpoint pixel 34''' along the left edge is selected and assigned a value which is the average of the two values of the adjacent corner pixels, added to the previously selected pseudo-random value Q multiplied by the current step value.

The centre pixel 34'''' is assigned a value which is the average of the four corner pixels, added to the previously selected pseudo-random value R multiplied by the current step value.

The field is then broken into four smaller squares, each half the size the step value is halved, and the process is then repeated with each smaller square starting with the selection of new pseudo-random values P',Q' and R' , until all pixels 34 in the field have been assigned a value.

The assigned roughness is used to modify the initial step, where the corner pixels 34' are given their initial pseudorandom values. If the roughness is non-zero, then this step is applies to the smaller squares at a number of subsequent stages also, that number being determined by the roughness value. Thus the user is able to select a second feature for the texture.

Attention is drawn to Figure 8E which shows a flow chart of the Z value assignment process. From and entry 11 a set up operation 13 places the seed number in the pseudo-random number generator, initialises the pseudo-random number generator and sets the roughness value. Thereafter, a corner test 15 checks to see if the corner pixels 34' have come into contact with each other. This signals the end of the process. If they have, the assignment operation exits to a return 17, if it has not, a roughness test 19 checks to see if roughness is to be applied. If it is, a roughness operation 21 assigns random values to the corner pixels 34' . Both the roughness test 19 and the roughness operation 21 pass control to an edge centre operation 23 which assigns values to the edge centre pixels 34'', 34''' thereafter a centre pixel operation 25 assigns a value to the centre pixel 34''''. A division operation 27 then divides the field into four equal regions. A repeat operation 29 repeats the process for each smaller region until the corner test 15 detects that the entire field has been covered, each pixel 34 having been assigned a Z value.

Figures 9A to Figure 9F illustrate the effects of roughness on a final image. In Figure 9A, the roughness value is set to zero and the image is substantially smooth. In Figure 9B the roughness value is set to 1 and the image becomes a little finer in detail. Figures 9C, 9D, 9E and 9F have respective roughness values of 2, 3, 4, 5, and 6. The effect on the final image is clear from the figures. Figure 9A shows a surface which might, for example, appear on a piece of satin fabric, whereas Figure 9F resembles sandpaper. Just by varying the roughness value on the same set of pixels 34 on a texture 20, with the same pseudo random number generator seed number, all these different effects can be achieved.

The next action in the texture forming operation is "warping". Warping is the large-scale deformation of the texture. It can be used to create controlled curves, zig-zags and ripples in the final image. For each axis X, Y in the texture, a warping function is defined by the user. For every X coordinate the Y warping returns an off-set to be applied to the Y coordinate. Similarly for every Y coordinate, the X warping function returns an off-set to be applied to the X coordinate.

The warping functions are defined by a list of pairs of values a, b representing points on a curve.

Figure 10A shows a linear interpolation used in warping. The points 42, selected by the texture designer, of the warping curve, are shown, as separate locations on a control icon 44.

In this example, a smooth option has not been selected. Consequently, the interpolation between the points 42 is linear. A display 46 shows the resulting warping function comprising straight line segments.

Figure 10B shows the same set of points 42 as is shown in Figure 10A, but where the smooth option 48 has been selected. The curve, on the display 46, now smoothly interpolates between the points 42, with no sharp angles or straight lines.

For preference, the smoothing function used in Figure 10B is a Hermite spline curve. This is just one of many smoothing functions which can be used in the invention. For example a

Bezier function, or a Bezier spline, can equally be used.

Those, skilled in the art, will be aware of numerous other functions which can fulfill this purpose. Figures HA to HE show examples of the effects of various warping functions. Figure HA shows the initial unwarped cell, laid out as a chequerboard for clarity of illustration of effect.

Figure HB shows linear warping in the X axis. Figure 11C shows smooth warping in the X axis. Figure HD shows smooth warping in the Y axis. Figure HE shows simultaneous smooth warping in the X axis and the Y axis.

The texture designer, is thus able to add a further effect to the texture. To warp the texture, the designer selects points 42 and a linear or smooth option to achieve the desired effect.

The next stage in texture design, if required, enables the texture designer to apply distortion. A variable amount of pseudo-random distortion can be applied to a texture. This can be used to change a regular cell pattern, such as a simple square grid, into something that looks more "organic", perhaps similar to the scales on a crocodile skin.

Figure 12 is a flow chart showing the manner in which a texture 20 is warped. Entry 50 is to a first operation 52 where the warp curve points 42 (from Figure 9 and Figure 10) are entered by the texture designer and the preferred manner of interpolation is selected. Thereafter, a second operation 54 performs the interpolation to produce the curves (as seen on the displays 46 of Figures 9 and 10) .

A third operation 56 then selects the first pixel 34 in the texture 20. Next, a fourth operation 58 finds the y warping factor. To do this, it goes to the curve generated in the second operation 54 at the X value of the pixel 34 which is being processed. The "warp(y)" value, used in a later operation, is the value of the curve at the X value of the pixel 34.

A fifth operation 60 then finds the x warping factor. To do this, reference is made to the interpolated curve generated in the second operation 54. The Y value of the pixel 34 being processed is selected, and the value of the X coordinate, on the curve, is taken. This is the x warping factor "warp(x)".

A sixth operation 62 then calculates the warped x position of the pixel 34 w(x) by adding the X coordinate of the pixel 34 to the product of the X coordinate of the pixel 34 and the y warping factor warp(y) . A seventh operation 64 then calculates the warped y position of the pixel 34 w(y) by adding the Y coordinate of the pixel 34 being processed to the product of the Y coordinate of the pixel being processed and the x warping factor warp(x). Thereafter, a first test 66 checks to see if the last pixel 34 in the texture 20 has been processed. If it has, the routine goes to an exit 68. If it has not, control goes to an eighth operation 70 which selects the next pixel 34 in the texture 20 and passes control to the fourth operation 58. In this way, each pixel 34 in the cell 22 is processed in turn until all of the pixels 34 have been processed.

Figure 13 is a flow chart of the process whereby distortion is added to a texture 20. From an entry 72, a ninth operation 74 selects the first pixel 34 in the texture 20. The coordinates of a pixel 34 that the distortion process selects are not the initial coordinates of a pixel 34, X, Y which form the starting point of the process of Figure 12, but, rather, the warped X and Y coordinates from the warping process of Figure 12, namely W(x), W(y) . If there had been no warping, the coordinates of the pixel 34 would have remained as X, Y. These would then be the values of W(x), W(y) had no warping taken place.

Thereafter a tenth operation 76 goes to the initial plasma field and reads the Z value (see Figure 8) at a pixel 34, displaced from the warped coordinate W(x), W(y), in the Y direction by one quarter of the Z value (see Figure 8) assigned to the pixel 34 being processed. This produces an X distortion factor f(x).

An eleventh operation 78 then reads the Z value of a pixel 34, displaced from the pixel 34 being processed, in the Y direction by one half of the Z value assigned to the pixel being processed (see Figure 8) .

A twelfth operation 80 then selects a width distortion factor D(w). A thirteenth operation 82 similarly, selects a height distortion factor D(h). Both the distortion factors D(w), D(h), are provided by the texture designer as another input variable to the final texture.

Thereafter a fourteenth operation 84 calculates the distorted X value d(x) by summing the warped X coordinate W(x) with the product of the X distortion factor f(x) found in the tenth operation 76, and the width distortion factor D(w), selected in the twelfth operation 80. A fifteenth operation 86 then calculates the distorted Y value d(y) by summing the warped Y coordinate W(y) of the pixel 34 being processed with the product of the Y displacement factor f(y), found in the eleventh operation 78, and the height distortion factor D(h), selected in the thirteenth operation 82. A second test 88 then checks to see if the last pixel 34 in the texture 20 has been processed. If all the pixels 34 in the texture 20 have been processed the distortion process passes to exit 90. If the last pixel 34 has not been processed, a sixteenth operation 92 selects the next pixel 34 to be processed and passes control to the tenth operation 76. In this way, all of the pixels 34 in the texture 20 are processed, one by one, until the whole texture 20 is complete.

Figures 14A to 14F show examples of different degrees of distortion, on a simple square cell 22 pattern for clarity of visible effect. Figure 14A shows the texture 20 with no warping or distortion. Figure 14B shows the grid of Figure 14A with slight distortion. Figure 14C shows the grid of

Figure 14A with a little bit more distortion than Figure 14B. Figure 14D shows the grid of Figure 14A with a fair degree of distortion. Figure 14E shows the grid of Figure 14A with a great deal of distortion. Figure 14F shows the grid of Figure 14A with the maximum distortion. The regular grid pattern of square cells 22 in the texture 20 of Figure 14A has, by the time distortion has reached the levels of Figure 14F achieved an appearance which is apparently, to the eye, chaotic rather than regular. Such a pattern as shown in Figure 14F emulates the surface of materials like marble.

Figure 15 is a flow chart of the next activity in the preparation of a texture. Having the performed the distortion activity described in Figure 13, it now becomes necessary to find out, so that further processing can take place, where all of the pixels 34 have moved to. From entry 94, a seventeenth operation 96 selects the first pixel 34 according to the distorted outputs D(x), D(y) from the operation shown in Figure 13. An eighteenth operation 98 then calculates which cell 22 the pixel 34 under scrutiny actually occupies now that it has been moved around. The cell 22 shape and size is chosen by the texture designer. The analysis is made on the distorted coordinates d(x), d(y) where the pixels 34 have been moved by any warping .and distortion which may have been applied. If no warping or distortion has been applied, of course, the pixel 34 remains in its original position X,Y. The designer of the texturing can choose various types of cell, shown in Figure 2. The cell 22 width and height are specified by the designer, and are usually constrained to provide tileability) such that a whole number of cells 22 will fit across and down the image. Using the boundaries of the selected cell 22 type and size, the pixel 34 is allocated to a specific cell 22. The position of the pixel 34 within the cell 22 is also used to determine the Xoffset 134 and Yoffset 136 values as shown in Figure 18.

A third test 100 checks to see if the last pixel 34 has been processed. If it has, the activity proceeds to exit 102. If it has not, a nineteenth operation 104 selects the next pixel 34 and returns control to the eighteenth operation 98. In this way, all the pixels 34 are processed and allocated to a cell 22.

Attention is drawn to Figure 16 showing the first stage of colouring the texture 20. From an entry 106 a twentieth operation 108 selects a first weighting function "aweigh"^' and a second weighting function "bweigh". These are sets of coefficients for multiplication with properties of a "pixel vector". These will be used, as described hereafter in relation to Figure 17, to assist in the calculation of a colour value for each pixel 34.

A twenty-first operation 110 then selects the first pixel 34 in the texture. A twenty-second operation 112 then calculates a first colour value A according to the equation:

A=0.5+sum(aweigh{i}*value{i} ) /sum(abs (aweigh{i} ) )

"Abs" is the absolute value of aweigh{i}. Nalue { i } is explained in Figure 17. The sum is taken over the pixel vector for the pixel being processed. Thereafter a twenty- third operation 114 calculates a second colour value B according to the equation shown in the box of the twenty-third operation 114.

B=0.5+sum(bweigh{i}*value{i}/sum(abs (bweigh{i} ) )

A fourth test 116 checks to see if the last pixel 34 has been processed. If it has not, a twenty-fourth operation 118 selects the next pixels 34 in the texture 20 and returns control to the twenty-second operation 112 so that all the pixel 34 can be processed in turn. If the fourth test 116 finds that the last pixel 34 has been processed, the process then goes to exit 122. In this way, each pixel 34 in the texture 20 is allocated an A value and a B value.

Attention is now drawn to Figure 17 which shows, in tabulated form, the elements in the equations shown in the twenty-second operation 112 and the twenty-fourth operation 114 of Figure 16. While only the equation in the twenty-second operation

112 is explained, it is to be understood that the equation in the twenty-third operation 114 behaves in just the same way, except that a different weighting table bweigh is used.

A first column 124 shows the elements that make up the vector {i} which is used to characterise each pixel 34 in the texture 20. A second column 126 shows the aweigh weighting function where each of the elements al-al6 corresponds to one of the 16 separate elements in the first column 124. A third column 128 shows the result of multiplying the first column 124 with the second column 124. Each element x,y etc is multiplied by its respective coefficient al, a2 etc in the second column to produce the corresponding result in the third column 128. Finally for each pixel 34, the terms appearing in the equations in the twenty-second operation 112 and the twenty- third operation 114 are created. Value{i} is the value of each of the elements in the first column 124. Aweigh{i} is the value of each of the elements in the third column 128. The particular coefficients al-al6 in the second column 126 can be chosen by the user when creating a texture, or can be fixed values. Certainly, when reconstructing an image, they must be the same values used for its creation. The aweigh weighting function has different coefficients al-al6 than appear in the corresponding positions in the bweigh weighting function. For example,

sum(aweigh{i}*value{i} ) = [ (x*al) * (x) + (y*a2) * (y) + + (pix elrand*al6) * (pixelrand) ]

Attention is drawn to Figure 18 explaining some of the elements shown in the first column 124 of Figure 17.

An origin 130 is shown on a texture 20 at one of its corners. A pixel starting point 132, in one of the cells 22' has its X offset and Y offset measured from the edge of the cell 22', as indicated by first and second arrows 134, 136. The X offset and Y offset are thus the coordinates of the pixel starting point 132 within its particular cell 22'.

A warped position 138 has coordinates w(x), w(y) measured from the origin 130 of the texture 20. The warped position 138 is where the starting point 132 ends up after the warping function, shown in Figure 10, has been applied. Equally a warped and distorted position 140, where the pixel 34^' arrives having been distorted away from the warped position 138, has coordinates d(x) and d(y), also measured from the origin 130 of the texture 20. Attention is drawn to Figure 19 explaining the term radial in the first column 124 of Figure 17. A line is drawn from the cell 22 centre 142, through the position of the pixel 34 to intersect an ellipse 144 which bounds the cell 22. This ellipse has the same ratio of width to height as the cell that it bounds. For a square cell, the ellipse has equal width and height and is therefore a circle. The line is used as a scale, with the value 0 being given at the cell centre 142 and the value 1 being assigned at the point 146 of intersection with the ellipse 144. The value "radial" is then the proportional point on the line occupied by the coordinates of the pixel 34. In the example shown, it can be seen that "radial" has a value of about 0.25. "The value of radial" is always less than 1.

Figure 20 illustrates the term " edgewards", also shown in the first column 124 of Figure 17. Instead of the line from the centre 142 of the cell 22 through the pixel 34 being extended to the ellipse 144, the line is terminated at a cell edge intersection point 148. Once again, the line to the edge of the cell 22is used as a scale and the centre of the cell 142 is assigned the value 0 and the cell edge intersection point 148 is assigned the value 1. The proportional position of the pixel 34 along the line gives the value "edgewards". In the example shown, the value of "edgewards" is around 0.5. The value of "edgewards" is always less than 1.

Also shown in Figure 20 is the term "angle" which is simply the angle, between the line that was used to create "edgewards" and "radial" and the X axis. Likewise, the term

"cellplas a" is the Z value (see Figure 8) of the plasma field at the centre of the cell 142. "Pixelplasma" is the value of the pixel 34 on the plasma field (the Z value, as shown in Figure 8) at the point d(x), d(y) indicated by the numeral 150 in Figure 20. Similarly, "pixelplasma2" is the value of the plasma field at the point d(x) , ( (z/2) -d(y) ) , where z is the z value derived at d(x) , d(y) .

The term "cellrand", used in the first column 124 of Figure 17, is a pseudo random value, derived from the cell coordinates. The corner, of the cell 22, from which xoffset and yoffset are measured, gives the coordinates within the texture 20 of the cell 22. The cell coordinate is used as the seed for a pseudo random number generator. The result of the pseudo random generated number is "cellrand".

The term "pixelrand" is a pseudo random value derived from the coordinates of the pixel 34 (x,y) and, again, is a pseudo random number in which the pixel 34 coordinates (x,y) are the seed.

Each of the values in the first column 124 of Figure 17 is scaled so that it lies between 0 and 1. Thus, the equations used in the twenty-second operation 112 and the twenty-third operation 114 always yield a value between 0 and 1. The A Value and the B value represent colour coordinates by which the individual pixels are coloured.

The A and B values can further be processed by employing a warping function, similar to that shown in Figure 10.

Attention is drawn to Figure 21 where the A colour value and the B colour value are used to determine the colour of each pixel 34. The texture designer selects four colours CI, C2, C3 and C4 to represent the corners of a unit square 52. The colours CI to C4 are specified, in this instance, by a 24 binary digit number which identifies their colour. Which colour CI to C4 goes on which corner of the selection square 152 is entirely up to the texture designer. The texture designer can specify any colour they to occupy any of the corners.

The pixel colour selection square 152 can be imagined as being filled with a field of all of the different mixed hues and saturations available from the corner colours CI to C4. One of the sides of the selection square is calibrated as a scale 0 to 1 and this is the axis of selection for the A colour selection value. Likewise, an adjacent side of the square is also calibrated 0 to 1 and this is used as a selection axis for the B colour value. Whatever the value of A and B for a particular pixel 34, the corresponding colour is selected from the selection square 152 at the coordinates A, B and applied to that pixel 34 in the completed texture.

In use, the texture designer creates a texture by adjusting, all of the variables herein before mentioned, until a satisfactory image of a texture is found. This is then stretched to fit the object 32 (Figure 7) in the manner of stretching a rubber sheet to fit. For example, on a sphere, the texture 20 may be wrapped around to envelop the surface. Equally, the texture 20 can be projected in the manner of a slide projector, onto the surface to be textured. It can be placed and cropped. Many other methods of mapping a texture onto a surface will be known to one skilled in the art.

Figures 22A to 22L show different textures which can be achieved. Since the drawings are in black and white it is impossible to represent the rich variation in colour. That will have to be imagined.

Figure 22A has a close resemblance to brickwork. Figure 22B is a fabric. Figure 22C is a pink granite. Figure 22D is a blue marble. Figure 22E is galvanised steel. Figure 22F is snake skin. Figure 22G is leopard skin. Figure 22H is a representation of a dawn sky. Figure 221 is wickerwork. Figure 22J is pine grain. Figure ,22K is a cork tile. Figure 22L is a linoleum tile. It can be seen that, using the variables available and the techniques employed, may different textures can be achieved.

Figure 23 is a flow chart of the activity of the image generation source 10 shown in Figure 1. The image generation source 10 can be a computer, a URL, an ISP or any other device from which a representation of an image may be sent.

From an entry 154 a twenty-sixth operation 156 has the image generation source 10 interrogate the mobile telephone 16, or any other device which is to receive the image to determine whether or not the texture programme is stored in that device. If a fifth test 158, on receiving a response from the device which is to receive the image, detects that the programme is present, the operation goes to exit 160. If the fifth test 158 detects that the texture programme is not present in the device to receive the image, a twenty-seventh operation 162 has the image generation source 10 send the texture programme to the device 16 so that the device 16 can interpret a texture.

Once the texture programme is in the device, the operation, shown in Figure 23, proceeds to exit 160.

Figure 24 shows the activity of the image generation source 10 when sending an image to a device 18. From an entry 164 a twenty-eighth operation 166 first sends the image to the mobile phone, computer or other device which is to show the image. Thereafter a twenty-ninth operation 168 has the image generation source 10 send a texture string to the mobile phone 18 or computer, or other device, that is to generate the image. As will be explained hereafter, the texture string is a simple concatenation, in known order, of all of the selectable variables which determine a texture.

Once the texture string has been sent to the mobile phone or computer, this operation proceeds to exit 170.

Attention is drawn to Figure 25 showing the activity of the cell phone 18, computer or other device which is to regenerate an image .

From an entry 172 a thirtieth operation 174 either retrieves the 3-D object which is to be textured from a memory, or receives the 3-D object from an outside source such as the image generation source 10. A thirty-first operation 176 then either retrieves from memory, or receives from an outside source such as the image generation source 10 the texture string which defines the texture to be applied to the three dimensional object. A thirty-second operation 178 then, having received or retrieved the texture string containing the concatenated variables which define the required texture, generates that texture for application to the object. A thirty-third operation 180 then applies the surface texture to the object by projection, wrapping, or any other technique known in the art. Thereafter, the thirty-third operation 180 exits 182.

Attention is drawn to Figure 26, showing the various ways in which a texture can be employed. The image generation source 10 can store or retrieve the texture programme and texture strings, for use in providing surface texture on objects, in a disc data store 184 such as hard disc. The programmes and texture strings can likewise be stored and retrieved on removable media 186 such as a floppy disc, pre-recorded or re- writeable compact discs 188, fixed or removable magnetic tapes 190, or in a memory 192 which can be a RAM, ROM, electrically alterable ROM, or any other electronic or physical device which can store a volatile or non-volatile record.

Likewise, the image generation source 10 sends messages 194, via a telecommunications network or internet service or telephone system as earlier described, to and from the remote devices such as the mobile phone 18 or a remote computer terminal 196. The messages from the image generation source 10 include texture strings and, on occasions, the texture programme .

Figure 27 illustrates the texture string, a serial^' concatenation of binary words or binary digits, sent by the image generation source 10 to the device 18, 194, or stored and retrieved from a memory 184, 186, 188, 190, 192 for the reconstruction of a texture. Although the elements are here given a specific order, it is to be understood that a different order can be allocated within the invention, and some elements omitted and new elements added.

A first element 200 conveys the seed for the pseudo random number generator which generates the z values for each pixel 34 as illustrated in Figure 8. A second element 202 contains the roughness value discussed in relation to Figure 9.

A third element 204 contains the coordinates of the warp function points illustrated in Figures 9 and 10. A fourth element 206 conveys the warp mould, selecting either a smooth or linear interpolation as discussed in connection with Figures 9 and 10.

A fifth element 208 contains the width distortion factor (Dw) described in relation to Figure 13. A sixth element 210 contains the height distortion factor (Dh) also described in relation to Figure 13. A seventh element 212 contains data to select the cell style, as illustrated in Figure 2A to Figure 2E. An eighth element 214 contains information to determine the cell size. A ninth element 216 contains either an indication of the first weighting function aweigh, or the values of another weighting function for use in place of aweigh, as described in relation to Figure 16. A tenth element 218 conveys either an indication of the second weighting function bweigh, or the values of a second weighting function to be used in its place. This is also described in relation to Figure 16. An eleventh element 220 contains CI, the colour to be used in a first corner of the selection square 152, illustrated in Figure 21. A twelfth element 222 contains an indication of the second colour C2 to be used on a second corner of the selection square 152. A thirteenth element 224 contains indication of a third colour C3 to be used on a third corner of the selection square 152. A fourteenth element 226 contains an indication of the fourth colour C4 to be used on the fourth corner of the selection square 152. Finally, and optionally a fifteenth element 228 contains an indication as to which object the texture, defined in the previous elements, is to be applied.

The texture string 198 may be sent as a serial data stream over a radio wave or down a telephone line, using a carrier, or not using a carrier as is appropriate. It may also be sent and stored as a series of parallel words.

This small amount of data is sufficient to generate complex textures and offers advantage in speed, bandwidth and storage. It also has the advantage that the texture program is small and fast, making it suitable for use in low capacity devices such as mobile telephones and palm top computers.

Claims (27)

1. A method of generating a surface texture in an image, said method comprising the steps of: employing a texture field of pixels; allocating a random value for each of said pixels in the field; moving said pixels; dividing said texture field into wrappable cells; and allocating a colour to each of said pixels.

2. A method, according to claim 1, wherein said step of allocating a random value to each pixel includes controlling the roughness of said random values.

3. A method, according to any one of the preceding claims, wherein said step of moving said pixels includes warping said pixels.

4. A method, according to any one of the preceding claims, wherein the step of moving said pixels includes distorting said pixels.

5. A method, according to any one of the preceding claims, wherein the step of dividing said texture field into wrappable cells includes the step of selecting the shape of said cells.

6. A method, according to any one of the preceding claims, wherein said step of dividing said texture field into wrappable cells includes the step of selecting the size of said cells.

7. A method, according to any one of the preceding claims, wherein said step of allocating a colour to each pixel includes taking account of the position of the pixel.

8. A method, according to any one of the preceding claims, wherein said step of allocating a colour to each pixel includes taking account of the movement of the pixel.

9. A method, according to any one of the preceding claims, wherein said step of allocating a colour to each pixel includes taking allocation from within a selected range of colours .

10. A method, according to any one of the preceding claims, including use of a computer program to generate the surface texture.

11. A method, according to any one of the preceding claims, including use of a texture data string to generate the surface texture.

12. An apparatus for generating a surface texture in an image, said apparatus comprising: means to generate a texture field of pixels; means to allocate a random value for each pixel in the field; means to move the pixels; means to divide said texture field into wrappable cells; and means to allocate a colour to each pixel.

13. An apparatus, according to claim 12, wherein said means to allocate a random value to each pixel includes means to control the roughness of said random values.

14. An apparatus, according to any one of claims 12 to 13, wherein said means to move said pixels includes means for warping said pixels.

15. An apparatus, according to any one of claims 12 to

14, wherein said means to move said pixels includes means to distort said pixels.

16. An apparatus, according to any one of claims 12 to

15, wherein said means to divide said texture field into wrappable cells includes means to select the shape of said cells .

17. An apparatus, according to any one of claims 12 to

16, wherein said means to divide said texture field into wrappable cells includes means to select the size of said cells.

18. An apparatus, according to any one of claims 12 to

17, wherein said means to allocate a colour to each pixel includes means responsive to the position of the pixel.

19. An apparatus, according to any one of the claims 12 to 18, wherein said means to allocate a colour to each pixel includes means responsive to the movement of the pixel.

20. An apparatus, according to any one of claims 12 to

19, wherein said means to allocate a colour to each pixel includes means to allocate from within a selected range of colours .

21. An apparatus, according to any one of claims 12 to

20, employing a computer program to generate the surface texture.

22. An apparatus, according to any one of claims 12 to

21, employing a texture data string to generate the surface texture.

23. A computer program, operating according to the method recited in claims 1 to 11.

24. A memory device, bearing a copy of a computer program, said computer program being operable according to the method recited in claims 1 to 11.

25. A computer device, containing a program to cause it to operate according to the method recited in claims 1 to 11.

26. A texture string message, as recited in claims 11.

27. A computer, operative to generate a texture data string, as recited in claims 11.