CA2348622C - Partial retrieval of images in the compressed domain - Google Patents

Partial retrieval of images in the compressed domain Download PDF

Info

Publication number
CA2348622C
CA2348622C CA002348622A CA2348622A CA2348622C CA 2348622 C CA2348622 C CA 2348622C CA 002348622 A CA002348622 A CA 002348622A CA 2348622 A CA2348622 A CA 2348622A CA 2348622 C CA2348622 C CA 2348622C
Authority
CA
Canada
Prior art keywords
server
client
image
request
information
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
CA002348622A
Other languages
French (fr)
Other versions
CA2348622A1 (en
Inventor
Mathias Larsson
Charilaos Christopoulus
Magnus Jandel
Diego Santa Cruz
Touradj Ebrahimi
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Telefonaktiebolaget LM Ericsson AB
Original Assignee
Telefonaktiebolaget LM Ericsson AB
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Telefonaktiebolaget LM Ericsson AB filed Critical Telefonaktiebolaget LM Ericsson AB
Publication of CA2348622A1 publication Critical patent/CA2348622A1/en
Application granted granted Critical
Publication of CA2348622C publication Critical patent/CA2348622C/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N1/327Initiating, continuing or ending a single-mode communication; Handshaking therefor
    • H04N1/32765Initiating a communication
    • H04N1/32771Initiating a communication in response to a request, e.g. for a particular document
    • H04N1/32776Initiating a communication in response to a request, e.g. for a particular document using an interactive, user-operated device, e.g. a computer terminal, mobile telephone
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/00127Connection or combination of a still picture apparatus with another apparatus, e.g. for storage, processing or transmission of still picture signals or of information associated with a still picture
    • H04N1/00204Connection or combination of a still picture apparatus with another apparatus, e.g. for storage, processing or transmission of still picture signals or of information associated with a still picture with a digital computer or a digital computer system, e.g. an internet server
    • H04N1/00244Connection or combination of a still picture apparatus with another apparatus, e.g. for storage, processing or transmission of still picture signals or of information associated with a still picture with a digital computer or a digital computer system, e.g. an internet server with a server, e.g. an internet server
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N1/327Initiating, continuing or ending a single-mode communication; Handshaking therefor
    • H04N1/32765Initiating a communication
    • H04N1/32771Initiating a communication in response to a request, e.g. for a particular document

Abstract

In a method and a system for retrieving images in a client-server system, images are stored as a set of independently decodable units (CU's) on the server. A client issues a series of requests for image information. Each request contains a request number, information on what image information the client wants to see next and information on what image information the client had received at the time when the request was issued. The server does not have to store any state information (e.g. previous requests). On receiving a request, the server sends a restart marker, a confirmation of the request number and incremental image information corresponding to the request. The use of the method and the system as described herein will result in that no decodin g of the whole bit stream will be required in the server. This will save a lot of time at the sender side (server side), since it does not need a full decoding of the stream.

Description

W000124188 _ PCf/SE99101847 PARTIAL RETRIEVAL OF IMAGES IN THE COMPRFSSED DOMAIN
TECFIIIICAL FIELD
The present invention relates to a method and a system for transmitting images between a client and a server. The method and the system are particularly well suited for transmission of parts of images stored in a server.

BACKGROUND OF THE INVENTION AND PRIOR ART
Digital images can be stored on servers and distributed over a telecommunication network. Images can also be stored on physical media using for example a CD-ROM. If the image is large it might take some time to transmit the image. In order to speed up the transmission the clientmight select a region vf the image that are more vital and then only receive the region. This is known as Region of Interest (ROI) coding.

In today's client-server systems, if a client wants to access an irnage from a server, a connection is established between the user program at the client side and the server. The user program then sends a r~est to Set the desired image. The server reacts by fetching the file and starts the transmission. The user program can at any time send a new request to the server, e.g., a request for parts of a file. When the transmission is finished the connection is closed. Such a system is described in Fielding, et al, Hypertext Transfer Protocol - HTTPJI.1 rev 05, HTTP Working Group, INTERNET-DRAFT, September 11, 1998 (Work in progress).

However, there is a problem with most of the still image compression techniques, like e.g. JPEG, in that they produce a bit stream being one inseparable coding unit. Thus, if a Region of Interest is selected the lack of independently decodable units forces the server to pe.rform a complete decoding followed by a new encoding of the whole bit stream. Depending on the server software it sometimes even has to re-load the image from the storage media. The drawback with this is that a time consuming and computational complex scheme is required, which will put high demands on the computational power of the server.
Furthermore, in the emerging still image standard JPEG2000 wo i1(IRalss rcrlSE99/'01847 independent entropy coding of so called coding units (CU) is used. A coding unit can for example be, a subband in the transform domain, in the case of i.e. wavelet transform), a part of a subband, such as bit plane or block of certain size (example 16x16), or a bit plane for a region within a subband.
SLJMMARY
It is an object of the present invention to overcome the problems as outlined above and in particular to reduce the amount of processing and encoding in a server when a client requests an ROI or a part of the image.

This object and others are obtained by storing images as a set of independently decodable units (CU's) on a server. When a client requests a certain part of the image only information from the CUs that have not already been transmitted are then re-encoded1 which saves a lot of processing time in the server.
For example, a client is issuing a series of requests for image information. Each request contain a request number, information on what image information the client wants to see next and information on what image information the client had received at the time when the request was issued. The server does not have to store any state information (e.g. previous requests). On receiving a request, the server sends a restart marker, a confirmation of the request.number and incremental image information corresponding to the request.

The use of the method and the system as described herein will result in that no decoding of the whole bit stream will be required in the server. This will save a lot of time at the sender side (server side), since it not needs to perform a full decoding of the stream.

BRIEF DESCRIPTION OF THE DRAWINGS
The present invention will now be described in more detail and with reference to the accompanying drawings, in which:

- Fig. 1 shows the basic steps carried out in a client -server process.
- Fig. 2 shows the steps carried out in a client - server process according to a first embodiment.
- Fig. 3 shows the steps carried out in a client - server process according to a second embodiment.
- Fig. 4 shows the steps carried out in a client - server process according to a third embodiment.
- Fig. 5 shows the steps carried out in a client - server process according to a first alternative of the third embodizent.
- Fig. 6 shows the steps carried out in a client - server process according to a second alternative of the third embodiment.
- Fig. 7 shows the steps carried out in a client - server process according to a third alternative of the third embodiment.
- Fig. 8 shows the steps carried out in'a client - server process according to a fourth embodiment.

DETAILED DESCRIPTION
In Fig. 1, a basic interaction between a client and a server is shown. Thus first the client requests an image, step 101. Next in a step 103, the server starts to transmit the image to the client. The client then , at some time during transmission requests a portion of the image, which is currently being transmitted, step 105. The server then, in response to the request in step 105, starts to transmit the requested portion, step 107. The client may also request additional portions of the image at any time as indicated in step 109. The transmission can be interrupted at any time at a lower protocol level, such as TCP or HTTP.

In the following description and on the corresponding drawings the following definitions, syntax and notation is used:

- A Codinq_Onit_ -(CU) is a part of a bit stream that is independently_decodable. Thus, it is possible to decode a certain part of the bit stream without having to decode the whole stream.
- A TAG or re-sync mark is a combination of bits that can not be generated from the entropy encoder.

Syntax elements in the Client - Server process Several detailed instances of a basic client server process are described below. They correspond to various specific formats of the syntax elements in the Client -Server process. <Image data request> can have the following formats:

- <Image data request 1> = send the first <number> subbands - <Image data request 2> = send the first <number> bit planes - <Image data request 3> = send the first <number> subbands of the ROI <ROI number> <ROI description>
- <Image data request 4> = send the first <number> bitplanes of the ROI <ROI number> <ROI description>
- <Image data request 5> = send <CU sequence> (describing what CU's are requested) <Image data acknowledge> can have the following formats:
- <Image data acknowledge i> = <Image data acknowledge marker>
bits/bytes/CUs received <number>
- <Image data acknowledge 2> = <Image data acknowledge marker>
CUs received <number> <CU ni> <CU n2> ... <CU nn>, where <CU n>
is the number assigned to a received CU

Version 1 is used with a re-sending and packet ordering transmission protocol such as TCP. Version 2 is used with a connectionless best-effort transmission protocol such as UDP.
<Image data > can have the following formats:
- <Image data 1> = <CU stream> corresponding to the first <number> of remaining subbands - <Image data 2> =. <CU stream> corresponding to the first <number> of remaining bit planes - <Image data 3> = <CU stream> corresponding to the first <number> remaining subbands of the ROI <ROI number>
- <Image data 4> = <CU stream> corresponding to the first remaining <number> bit planes of the ROI <ROI number>
- <Image data 5> = <CU stream> corresponding to the CU's specified in <Image data request 5>

Cl- 02348622 2001-04-18 WO 0=4188 PGT/SE99lO1847 Several different formats of <CU stream> are possible:
- <CU stream 1> = <header> <Length C[71> <Length CU2> ... <Length CUN> <CU1> <CU2> ... <CUN>
- <CU stream 2> = <header> <Length CU1> <CU1> <Length CU2>
<CU2>... <Length CUN><CUN>
- <CU stream 3> = <header> <Tag 1> <CU1> <Tag2> CU2> ... <Tag N><CUN>
- <CU stream 4> = <header> <CU1> <Tagi> <CU2> <Tag 2>... <CUN>
<Tag N>

The image header is not required 4 5 it already has been received by the client.

<Image transcoding header> contains a description of the transcoding operations that was performed on the original image in order to produce the transcoded image. The client use this information to map CU's from the original image to the transcoded image and to map CU's from the transcoded image to the original image.

<image posting notification> is used for telling the client that the transcoded image is stored at the server. It gives the URL_ of the transcoded image. A time-out can optionally be including indicatju5'that the image will be saved only for a specified time.
In Fig. 2 a first embodiment of the present invention is shown.
Thus, in this case the client wants to access parts of the stored image. This could be certain bit planes, subbands or pre-stored Regions of Interest. In this case the server do not use any special functions to respond to the request except the ones used in the communication protocol (e.g. HTTP). A process for this is shown in Fig. 2.

Step 201, the client sends ft- request for a stored image. The image is stored as a compressed bit stream and in a format comprising independently coded coding units (CU).
Step 203, the server responds and starts the transmission.
Step 205, the client decides that a part of the image is more important. The Client gets the information of where it is stored from the image header, and sends a request to the Server for the desired part. The part can be an ROI or image data, which increases the quality of the whole image.
Step 207, the Server may now send a re-start mark and starts the transmission of the wanted CU's.

The re-start marker functionality can also be provided by a lower protocol in the stack, e.g. TCP or HTTP. The re-start marker can optionally be excluded if it can be derived from information in the lower protocol levels.

In Fig. 3 another type of client server process is shown. In the process shown in Fig.3, no advanced processing is performed at the server side.In the example described in conjunction with Fig. 3, a Client starts receiving an image and then in the middle of the transmission decides that some part of the image is more vital and only want that part to be transmitted. This could be a number of bit planes, subbands or Regions of Interest. It should be noted that in this case the image could be stored with a Region of Interest (ROI) but the user wants to select another ROI.

In such a case the server has to use some additional functions for finding the requested parts of the compressed image. The interaction between the Client and the Server and the operation at each sides can then be as follows, acknowledgement messages and similar massages are not shown for clarity reasons. The can for example use IP, TCP/UDP, HTTP or similar protocols for such messages.

Step 301, a client sends and requests for a stored image. The image is stored as a compressed bit stream and in a format having independently coded coding units (CU).
Step 303, the Server responds and starts the transmission Step 305, the Client decides that a part of the image is more important and if a Region of Interest is selected it also sends the shape of the selected region and some other information needed. This could be, e.g., the chronological number of the ' WO 00l24188 PCT/SE99/01847 request, the number of CU's or bytes received, marked with (*) in Figure 4. At this point the Client has created a mask in the transform domain, for example using the method described in Charilaos Christopoulos (editor), JPEG 2000 Verification Model Version 1.2, ISO/IEC JTCI/SC29/WG1 N982, August 14, 1998, that selects the coefficients needed for _ the.._server ._to . deGide what CU's are needed from the Server.
Step 307, the Server gets the request. The server uses information in the bit stream, such as TAGS, in order to find the desired CU's. The server now sends a re-start mark and if needed the lengths of the remaining CU's. It then starts the transmission of the requested CU's.

In the following, the situation where a Client starts receiving an image and then. in the middle of the transmission decides that some part of the image is more vital and only want that part to be transmittedjis dealt with. This is also known as selection of Region of Interest. It should be noted that in this case the image could be stored with a Region of Interest (ROI) but the user wants to select another ROI. In the example below the JPEG2000 progressive-by-resolution (PBR) scheme is used. A
similar method can however be applied in progressive-by-accuraqy (PBA) schemes, as is described in Charilaos Christopoulos (editor), JPEG 2000 Verification Model Version 1.2, ISO/IEC
JTC1/SC29/WG1 N982, August 14, 1998.

In Fig. 4, the progressive-by-resolution scheme in JPEG2000, is shown. In the PBR mode of JPEG2000 each subband can, in a simplified way, be viewed as a coding unit, CU, since the whole subband is independently entropy coded. This is the case if the so called non-adaptive mode is used, since in this case a subband is the same thing as a sequence. This will make it possible to entropy decode any subband independently if the Client knows where to find it in the bit stream. In the very basic mode of JPEG2000 this is supported by an array, that is stored in the image header, containing the lengths of each CU in bits/bytes. Thus it is possible for the Client to parse the bit stream since it knows the length of each entropy-coded subband.

wo 00R4188 PCT/SE99/01847 The client sends a request to a server and requesting a stored image. The image is stored as a compressed bit stream. The server gets the bit stream and starts the transmission.
In a preferred embodiment, the interaction between the Client and the Server and the operation at each sides is as follows, acknowledgement messages and similar messages are left out for reasons of clarity.

-First the client sends and requests for a stored image. The image is stored as a compressed bit stream and in a CU format.
- The Server then responds and starts the transmission - At some point during the transmission, the Client decides that a part of the image is more important and sends the shape of the selected region and some other information needed. This can, e.g., be the chronological number of the request, the number of CU's or bytes received, marked with (*) in Figure 4.
- The Server then gets the request for the ROI and performs an entropy decoding for the CU's that has not been sent. In this case it is the subbands that not have been sent yet. The entropy decoding will give the quantized.,_transform coefficients. The server creates a mask in the transform domain. Then the server can select the coefficients that are needed for the Region of Interest, for example using the method described in Charilaos Christopoulos (editor), JPEG 2000 Verification Model Version 1.2, ISO/IEC JTCI/SC29/WG1 N982, August 14, 1998. Thus, by using the mask the Server selects which coefficients are needed in each of the remaining subbands. The quantized coefficients belonging to the Region of Interest are then entropy encoded subband wise. Thus, the same CU structure is kept. The Server may now send a re-start mark and the lengths of the CU's to be ,.... . ..
sent and starts the transmission_., of t~.e.~Q! s...
- The Client gets the response from the server describing what type of transcoding that have been used. The C1ientthen creates the desired. mask in the transfo_rm_clQmain, for example using the method described in Charilaos Christopoulos (editor), JPEG 2000 Verification Model Version 1.2, ISO/IEC JTC1/SC29/WG1 N982, August 14, 1998 that selects the coefficients needed for the response from the Server.

WO dKl/24188 PCT/SE99/01847 From the Client point of view the result will be that the Region of Interest will have full resolution, while the background will have a reduced resolution (which could improve in later stages if the method described above using the shifting is used). The amount of reduction of course depends on when the Region of Interest request was done.

If the request for the Region of Interest hits in the middle of a CU, which will be the most probable case, there are two ways of proceeding. Either the CU where the request hit is re-transmitted, or the transmission of the CU is completed and then the re-coding.starts.

In the case of the progressive-by-accuracy mode in JPEG2000 the same idea as in the previous example can be used without any major changes. In this case a CU is a bit plane. Thus, the bit stream is ordered by accuracy. First the highest bit plane is transmitted and then the second highest and so on.

The interaction between the Client and the Server and the operation at each sides are the following, where acknowledgement messages and similar messages are left out.

- First the client sends and requests for a stored image. The image is stored as a compressed bit stream and in CU format.
- The Server responds and starts the transmission.
- The Client decides that a part of the image is more important and sends the shape of the selected region and some other information needed. This could, e.g., be the chronological number of the request, the number of CU's or bytes received, marked with (*) in Figure 4. At this point the Client has created a mask in the transform domain, for example using the method described in Charilaos Christopoulos (editor), JPEG 2000 Verification Model Version 1.2, ISO/IEC JTCl/SC29/WG1 N982, August 14, 1998, that selects the coefficients needed for the response from the Server.
- The Server gets the request for the ROI and performs an entropy decoding for the CU's that has not been sent. In this case it is the bit planes that not have been sent yet. The ' WO 00/24188 PCT/SE99/01847 entropy decoding will give the remaining parts of the quantized transform coefficients. The server creates a mask in the transform domain. Then the server can select the coefficients that are needed for the Region of Interest, for example using the method described in Charilaos Christopoulos (editor), JPEG
2000 Verification Model Version 1.2, ISO/IEC JTC1/SC29/WG1 N982, August 14, 1998. Thus, by using the mask the Server selects which coefficients are needed in each of the bit planes. The remaining parts of the quantized coefficients belonging to the Region of Interest are then entropy encoded bit plane wise.
Thus, the same CU structure is kept. The Server can now send a re-start mark and the lengths of the CU's to be sent and starts the transmission of the CU's.

Instead of having a reduction of the resolution in the background, as in the previous example, the accuracy of the pixels not belonging to the Region of Interest is reduced. This is done by simply skipping the remaining bit planes for bit planes belonging to the background.

On receiving a request, the server transcodes the original image. The transcoded image is either sent to an output buffer, processes C1 and C2 below or posted as a new image, process C3 below. A new client request will always refer to a posted image either the original image as in Cl and C2, see below, or the posted transcoded image as in C3, see below. The client is responsible for transforming between image formats so that received image information referring to the original image can be reused in the client's copy of the transcoded image.
Successful reuse is reported to the server in <Image data acknowledge> messages.

Client-Server process Cl (optimized for download speed) This process could start without any previous transfer of image information. A client-server process according to cases described above in conjunction with Figs 2 or 3, might, however, have occurred. Some of the CUs of the original image might have been transferred to the client during this process. The client knows about this previous activity but the server does not store any such state information.

- Client request 1) <request number> <Image data acknowledge>
<Image data request>
- Server response 1) <restart marker> <request number> <image transcoding header> <image header> <CU stream> (the header of the transcoded image is sent) If the client does not understand the new format, it can interrupt the stream at the TCP level. A new set of client-server exchanges can continue. They will always refer to the original image since the transcoded image usually is not kept by the server. If a new request according to case occurs, the server will then usually repeat the transcoding operation.
The server might decide to save a cached copy of the transcoded image but this cannot be assumed by the client.

Client-Server process C2 (optimized for low bandwidth) This process can also start without any previous transfer of image information. A client-server process according to cases described above in conjunction with Figs 2 or 3, might, however, have occurred. Some of the CUs of the original image might have been transferred to the client during this process. The client knows about this previous activity but the server does not store any such state information.

- Client request 1) <request number> <Image data acknowledge>
<Image data request>
- Server response 1) <restart marker> <request number> <image transcoding header> <image header> (the server has only calculated the header of the transcoded image. A complete transcoding has not been performed) - Client request 2) <request number> <Image header acknowledge>
<Image data acknowledge> <Image data request> (The client confirms that it can handle the transcoded format. The request is repeated since the server does not save the old request) - Server response 2) <restart marker> <request number> <CU

stream> (the server performs a complete transcoding and sends the body of the image fiZe to the output buffer) Client-Server process C3 (a transcoded image is posted by the server) This process could start without any previous transfer of image information. A client-server process according to cases described above in conjunction to the Figs 2 or 3 might, however, have occurred. Some of the CUs of the original image might have been transferred to the client during this process.
The client knows about this previous activity but the server does not store any such state information.

- Client request 1) <request number> <Image data acknowledge>
<Image data request>
- Server response 1) <restart marker> <request number> <image transcoding header> <image header> <image posting notification>
- Client request 2) (the client is now addressing the posted transcoded image at the http protocol level) <request number> <Image header acknowledge> <Image data acknowledge> <Image data request>
(The client is responsible for transforming CIIs from the original image to the format of the transcoded image. The result of these operations is put in the <Image data acknowledge> ) - Server response 2) <restart marker> <request number> <CU
stream>

A new set of client-server exchanges can continue. They can refer to the original or transcoded image according to decisions by the client.

It should be noted that in some situations the number of received CU's or bits/bytes is not needed. This is the case if the Client continues to receive image data after the request(s) has been sent. The Server sends the re-start mark and maybe some other info in order to inform the Client that from now on the requested bit plane, subband or Region of Interest is coming.

WO=00/24188 PCT/SE99/01847 Below additional examples of interactive selection of Regions of Interest during transmission from bit streams when the stream does not contain the desired Region of Interest are described.
The examples illustrates the different bit stream formats <CU
stream 1> - <CU stream 4>

Above, in conjunction with Fig. 4, the PBR-mode of the JPEG2000 coder is described. A modification of the scheme described above would be to send the length of the CU together with the data.
Thus, when the Server gets the request for the ROI and performs an entropy decoding for the CU's that has not been sent. Instead of sending a re-start mark and the lengths of the CU's to be sent and starts the transmission of the CU's, the Server can now send a re-start mark and the length of the following CU.
The resulting Client-Server process is shown in Fig. 5. This will result in that there is no need to re-send the array of CU
lengths as shown in Fig. 4.

It is also possible to use TAGS or re-sync marks in the bit stream. Thus instead of having an array describing the length of each CU above in conjunction with Fig. 4, the CU can be marked out in the bit stream by a bit pattern that is not generated by the entropy coder. The bit stream is searched in a sequential manner in order to find the different coding units.
The interaction between the Client and the Server and the operation at each sides is changed so that instead of sending a re-start mark and the lengths of the CU's to be sent and starts the transmission of the CU's, the Server can send a re-start mark and a TAG before the corresponding CU. The resulting Client-Server process is shown in Fig. 6.

It should be noted that an alternative way is to use send the TAGS after each CU or header instead of before the CU as is shown in Fig. 7. Thus, the interaction between the Client and the Server and the operation at each sides is changed so that instead of sending a re-start mark and the lengths of the CU's to be sent and starts the transmission of the CU's, the Server sends a re-start mark and a TAG after the corresponding CU.

Another solution could be to use the "scaling based method" in JPEG2000 for the rest of the subbands. This means that the ROI
mask for the remaining subbands still is produced, but no different encoding of the ROI mask coefficients must be performed. The ROI mask coefficients are scaled up by a certain factor. Then encoding of the subbands will continue without changes. The shifting value must be stored in the bit stream, so the Client can shift down. Thus, the interaction between the Client and the Server and the operation at each sides is changed so that instead of sending a re-start mark and the lengths of the CU's to be sent and starts the transmission of the CU's, the Server can now send a re-start mark and a TAG after the corresponding CU.

In the schemes described above in conjunction with Figs. 4 - 7, the Server needs to perform an entropy decode and then an entropy encode of the quantized coefficients. This is not so good if a really fast access of different parts of the image is desired.

The solution to this problem is that the image is divided into blocks that are independently decodable. These will be the CU's.
The interaction between the Client and the Server and the operation at each sides are the following is shown in Fig. 8. It should be noted that acknowledgement messages and similar messages are left out.

- Step 801, The client sends and requests for a stored image.
The image is stored as a compressed bit stream.
- Step 803, The Server responds and starts the transmission - Step 805, The Client decides that a part of the image is more important and creates a mask in the transform domain, see Ref.
1, that selects the CU's needed. The desired CU's is sent to the Server.
- Step 807, The Server gets the request for the CU's. The Server may now send a re-start mark and the TAG for is before its corresponding CU.

The method and system as described herein provides a number of advantages compared with prior client - server systems for retrieving images. Thus, the Server does not need any memory to store information of what parts it has sent. In the first embodiment the server does not need to perform any processing whatsoever in order to give the client the wanted desired parts of the bit stream. The Client will get the information of where the requested parts are stored from the image header.
In the first and second embodiment, the Server does not need to perform any entropy decoding, it only has to send the requested CU's. Thus, decreasing the transmission time dramatically. In the third embodiment the Server does not have to decode that whole bit stream. This will save a lot of time at the sender side (server side), since it not needs to a full decoding of the stream.

The method and system as described herein can also be extended to be used together with a video compression algorithm that have independent decodable units in the compressed video stream.

Claims (12)

1. A method of transmitting an image, which is stored as a number of independently decodable coding units, between a server and a client, the method comprising the steps of:
- transmitting a request for image data from the client to the server, - starting transmission of the requested image data from the server to the client, - transmitting a request for a new part of the image during or after transmission thereof, said request comprising information on which image information the client is interested in and which information about the image the client already has access to, and - transmitting the requested new part of the image from the server to the client using only coding units not already transmitted.
2. A method according to claim 1, characterized in that the image is stored in the transform domain.
3. A method according to any one of claims 1-2, characterized in that each request from the client comprises a request number.
4. A method according to any of claims 1-3, characterized in that the server after having transmitted requested information to the client directly discards all information provided by the client.
5. A method according to any of the claims 1 to 4, characterized in that the server transmits a marker code prior to transmitting requested coding units.
6. A method according to any one of claims 1 to 5, characterized in that the server performs a transcoding before transmitting the new image part.
7. A server in connection with a client, wherein images are stored as a number of coding units in the server, the server comprising:
- means for receiving a request for image data from the client, - means for transmitting the requested image data to the client, - means for receiving a request for a new part of the image during or after transmission thereof, the request from the client comprising information on which image information the client is interested in and which information about the image the client already has access to, and - means for transmitting the requested new part of the image to the client using only coding units not already transmitted.
8. A server according to claim 7, characterized by means for storing the images in the transform domain.
9. A server according to any one of claims 7-8, wherein each request from the client comprises a request number.
10. A server according to any of the claims 7-9, characterized in that the server is arranged to directly discard all information provided by client after having processed it.
11. A server according to any of claims 7-10, characterized in that the server is arranged to transmit a marker code prior to transmitting requested coding units.
12. A server according to any of claims 7-11, characterized in that the server is arranged to perform a transcoding of the coding units not already transmitted before transmitting the new image part.
CA002348622A 1998-10-21 1999-10-13 Partial retrieval of images in the compressed domain Expired - Lifetime CA2348622C (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
SE9803593-4 1998-10-21
SE9803593A SE513353C2 (en) 1998-10-21 1998-10-21 Partial image retrieval in the compressed domain
PCT/SE1999/001847 WO2000024188A1 (en) 1998-10-21 1999-10-13 Partial retrieval of images in the compressed domain

Publications (2)

Publication Number Publication Date
CA2348622A1 CA2348622A1 (en) 2000-04-27
CA2348622C true CA2348622C (en) 2009-08-18

Family

ID=20413027

Family Applications (1)

Application Number Title Priority Date Filing Date
CA002348622A Expired - Lifetime CA2348622C (en) 1998-10-21 1999-10-13 Partial retrieval of images in the compressed domain

Country Status (10)

Country Link
US (1) US7571382B2 (en)
EP (2) EP1127452B1 (en)
JP (1) JP4764549B2 (en)
KR (1) KR100595400B1 (en)
CN (1) CN1166171C (en)
AU (1) AU766874B2 (en)
CA (1) CA2348622C (en)
DE (2) DE69935729T2 (en)
SE (1) SE513353C2 (en)
WO (1) WO2000024188A1 (en)

Families Citing this family (28)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5748786A (en) * 1994-09-21 1998-05-05 Ricoh Company, Ltd. Apparatus for compression using reversible embedded wavelets
US6549666B1 (en) * 1994-09-21 2003-04-15 Ricoh Company, Ltd Reversible embedded wavelet system implementation
US6873734B1 (en) * 1994-09-21 2005-03-29 Ricoh Company Ltd Method and apparatus for compression using reversible wavelet transforms and an embedded codestream
US6898323B2 (en) * 2001-02-15 2005-05-24 Ricoh Company, Ltd. Memory usage scheme for performing wavelet processing
US7062101B2 (en) * 2001-03-30 2006-06-13 Ricoh Co., Ltd. Method and apparatus for storing bitplanes of coefficients in a reduced size memory
US6950558B2 (en) * 2001-03-30 2005-09-27 Ricoh Co., Ltd. Method and apparatus for block sequential processing
US6895120B2 (en) * 2001-03-30 2005-05-17 Ricoh Co., Ltd. 5,3 wavelet filter having three high pair and low pair filter elements with two pairs of cascaded delays
US7581027B2 (en) * 2001-06-27 2009-08-25 Ricoh Co., Ltd. JPEG 2000 for efficent imaging in a client/server environment
US7284069B2 (en) * 2002-01-11 2007-10-16 Xerox Corporation Method for document viewing
US7120305B2 (en) * 2002-04-16 2006-10-10 Ricoh, Co., Ltd. Adaptive nonlinear image enlargement using wavelet transform coefficients
JP2003333569A (en) * 2002-05-13 2003-11-21 Sony Corp File format, information processing system, information processing apparatus and method, recording medium, and program
US7734824B2 (en) 2002-10-18 2010-06-08 Ricoh Co., Ltd. Transport of reversible and unreversible embedded wavelets
FR2842378B1 (en) * 2002-07-15 2005-02-04 Canon Kk METHOD AND DEVICE FOR PROCESSING A QUERY OR COMPRESSED DIGITAL DATA
US7200615B2 (en) 2003-10-16 2007-04-03 Xerox Corporation Viewing tabular data on small handheld displays and mobile phones
US7620892B2 (en) 2004-07-29 2009-11-17 Xerox Corporation Server based image processing for client display of documents
US7539341B2 (en) 2004-07-29 2009-05-26 Xerox Corporation Systems and methods for processing image data prior to compression
US7721204B2 (en) * 2004-07-29 2010-05-18 Xerox Corporation Client dependent image processing for browser-based image document viewer for handheld client devices
CN101147174B (en) * 2004-10-15 2011-06-08 微软公司 System and method for managing communication and/or storage of image data
JP4716949B2 (en) * 2005-09-02 2011-07-06 株式会社リコー Image processing apparatus and image processing method
US8812978B2 (en) 2005-12-22 2014-08-19 Xerox Corporation System and method for dynamic zoom to view documents on small displays
JP4656190B2 (en) * 2008-06-10 2011-03-23 ソニー株式会社 Information processing apparatus and method
US8909806B2 (en) * 2009-03-16 2014-12-09 Microsoft Corporation Delivering cacheable streaming media presentations
US9237387B2 (en) 2009-10-06 2016-01-12 Microsoft Technology Licensing, Llc Low latency cacheable media streaming
US8356114B2 (en) 2010-04-15 2013-01-15 Canon Kabushiki Kaisha Region of interest-based image transfer
US8755441B2 (en) 2010-05-10 2014-06-17 Canon Kabushiki Kaisha Region of interest-based video transfer
US9407876B1 (en) * 2010-09-14 2016-08-02 Pixia Corp. Method and system for encoding and decoding multiple wide-area surveillance area-of-interest video codestreams
US9747010B2 (en) 2014-01-16 2017-08-29 Xerox Corporation Electronic content visual comparison apparatus and method
CN106664439B (en) * 2014-07-30 2020-04-03 Sk普兰尼特有限公司 Cloud streaming server

Family Cites Families (26)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE3820038A1 (en) * 1988-06-13 1989-12-14 Ant Nachrichtentech METHOD FOR PROCESSING AND TRANSMITTING AN IMAGE SEQUENCE
US5444550A (en) * 1989-04-28 1995-08-22 Canon Kabushiki Kaisha Image processing apparatus
WO1991015831A1 (en) * 1990-04-05 1991-10-17 Seiko Epson Corporation Page description language interpreter
DE69232164T2 (en) * 1991-08-22 2002-07-18 Sun Microsystems Inc Network video provider device and method
US5327248A (en) * 1992-03-23 1994-07-05 Ricoh Company, Ltd. Compressed image virtual editing system
US5253055A (en) * 1992-07-02 1993-10-12 At&T Bell Laboratories Efficient frequency scalable video encoding with coefficient selection
JPH07107255A (en) * 1993-10-04 1995-04-21 Fujitsu Ltd Image information transfer control system
US5966465A (en) * 1994-09-21 1999-10-12 Ricoh Corporation Compression/decompression using reversible embedded wavelets
US5678007A (en) * 1994-11-22 1997-10-14 Microsoft Corporation Method and apparatus for supporting multiple outstanding network requests on a single connection
US5764235A (en) * 1996-03-25 1998-06-09 Insight Development Corporation Computer implemented method and system for transmitting graphical images from server to client at user selectable resolution
US6006231A (en) * 1996-09-10 1999-12-21 Warp 10 Technologies Inc. File format for an image including multiple versions of an image, and related system and method
US5838927A (en) * 1996-11-22 1998-11-17 Webtv Networks Method and apparatus for compressing a continuous, indistinct data stream
US5991816A (en) * 1996-12-13 1999-11-23 Wisconsin Alumni Research Foundation Image transfer protocol in progressively increasing resolution
US6182127B1 (en) * 1997-02-12 2001-01-30 Digital Paper, Llc Network image view server using efficent client-server tilting and caching architecture
US6049892C1 (en) * 1997-02-24 2002-06-04 Ethos Software Corp Process and apparatus for downloading data from a server computer to a client computer
US6535878B1 (en) * 1997-05-02 2003-03-18 Roxio, Inc. Method and system for providing on-line interactivity over a server-client network
JP3213582B2 (en) * 1997-05-29 2001-10-02 シャープ株式会社 Image encoding device and image decoding device
JPH1188866A (en) * 1997-07-18 1999-03-30 Pfu Ltd High-definition image display device and program storage medium therefor
SG116400A1 (en) * 1997-10-24 2005-11-28 Matsushita Electric Ind Co Ltd A method for computational graceful degradation inan audiovisual compression system.
US6182114B1 (en) * 1998-01-09 2001-01-30 New York University Apparatus and method for realtime visualization using user-defined dynamic, multi-foveated images
US6256415B1 (en) * 1998-06-10 2001-07-03 Seiko Epson Corporation Two row buffer image compression (TROBIC)
US6496607B1 (en) * 1998-06-26 2002-12-17 Sarnoff Corporation Method and apparatus for region-based allocation of processing resources and control of input image formation
JP2000048036A (en) * 1998-07-28 2000-02-18 Canon Inc Image processor and its method
SE9803454L (en) * 1998-10-09 2000-04-10 Ericsson Telefon Ab L M Procedure and system for coding ROI
US6201897B1 (en) * 1998-11-09 2001-03-13 Earth Resource Mapping Transformation and selective inverse transformation of large digital images
US6546143B1 (en) * 1999-03-12 2003-04-08 Hewlett-Packard Development Company Efficient wavelet-based compression of large images

Also Published As

Publication number Publication date
EP1715672A3 (en) 2006-11-15
CA2348622A1 (en) 2000-04-27
CN1166171C (en) 2004-09-08
DE69941743D1 (en) 2010-01-14
JP2002528969A (en) 2002-09-03
JP4764549B2 (en) 2011-09-07
US20030110299A1 (en) 2003-06-12
EP1715672B1 (en) 2009-12-02
EP1127452B1 (en) 2007-04-04
AU1425200A (en) 2000-05-08
DE69935729T2 (en) 2007-08-16
KR20010085937A (en) 2001-09-07
KR100595400B1 (en) 2006-07-03
WO2000024188A1 (en) 2000-04-27
SE513353C2 (en) 2000-08-28
AU766874B2 (en) 2003-10-23
CN1326637A (en) 2001-12-12
SE9803593L (en) 2000-04-22
EP1127452A1 (en) 2001-08-29
SE9803593D0 (en) 1998-10-21
US7571382B2 (en) 2009-08-04
EP1715672A2 (en) 2006-10-25
DE69935729D1 (en) 2007-05-16

Similar Documents

Publication Publication Date Title
CA2348622C (en) Partial retrieval of images in the compressed domain
JP4664916B2 (en) Data compression
JP4709493B2 (en) Method and product for communicating compressed digital images
US5945930A (en) Data processing apparatus
US20040136598A1 (en) Method and device for selecting data in a communication network
Lee JPEG 2000: Retrospective and new developments
JP4716949B2 (en) Image processing apparatus and image processing method
US7460724B2 (en) JPP-stream to JPEG 2000 codestream conversion
CN1717047A (en) Data streaming file, method and system for moving data streaming service
JP2004274759A (en) Communication method and device for compressed digital image with limited access and server/client transfer
JP2004519038A (en) How to transfer a conforming object
JP2006295886A (en) Image processing system, program, and recording medium
EP1076459A2 (en) Data transfer system and method
JP4086728B2 (en) Image communication method and system
JP4773770B2 (en) Image processing system, image processing method, program, and recording medium
Hara An implementation of JPEG 2000 interactive image communication system
Rosenbaum et al. Remote display of large raster images using jpeg2000 and the rectangular fisheye-view
JP3014199B2 (en) Image cutout processing method
Boliek et al. JPEG 2000 for efficient imaging in a client/server environment
JP4024157B2 (en) Electronic information transmission method, facsimile apparatus, information processing apparatus, program, and storage medium
Ortíz et al. Improved JPIP protocol with proxy caching

Legal Events

Date Code Title Description
EEER Examination request
MKEX Expiry

Effective date: 20191015