AU4812099A - Method and apparatus in transmission of images - Google Patents

Description

WO 00/01153 PCT/SE99/01024 1 Method and Apparatus in Transmission of Images. FIELD OF INVENTION 5 The present invention relates to a method and to arrangement for coding and extracting regions of interest (ROI) in the transmission of still images and video images. The method and the arrangement are particularly well suited for transform 10 based coders, such as wavelets and DCT. DESCRIPTION OF THE BACKGROUND ART In transmission of digitized still images from a transmitter 15 to a receiver, the image is usually coded in order to reduce the amount of bits required for transmitting the image. The bit quantity is usually reduced, because the capacity of the channel used is limited. A digitized image, however, 20 consists of a very large number of bits. When transmitting an image that consists of a very large number of bits over a channel which has limited bandwidth, transmission times will be unacceptably long for the majority of applications if it is necessary to transmit every bit of the image. 25 Consequently, in recent years research has been directed to coding methods and techniques for digitized images with the object of reducing the number of bits necessary to transmit the images. 30 These methods can be divided into two groups: WO 00/01153 PCT/SE99/01024 2 Lossless methods, i.e. methods exploiting the redundancy in the image in such manner as to enable the image to be reconstructed by the receiver without loss of information. 5 Lossy methods, i.e. methods that exploit the fact that not all bits are equally as important to the receiver. Hence, the image received is not identical to the original but looks sufficiently like the original image to the human eye, for instance. 10 In some applications, certain parts of the transmitted image are of more interest than the remainder of the image, and better visual quality of these parts of the image is therefore desired. Such a part is usually called the region 15 of interest (ROI). Applications in which this can be useful include, for example, medical databases or the transmission of satellite images. In some cases, it is also desired, or necessary, to transmit the region of interest loss-free, while the quality of the remainder of the image is of less 20 importance. There are also occasions when it is required to extract the regions of interest from the bit stream and decode these regions of interest without needing to decode the image as a whole. 25 Swedish Patent Applications SE 9703690-9 and SE 9800088-8 both describe how a mask can be calculated for delimiting such a region of interest (ROI). SUMMARY OF THE INVENTION 30 The present invention addresses the aforesaid problem of defining and transmitting regions of interest and background WO 00/01153 PCT/SE99/01024 3 regions of mutually different qualities in the transmission of images. The basic concept of the invention in solving the problem is 5 to transform the image and to define in said transform a mask that corresponds to the regions of interest and to the background regions. The region definition and the image transform are transmitted to a receiver capable of recreating the image with the quality desired in the predetermined 10 regions. More specifically, the solution involves dividing the image into the desired regions. The image is then transformed to some type of transform coefficients. A mask corresponding to 15 the separate regions in the image is defined in the transform domain and the coefficients classified and assigned to different segments in accordance with the mask definition. The segments thus belong to the corresponding regions in the image. The segments and the coefficients are transmitted in a 20 compressed state to a receiver that is capable of reproducing regions in the image on the one hand and of reproducing the actual image on the other hand with the desired image quality in the various regions. 25 One advantage afforded by the invention is that several different regions of interest can be defined. Another advantage- is that different regions can have several different degrees of image quality. 30 WO 00/01153 PCT/SE99/01024 4 Still another advantage is that only those parts of the image that are of vital interest to the user need be decoded, while avoiding decoding of the whole of the image. 5 Yet another advantage is that the segments can be coded independently of each other. The invention will now be described in more detail with reference to preferred embodiments thereof and also with 10 reference to the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS Figure 1 is a block schematic illustrating an inventive 15 arrangement. Figure 2 is a flow chart illustrating part of an inventive method. 20 Figure 3 is a flow chart illustrating a further part of an inventive method. Figure 4 is a diagram illustrating classification of transform coefficients. 25 Figure 5 is a diagram for interlinking image segments in a bit stream. Figure 6 is a view of an image with object. 30 Figure 7 is a graphic representation of the topology in Figure 6.

WO 00/01153 PCT/SE99/01024 5 DESCRIPTION OF PREFERRED EMBODIMENTS Figure 1 is an overview of an arrangement for coding and transmitting images. An image 3 of an object is stored in 5 digital form in a digital camera 1, and the image presented on a screen 4. The screen is connected to a computer 2 which is programmed to divide the image 3 into objects or regions, of which a background region R1 and regions of interest R1 and Rn are shown. An image coder 5 in the computer 2 wavelet 10 transforms the image, while simultaneously compressing the image, and generates a compressed bit stream PS1. An operator at the image screen 4 defines the regions of interest R2 and Rn. The image coder includes means for creating a mask PS2 in accordance with the regions and defines separate parts, 15 segments, of the bit streams with respect to the corresponding regions R1, R2 and Rn, with the aid of said mask. The definition also enables the regions R1, R2, Rn in the form of said separate segments in the bit stream PS1 to be coded to different degrees of accuracy. A transmitter 6 20 sends the bit stream, including the definition of the positions and shapes of the regions R2 and Rn to a receiver 7 which is connected to a computer that includes an image decoder 8. The decoder decodes the bit stream PS1 and reproduces the mask definition PS2 and presents the image on 25 an image display screen 9. The accuracy of the background Ri is relatively poor, whereas each of the regions R2 and Rn has respectively a higher degree of accuracy. The following definitions are given in order to assist in 30 describing the inventive method: WO 00/01153 PCT/SE99/01024 6 - A segment is defined here as all of the coefficients in the transform domain that belong to a given object or the background in the image. The segment can then be divided further into subsets. 5 - A subset is defined here as a number of coefficients in a part of the transform domain (e.g. a subband in the case of the wavelet transform) which is required for the reconstruction and which belongs to a segment in the 10 digitized image, see Figure 4. As before mentioned, the coefficients are classified and can be assigned to individual segments. When this classification is made, the segments are coded independently of one another 15 to different levels of accuracy, which yields a bit stream for each segment. These segments are then joined together. The inventive encoding method will be described with reference to Figure 2. The digitized image 3 to be 20 transmitted presents the background R1 and the regions of interest R2 and Rn. The following procedural steps are carried out: 1. Perform a transformation of the image 3 according to 25 step 21. In the illustrated case, this transformation is performed with a wavelet transform or with a discrete cosine transform (DCT). 2. Create a mask according to step 2 with the aid of 30 information as to how the digitized image 3 shall be divided into the background R1 and the objects R2 and Rn. The techniques described in Swedish Patent Applications SE WO 00/01153 PCT/SE99/01024 7 9703690-9 and SE 9800088-8 can be used to this end. The mask is created in the transform domain and describes which coefficients are required to reconstruct the different objects or the background. Different segments SG1, SG2 and 5 SGn correspond to the background R1 and the objects R2 and Rn. 3. Use the mask to classify the transform coefficients as belonging to the different segments SG1, SG2, SGn, according 10 to step 3. 4. Code the segments independently of one another, according to step 24. This gives the number of bits needed for each subset. 15 5. Concatenate the subset streams together with necessary substream information and header information, according to step 26. This requires a bit stream description, given below. 20 6. Send the concatenated bit streams 27. This includes shape data 271, bit stream information 272, subband 0 referenced 273 and subband 1 referenced 274. The method enables the receiver to have immediate access to 25 any parts of the image when so desired, as shown in Figure 3. This is possible because the information as to where different parts are found in the bit stream is known. One method of how the decoder may work is described below 30 with reference to Figure 3.

WO 00/01153 PCT/SE99/01024 8 1. Receive the bit stream 27 and decode the header information required, according to step 31. 2. Find and decode the required segment information, step 5 32. 3. Create a mask in the transform domain, for instance with the aid of the technique described in said Patent Applications SE 9703690-9 and SE 9800088-8; step 33. The mask 10 describes those coefficients that are required to reconstruct the desired objects or background. 4. Decode requisite segment data from the bit stream; step 34. 15 5. Reconstruct the requisite segments; step 35. 6. Decode and show the image; step 36. 20 BIT STREAM DESCRIPTION A description will now be given of those components in the bit stream 27 that are required when applying the described technique. 25 Data structures and pointers Pointer 30 A pointer is a set of symbols that defines the position of a bit or a byte in a bit stream or a file. Many ways of defining a pointer have been defined in computer science. Any WO 00/01153 PCT/SE99/01024 9 one of these methods can be used here. A pointer can be defined implicitly by a specific bit stream composition rule. A pointer can be defined relative to an explicitly or implicitly determined position. A simple way of defining a 5 pointer is to determine the number of bits between the requested position and a known reference point, such as the first bit in the bit stream, for instance. Topology descriptor 10 The topology descriptor, TOP, is a set of symbols that defines the topological relationship between numbered objects and shapes. This is illustrated in Figure 6, in which four objects 01, 02, 03, 04 and four shapes S1, S2, S3 and S4 are 15 shown. The topology of the image can be represented, e.g., as a tree graph as shown in Figure 7. The nodes and the edges of the tree graph can be coded in a data structure using well known methods. PTOP is a pointer to a topology descriptor. 20 Shape descriptor A shape descriptor, Si, defines the appearance of a closed boundary line of an object. The shape number, i, is given by a topology descriptor. Many different shape coding techniques 25 can be used. Examples of such methods are chain coding and shape coding methods in MPEG-4. Shape descriptors can be decoded independently of one another once their respective positions in the bit stream is known. PSi is a pointer to a shape descriptor. 30 WO 00/01153 PCT/SE99/01024 10 Segment descriptor A segment descriptor, Ti, is a compressed set of symbols that encode a segment as described above. The segment includes an 5 ordered set of subsets. The object number, i, is given by a topology descriptor. p_Ti is a pointer to a segment descriptor. Subset descriptor 10 A subset descriptor, Bij, is an independently decodable subset, j, of a segment descriptor, Ti, which describes, e.g., the coefficients that belong to a given subband, j, as described above. p_Big is a pointer to a subset descriptor. 15 Multiplexed segment descriptor Several segment descriptors, {Ti, Tj, Tk .. .}, can be multiplexed into a common data structure MT(i,j,k). This is 20 done normally for the purpose of simultaneous progressive transmission of a set of objects. The data structure, MT, is called a multiplexed segment descriptor. Several multiplexing methods can be used. pMT is a pointer to a multiplexed segment descriptor. 25 Segment multiplexing methods Examples of multiplexing methods are shown in Figure 5. A simple method is to interleave subsets 52 belonging to the 30 component segments so that: MT(i,j,k)={BiO, BiO, Bko, Bil, Bjl, Bkl, B 12 , Bj 2 , Bk 2 -. - } WO 00/01153 PCT/SE99/01024 11 In this case, the order of the symbols corresponds to the order in the bit stream 51, with symbols on the left being sent first. Subsets in a multiplexed stream may be excluded 5 if they are known by the decoder. Bit stream storage format In order to obtain immediate access to any object whatsoever 10 in the image, the stored bit stream or file structure should preferably include at least the following components: In the image header, if required: 15 Topology descriptor TOP Pointers to shape descriptors {p_Si, pS 2 -.. -p_SN Pointers to segment descriptors {p_TO, pT 1 ,.. .p_TNI 20 Optional pointers to subset descriptors: for each k=[0 , N], {p_Bko, p_Bkl, . . . p_BkN} In the actual stored bit stream if needed: 25 Shape descriptors {Si, S2, ...SN} Segment descriptors {TO, T 1 ,... TN} 30 A group of segment descriptors with index {k,l,m. . .} can optionally be replaced with a multiplexed segment descriptor MT(k,l,m...) WO 00/01153 PCT/SE99/01024 12 .N is the number of stored objects. The background is the object with index 0. 5 PROGRESSIVE TRANSMISSION WITH IMMEDIATE ACCESS TO OPTIONAL OBJECTS A server receives a request for sending image data to a client. The image is stored with the server in the format 10 described in the preceding passage. Part of the stored data structures (topological data, shapes, segments and subsets) may have already been sent to the receiving terminal. This section of the description describes a procedure for composing a bit stream with the server that handles the 15 request. Example Request from user 20 A simple request contains the following information: Send objects with numbers k, 1, m ... with a respective accuracy of nk, n 1 , nm where the accuracy is the index for the 25 highest subset that is sent for each index. Several primitive requests may be sent. They will be served in the order in which they are received or in an otherwise specified order. 30 WO 00/0 1153 PCT/SE99/01024 13 Procedure for serving a request (details) Send topological information if needed. TOP is sent in response to a first request for image information. 5 Send all shape descriptors that are necessary to describe the boundaries of the objects requested. It is not necessary to send shape descriptors that are already known to the decoder. When using the topological tree structure in Figure 7, it is 10 found that not all shape descriptors on the same branch as the object or on the same or lower hierarchical level need be sent. The server knows the state of the decoder and will send solely those shape descriptors that are unknown to the decoder. 15 Send (multiplexed) subset descriptors that describe the objects requested to the defined accuracy. Subset descriptors that are already known to the decoder need not be sent. For instance, the user is aware of the subsets {Bko, Bki, Bk2, Bk3} 20 belonging to segment k. Subset descriptors {Bk 5 , Bk6, Bk7} must be sent when object k is requested to accuracy 7. EXAMPLES 25 In this section of the description, examples are given with respect to situations in which the proposed method can be applied. Assume, according to Figure 5, that in the centre of the 30 image R51 there is an encircled region R52 whose quality must be better than the quality of the region R53 outside the circle, this latter region being referred to hereinafter as WO 00/01153 PCT/SE99/01024 14 the background. However, both the background R53 and the region R52 shall be transmitted simultaneously. The following then takes place: 5 1. The original image is transformed with a wavelet transform. 2. A mask is then created in the transform domain. This mask describes the coefficients that are required in the 10 transform domain in order to reconstruct the region R52 and the background R53. The created mask is then used to classify the coefficients in the transform domain in two segments, one segment for the region and one segment for the background. The two segments are built up by a number of subsets. In the 15 illustrated case, the number of subsets is the same as the number of subbands in the transform domain. The situation on hand is thus: 2.1 In respect of the region segment belonging to the region 20 R52: ro,1t ro,2, - . ,ro, 1 }, . .-. {rnosubbands,1 , rno_subbands,2, . . .rnosubbands,j}} where i,j are the number of coefficients in the different subsets. 25 2.2 In respect of the background segment belonging to the background R53: { {bo, 1 ,bo, 2 , .- bo,}, . . . ,{bno_subbands, 1 fbnosubbands,2, .bnosubbands,q} 30 where p,q are the number of coefficients in the different subsets.

WO 00/01153 PCT/SE99/01024 15 3. The two subsets are then coded as follows: 3.1 In respect of the region segment: 5 A shape descriptor Tr={Br,0,Br,ir .. ,Brno_subbands} and a set of subset pointers {pBr,oePBr,i, .. . -pBr,no_subbands1 3.2 In respect of the background segment: 10 A segment descriptor Tb={Bb,o,Bb,1, ... ,Bbno_subbands} and a set of subset pointers {p_Bb,,Bb,1,... ,p_Bb, no_subbands 4. The two segments are then combined into a single bit stream, bit stream 51, in the following manner: 15 <image header><TOP><Sr><{p_Bb,o ,p_Br,orP_B,,p_Bb,nosubbandsr p_Br,no_subbands}><MT(b,r)={Bb,,Br,o,Bb,I,Br,1 ..-- ,Bbnosubbands' Br,no-subbands}> 20 In this case, the subsets are combined in the manner shown in the upper part of Figure 5, with the sub-bit streams 52 of the region being taken alternately with the sub-bit streams of the background. It will be noted that the TOP field is not required when the receiver is aware of the order in which the 25 various parts of the image are set. The first part of the array, from <image header> to . . .p_B.. .}> is, in other words, a definition of where the different image regions are placed in the remainder of the compressed bit stream <MT(b,r)={.. .... }>. 30 5. The combined bit stream is then sent to the receiver.

WO 00/01153 PCT/SE99/01024 16 The following takes place on the decoder side: 6. The image header together with the topology, shape 5 information and pointers are read. 7. The decoder is now able to create the same mask as that described above. 10 8. The decoder creates the segments with the underlying subsets. 9. The decoder commences with decoding the combined bit stream and filling in the transmitted transform coefficients 15 in the corresponding subsets. 10. An inverse transform is used. 11. The image is transmitted and reconstructed. 20 The aforedescribed is one way of using the proposed method. Other methods may be to combine (mix) the bit streams in another way. For instance, as shown in the bottom part of Figure 5, the region R52 may be transmitted first, followed 25 by the background R53. Another example is one in which more than one region is found, as described with reference to Figure 6, wherewith these regions are combined in a number of different ways. 30 In addition to the earlier mentioned advantages, the proposed method has the added advantage of enabling shape information to be sent only when needed.

Claims (19)

1. A method of transmitting an image (3) between a transmitter (2, 5, 6) and a receiver (7, 8), comprising the 5 steps of: - dividing the image (3) into at least two image regions (R1, R2, Rn); - coding the image regions (R1, R2, Rn) into a coded symbol stream (21), said coding utilising a symbolic 10 representation and having predetermined accuracy levels in said image regions; and - compressing the coded symbol stream into a compressed bit stream (PS1, 27), characterised in that the method includes the further steps 15 of: - generating (22) a definition (PS2) of the different image regions in the compressed bit stream; - transmitting said definition (PS2) to the receiver (7); - transmitting the compressed bit stream (PS1, 27) to the 20 receiver (7, 8; and - decoding (33, 34) in the receiver predetermined parts of the compressed bit stream (PS1, 27) with the aid of said definition. 25 2. An arrangement for transmitting an image (3), comprising: - a transmitter (2, 5, 6) and a receiver (7, 8); - means (4, 5) for dividing the image (3) into at least two image regions (R1, R2, Rn); 30 - a coding device (5) for coding the image regions (R1, R2, Rn) into a coded symbol stream, said coding device WO 00/01153 PCT/SE99/01024 18 utilising a symbolic representation and having predetermined accuracy levels in said regions; - a compressing device for compressing the coded symbol stream into a compressed bit stream (PS1, 27); and 5 - means in the transmitter (2, 5, 6) for transmitting said compressed bit stream (PS1, 27) to the receiver (7, 8), characterised in that the arrangement also includes: - means (5) for generating (22) a definition (PS2) of the different image regions (R1, R2, Rn) in the compressed bit 10 stream (PS1, 27); - means in the transmitter (2, 5, 6) for transmitting said definition (PS2) to the receiver (7, 8); and - a decoder (8) in the receiver for decoding (34, 35) predetermined parts of the compressed bit stream (PS1, 27) 15 with the aid of said definition (PS2). WO 00/0 1153 PCT/SE99/01024 1 9 AMENDEDCLAIMS [received by the International Bureau on 9 November 1999 (09.11.99); original claims 1-2 replaced by amended claims 1-18 (5pages)] 1. A method of transmitting an image (3) between a transmitter (2, 5, 6) and a receiver (7, 8), comprising the 5 steps of: - dividing the image (3) into at least two image regions (R1, R2, Rn); - coding the image regions (R1, R2, Rn) into a coded symbol stream (21) , said coding utilising a symbolic 10 representation and having predetermined accuracy levels in said image regions; and - compressing the coded symbol stream into a compressed bit stream (PS1, 27), characterised in that the method includes the further steps 15 of: - generating (22) a definition (PS2) of an outer boundary line (Si)of at least one of the image regions (R2,Rn); - transmitting said definition (PS2) to the receiver (7); - transmitting the compressed bit stream (PS1, 27) to the 20 receiver (7, 8; and - decoding (33, 34) in the receiver with the aid of said definition.

2. The method of claim 1, characterised in that two different 25 of the image regions (R2,Rn) are coded to have said predetermined accuracy levels independently of each other.

3. A method of transmitting an image (3) between a transmitter (2, 5, 6) and a receiver (7, 8), comprising the 30 steps of: - dividing the image (3) into at least two image regions (R1, R2, Rn); - coding the image regions (Ri, R2, Rn) into a coded symbol stream (21), said coding utilising a symbolic 35 representation and having predetermined accuracy levels in said image regions; and AMENDED SHEET (ARTICI F 1I WO 00/01153 PCT/SE99/01024 2 0 - compressing the coded symbol stream into a compressed bit stream (PS1, 27), characterised in that the method includes the further steps of: 5 - generating (22) a definition (PS2) of a mask (PS2) for at least one of the image regions (R2,Rn), two different of the image regions (R2,Rn) being encoded to have said predetermined accuracy levels independently of each other; - transmitting said definition (PS2) to the receiver (7); 0 - transmitting the compressed bit stream (PS1, 27) to the receiver (7, 8; and - decoding (33, 34) in the receiver with the aid of said definition. 5

4. The method of claim 1,2 or 3, characterised in that only predetermined parts of the compressed bit stream (PS1,27) are decoded.

5. The method of any of the claims 1, 2, 3 or 4, 0 characterised by generating a topology description, defining the topological relationship between objects (01, 02, 03, 04) and shapes (S1, S2, S3, S4) in the image.

6. The method of any of the claims 1, 2, 3 or 4, 5 characterised by generating a shape description, defining the appearance of the closed boundary line (Si) of an object (01, 02, 03, 04) in the image.

7. The method of any of the claims 1, 2, 3 or 4, 0 characterised by generating a segment description, defining which transform coefficients that belong to respective segment.

8. The method of claim 7, characterised by generating a 5 subset description, defining which transform coefficients that belong to an independently decodable part of a segment. AMENDED SHEET (ARTICLE 19) WO 00/01153 PCT/SE99/01024 2 1

9. The method of any of the claims 5, 6, 7 or 8, characterised by generating of a pointer, defining a position in the bit stream (27) for the respective one of the above mentioned descriptions. 5

10. An arrangement for transmitting an image (3), comprising: - a transmitter (2, 5, 6) and a receiver (7, 8); 0 - means (4, 5) for dividing the image (3) into at least two image regions (R1, R2, Rn); - a coding device (5) for coding the image regions (Ri, R2, Rn) into a coded symbol stream, said coding device utilising a symbolic representation and having predetermined 5 accuracy levels in said regions; - a compressing device for compressing the coded symbol stream into a compressed bit stream (PS1, 27); and - means in the transmitter (2, 5, 6) for transmitting said compressed bit stream (PS1, 27) to the receiver (7, 8), 0 characterised in that the arrangement also includes: - means (5) for generating (22) a definition (PS2) of an outer boundary line (Si) of at least one of the image regions (R2,Rn); - means in the transmitter (2, 5, 6) for transmitting said 5 definition (PS2) to the receiver (7, 8); and - a decoder (8) in the receiver for decoding (34, 35) of the compressed bit stream (PS1, 27) with the aid of said definition (PS2). 0

11. The arrangement of claim 10, characterised in that the coding device is arranged to encode (24) two different of the image regions (R2, Rn) to have the predetermined accurracy levels independently of each other. 35 AMENDED SHEET (ARTICLE 19) WO 00/01153 PCT/SE99/01024 2 2

12. An arrangement for transmitting an image (3), comprising: - a transmitter (2, 5, 6) and a receiver (7, 8); - means (4, 5) for dividing the image (3) into at least 5 two image regions (R1, R2, Rn); - a coding device (5) for coding the image regions (R1, R2, Rn) into a coded symbol stream, said coding device utilising a symbolic representation and having predetermined accuracy levels in said regions; L0 - a compressing device for compressing the coded symbol stream-into a compressed bit stream (PS1, 27); and - means in the transmitter (2, 5, 6) for transmitting said compressed bit stream (PS1, 27) to the receiver (7, 8), characterised in that the arrangement also includes: L5 - means (5) for generating (22) a definition (PS2) of a mask (PS2) for at least one of the image regions (R2,Rn), the coding device (5) being arranged to encode (24) two different of the image regions (R2,Rn) to have said predetermined accuracy levels independently of each other; 0 - means in the transmitter (2, 5, 6) for transmitting said definition (PS2) to the receiver (7, 8); and - a decoder (8) in the receiver for decoding (34, 35) of the compressed bit stream (PS1, 27) with the aid of said definition (PS2). 25

13. The arrangement of claim 10, 11 or 12, characterised in that the decoder (8) is arranged to decode only predetermined parts of the compressed bit stream (PS1,27). 30

14. The arrangement of claim 10, 11, 12 or 13, characterised in that the transmitter (2, 5, 6) has means for generating a topology description, defining the topological relationship between objects (01, 02, 03, 04) and shapes (S1, S2, S3, S4) in the image. 35 AMENDED SHEET (ARTICLE 19) WO 00/01153 PCT/SE99/01024 2 3

15. The arrangement of claim 10, 11, 12 or 13, characterised in that the transmitter (2, 5, 6) has means for generating a shape description, defining the appearance of the closed boundary line (Si) of an object (01, 02, 03, 04) in the 5 image.

16. The arrangement of claim 10, 11, 12 or 13, characterised in that the transmitter (2, 5, 6) has means for generating a segment description, defining which transform coefficients 0 that belong to respective segment.

17. The arrangement of claim 16, characterised in that the transmitter (2, 5, 6) has means for generating a subset description, defining which transform coefficients that 5 belong to an independently decodable part of a segment.

18. The arrangement of claim 14, 15, 16 or 17, characterised in that the transmitter (2, 5, 6) has means for generating a pointer, defining a position in the bit stream (27) for the 0 respective one of the above mentioned descriptions. AMENDED SHEET (ARTICLE

19) WO 00/01153 PCT/SE99/01024 2 4 STATEMENT UNDER ARTICLE 19 In the amended independent method claim 1, which in the main corresponds to earlier claim 1, a feature defining an outer boundary line is inserted. This is supported by the description page 9, lines 22,23. Dependent claim 2 defines that different regions are coded independently, supported by the description page 7, lines 12-14. The new independent method claim 3, also in the main corresponding to earlier claim 1, defines a mask for the image regions and that the image regions are coded independently of each other. Support in the description is to be found at page 3, lines 14-19; page 6, line 29 to page7, line 10; page 7, lines 12-14. The scope of earlier claim 1 has been broadend in one respect. The feature of decoding predetermined parts of the bit stream has been removed from claim 1 and is instead defined in the new dependent claim 4. The new independent method claims 5-9 define a number of descriptions and an associated pointer for the transmitted image. Support is in the description at page 8, line 20 to page 10, line 14. The earlier independent device claim 2 is amended in a corresponding way as claim 1 and is now claim 10. The new device claim 12 corresponds to the new method claim 3. The new independent device claims 11 and 13-18 correspond to the respective claims 2 and 4-9.