Sign In to Follow Application
View All Documents & Correspondence

A Coding Method And An Apparatus

Abstract: The present invention provides an image coding method and an image decoding method by which an image can be restored correctly even if part of memory management information is lost by a transmission channel error, a candidate of a reference image that can be referred to is selected more appropriately, and coding efficiency is improved. The image coding method includes a step for executing coding of an image (Step 100), a step for judging whether a picture in the memory which is never used as reference exists (Step 102), a step for coding memory management information for releasing the picture in the memory which is never used as reference when a picture in the memory which is never used as reference exists (Step 103), a step for releasing the picture in the memory which is never used as reference (Step 104), a step for judging whether the memory management information that releases the picture in the memory which is never used as reference is coded by coding of an image immediately before (Step 105), and a step for coding again the memory management information that releases the picture in the memory which is never used as reference when the memory management information is coded (Step 106).

Get Free WhatsApp Updates!
Notices, Deadlines & Correspondence

Patent Information

Application #
Filing Date
03 February 2010
Publication Number
31/2010
Publication Type
INA
Invention Field
COMPUTER SCIENCE
Status
Email
Parent Application
Patent Number
Legal Status
Grant Date
2018-04-26
Renewal Date

Applicants

PANASONIC CORPORATION
1006, OAZA KADOMA, KADOMA-SHI, OSAKA 571-8501

Inventors

1. KADONO, SHINYA
7-25-204, KOSHIENGUCHI 1-CHOME, NISHINOMIYA-SHI, HYOGO 663-8113
2. ABE, KIYOFUMI
16-1-213, MIYAMAE-CHO, KADOMA-SHI, OSAKA 571-0074
3. KONDO, SATOSHI
7-17, OTOKOYAMASHIGETSU, YAWATA-SHI, KYOTO 614-8361
4. HAGAI, MAKOTO
22-402, OEDAMINAMI-MACHI, MORIGUCHI-SHI, OSAKA 570-0051

Specification

DESCRIPTION Technical Field The present invention relates to an image coding method for compressing a moving picture signal efficiently utilizing correlation between pictures, an Image decoding method for decoding the moving picture correctly and a program for compressing the moving picture by software. Background Art In recent years, a multimedia that integrates audio, video and other information relating to the audio and the video have been popular; conventional Information media, namely, a newspaper, a magazine, a TV, a radio, a telephone would be integrated into the multimedia. In general, multimedia relates and represents not only letters but also graphics, a voice and particularly an Image. To make the conventional Information media the multimedia, it is essential to represent the Information In a digital form. Whereas, when information quantity of the each information media is estimated, the Information quantity per letter is 1~2 bytes, while that of the voice per second needs more than 64kblts (quality of telephone conversation) and further that of a moving picture per second needs more than 100Mbits (standard TV broadcasting quality) and therefore it is not realistic to deal the enormous Information of the information media as-ls In the digital form. For example, a TV telephone has been already In practical use by ISDN (Integrated Service Digital Network) that has the transmission speed of 64kbps~l.5Mbps but It is impossible to transmit videos of a TV and a camera directly through ISDN. Then, a technology for compressing information becomes necessary. For example, In the case of a TV telephone, the moving picture compression teclnnology of H.261 or H.263 standard standardized Internationally by ITU-T (International Telecommunication Union Telecommunication Standardization Section) is used. Additionally, it Is possible by I^PEG-1 standard to contain Image information together with voice Information in an ordinary musical CD (Compact Disk). Here, MPEG (Moving Picture Experts Group) is an international standard for digital compression of a moving picture signal and MPEG-1 is a standard for compressing the moving picture signal to 1.5Mbps, namely, about one-tenth of the Information of a TV signal. Additionally, the transmission speed whose subject is MPEG-1 standard is mainly limited to about 1.5Mbps; by MPEG-2 standardized to satisfy further demand for high Image quality, the moving picture signal is compressed to 2~15 Mbps. Further, in the present circumstances, by the working group (ISO/IEC 3TC1/SC29/WG11) that has carried on the standardization of MPEG-1 and MPEG-2, MPEG-4 that has further higher compression ratio has been standardized, MPEG-4 not only makes it possible first to execute cording highly efficiently with a low bit rate, but also powerful error resistance technology Is introduced. The technology can minimize subjective Image quality degradation even If an error In a transmission Channel occurs. Furthermore, ISO/IEC and ITU-T jointly carry on standardization activity of 3VT (Joint Video Team) as a next generation screen coding method; at the present moment, what is called Joint Model 2 (JM2) is the latest. Different from the conventional moving picture coding, 3VT can select an arbitrary Image (picture) out of plural images (pictures) as a preceding reference Image. Here, a picture represents a frame or a field. Fig. lA is a diagram that explains the image coding that executes coding referring to a selected Image out of plural reference images stored in a rriemory. Fig. IB is a structure diagram that shows the structure of the memory that stores Images. As shown in Fig. IB, the memory is made up of short term memory and long term memory. The short term memory memorizes several images coded/decoded immediately before and corresponds to reference Images of so-called a P picture (Predictive Coded Picture) and a B picture (Bl-predictive Coded Picture) of MPEG-1 and MPEG-2, The long term memory is used to store an image signal longer than the short term memory. Ordinarily, the short term memory is an FIFO (first in, first out) memory. In the case of storing an image over the upper limit of the memory, the oldest image in the short term memory Is released and a new image is stored in the area. Consequently, ordinarily to refer Jto,a reference image that has been released from the memory by the mechanism of FIFO, it is possible to refer to the reference image for a long time by moving the reference image in advance from the short term memory to the long term memory and storing the image in the long term memory. The long term memory Is a method for clearly designating storage area; It is possible to refer to the picture stored In the area unless the same area is designated and overwritten. Fig. lA shows predictive situation at the time of, image coding; the Image of the picture (frame) No. 2 refers to the image of the picture No. 0; the Image of the picture No. 1 refers to the Image of the picture No. 0 or the picture No. 2. Similarly, the Image of the picture No. 4 refers to the Images of the picture Nos. 0 and 2; the image of the picture No. 6 refers to the image of the.picture No. 0. Further, the image of the picture No. 5 can refer to the inriages of the picture Nos.. 0,2, 4 and 6. Now, In this Fig. lA, the Images of the picture Nos. 0, 6 and 12 are referred to after relatively long time, while the Images of the picture Nos. 2, 4 and 8 are referred to only by Images short time later. Consequently, as Is shown. In Fig. IB, the memory area to store images is divided into the short term memory and the long term memory; the images of the picture Nos. 0, 6 and 12 can be stored in the memory that needs the long time storage. Now, to use the memory shown in Fig. lA effectively needs sophisticated memory management; a mechanism to control the memory is introduced in JVT. Commands for controlling the memory are as follows: 1. The command for selecting images that can be referred to; 2. The command for releasing the memory area that stores the images that are useless as the reference images of the predictive coding in the short term memory; and 3. The command for moving the contents of the short term memory to the long-term'memory. - In coding and decoding an image, since the Image that has a small prediction error In the unit of block is selected out of the images that can be referred to, a signal that designates the reference images In the unit of block is necessary. By electing in advance the images that can be referred to, it is possible to reduce the number of candidates of the reference Images Into an appropriate value and to cut down the number of bits of the reference Image designation signal that is necessary in the unit of block. Additionally, In the case of moving Images from the short term memory to the long term memory, since It is useless to store the Images of the same contents In both of the short term memory and the long term memory, the Images In the short term memory are released. Fig. 2A and Fig. 2B are flowcharts that show a conventional image coding method and a conventional Image decoding method. Fig. 2A shows operations that an image coding device executes to release the memory area that stores the pictures that are never used as the reference images in the predictive coding. In Fig. 2A, for a start, the image coding device codes the inputted image (Step 100). After the coding, the image coding device examines whether there is an unnecessary area (the Images that are not referred to in future coding) in the memory (Step 101) and judges whether a picture in the memory which is never used as reference exists or not (Step 102). When the picture In the memory which Is never used as reference is judged to exist (Yes at Step 102), the command for releasing a picture in the memory which is never used as reference is coded as memory management Information (Step 103), a picture in the memory which is never used as reference is released (an Images in the memory are deleted) (Step 104) and the processing ends. On the other hand, in the case of the image coding device judging that there is no picture In the memory which is never used as reference (No at Step 102), the processing ends without executing the operations in Step 103 and Step 104. Next, operations that an image decoding device executes to release the memory area that stores the Images which are never used as reference in the predictive coding is explained based on the flowchart, of Fig. 2B. For a start, the Image decoding device decodes the memory management information (Step 110) and decodes an image signal from a coded signal (Step 111), The image decoding device judges whether a memory release command exists or not as a result of the examination (Step 112). If the memory release command exists (Yes at Step 112), the Image decoding device judges whether there are Images that should be released by the command or whether the memory has been already released (the images have already been deleted) (Step 113). If the Image decoding device judges that the memory has already been released (Yes at Step 112), the image decoding device assumes that It is an ERROR because JVt prohibits transmitting the command for releasing the same image again after releasing the Image from the memory and therefore to release again the memory that has already been released Is the ERROR. On the other hand, if the Image decoding device judges that the memory Is not released (No at Step 113); it releases the memory (Step 114) and ends the processing. If It is judged that there Is no memory release command (No at Step 112), the operations of Step 110 and Step 111 are not executed and the processing ends. By the way, Step 110 and Step 111 are In no particular order and may counterchange. Fig. 3A and Fig. 38 are flowcharts that show another conventional Image coding method and another conventional image decoding method. Fig. 3A shows operations that the image coding device executes to hvove the-images from the short term memory to the long term memory. In Fig. 3A, for a start, the image coding device codes the inputted image (Step 120). After the coding, the image coding device examines whether there are Images that should be moved to the long term memory (Step 121) and judges whether there are the images that should be moved or not (Step 122). If there are the images that should be moved (Yes at Step 122), the image coding device codes a command for indicating how the Images are moved to the long term memory as the memory management Information (Step 123), moves the images to the long term memory based on the command (Step 124) and ends the processing. On the other hand, In the case of the Image coding device judging that there Is no image that should be moved to the long term memory (No at Step 122), the image coding device does not execute the operations of t Step 123 and Step 124 and ends the processing. Next, the operations that the Image decoding device executes to move the images from the short term memory to the long term memory are explained based on the flowchart of Fig. 38. For a start, the image decoding device decodes the memory management information (Step 130). Next, the image decoding device decodes an image signal from a coded signal (Step 131). Then, the Image decoding device judges whether there is a command for moving the images to the long term memory or not in the decoded memory management information (Step 132). If the Image decoding device judges there Is the command (Yes at Step 132), it judges next whether there are images that should be moved by the command or whether the images have already been moved (there is no image because the images are released after the move) (Step 133). JVT prohibits transmitting the command for moving the same Image again to the long term memory after moving the Image to the long term memory. Consequently, in the case of moving the image that has already been moved to the long term memory again to the long term memory. It Is assumed to be the ERROR. Therefore, when the image decoding device judges that the image has already been moved (Yes at Step 133), the image decoding device assumes it to be the ERROR and when the Image decoding device judges that the image Is not moved, the image decoding device moves the Irnage to the long term memory (Step 134) and ends the processing. On the other hand, in the case of the Image decoding device judging that there is no command for moving the image to the long term memory (No at Step 132), the image decoding device does not execute the operations of Step 133 and Step 134 and ends the processing. By the way, Step 130 and Step 131 are In no particular order and may counterchange. Fig. 4A and Fig. 4B are flowcharts that show yet another conventional Image coding method and yet another conventional image decoding method. For a start, operations that the Image coding device executes to select the Image that can be referred to are explained based on the flowchart of Fig. 4A. For a start, the Image coding device selects reference Images that are expected to have a high correiation with coded images (generajiy, reference images that are temporally close) as candidates of the reference Images (Step 200). Next, the Image coding device codes the designation information (a type of memory , management information) that indicates the selected candidates of the reference images (Step 201), refers to and codes an appropriate reference image out of the selected candidates of the reference Images in the unit of block (Step 202) and ends the processing. By the way. Step 201 and Step 202 are in no particular order and may counterchange. Next, operations that the image decoding device executes to select the image that can be referred to are explained based on the flowchart of Fig. 4B. For a start, the image decoding device decodes the designation information, a type of memory management information (Step 210), selects candidates of the reference images from the memory as a result (Step 211), selects an appropriate reference image out of the selected candidates of the reference images in the unit of block, decodes the appropriate reference Image while referring to it (Step 212) and ends the processing. Now, in the conventional image coding methods and the conventional image decoding methods, the Image coding device codes and outputs the command for releasing images which are never used as reference from the memory and the command for moving i mages from the short term memory to the long term memory, and transmits the commands to the Image decoding device, which decodes the commands. The number of this transmission is limited to only one picture and therefore in the case of the picture including the command being lost by a transmission error and the like. It is impossible to decode the Image because the decoding device cannot decode the image placement in the memory correctly. Furthermore, in coding and decoding an image, in the case of selecting a reference image, when the image coding device selects simply the temporally close Images only as the reference image candidates, it is impossible to. execute a most suitable coding considering the scalability (in an example of predictive structure in Fig. lA, it is possible to decode an I picture (Intra Coded Picture) and a P picture (Predictive Coded Picture) even If a B picture (Bi-predictlve Coded Picture) Is not decoded or it is possible to decode other P pictures even If the P pictures of the picture Nos. 4, 10 and 16 are not decoded) for decoding an image. In other words, although the images that are temporally adjacent to the Image of picture No, 6 are the images of picture Nos. 4 and 2, in reality, only the image of picture No. 0 can be referred to, and therefore, If the images of picture Nos. 4 and 2 are included In the candidates of the eference image, the efficiency for coding is not very good. Further, in the conventional image coding methods, since it is prohibited to transmit the command for releasing the image which is lever used as reference and the command for moving the images Tom the short term memory to the,long term memory attaching to an Image that is not stored In the memory, flexible transmission of the commands of mernory management Information is blocked. To prohibit transmitting the commands attaching to the Image that is not stored In the memory has the following reason. Namely, the image that Is not stored In the memory has the least significance; the possibility that it Is not decoded by the scalability Is high; the Image decoding device cannot decode the Image placement correctly because the commands attaching to the Image that Is not stored In this memory are not decoded; the reason to prohibit transmitting the commands attaching to the Image that is not stored in the memory Is to avoid the situation. Disclosure of Invention Accordingly, to solve the above-explained problem, it Is an object of this invention to provide an image coding method and an Image decoding method for restoring an Image correctly even If part of memory management is iost by a transmission channel error and an image coding method and an Image decoding method for selecting candidates of the reference Images that can be referred to more appropriately and Improving coding efficiency. To.solve this problem, the image coding method according to the present Invention Is an image coding method for coding a picture referring to a reference picture selected from plural reference pictures stored in a memory Including: a picture coding step for coding a picture referring to the selected reference picture; a management information coding step for coding memory, manageriient information for eontrolling and managing the" reference pictures stored in the memory attaching to the coded picture; and a management Information recoding step for coding the memory management information again separately from the coding at the management information coding step. As a result, since memory management information is coded and outputted plural times, even If the transmission channel error occurs when the memory management information Is transmitted to the decoding device, the possibility that the picture Is restored correctly becomes high because it Is thinkable that any one of the memory management Information that is transmitted plural times is transmitted and decoded. Additionally, in the management Information recoding step, information that Identifies the coded picture to which the memory management Information is attached In the management information coding step may be attached to the memory management Information that Is coded again. As a result, In the case of the transmission channel error occurring when memory management Information coded first attaching to a coded picture is transmitted, since a coded plctur6 attached to memory management information is Identified, it is possible to detect at which time the transmission channel error occurred. Furthermore, in the management information coding step, when the memory management information is attached to a coded picture that is not stored in the memory, the memory management information may' be also attached to a coded picture stored in the memory in the management Information recodlng step. As a result, since the memory management information Is attached to an important Image that is decoded and stored In the memory, the decoding of the memory management information is executed with reliability and therefore the possibility that a picture is restored correctly becomes hfgh. . - Moreover, the Image decoding method according to the present invention is an image decoding method for decoding a picture referring to a reference picture selected from plural reference pictures stored in a memory, the image, decoding method, including: a step for decoding memory management Information for controlling and managing a reference picture stored In the mpmory; and a step for releasing the memory area when the memory area to be released has not been yet released, and executing no processing to the memory when the memory area to be released has been already released based on the decoded memory management Information, in the case of releasing a picture In the memory which is never used as reference. As a result, even if a decoding device receives memory management information that Indicates to release a picture from, memory plural times, the decoding device does not process It as an error and can decode a picture correctly. Additionally, the Image decoding method according to the present Invention Is an Image decoding method for decoding a picture referring to a reference picture selected from plural reference pictures stored in memory, wherein the memory may include short term memory whose storage time of a reference picture is short and long term memory whose storage time of a reference picture can be longer than the-storage time of the short term memory, and the image decoding method may include: a step for decoding memory management information for controlling and managing a reference picture stored in the memory; and a step for moving the reference picture from the short term memory to the long term memory when a reference picture of a move object exists In the short term memory and executing no move in the memory when a reference picture of a move object does not exist In the short term memory based on the decoded memory management information, in the case of moving the reference picture stored in the memory from the short term memory to the long term memory. As a result, even if a decoding device receives memory management information plural times, the decoding device does not process it as an error and can decode a picture correctly. Furthermore, an image coding method for coding a picture referring to a reference picture selected from plural reference pictures stored in a memory, the image coding method may Includes a step for coding a reference picture stored In the memory whose priority value is higher than a priority value of a coded picture as a candidate of a reference picture. As a result, It is possible to select a candidate of a picture that can be referred to more appropriately and Improve coding efficiency. Moreover, the Image coding method according to the present invention is an Image coding method Including: a step for coding a coded picture; a step for judging whether a reference picture that is not referred to after coding the coded picture exists In memory or not; a step for coding a command that indicates to release a picture In the memory which Is never used as reference after decoding the coded picture by a decoding device that decodes coding data as a command for releasing a picture in the memory which is never used as reference for not being referred to when there is the reference picture that is not referred to; a step for releasing a picture In the memory which is never used as reference; and a step for coding a command that indicates to release a picture in the memory which is never used as reference before the below-mentioned other coded picture is decoded when another coded picture coded after the coded picture is coded. Asa result, even if the first command that indicates to release a picture in the memory which is never used as reference is dropped, the command transmitted next Is executed before decoding of the picture and therefore It Is possible to reduce the delay In executing the command. Additionally, the Image decoding method according to the present invention Is an image decoding method including: a step for decoding memory management information for managing memory attaching to a decoded picture; a first judgment step for judging whether the memory management Information Is a command used before decoding that indicates to execute processing for managing memory before decoding the decoded picture; a second judgment step forjudging whether processing for managing memory has been already done or not when the memory management information is judged to be the command used before decoding at the first judgment step; and a step for decoding the decoded picture when processing for managing memory is judged to be done by the second judgment step and decoding the decoded picture after processing for managing memory based on the memory management information when processing for managing memory is judged not to be done at the second judgment step. Asa result, even if the first command that indicates to release a picture in the memory which Is never used as reference Is dropped, the command transmitted next Is executed before decoding of the picture and therefore it is possible to reduce the delay in executing the command. Furthermore, the image coding method according to the present invention is an Image coding method including: a step for coding a coded picture; a judgment step for judging whether all reference pictures in memor^y after the coded picture is coded are pictures that are not referred to; a step for coding an initialization command that Is a command for releasing all reference pictures in the memory when all reference pictures in the memory are judged not to be referred to in the judgment step; an initialization step for releasing all reference pictures in the memory; and a step for coding an initialization resending command that is a command that indicates tb release all reference pictures in memory based on added information that makes all reference pictures stored in the memory objects of release before the coded picture released at the time of coding the coded picture when another coded picture coded after the coded picture is coded. As a result, when the Initialization command is transmitted to the decoding device, eyen if the initialization command is dropped by the transmission channel error, it is possible to execute initialization in memory normally based on the added information of ttie initialization resending command. Moreover, the image decoding method according to the present Invention Is an image decoding method including: a step for decoding memory management Information that manages memory attaching to a decoded picture; a step for decoding the decoded picture; an initialization judgment step forjudging whether there Is an Initialization step that Is a command for releasing all reference pictures in memory in the memory management Information; an initialization resending judgment step for judging whether there is an initialization resending judgment command that is a command for releasing all reference pictures in memory based on added information that indicates objects of release in order to release reference pictures stored in the memory before the other decoded picture that should be initialized and released when another decoding picture decoded before the decoded picture is decoded in the memory management information when the initialization command is not judged to exist in the memory management information in the initialization judgment step; an initialization completion judgment step for judging whether all reference pictures in memory are released when the memory management information is judged to be the initialization resending command in the initialization resending judgment step; and a release step for releasing reference pictures In memory based on the addition Informatlan when"all reference pictures are judged not to-be released in the Initialization completion judgment step. As a result, while the Initialization command is transmitted to the decoding device, even If the initialization command has not been received at the decoding method by the transmission channel error, it Is possible to execute initialization in memory correctly based on the added information of the initialization resending command. Additionally, a receding medium In which a data stream Is recorded, the data stream being created by coding In the unit of slice with reference to a reference picture selected from plural reference pictures stored In memory, wherein the data strisam may be created by coding Information that designates an reference picture of an object to be released attaching to at least two slices In the case of releasing from memory reference pictures stored In the memory. As a -result, when the coding is executed In the unit of slice, even If the transmission, channel error occurs when the memory management Information is transmitted to the decoding device, the possibility that the picture Is restored correctly In the unit of slice becomes high because It Is thinkable that any one of the memory management Information that Is transmitted plural times Is transmitted and decoded. Furthermore, a receding medium in which a data stream is recorded, the data stream being created by coding In the unit of slice with reference to a reference picture selected from plural reference pictures stored In memory, wherein the data stream may be created by coding Information that designates an reference picture of an object to be released attaching to at least two slices in the case of releasing from' memory reference pictures stored In the memory, further information that indicates that the slices has information that designates the reference picture of the object to be released may be coded by attached to the slices, and Information that shows information that designates the reference picture of the object to be released is referred to when the reference picture of the object to be released is referred to in a slice that does not have information that designates the reference picture of the object to be released. As a result, in the slice that does not have the information that designates the picture of the object to be released, since addition of the above-mentioned Information can be omitted, the coding efficiency Improves, Note that the present invention can be realized not only as the image coding method and the image decoding method but also as the image coding device and the Image decoding device using these methods, the recording medium in which the data stream, which is coded by the Image coding method, is recorded, and a program that causes a computer to execute the steps In the image coding method and Image decoding method. It is needless to say that such a program can be distributed through the recoding medium such as CD-ROM and the transmission medium such as Internet. Further Information about Technical Background to this Application Japanese patent application No. 2002-110424 filed on April 12, 2002, Japanese patent application No. 2002-190955 dated on June 28, 2002, Japanese patent application No. 2003-49711 filed on February 26, 2003 and US provisional patent application No. 60/377656 filed on i^iay 6, 2002 are Incorporated herein by reference. Brief Description of Drawings Fig. lA is a diagram that explains the image coding that executes coding referring to a selected image out of plural reference images stored in memory, and Fig. IB is a structure diagram that shows the structure of the meniory that stores images. Fig. 2A is a flowchart that shows a conventional image coding method, and'IFi'g, 2B is'a flowchart that shows a conventional image decoding method. Fig. 3A is another flowchart that shows a conventional image coding method, and Fig. 3B is another flowchart that shows a conventional image decoding method. Fig. 4A is yet another flowchart that shows a conventional image coding method, and Fig. 4B Is yet another flowchart that shows a conventional image decoding method. Fjg. 5 is a block diagram that shows the structure of an image coding device of the present Invention. Fig. 6 Is a flowchart that shows the image coding method according to the first embodiment of the present Invention. Fig. 7 is a block diagram that shows the structure of an image decoding device of the present invention. Fig. 8 is a flowchart that shows the Image decoding method according to the second embodiment of the present invention. Fig. 9 is a flowchart that shows the Image coding method according to the third embodiment of the present Invention. Fig. 10 is a flowchart that shows the image decoding method according to the fourth embodiment of the present Invention. Fig. 11 is a flowchart that shows the Image coding method according to the fifth embodiment of the present invention. Fig, 12 is a fiowchart that shows the Image coding method according to the sixth embodiment of the present invention. Fig, 13 is a flowchart that shows the image coding method according to the seventh embodiment of the present invention. Fig. 14A is an explanatory diagram that shows the relationship among the picture No. and the stored picture No. of the image and the transmission order, Fig. 14B \s a diagram that shows a relationship among the picture No. to be decoded, the picture No. to be stored^ and the picture No. to be released, and Fig. 14C is a diagram that shows another relationship among the picture No. to be decotiecl,"the picture No. to be stored, and the picture No. to-be released. Fig. 15 is a corresponding diagram that shows the command of tne memory management information in the present irventlon. Fig. 16 Is a flowchart that shews the procedure for executing the command In the eighth embodiment of the present invention. Fig. 17 is a schematic diagram that shows the relationship between the header Information and the frame data in the coded signal of each picture. . Fig. IS Is a schematic diagram that shows the commands of the memory management information In the header information of the coded signals. Fig. 19 Is an explanatory diagram that shows a relationship among the picture No. and the stored picture No. of eact\ frame and the transmission order. Fig. 20 is a fiowchart that shows the method for coding the iriltializatlon command. Fig. 21 Is a flowchart that shows the method for decoding the coded initialization command. Fig, 22 shows the commands of the memory management information used in the eighth embodiment of the present invention. Fig. 23 is a flowchart that shows the Image coding method using the initialization resending command in the present Invention. Fig, 24 Is a flowchart that shows a method for decoding the coded Initialization resending command in the present invention. Fig. 25 Is an explanatory diagram that shows another relationship among the picture No. and the stored picture No. of each frame and the transmission order. Fig. 26 is a correspondence diagram that shows a relationship between the memory management information and the commands that are used in the ninth embodiment of the present Invention. Fig. 27 is a flowchart that shows an image coding method in the ninth embddlmeht of the present invention. Fig. 28 Is a flowchart that shows an Image decoding method in the ninth embodiment in the present invention. Fig. 29A is a correspondence diagram that shows the contents of the commands and the added information, and Fig. 29B is a correspondence diagram that shows the execution timings of the commands. Fig. 30 is a schematic diagram that shows the commands of the memory management Information in the header information of a coded signal. Fig. 31 Is a schematic diagram that shows the commands of the memory management Information In the header information of another coded signal. Fig. 32 Is a schematic diagram that shows the data stream structure coded In the unit of slice. Fig. 33A and Fig. 33B are schematic diagrams that show the data streaim structures coded in the unit of slice. Fig. 34A, 34B and 34C are e>:planatory .diagrams about a record medium to store a program to realize the Image coding method or the Image decoding method of the first embodlment'-the tenth embodiment of the present invention by a computer system. Fig. 35 is a block diagram that shows the overall configuration of a content supply system using the image coding method and the image decoding method according to the present invention. Fig. 36 is an outline view that shows an example of the cell phone using the Image coding method and the image decoding method according to the present invention. Fig. 37 is a block diagram that shows the cell phone using the image coding method and the Image decoding method according to the present invention. Fig. 38 Is a block diagram that shows the configuration of a digital broadcasting system using the Image coding method Knd the image decoding method according to the present invention. ■., Best Mode for Carrying Out the Invention The present embodiments of the present invention will be explained below with reference to the figures. (The First Embodiment) For a start, the first embodiment is explained. Fig. 5 is a block diagram that shows the structure of an image coding device of the first embodiment to realize an image coding method. The Image coding device 100 includes a memory Information control unit 101, a short term memory management unit 102, a long term memory management unit 103, a non-storage memory management information unit 104, a management information coding unit 105, a reference inriage selection unit 106, a storage area designation unit 107, a reference area designation unit 108, an image memory 109, an Image decoding unit 111, a Image-coding unit 110, a variable length coding unit 112, a counter 113 and a counter 114. The reference Image selection unit 106 selects candidates of the reference images from a priority designation signal Prl and picture type Information PicType that are inputted from the outside and informs accordingly to the memory information control unit 101. The memory information control unit 101 judges whether either or both of a preceding image (picture) and a following Image can be referred to by the picture type information PicType and instructs the reference area designation unit 108 to output the corresponding reference image from the image memory 109 to the image coding unit 110. The image coding unit 110 refers to the reference Image outputted from the image memory 109 and codes the inputted image signal Vin. The variable length coding unit 112 further executes the variable length coding and outputs an image coding stream VideoStr. The output of the image coding unit 110 is again decoded to be a decoded image by the image decoding unit 111 and is stored in the image memory 109 as the reference image. At this time, the memory position where the decoded Image can be stored in the Image memory 109 is designated as follows. The memory Information control unit 101 Inquires the short term memory management unit 102, specifies the memory position where the image was released in the short term memory and instruct the Image memory 109 In order that the storage area designation unit 107 records the decoded image at the memory position. the short term memory management unit 102 Informs the memory information control unit 101 of the command for detecting unnecessary images (that are not referred to) in the short term memory and deleting them (releasing the memory). Moreover, the long term menlory management unit. .103 Informs the memory information control unit 101 of the command for moving the images in the short term memory to the long term memory. On the other hand, to prevent the memory management information from being damaged because part of the memory management information stream CtlStr is lost by the transmission channel error, the counter 113 for the short term memory and the counter 114 for the long term memory measure the number of codings of the command for releasing the Images which are never used as reference and the command for moving the images in the short term memory to the long term memory. The transmission of the above-mentioned commands plural times becomes possible according to need. Additionally, the non-storage memory management information unit 104 manages whether the command for releasing the images which are never used as reference and the command for moving the Images In the short term memory to the long term memory are coded by attached to the image that has low priority value and is hard to be decoded. In the case of the above-mentioned commands being coded by attached to the image that has low priority value, the non-storage memory management information unit 104 Instructs the memory information control unit 101 to code the commands again attaching to the image that has the higher priority value. Next, an image coding method according to the first embodiment of the present Invention is explained. Fig. 6 is a flowchart that shows the Image coding method according to the first embodiment and shows the operations that the image coding device 100 shown in Fig. 5 executes. By the way. In the Fig. 6, the same operations as Fig. 2A are given the same numbers. The characteristic of the image coding method shown in Fig. 6 is, in the case of an image (a picture) which is never used as reference as the reference Image for the predictive coding existing In the memory, repeatedly coding the command of the memory managing information for releasing the memory area that stores the mage (for deletjng the image). In this way, by coding the command of the memory management Information repeatedly, even if .one command of the memory management information is lost by the transmission channel error, it is possible to restore the management information of the image stored In the memory by the other command of the memory management information and therefore the possibility that the image is restored correctly despite of the transmission channel error becomes high. In Fig, 6, for a start, the inputted image is coded (Step 100). After the coding, whether there is unnecessary area (the Images that are not referred to In future coding) In the memory Is examined (Step 101) and whether a picture In the memory which is never used as reference exists or not is judged (Step 102). When the picture in the memory which Is never used as reference Is judged to exist (Yes at Step 102), the management Information coding unit 105 codes the command for releasing a picture in the memory which is never used as reference as memory management information (Step 103) and releases a picture in the memory which is never used as reference (Step 104). In the case of no a picture in the.memory which Is never used as reference existing (No at Step 102), the operations in Step 103 and Step 104 are not executed. Next, the memory Information control unit 101 judges whether the command for releasing a picture In the memory which is never used as reference Is coded as the memory management information attaching to the coding of the Image coded Immediately before (the Image before the coding object) (Step 105). When the command is not coded (No at Step 105) the processing ends. When the command Is coded (Yes at Step 105), the management Information coding unit 105 codes the command for releasing a picture in the memory which Is never used as reference again as the memory management Information (Step 106) and the processing ends. In this way, when the command for releasing a picture in the memory which Is never used as reference (the command of memory management information) is coded by the coding of the image Immediately before, the command of memory management information is coded again. The coded memory management information attaching to the coding of the Image Immediately before and the memory management information that Is coded again are outputted from the Image coding device respectively, are transmitted to the image decoding device, which decodes the two kinds of memory management Information. In addition, in the case of the command for releasing a picture in the memory which is never used as reference being coded by attached to the coded signal of the image coded immediately before in Step 105, the command is coded again. But the case of attaching to the image several images before instead of the case of attaching to the image immediately before is acceptable. Further, it is also acceptable to code the above-mentioned command repeatedly as the memory management information and to transmit the command attaching to plural Images. Furthermore, It is sufficient to transmit the above-mentioned command for releasing a picture in the memory which Is never used as reference plural times; when the command Is coded again and transmitted, It is not always necessary to transmit the command attaching to the coded signal of the Image. Moreover, In the case of transmitting the command of the memory management Information again, it is acceptable that the command to be transmitted again Is not In the same stream as the coded picture but is transmitted, for example, as a different stream or is recorded in a different area of storage media. As described above, by transmitting the command (of the memory management Information) for releasing a picture In the memory which is never used as reference (of the memory management information) plural times, in the case of the transmission channel error occurring, any one of the commands that are transmitted plural times is thought to be transmitted and to be decoded, and therefore, the possibility that the image is decoded correctly becomes high. (The Second Embodiment) Next, the second embodiment of the present invention is explained. Fig. 7 is a block diagram that shows the structure of an Image decoding device according to the second embodiment to realize an image decoding method. The Image decoding device 200 includes a memory information control unit 201, a short term memory management unit 202, a long term memory management unit 203, a management information decoding unit 205, a storage area designation unit 207, a reference area designation unit 208, an Image memory 209, an image decoding unit 210 and a variable length coding unit 212. The memory Information control unit 201 judges whether either or both of a preceding image and a following image to the coding object can be referred to by the picture type information PicType and instructs the reference area designation unit 208 to output the corresponding reference Image from the image memory 209 to the image decoding unit 210. The variable length decoding unit 212 decodes the coded stream VideoStr; the Image decoding unit 210 further decodes VideoStr, outputs as a decoded image signal Vout and stores Vout as the reference Image In the Image memory 209. At this time, the memory position where the decoded Image can be stored in the Image memory 209 Is designated as follows. The memory information control unit 201 inquires the short term memory management unit 202, specifies the memory position where the image was released, and instructs the image memory 209 in order that the storage area designation unit 207 records the decoded image at the memory position. The management information decoding unit 205 decodes the memory management information stream Ctistr, informs the short term memory management unit 202 of the information of the unnecessary images (that are not referred to) in the short term memory through the memory information control unit 201, and informs the long term memory management unit 203 of the command for moving the images in the short term memory to the long term memory. Next, an Image decoding method according to the second embodiment of the present invention Is explained. Fig. 8 is a flowchart that shows the image decoding method according to the second embodiment and shows the operations that the Image decoding device 200 shown in Fig. 7 executes. By the way, in the Fig. 8, the same operations as Fig. 2B are given the same numbers. In the case of the Image coding device transniltting the command for releasing a picture in the memory which is never used as reference plural times, unless the command Is lost by the transmission channel error, the Image decoding device receives the command for releasing the area of the same image In the memory plural times. Consequently, It is necessary to realize the image decoding method by which, even If the Image decoding device receives the command for releasing again the memory area that has been already released, the Image decoding device does not process the command as an error but judges on the contrary that the command is correctly received. The present embodiment realizes such an Image decoding method. In Fig. 8, for a start, the management Information decoding unit 205 decodes the memory management information (Step 110). Next, the Image signal Is decoded from the coded signal (Step 111). Then, the memory Information control unit 201 judges whether :here is the command for releasing the memory in the decoded nemory management Information or not (Step 112). When there is :he command for releasing the memory (Yes at Step 112), whether :here Is an Image that should be released by the command or the memory has been already released (the Image has been already deleted) is judged (Step 113). When the memory has been already released (Yes at Step 113) the processing ends without further processing. When the memory has not been released, the memory is released (Step 114), and the processing ends. On the other hand, when there Is no command for releasing the memory (No at Step 112), the processing ends without executing the operations in Step 113 and Step 114. By the way, Step 110 and Step 111 are In no particular order and may counterchange. By the operations described above, even if the command for releasing the area of the same image in the memory is coded and transmitted plural times by the image coding method of the first embodiment and the Image decoding device 200 receives the command plural time, the image decoding device 200 does not process the command as an error and therefore the image decoding method for decoding correctly Is realized. In addition, it is sufficient to transmit the above-mentioned command for releasing a picture In the memory which is never used as reference plural times; when the command Is coded again and transmitted, it is not always necessary to transmit the command attaching to the coded signal of the Image. Moreover, In the case of transmitting the command of the memory management Information again, It is acceptable that the command to be transmitted again is not In the same stream as the coded picture but is transmitted, for example, as a different stream or Is recorded In a different area of the storage media. (The Third Embodiment) Next, the image coding method according to the third embodiment is explained. Fig. 9 is a flowchart that shows the image coding method according to the third embodiment and shows the operations that the image coding device 100 executes. In the Fig. 9, the same operations as Fig. 3A are given the same numbers. The characteristic of the present embodiment Is, in the case of an image that should be moved from the short term memory to the long term memory existing in the memory, repeatedly coding the command of the memory managing Information for moving the image. By coding the command of the memory management information repeatedly, even if one command of the memory management tnformatidn is lost by the transmission channel error, it Is possible to restore the management Information of the Image stored in the memory by the other command of the memory management Information and therefore the possibility that the image is restored correctly despite of the transmission channel error becomes high. In Fig. 9, for a start, an inputted image Is coded (Step 120). After the coding, whether there is an image that should be moved to the long term memory is examined (Step 121). Then, the memory information control unit 101 judges whether there is an Image that should be moved to the long term memory or not (Step 122). When there is an image that should be moved (Yes at Step 122), the management Information coding unit 105 codes a command for showing how the image Is moved to the long term memory as the memory management information (Step 123). Then, the Image Is moved to the long term memory based on the command (Step 124). Next, the memory Information control unit 101 judges whether or not the command for moving the Image to the long term memory is coded as the memory management Information attaching the coding of the Imgge coded Irnmedla^tely before (the. Image before the coding object) (Step 125). When the command is not coded (No at Step 125), the processing ends. When the command is coded (Yes at Step 125), the management information coding unit 105 codes the command for moving the image ag&in as the memory management information (Step 126) and the processing ends. In this way, when the command (of memory management information) for moving the Image to the long term memory is coded by the coding of the Image immediately before, the command of memory management information' is coded again. The coded memory management Information attaching to the coding of the image Immediately before and the memory management information that Is coded again are outputted from the Image coding device respectively, and are transmitted to the image decoding device, which decodes the two kinds of memory management information. In addition, in Step 125, in the case of the command for moving the image to the long term memory being coded by attached to the coded signal of the image coded immediately before, the command Is coded again. But the case of attaching to the image several images before instead of the case of attaching to the image immediately before Is acceptable. Further, it Is also acceptable to code the above-mentioned command repeatedly as the memory management and to transmit the command attaching to plural images. Furthermore, it Is sufficient to transmit the above-mentioned command for moving the Image to the long term memory plural times; when the command Is coded again and transmitted, it is not always necessary to transmit the command attaching to the coded signal of the image. Moreover, in the case of transmitting the command of the memory management information again, it is acceptable that the command to be transmitted again Is not In the same stream as the coded picture but is transmitted, for example, as a different stream or is recorded in a different area of the storage media, As described above, by transmitting the command for moving the image to the long term memory plural times, in the case of the transmission channel error occurring, any one of the commands that are transmitted plural times is thought to be transmitted and to be decoded,, and therefore, the possibility that the image is decoded correctly becomes high. (The Fourth Embodiment) Next, an Image decoding method according to the fourth embodiment is explained. In the case of the Image coding device transmitting the command for moving an image to the long term memory plural times, unless the command is lost by the transmission channel error, the image decoding device receives the command for moving the same image area to the long term memory plural times. Consequently, it is necessary to realize the Image decoding method by which, even if the image decoding device receives the command for moving the image that has been already moved again, the image decoding device does not process the command as an error but judges on the contrary that the command is correctly received. The characteristic of the image decoding method according to the present embodiment realizes such an Image decoding method. Fig. 10 Is a flowchart that shows the Image decoding method according to the fourth embodiment and shows the operations that the image decoding device 200 shown In Fig. 7 executes. In the Fig. 10, the same operations as Fig. 3B are given the same numbers. In Fig. 10, for a start, the management information decoding unit 205 decodes the memory management information (Step 130). Next, the image signal Is decoded from the coded signal (Step 131). Then, the memory information control unit 201 judges whether or not there is the command for moving an image to the long term memory in the decoded memory management Information (Step 132). When there Is the command for moving the image to the long term memory (Yes at Step 132), whether there is an image that should be moved by the command or the image has been already moved (the image no longer exists because It was released after the move) is judged (Step 133). When the Image has been already moved (Yes at Step 133) the processing ends without further processing. If not so, the Image is moved to the long term memory (Step 114), and the processing ends. On the other hand, when there Is no command for moving the Image to the long term memory (No at Step 112), the processing ends'Without executing the operations in Step 133 and Step 134. By the way. Step 130 and Step 131 are In no particular order and may counterchange. By the operations described above, even If the command for moving the image to the long term memory Is coded and transmitted plural times by the image coding method of the third embodiment, the image decoding method for decoding correctly Is realized. In addition, it is sufficient to transmit the above-mentioned command for moving the image to the long term memory plural times; when the command Is coded again and transmitted, it Is not always necessary to transmit the command attaching to the coded signal of the Image. Moreover, In the case of transmitting the command of the memory management Information again. It fs acceptable that the command to be transmitted again Is not in the same stream as the coded picture but is transmitted, for example, as a different stream or Is recorded In a different area of the storage media. (The Fifth Embodiment). Next, the Image coding method according to the fifth embodiment Is explained. Fig. 11 Is a flowchart that shows the Image coding method according to the fifth embodiment and shows the operations that the image coding device 100 shown In Fig. 5 executes. In the Fig. 11, the same operations as Fig. 6 are given the same numbers. The characteristic of the present embodiment shown in Fig. 11 is, In the case of an image which Is never used as reference existing in the memory, repeatedly coding the command of the memory management information for releasing the image and transmitting the command at least once attaching to an important image that is stored in the memory. In the case of repeatedly coding the command of the memory management information, if the command of the memory management Information is transmitted attaching to an Image that does not have a high priority value, the command of the memory management Information cannot be acquired when all the images that do not have a high priority value are not decoded. For example, in Fig. lA, since the Image of the picture No. 4 becomes unnecessary after the Image of the picture No. 5 Is coded, it Is possible to code the command for releasing the memory area where the Image of the picture No. 4 exists, attaching to the image of the picture No. 5. However, besides coding the command for releasing the memory area where the Image of the picture No. 4 exists, attaching to the image of the picture No. 5, if the conimand is coded by attached to the Image of the picture No. 7, In either case, the above-mentioned command Is coded by attached to the B pictures that have the lowest priority value (whose Image degradation is small In the case of not being decoded). These B pictures may not be decoded and therefore the command for releasing the memory area where the Image of the picture No. 4 exists Is not decoded. As a result, the management Information In the memory Is not reproduced correctly, Consequently, it is necessary to code the command for releasing the Image area at least once attaching to the image that has a high priority value, is decoded without fail, and is stored in the memory. In Fig. 11, for a start, the inputted image is coded (Step 100). After the coding, whether there is unnecessary area (the images that are not referred to In future coding) in the memory Is examined (Step 101) and whether a picture in the memory which is never used as reference exists or not is judged (Step 102). When a picture in the memory which Is never used as reference exists (Yes at Step 102), the management Information coding unit 105 codes the command for releasing a picture in the memory which is never used as reference'as memory management information (Step 103) and releases a picture in the memory which is never used as reference (Step 104). In the case of no picture In the memory which is never used as reference existing (No at Step 102), the Operations in Step 103 and Step 104 are not executed. Next, the memory Information control unit 101 judges whether or not the command for releasing a picture In the memory which Is never used as reference that was coded in the past Is coded by attached to an important image (that is decoded and is stored) (Step 140). When the command Is coded b y attached to the important Image (Yes at Step 140), the processing ends. When the command is not coded by attached to the Important image (No at Step 140), the management Information coding unit 105 codes the command for releasing a picture in the memory which is never used as reference again as the memory management Information (Step 141). Then, the processing ends. As a result, thfe command for releasing a picture in the memory which Is never used as reference again Is coded by attached to the Important Image. As described above, the above-mentioned command attaches to the important image that is decoded and Is stored in the memory, the possibility that the image is restored correctly when the transmission channel error occurs becomes high. In addition, It is sufficient to transmit the above-mentioned command for releasing a picture In the memory which is never used as reference plural times; when the command is coded again and transmitted, it is not always necessary to transmit the command attaching to the coded signal of the image. Moreover, in the case of transmitting the command of the memory managenrient information again, it is acceptable that the command to be transmitted again is not in the same stream as the coded picture but is transmitted, for example, as a different stream or is recorded In a different area of the storage media; (The Sixth Embodiment) Next, the image coding method according to the sixth embodiment is explained. Fig. 12 is a flowchart that shows the image coding mfethod according to the sixth embodiment. Fig. 12 shows the operations that the image coding device 100 shown In Fig. 5 executes. In the Fig. 12, the same operations as Fig. 5 are given the same numbers. The characteristic of the present embodiment shown in Fig. 12 is repeatedly coding the command of the memory management Information for moving an image to the long term memory and transmitting the command at least once attaching to an important Image (that is decoded and is stored In the memory). In the case of repeatedly coding the command of the memory management information for moving the Image to the long term memory, if the command of the memory management information is transmitted attaching to an image that does not have a high priority value, the command of the memory management information cannot be acquired when all the images that do not have a high priority value are not decoded. In Fig. 12, for a start, an Inputted image is coded (Step 120). After the coding, whether there is an image that should be moved to the long term memory is examined (Step 121) and whether there is an Image that should be moved is judged (Step 122). When there is an image that should be moved (Yes at Step 122), the management information coding, unit 105 codes a command for showing how the image Is moved to the long term memory as the memory management Information (Step 123). Then, the image is moved to the long term memory based on the command (Step 124). Next, the memory Information control unit 101 judges whether the command, which was coded In the past, for moving the image to the long term memory is coded or not attaching to the important image (that is decoded and Is stored in the rnemory) (Step 150). When the command is attached to the important image (Yes at Step 150) the processing ends. When the command attaches to the Important Image (No at Step 150), the management information coding unit 105 codes the command for moving the image to the long term memory again as the memory management information (Step 151). Then the processing ends. By so doing, the command for moving the Image to the long term memory attaches to the Important Image and is coded. As Is described above, since the above-mentioned comniand attaches to the Important Image that Is decoded and is stored In the memory, the command Is decoded and therefore the possibility to decode the image correctly when the transmission channel error occurs becomes high. In addition. It Is sufficient to transmit the above-mentioned command for moving the Image to the long term memory plural times; when the command Is coded again and transmitted, it Is not always necessary to transmit the command attaching to the coded signal of the image. Moreover, In the case of transmitting the command of the memory management Information again, it Is acceptable that the command to be transmitted again is not In the same stream as the coded picture but Is transmitted, for example, as a different stream or is recorded in a different area of the storage media. (The Seventh Embodiment) The image coding method according to the seventh embodiment is explained. The characteristic of the present embodiment is an Image coding method for.executing the coding referring to the reference Image selected-depending on the priority value of the image; Fig. 13 is a flowchart that shows the Image coding method according to the seventh embodiment of the present invention. Fig. 13 shows the operations that the image coding device 100 shown in Fig. 5 executes. In Fig. 13, for a start, the priority value of each image that is the coding object Is set up (Step 160). For example, the priority value of an I picture and a P picture is high, while that of a B picture is low. Additionally, even among same P pictures, the priority value of the P picture that Is referred to by many images Is high, while that of the P picture that Is not referred to much Is low. Next, pictures that have the equivalent or higher priority value to the coding object Image are selected among the reference Images In,the memory and are made candidates of the reference Images (Step 161). For example, the B picture can refer to the I picture and the P picture, while the P picture excludes the P picture that has the low priority value from the candidates of the reference image. . Next, designation Information (a type of the memory management Information) that shows the selected candidates of the reference images is coded (Step 162); among the selected candidates of the reference images, the appropriate reference images are referred to and is coded in the unit of block (Step 163). By the way, Step 162 and Step 163 are in no particular order and may counterchange. By so doing, the images that have lower priority value than the coding object image are not included among the candidates of the reference images. As is described above, since the images that have lower priority value than the coding object image are not Included among the candidates of the reference images, in the case of generating a stream that can realize the scalability, the Images that cannot be referred to are excluded from the candidates of the reference images and therefore the coding efficiency improves. Here, the image coding method executed depending on the priority value of the set images, as is described above, is explained concretely with reference to Fig. 14. Fig. 14A is an explanatory diagram that shows the relationship among the numbers given to each frame (picture (frame) No.), the numbers by which each frame is stored in the memory (stored picture (frame) No.), and the numbers that shows the order by which each frame Is transmitted (transmission order). In Fig. 14A, since the I picture of the picture No. 0 does not refer to other pictures, the I picture of the picture No. 0 is stored in the memory and Its stored picture No. Is 0. Next, since the P picture of the picture No. 2 that refers to the I picture of the picture No. 0 Is stored In the memory, the stored picture No. on the P picture of the picture No. 2 is 1, Then, since the B picture of the picture No. 1 that refers to the I picture of the picture No. 0 and the P picture of the picture No. 2 Is stored in the memory, the stored picture No. on the B picture of the picture No. 1 is 2, The order by which each picture is transmitted Is that by which each picture is stored. By the similar procedures, the relationship among the picture No,, the stored picture No., and the transmission order Is decided. Next, an example of the relationship among the picture numbers that are decoded, the picture numbers that are stored in the memory, and the picture numbers that are released is explained using Fig. 14B. Fig. 14B is a diagram that shows a relationship among the picture No. (frame No.) to be decoded, the picture No. (frame No.) to be stored, and the picture No. (frame No.).to be released. In addition, here, the maximum number of the pictures that can be stored in the memory is 5. The pictures are stored in the memory depending on the transmission order. ■ Furthermore, for example, when the P picture of the. picture-No. 4 is decoded, since the stored picture No. of the P picture of the picture No. 4 is 3; the pictures of the picture Nos. 0, 1, and 2 are stored in the memory. When the P picture of the decoding picture No. 3 is decoded, as shown in Fig. 14B, the pictures of the picture Nos. 4, 1, 2, and 0 are stored. Here, since the B picture of the picture No, 1 is not referred to by any picture after the picture of the picture No, 3 is decoded, as shown in Fig. 14A, the B picture of the picture No. 1 Is released at the time the picture of the picture No. 3 is decoded. Similarly, when the B picture of the decoding picture No. 5 is decoded, shown In Fig. 14B, the pictures of the picture Nos. 6, 3, 4, 2, and 0 are stored. Here, since the B picture of the picture No, 3 is not referred to by any picture aft6r the picture of the picture No. 5 is decoded, the B picture of the picture No. 3 Is released at the time the picture of the picture No. 5 Is decoded. Further, when the P picture of the decoding picture No. 8 is decoded, as shown in Fig. 14B, the pictures of the picture Nos. 5, 6, 4, 2, and 0 are stored. Here, since the memory can store only a hiaximum of five frames, In order to refer the P picture of the picture No. 8 later, one of pictures of the picture Nos. 5, 5, 4, 2, and 0 must be released to secure the memory to memorize the P picture of the picture No. 8. Consequently, as the standard to select the frame to be released in Fig. 14B, when the P picture whose picture No. is a even number is decoded, the temporally oldest picture, the I picture of the picture No. 0 in this case is released at the time the P picture of the picture No. 8 Is decoded. Similarly, when the B picture of the decoding picture No. 7 is decoded, as shown In Fig. 14B, the pictures of the picture Nos. 8, 5, 6, 4, and 2 are stored. Here, since the B picture of the picture No. 5 is not referred to by any picture after the picture of the B picture No. 7 is decoded, the B picture of the picture No. 5 is released at the time the B picture of the picture No. 7 is decoded. Further, the P picture of the decoding picture No. 10 is decoded, as shown in Fig. 14B, the pictures of the picture Nos. 1, 8, 6, 4, and 2 are stored. Here, since the memory can store only the maximum of five frames, in order to refer to the P picture of the picture No, 10 later, oneof pictures of the picture Nos. 7, 8, 6,4, and 2 must be released to secure the memory to memorize the P picture of the picture No. 10. Consequently, as the standard to select the frame to be released In Fig. 146, when the P picture whose picture No. is a even number Is decoded, the temporally oldest picture, the picture of the picture No. 2 is released at the time the P picture of the picture No. 10 Is decoded. In this way, when a picture Is released, the command of the memory management information for releasing the picture is coded by attached to the coded signal of the decoding picture, and transmitted. In the example shown in Fig. 14B, the example in which an Image .(a picture) which Is never used as reference exists and the command of the memory management information forreleaslng the image Is transmitted once Is described. In this way, when the command of the memory management information for releasing the image is transmitted once, there Is possibility that the command of management information that is transmitted attaching to the B picture cannot be executed. Because the possibility that the B picture is used as a reference image to code/decode the P picture Is low; the possibility that the data of the P picture are discarded first, when the adequate memory capacity and transmission capacity are not secured, is high; as a result, there is possibility that the command of the memory management information that is transmitted attaching to the B picture is not executed. To solve this problem, an example of repeatedly coding and transmitting the command of the memory management Information for releasing the Image is explained. Fig. 14C Is explained concretely below. Fig. 14C is a diagram that shows another relationship among the picture No. (frame No.) to be decoded, the picture No. (frame No.) to be stored, and the picture No, (frame No.) to be released. Fig. 14C shows that the command for releasing the picture of the picture No. to be released attaches to the coded signal of the picture of the decoding picture No. As shown in Fig. 14C, when the B picture of the picture No. 3 is decoded, the pictures of the picture Nos. 4, 1, 2, and 0 are stored. Here, the B picture of the picture No. 1 Is not referred to by any picture after the picture of the picture No. 3 is decoded as shown in Fig. 14A. Consequently, at the time the picture of the picture No. 3 is decoded, the B picture of the picture No. 1 is released and the command of the memory management Information for releasing the B picture of the picture No. 1 attaches to the picture of the picture No. 3. However, since the picture of the picture No. 3 Is the B picture, •as Is described abbv6, its revel of importance is low compared with the I picture and the P picture In the point of reproducing the image and It Is highly probable that the B picture is discarded at the time of the transmission, and therefore, there is possibility that the command of the memory management information that is transmitted attaching to the B picture of the picture No. 3 Is not executed (the case of the frame being stored as shown In Fig. 25). Then, the command of the memory management Informatlbn for releasing the picture of the picture No. 1 attached to the picture of the picture No. 3 Is attached to the P picture of the picture No. 5 that is decoded next and has the higher priority value than the B picture of the picture No. 3 in the point of reproducing the image. (Refer to Fig. 14C). Similarly, the command of the memory management information (for releasing the picture of the picture No. 3) attached to the B picture of the picture No. 5 is attached to the P picture of the picture No. 8; the command of the memory management information (for releasing the picture of the picture No. 5) attached to the B picture of the picture No. 7 is attached to the P picture of the picture No. 10. By the way, since the picture of the picture No, 8 Is the P picture, the command of the memory management Information attached to the picture No. 8 Is not attached to the B picture of the picture No. 7, as shown in Fig. 14C, but it is acceptable to do so. Up to this point, as shown in Fig. 14C, the same command of the memory management information as the command of the memory management Information first attached to the B picture is repeatedly attached to the picture that has the higher priority value than the B picture In the point of reproducing the Image and is stored or transmitted later than the B picture to which the command of the memory management Information is first attached. By so doing, even if the B picture to which the command of the memory management information is first attached is dropped, the command of the memory management information can be normally executed. In addition, as explained using Fig. 14C, in the case of attaching the command of the memory management information to :he B picture and further attaching the command of the memory management information repeatedly to the P picture, the set priority yalue is used. Note that the set up of the priority value is not limited to what is shown in the present embodiment. In addition. In the present embodiment, whether each image Is transmitted or not is decided depending on the priority value of each image; the priority value is not coded by attached to each image like the memory management information shown in the above-mentioned embodiments. As a result, the decoding processing of the data coded by the present embodiment is not different from the conventional method. (The Eighth Embodiment) Next, the eighth embodiment is explained. The characteristic of the present embodiment is to code and transmit plural times the command (of the memory management information) for releasing all the Images (pictures) in the memory and initializing the memory area. The memory command information shown In the above-mentioned each embodiment Is given as code information shown in Fig. 15. Fig. 15 Is a corresponding diagram that shows the command of the memory management Information and shows the code No. (Code In Fig, 15), the contents of the command (the command in Fig. 15) and its added Information (the added information In Fig. 15). For example, the command for releasing a picture In the memory which is never used as reference in the short term memory (short term memory releasing) Is given as the code information Code 1 and the picture No. (frame No.) to be released is added as the added Information. Furthermore, the code Information Is given as header information shown in Fig. 17. Fig. 17 is a schematic diagram that shows the relationship between the header Information and the frame data in the coded signal of each picture. In Fig. 17, each coded signal shows the coded signals of Frml2, Frmll, and Frml4 that are explained later. Each coded signal Includes the frame header that has the header information and frame data on the.coding of the image. For example, the coded signal of the frame Frml2 includes the frame header Frml2Hdr and the frame data made up of each data MB12a, MB12b, MB12C, MB12d and the like. Details of this coded signal are shown in the schematic diagram of Fig. 18. Fig. 18 Isa schematic diagram that shows-the commands of the memory management Information In the header information of the coded signals. As shown in Fig. 18, the coded signal of the frame FrmA includes the frame header FrmAHdr and the frame data made up of each data MBa, MBb, MBc, MBd, and the like. Then, the code information Code A of the command, the added information AddA of the code information Code A, the code information Code B of the command that should be executed next to the command of the code information Code A, and the added Information AddB of the code information Code B are added to the frame header FrmAHdr in this order. If there Is no added Information like the code information Code C, only th6 code Information Is added. Next, the procedure for executing the command (s shown In Fig. 16. Fig. 16 Is a flowchart that shows the procedure for executing the command. In Fig. 316, for a start, a comniand Is acquired (Step CO), and whether the acquisition pf the command ends or not is judged (Step CI). When tHe acquisition of the command does not end and the command is acquired (No at Step CI), the acquired command is executed (Step C2); return to Step CO and this operation is repeated. On the other hand, when the acquisition of the comnnad ends and the command is not acquired (Yes at Step CI), the processing for executing the command ends. This procedure is executed to each frame. By the way. In the case of the command information being transmitted in the unit of slice made up of plural macro blocks, the command is executed by the same procedure as the above. Incidentally, in the first embodiment, the command of the memory management information for releasing the image which is never used as reference (releasing the memory) is explained. Further, the first embodiment shows that by coding repeatedly the command of the menriGiry management information for releasing the image which is never used as reference, even if one command of the memory management information is lost by the transmission channel error, the management information of the image stored in the memory can be restored by the other command of the memory management Information and the possibility that the image is correctly restored becomes high. Here, out of the code information shown In Fig. 15., the initialization command Code 5 for releasing all the Information in the memory is considered. When the Initializing command Code 5 Is transmitted only once and if this Initialization command Code 5 is lost by the transmission channel error, t he processing of the memory management and like that are normally executed after the initialization is affected. There, similarly to the first embodiment, the case of repeatedly coding and transmitting the initialization command Code 5 is explained using Fig. 19. Fig. 19 Is an explanatory diagram that shows a relationship among the numbers given to each frame'(picture (frame) No.), the numbers by which each frame is stored in the memory, (stored picture (frame) No.)/ and the numbers that shows the order by which each frame is transmitted (transmission order). Fig. 19 Is explained concretely below. For a start, since the I picture of the picture No. 0 does not refer to other pictures, the ! picture of the picture No. 0 is stored in the memory and its stored picture No. Is 0. Next, since the P picture of the picture No. 2 that refers to the I picture of the picture No. 0 is stored In the memory, the stored picture No. on the P picture of the picture No. 2 is 1. Then, since the B picture of the picture No. 1 that refers to the I picture of the picture No. 0 and the P picture of the picture No. 2 is stored in the memory, the stored picture No. on the B picture of the picture No. 1 is 2. The order by which each picture Is transmitted is that by which each picture is stored. By the similar procedures, the relationship among the picture No., the stored picture No., and the transmission order is decided. When the I picture of the picture No. 12 shown in Fig. 19 is coded, the initialization command Code 5 shown in Fig. 15 Is transmitted. Since the stored picture No. of the I picture of the picture No. 12 is 11, by this Initialization command Code 5, all the pictures whose stored picture No. is 10 or less can be released in the memory. Here, the method for coding the Initialization command Code 5 Is explained using Fig. 20. Fig. 20 is a flowchart that shows the method for coding the Initialization command Code 5 and shows the operations that the image coding device 100 shown In Fig. 5 executes. For a start, an inputted Image Is coded (Step AO). After the coding, whether all the Imaged that can be referred to in the memory are unnecessary or not (whether any of them Is not referred to In the future coding) Is examined (for initialization) (Step Al); whether the pictures stored In the memory are not referred to in future and It is better to initialize them is judged (Step A2). If it is better to Initialize them (Yes at Step A2), the initialization command Code 5 that initializes the memory area is coded as the memory management information (Step A3); the initialization is executed (Step A4); the processing ends. On the other hand, when the initialization is not necessary (No at Step A2), the processing ends without executing the operations of Step A3 and Step A4. Next, a method for decoding the coded initialization command Code 5 is explained using Fig. 21. Fig. 21 is a flowchart that shows the method for decoding the coded initialization command Code 5 and shows the operations that the image decoding device 200 shown In Fig. 7 executes. For a start, the m'emofy management information is decoded (Step AlO); the Image signal is decoded from the coded signal (Step All). Next, whether there is the initialization command Code 5 in the decoded memory management information is judged (Step A12), if there is the initialization command Code 5 (Yes at Step A12), all the pictures memorized in the memory are released and initialized (Step A13) and the processing ends. However, the decoded Image (at Step All) is not released. On the other hand, if there is no initialization command Code 5 in the memory management information (No at Step A12), the processing ends. The method for initializing the memory Is explained concretely below using Fig. 19. The same Initialization command Code 5 as the initialization command given to the I picture of the picture No. 12 is given to the B picture of the picture No. 11. When shown In Fig. 17, the Initialization command Code 5 Is given to the frame header Frml2Hdr of the frame Frml2 (picture No. 12) aind the frame header FrmllHdr of the frame Frml2 (picture No. 11). Since the initialization command Code 5 does not have the added information as shown in Fig. 15, the Initialization command Code 5 releases all the pictures stored In the memory at the time it Is decoded. Therefore, when the initialization command Code 5 given to the I picture of picture No. 12 (the stored picture No. 11) is lost by the transmission channel error and the initialization command Code 5 given to the B picture of picture No. 11 (the stored picture No, 12) is executed, all the pictures are released by the picture decoded before the stored picture No. 11. In other words, even the I picture of picture No. 12 (the stored picture No. 11) that should not be released by nature is released. As just described, when the same initialization command Code 5 as the Initialization command given to the I picture of the picture No. 12 is given to the B picture of the picture No. 11, one picture (the I picture of the picture No. 12) is dropped. On the other hand, when the same initialization command Code 5 as the initialization command given to the I picture of the picture No. 12 (the stored picture No. 11) is given to the P picture of the picture No. 14 (the stored picture No. 13), the Initialization command Code 5 given to the I picture of the picture No. 12 is lost by the transmission channel error, and the Initialization command Code 5 given to the P picture of the picture No. 14 Is executed, two pictures (the B picture of the picture No. 11 and the I picture of the picture No. 12) are dropped. Note that when the initialization command Code 5 Is repeatedly coded and the Initialization command that is transmitted first and the Initialization command that is transmitted subsequently are executed without the transmission channel error, the similar problem to the above occurs because the Initialization Is executed by the Initialization command that Is transmitted first and further the initialization Is executed again by the initialization command that is transmitted subsequently. A method for solving such a problem in the initialization Is explained. Fig. 22 shows the commands of the memory management information used to solve the problem of initializing the memory. Fig. 22 is different from Fig. 15 in that the initialization resending command Code 6 is newly added to the former. Furthermore, this Initialization resending command Code 6 has the initialized picture (frame) No. (the number of the frame to which the initialization command Code 5 that initializes the memory area is attached) as added information. The flow of the processing of the Image coding using this initialization resending command Code 6 is explained below using Fig. 23. Fig. 23 Is a flowchart that shows the Image coding method using the initialization resending command Code 6 and shows the operations that the image coding device 100 shown in Fig. 5 executes. In the Fig. 23, the same operations as Fig. 20 are given the same numbers. For a start, the Inputted Image Is coded (Step AO). After the coding, whether ail the images in the memory are unnecessary or not (whether any of them is not referred to In the future coding) is examined (for initialization) (Step Al), the memory Information control unit 101 judges whether the Initialization Is necessary (Step A2); when the initialization is necessary (Yes at Step A2), the management information coding unit 105 codes the Initialization command Code 5 as the memory management information (Step A3) and executes the Initialization (Step A4). When the initialization is not necessary (No at Step A2), the operations of Step A3 and Step A4 are not executed. Next, the. memory information control unit 101 judges whether the Initialization command Codf 5 that initializes the memory area Is coded as the memory management Information attaching to the Image coded Immediately before (the image before the coding object) (Step A30); when the initialization command Code 5 is coded (Yes at Step A30), the management information coding unit 105 codes the initialization resending command Code 6 that initializes the memory area as the memory management information (Step,A31); the processing ends. Moreover, when the initialization command Code 5 that initializes the memory area is not coded as the memory management information attaching to the Image coded immediately before (the image before the coding object) (No at Step ABO), the processing ends. By the way, in the method shown in Fig. 23, in the case of coding the Initialization command Code 5 that Initializes the memory ai'ea being toded by attached to the coded signal of the image coded, immediately before, the InltializatJon resending command Code 6 Is coded agam; It is acceptable that In the case of the mitlallzatlon command Code 5 being coded by attached to the coded signal of the image coded not immediately before but several images before, the Initialization resending command Code 6 Is coded. Additionally, It Is also acceptable to code the initialization resending Command Code 6 that initializes the memory area repeatedly as the memory management information attaching to plural Images. More specifically, as shown in Fig. 19, In the case of coding the initialization command Code 5 attaching to the coding of the I picture of the picture No. 12, it is acceptable to code the initialization resending command Code 6 attaching to the coding of the B picture of the picture No. 11 and additionally, it Is also acceptable to code the initialization resending command Code 6 attaching to the P picture of the picture No. 14. In the case of the former, when shown in Fig. 17, the initialization command Code 5 Is given to the frame header Frml2Hdr of the frame Frml2;- further the Initialization resending command Code 6 is given to the frame header FrmllHdr of the frame FrmH. Moreover, In the case of the latter, the initialization command Code 5 is given to the frame header Frml2Hdr of the frame Frml2; the initialization resending command Code 6 is given to the frame header Frml4Hdr of the frame Frml4. Further, it is acceptable to code the Initialization resending command Code 6 attaching to the coding of the B picture of the picture No. 11 and together to code the initialization resending command Code 6 attaching to the coding of the P picture of the picture No. 14. In this case, when shown in Fig. 17, the initialization command Code 5 is given to the frame header Frml2Hdr of the frame Frml2 and the initialization resending command Code 6 is given to the frame header FrmllHdr of the framePrmil and the frame header Frml4Hdrof the frame'Frml4; Next, the processing for decoding the data in which the initialization resending command Code6 Is coded Is explained using Fig. 24. Fig. 24 is a flowchart that shows a method for decoding the coded initialization resending command Code 6 and shows the operations of the Image decoding device 200 shown in Fig. 7. In the Fig. 24, the same operations as Fig. 21 are given the same numbers. For a start, the management information decoding unit decodes the memory management Information (Step AlO). Then, the image signal is decoded from the coded signal (Step All). Whether there Is the Initialization command Code 5 In the decoded memory management information Is judged (Step A12), when there is the Initialization command Code 5 (Yes at Step A12), all the picture in the memory are released and initialized (Step A13); when there Is no initialization command Code 5 (No at Step 12), the initialization is not executed. Next, the memory Information control unit 101 judges whether ther6 Is the initialization resending command Code 6 in the memory management Information (St^p A40). When there Is no Initialization resending command Code 6 (No at Step A40), the processing ends; when there is the initialization resending command Code 6 (Yes at Step A40), whether the initialization is executed is examined (Step A41), When the initialization is executed (Yes at Step A41) the prociessing ends. When the initialization Is not executed (No at Step A40), based on the added Information of the initialization resending command Code 6, the storage frame (the frame stored in the memory for reference image at the time of coding an initialization frame) before the initialization frame (the frame to which the Initialization command Code 5 that initializes the memory area is attached) is released; further the number of pictures for long term memory is made 0 (Step A42); the processing ends. In addltionv when the long termframe is not used, there is no need to cause the number of pictures for long term memory to be 0. Consequently, as shown In Fig. 19, In the case of the picture of the picture No. 12 attached to the inltiaiization command Code 5 being coded and the picture of the picture No. 14 attached to the initialization resending command Code 6 being coded, all the pictures whose stored picture No. is 10 or less and that are stored In the memory are released by the initialization command Code 5 when the initialization command Code 5 is not lost by the transmission channel error or by the Initialization resending command Code 6 when the initialization command Code 5 is lost by the transmission channel error. In this way, when the initialization command Code 5 is repeatedly coded and transmitted, from the second time onward, the initialization resending command Code 6, to which the Initialization No., the added information Is added, is coded and transmitted, and therefore, based on the added information, the storage frames before the Initialization franne (the frames stored in the memory for reference Image at the time the Initialization frame first attached to the Initialization command Code 5 Is coded) are released. As a result, the above-described problem that a necessary image (picture) is dropped can be solved. By the way, in the case of giving the stored picture No. like Fig. 25, which is different from Fig. 19, the above-explained initialization resending command Code 6 is still effective. A concrete explanation is made below. Fig. 25 is an explanatory diagram that shows another relationship among the numbers given to each frame (picture (frame) No,), the numbers by which each frame is stored in the memory (stored picture (frame) No.), and the numbers that shows the order by which each frame is transmitted (transmission order). The method for giving these numbers is explained. For a start, since the r picture of the picture No. 0 does not refer-to t)ther • pictures, the I picture of the picture No. 0 is stored in the memory and its stored picture No. is 0, Next, since the P picture of the picture No. 2 that refers to the I picture of the picture No. 0 is stored in the memory, the stored picture No. on the P picture of the picture No. 2 is 1. Then, although the B picture of the picture No. 1 that refers to the I picture of the picture No. 0 and the P picture of the picture No. 2 is stored in the memory, since this B picture is not. referred to by other pictures. Its stored picture No. is 1, same as the stored picture No. of the P picture of the picture No. 2 that is stored immediately before. The order by which each picture is transmitted Is that by which each picture Is stored. By the similar procedures, the relationship among the picture No., the stored picture No,, and the transmission order Is decided. As shown in Fig. 25, when the I picture of the picture No. 12 is coded, it is transmitted attaching to the Initialization command Code 5 shown In Fig. 15. Since the stored picture No. of the I picture of the picture No. 12 is 6, it is possible to release all the pictures whose stored picture No. is 5 or less by this Initialization command Code 5. Here, the case of repeated coding the initialization command Code 5, more specifically, the case of giving the same initialization command Code 5 as the initialization command Code 5 given to the I picture of the picture No. 12 to the P picture of the picture No. 14 is explained, As shown In Fig. 15, since the Initialization command Code 5 does not have added information, It releases all the pictures stored in the memory for reference image at the time it is decoded. Consequently, when the! initialization command Code 5 given to the I picture of the picture No. 12 (the stored picture No. 6) is lost by the transmission channel error and the initialization command Code 5 given to the P picture of the picture No. 14 (the stored picture No. 7) is executed, all the pfctures whose stored picture No. is 6 or (ess and that are stored in the memory are released. In other words, even the I picture of the picture No. 12 (the stored picture No. 6) that should not be released by nature is released. However, by attaching the initialization resending command Code 6 Instead of the Initialization command Code 5 to the P picture of the picture No. 14, all the pictures whose stored picture No. is 5 or less that are stored in the memory are released by the initialization command Code 5 In the case of the initialization command Code 5 not being lost by the transmission channel error or by the initialization resending command Code 6 in the case of the initialization command Code 5 being lost by the transmission channel error. In other words, since the initialized frame No. (In this case, the picture No, 12) Is added to the Initialization resending command Code 6 as the added information, the storage frames before the initialization frame (the storage frames whose stored picture No. is 5 or less and that are stored in the memory for reference image at the time the Initialization frame Is stored) are released. As Is described, by the initialization resending command Code 6 that has the added information, even if the initialization command Code 5 is lost by the transmission channel error, the possibility that the initialization is executed normally becomes high. In addition, it is acceptable to substitute the initialization command Code 5 with the initialization resending command Code 6 shown in the present embodiment that has the picture No. of the picture to which the initialization resending command Code 6 is attached as added information and to realize Code 5 and Code 6 shown In Fig. 22 as one command. This is because when the Initialization is resent to resend the initialization Information, the number of the frame to which the Initialization command Code 5 is attached is designated; the picture No. to resend the said frame is not used. At this time, it is acceptable to invalidate the initialization command Code 5; ■ Note that In the case of realizing the Initialization resending. command Code 6 and the initialization command Code 5 shown in the above-mentioned embodiments by one command like this, it Is acceptable that the initialization resending command Code 6 that has a special value that Is not used In the initialization resending command Code 6 shown in the above-mentioned embodiments is made to be the command that has the same function as the initialization command Code 5 that is sent first. Moreover, as explained In the above-mentioned each embodinfient, when the memory management information such as. the command for releasing a picture In the memory which Is never used as reference and the Initialization command is transmitted again, as shown In Fig. 17 and Fig. 18, it is acceptable to transmit the header Information including the memory management information separately from the frame data Instead of transmitting the memory management Information Included in the header Information added to the frame data on the coding of the image. In other words, it Is acceptable that the command to be transmitted again is not in the same stream as the. coded picture but is transmitted, for example, as a different stream. Additionally, it is also acceptable to record the command in a different area of storage media. Further, in the present embodiment, when the initialization command Code 5 Is resent, the picture No. of the picture to which the initialization command Code 5 Is first attached (the initialized frame No.) is added to the initialization resending command Code 6 as added information but when the command of the memory management information such as the command for releasing the memory area and the command for designating the object picture to be moved from the short term memory to the long term memory Is resent as shown In the above-mentioned each embodiment, it is naturally acceptable thatthe picture No. of the coded-object picture transmitted attaching first to the command (the information for identifying the picture) is included as a parameter and is transmitted. By so doing, it is possible to detect which picture was transmitted when the transmission channel error occurred. (The Ninth Embodiment) Next, an Image coding method and an Image decoding method according to the ninth embodiment are explained. The characteristic of the present embodiment Is, when the memory management Information is transmitted plural times, to change the timing of the processing based on the memory management Information transmitted at the second time and later. When the data obtained by repeatedly coding the memory management information Is decoded as shown In the above-mentioned embodiments, before processing the memory management information that Is repeatedly transmitted, the Image signal to which the memory management information Is attached is decoded without fall. As a concrete example, the case of transmitting the command for releasing a picture In the memory which is never used as reference plural times that is explained in the second embodiment Is explained again using Fig, 19. The picture of the picture No. 12 shown in Fig. 19 is attached to the command of Code 1 shown in Fig. 22 and is coded and further the picture of the picture No. 11 is attached to the command of Code 1 and is coded. At this time, the decoding is executed following Fig. 8. As a start, the Code 1 attaching to the picture of the picture No. 12 is decoded (Step 110). Next, the picture of the picture No. 12 is decoded (Step 111). Here, when the Code 1 that should be attached to the picture of the picture No. .12 by nature is dropped during the transmission (No at Step 112), the processing on this frame ends. - In the order of transmission; the picture of the picture No. it is processed to be decoded next to the picture of the picture No. 12. For a start, the Code 1 that is coded by attached to the picture of the picture No, 11 is decoded (Step 110). Next, the picture of the picture No. 11 Is decoded (Step 111). When this Code 1 is not dropped during the transmission and is transmitted, the Code 1, the command for releasing the memory, exists in the decoded memory management information (Yes at Step 112), which leads to the next processing (Step 113). Here, since the memory is not released when the picture of the picture No. 12 that is decoded before decoding of the picture of the picture No. 11 is decoded (No at Step 113), the processing for releasing the memory Is executed (Step 114). As shown In the above-mentioned concrete example, owing to transmitting the command for releasing a picture In the memory which is never used as reference, the command that should be executed by nature to the picture (the picture No. 12) to which the first command \s not executed, is executed after the decoding processing of the picture signal of the picture (the picture No. 11) that Is transmitted later; a delay of executing the command occurs. Consequently, in the present embodiment, a method for solving the problem Is explained using Fig. 26, Fig. 27, and Fig. 28. Fig. 26 is a correspondence diagram that shows a relationship between the memory management information and the commands that are used In the present embodiment. In Fig. 26, the Code shows the number of the command; the command shows the contents of the command; the added information shows the added information added to the command; the processing position shows the timing for executing the commands. Fig. 26 is different from Fig. 15 In that In the former, Code Al~Code A4 are the commands that are executed after the decoding processing of the Image, while Code A6'yCode AQ that correspond to Code Al~Code A4 are the commands that are executed before the decoding processing of the Image. Then, in the case of sending the memory management information repeatedly, the commands of memory management information that are coded first are the commands (Code Al~Code A4) whose processing positions are after the decoding (executed after the decoding of the image); the commands that are coded repeatedly (after the second time) are the commands (Code A6~Code A9) whose processing positions are before the decoding. Herewith, In the case of the memory management Information sent first being dropped, the command that should be executed by the memory management information that Is sent first by nature is executed early and It Is possible to make the problem such as the delay hard to occur. Hereinafter, processing procedures using the commands in Fig. 26 are explained using Fig. 27 and Fig. 28. Fig. 27 is a flowchart that shows an Image coding method in the present embodiment and shows the operations of the image coding device 100 shown In Fig. 5. In Fig. 27, for a start, an image is coded (Step BO). After the coding, the unnecessary area (the Images that are not referred to in future coding) is examined (Step Bl); whether there is the unnecessary area is judged (Step B2). When there is a picture in the memory which is never used as reference (Yes at Step B2), the command for releasing a picture in the memory which is never used as reference is set to be executed after the decoding of the Image signal; the memory management information used after the decoding is coded (Step B3), a picture In the memory which Is never used as reference is released (Step B4). On the other hand, when there is no picture in the memory which is never used as reference (No at Step B2), the operations of Step B3 and Step 84 are not executed.- ■' Next, the memory information control unit 101 judges whether the command for releasing a picture in the memory which is never used as reference attaching to the coding of the image coded immediately before (the Image before the coded object) is coded as the memory management information (Step B30). If not coded (No at Step B30), the processing ends. If coded (Yes at Step B30), the management Information coding unit 105 executes the command for releasing a picture In the memory which is never used as reference before the decoding of the image signal and codes the memory management information used before the decoding (Step B31) and the processing ends. Note that In the case of the command for releasing a picture in the memory which is never used'as reference being coded by attached to the coded signal coded Immediately before In Step B30, the command Is coded again but the case of attaching to the image before several Images Is acceptable Instead of the case of attaching to the image immediately before. Further, It Is acceptable that the above-mentioned command Is repeatedly coded as the memory management information and Is transmitted attaching to plural images. Next, procedures for decoding the data coded following the procedures in Fig. 27 are explained using Fig. 28 and Fig. 19. Fig. 28 is a flowchart that shows an Image decoding method in the present embodiment and shows the operations that the Image decoding device 200 shown in Fig. 7. In the following explanation, in Fig. 19, the picture of the picture No. 12 is coded by attached to the command of the Code Al shown in Fig. 26 and further the picture of the picture No. 11 is coded by attached to the command of the Code A6. When shown in Fig. 17, the Code Al is given to the frame header Frml2Hdr of the frame Frml2 of the picture No. 12, while the Code A6 is given to the frame header FrmllHdr of the frame Frmll of thepicture No. ll; By the way, unless the command is lost by the transmission channel error, the image decoding device receives the command for releasing the same image area in the memory plural times. Consequently, in the image decoding method that the image decoding device executes, even if the Image decoding device receives the command for releasing the image that has been already released, the image decoding device does not processes the command as an error but must judge on the contrary that the command Is correctly received. For a start, the decoding processing on the picture of the picture No. 12 is explained. In Fig. 28, for a start, the memory management information of the picture of the picture No. 12 is decoded (Step B5); whether this memory management information is the memory management Information used before the decoding, Is examined (Step 87). Here, since this memory management information (Code Al) is the memory management Information used after the decoding (No at Step B7), the image signal of the picture of the picture No. 12 is decoded. Then, as is described before, since the memory management information (Code Al) is the memory management information used after the decoding (Yes at Step B9), the memory is released (Step Bll), and the processing on the memory management information of the picture of the picture No. 12 ends. On the other hand, when the Code Al of the memory management information is dropped, the memory management information is not judged to be the memory management information used before the decoding at Step B7 (No at Step B7), and additionally, the memory management information is not judged to be the memory management information used after the decoding (No at Step B9), only the image signal of the picture of the picture No. 12 is decoded (Step B6), the processing on the memory manage Information of the picture of the picture No. 12 ends. Next, the decoding processing of the frame of the picture No. 11 is explained using Fig, 28. For a start, the memory management information of the picture No. 11 Is decoded (Step B5); whether this memory management information is the memory management information used before the decoding, is examined (Step B7). Here, since the Code A6 is the memory management information used before the decoding (Yes at Step B7), whether the memory is released or not is examined (Step B8). In the processing of the picture of the picture No. 12, since the memory has been already released if the Code Al is executed (Yes at Step B8), the processing for releasing the memory (Step BIO) is not executed, and the picture of the picture No. 11 is decoded (Step B6). Then, whether the memory management information is used after the decoding, Is judged (Step B9), but since the Code A6 is the memory management information used before the decoding (No at Step B9), the processing on the memory management information of the picture of the picture No. 11 ends. However^ because of a drop of a packet during the transmission and the like, the memory management information of the picture of the picture No. 12 is dropped, in the processing on the picture of the picture No. 12, when the memory is not released, in the processing on the picture of the picture No. 11, the memory is judged not to be released (No at Step B8), the memory is released at the next step (Step B6). Then, since the Code A6 is the memory management information used before the decoding (No at Step B9), the processing on the memory management information of the picture of the picture No. 11 ends. In this way, for what is resent, executing the command before the decoding of the Image signal, even if the command sent first Is dropped, it Is possible to reduce the delay of executing the Command. In addition, as a concrete example, the case of the memory management Information being the Code Al and the Code A6 is explained, but the same can be realized with the similar processing in the case of the Code A2 and the Code A7 being used and the same can be also realized by the similar processing in the case of the Code A3 and the Code A8 being used and in the case of the Code A4 and the Cod A9 being used. Furthermore, It Is possible to use as a pair the initialization command Code A5 shown in Fig. 26 as the memory management information used after the decoding and the initialization resending command Code 6 shown in Fig. 22 as the memory management information used before the decoding, respectively. Moreover, In the case of a piece of the memory management information used after the decoding and plural pieces of the memory management information used before the decoding being given to one frame as the header information, It Is good to process the plural pieces of the memory management Inforniation used before the decoding before the memory management Information used after the decoding. In other words, it is good to give the memory management information used before the decoding to the head part of the header information shown in Fig. 17 and code the said memory management information. Additionally, by combining the commands shown in Fig. 29A and Fig. 29B and making whether the memory management information is the memory management Information used before the decoding or the memory management information used after the decoding, other information, It is acceptable to realize the commands shown in the above-mentioned embodiments. Fig. 29A is a correspondence diagram that shows the contents of the commands and the added information. Fig, 29B is a correspondence diagram that shows the execution timings (the processing positions) of the commands. Fig. 30 is a schematic diagram that shows the commands of the memory management information in the header information of a coded signal. In Fig. 30, the coded signal of the frame FrmB has the frame header FrmBHdr, the frame data such as MBa and MBb; the frame header FrmBHdr has the code information Code D and the like as the header Information. At this time, as shown In Fig. 30 for example. It is good that the frame header FrmBHdr of the frame FrmB includes, from the beginning, the code Information Code D of the command. Flag D that shows the processing position, and the added information AddD that shows the added Information of the command. When there is no added Information, as shown In Fig. 30, It Is good that Code E of the command and Flag E that shows the processing position are added to the frame header FrmBHdr. Since Immediately after the Code that shows the command Is not Add that shows added information but Flag that shows the processing position, it is possible to optimize the processing of Step B7 and Step B9 shown In Fig. 28. Additionally, to distinguish whether the executing timing of the command is before or after the decoding of the image signal, using a new command for showing the processing position, it is acceptable that the commands that are located before the position in the header frame of the command that shows the processing position are executed after the decoding, while the commands that are located after the position in the header frame of the command that shows the processing position are executed before the decoding. By so doing, when there are plural commands, the executing timing (the processing position) of each command can be shown by one command, compared with the case of transmitting a Flag that shows the processing position for every command, the Information to be transnnltted Is reduced and the coding efficiency Is Improved. A concrete example Is explained using Fig. 31. Fig. 31 is a schematic diagram that shows the commands of the memory management information in the header informatibn of another coded signal. In Fig. 31, the coded signal of the frame FrmC has the frame header FrmCHdr and the frame data such as MBa and MBb; In the frame header FrmCHdr, as the header Information, from the beginning In order, the command Code F, the command dif, the command Code G, the added information AddG, and the command Code H are located. Then, whether the command dif that shows the processing position Is in the frame header FrmCHdr Is judged, It is acceptable that the command Code F that Is before the command dif that shows the processing position Is executed after the decoding of the frame FrmC, while the command Code G and the command Code H that are after the command dif are executed before the decoding of the frame FrmC. In this case, if there Is not the command dif that shows the processing position, all the commands In the frame header FrmCHdr are executed after the decoding processing of the frame FrmC, By the way, as explained in the above-mentioned each embodiment, when the memory management information such as the command for releasing a picture in the memory which Is never used as reference and the Initialization command is transmitted again, it is acceptable to transmit the header information including the memory management information separately from the coded signal of the image instead of transmitting the memory management information included in the header Information added to the coded signal of the image. In other words, it Is acceptable that the command to be transmitted again is not in the same stream as the coded picture but is transmitted, for example, as a different stream. Additionally, It is also acceptable to record the command in a different area of storage media. (The Tenth Embodiment) Next, the tenth embodiment of the present invention is explained. In the present embodiment, the unit to which the coding Is executed is different from that of the above-mentioned each embodiment. In other words, in the first embodimerit, when the command for releasing a picture in the memory which is never used as reference is transmitted plural times, the memory management information stream CtlStr and the image coding stream VIdeoStr that correspond to the above-mentioned command and are shown In Fig. 5 are coded in the unit of an image (a picture) but In the present embodiment, It Is acceptable to code one frame In the unit of a slice like a stream structure shown in Fig. 32. Coding in the unit of a slice Is, as slice 1 of frame 1 in Fig. 32 has header 1-1, CtlStr 1, and'VldeoStr 1-1 and slice 2 of the frame 1 In Fig. 32 has header 1-2, CtlStr 1, and VideoStr 1-2, coding the header, the memory management Information stream CtiStr, and the image coding stream VideoStr for every slice of each frame. After coding, the image coding device outputs data stream. In addition, the slice is a synchronization return unit, a strip-shaped area made up of one or plural blocks, and the plural slices construct a picture. Furthermore, a picture Is a basic coding unit that Gol'responds to one image; a block is a basic unit of coding/decoding. Moreover, as described above, the contents when the memory management information stream CtlStr is transmitted plural times are the same Information within the same frame. Being the same information, the addition of this memory management streiam CtlStr in the unit of a slice can be omitted. For example, the information that shows whether the plural times of transmission are omitted or" not in the said slice is added to the header of the slice; ''0" is added to the header of the slice when the plural times of transmission of the above-mentioned command are omitted; "1" is added to the header of the slice when the above-mentioned command is transmitted (not omitted) in the said slice. Concretely, an example is shown in Fig. 33A and explained below. Each of the headers and the video coding istreams VideoStr of slice l~slice 3 in frame 1 is different. On the other hand, the slice 1 and the slice 2 have the same memory management information stream CtlStr 1, each of the slice 1 and slice 2 has the information "1" that shows that the same memory management information stream Is coded In the plural slices in the same frame. Additionally, the slice 3 has the information *0" that shows that the memory management information stream CtlStr 1 is omitted. By so doing, when transmitting of the command plural times Is omitted In the said slice, by referring to the memory management Information stream CtlStr in the slice where the above-mentioned ''1" is shown like the first slice and the like. It Is possible to omit the addition of the memory management information stream CtiStr and reduce the number of bits. In other words, the above-mentioned information ''0" that shows that the memory management stream CtiStr 1 is omitted is, in the slice that does not have the information that designates the picture of the object to be released (slice 3), when the information that designates the picture of the object to be released is referred to, the information that shows that the information that designates the picture of the object to be released is referred to. The method like this for enabling the omission of the addition of the memory management Information stream CtlStr is effective because the possibility that the memory management Information stream is dropped plural times during the transmission process Is low.v ■■ Further, when the presence or absence of the memory management Information stream CtlStr can be judged without the information that shows that the memory management information stream CtlStr Is omitted, It Is acceptable that this Information is omitted as shown In Fig. 33B. For example, when the head of the memory management information stream CtlStr can be: distinguished from the head of the image coding stream VideoStr, the judgment whether there is the information that shows whether the memory management Information stream CtlStr 1 Is coded can be confirmed by whether there Is the predetermined Information in the predetermined place from the head In each slice. The method like this for enabling the omission of the addition of the memory management Information stream CtlStr Is effective because the number of coding the memory management Information stream is cut down and the number of bits Is reduced. Up to this point, coding is explained but similarly decoding of one frame can be executed in the unit of a slice. In the second embodiment, when the command for releasing a picture In the memory which is never used as reference is transmitted plural times. the image decoding device 200 shown in Fig. 7 divides the stream structure that has the memory management information stream CtlStr and the image coding stream VideoStr that correspond the above-mentioned commands and are shown in Fig. 32, and inputs each stream In the unit of a image (picture), but it Is acceptable to input each stream in the unit of a slice. Note that In the coding and the decoding In other embodiments, it Is acceptable to code and decode one frame similarly in the unit of a slice. Furthermore, the image coding methods and the Image decoding methods shown in the first embodiment "^ the tenth embodiment can be Implemented In mobile communication devices such as a cell phone and a car navigation system and picture-taking devices such as a digital video camera and a digital still camera by semiconductors such as LSI (large scale Integration). Moreover, three types of implementations can be conceived: a sending/receiving terminal Innplemented with both an encoder and a decoder; a sending terminal Implemented with an encoder only; and a receiving terminal implemented with a decoder only. (The Eleventh Embodiment) Next, the eleventh embodiment of the present invention is explained. In the present embodiment. If a program for realizing the structure of the Image coding methods or the image decoding methods as shown In the first embodiment ~ the tenth embodiment is recorded on a memory medium such as a flexible disk, it becomes possible to perform the processing as shown in these embodiments easily In an independent computer system. Fig. 34A, 34B and 34C are explanatory diagrams that show the case where the processing is performed in a computer system using a flexible disk that stores the Image coding method or the image decoding method of the first embodiment ~ the tenth embodiment. Fig. 34B shows a flexible disk and the front view and the cross-sectional view of the appearance of the flexible disk, and Fig. 34A shows an example of a physical format of a flexible disk as a recording medium itself. A flexible disk FD 1 is contained in a case F, a plurality of tracks Tr are formed concentrically on the surface of the disk in the radius direction from the periphery, and each track is divided into 16 sectors Se in the angular direction. Therefore, as for the flexible disk storing the above-mentioned program, the image coding method as the program is recorded in an area allocated for it on the flexible disk FD 1, Fig. 34C Shows "the structure for recording and reading out the program on and from the flexible disk FD 1. When the program is recorded on the flexible disk FD 1, the computer system Cs writes In the image coding method or the image decoding method as a program through a flexible disk drive FDD. When the image coding method is constructed in the computer system by the program on the flexible disk FDl, the program is read out from the flexible disk drive FDD via the flexible disk FDl and transferred to the computer system Cs. The above explanation is made on the assumption that a recording medium is a flexible disk, but the same processing can also be performed using an optical disk. In addition, the recording medium is not limited to a flexible disk and an optical disk, but any other medium such as an IC card and a ROM cassette capable of recording a program can be used. Furthermore, the Image coding methods and the image decoding methods shown in the above-mentioned embodiments can be implemented in mobile communication devices such as a cell phone and a car navigation system and picture-taking devices such as a digital video camera and a digital still camera by semiconductors such as LSI (large scale integration). Moreover, three types of implementations can be conceived: a sending/receiving terminal implemented with both an encoder and a decoder; a sending terminal implemented with an encoder only; and a receiving tei-mlnal implemented with a decoder only. Here, the applications of the image coding method and the image decoding method as shown in the first embodiment ~ the tenth embodiment, and the system that uses the methods are explained. Fig. 35 is a block diagram that shows the overall configuration of a content supply system exlOO for realizing content distribution service. The area for providing communication service is divided into cells of desired Size*, ana-ceirsitesfekl07>^exil0 which are fixed wireless stations are placed in respective cells. This content supply system exlOO Is connected to devices such as a computer exlll, a PDA (Personal Digital Assistant) exl 12, a camera exll3, a cell phone exll4 and a cell phone with a camiera exll5 through the Internet exlOl, an Internet service provider exl02, a telephone network exl04 and cell sites exl07~exll0. However, the content supply system exlOO is not limited to the configuration as shown in Fig. 35, and may be connected to a combination of any of them. Also, each device may be connected directly to the telephone network exl04, not through the cell sites exl07~exll0. The camera exll3 Is a device such as a digital video camera capable of shooting video (moving pictures). The cell phone exl 14 may be a cell phone of a PDC (Personal Digital Communication) system, a CDMA (Code Division Multiple Access) system, a W-CDMA (Wideband-Code Division Multiple Access) system or a GSM (Global System for Mobile Communications) system, a PHS (Personal Handyphone System) or the like. A streaming server exl03 is connected to the camera exll3 through the telephone network exl04 and the cell site exl09, which enables live distribution or the lli

Documents

Application Documents

# Name Date
1 0660-chenp-2010 form-2 03-02-2010.pdf 2010-02-03
2 0660-chenp-2010 description(complete) 03-02-2010.pdf 2010-02-03
3 0660-chenp-2010 claims 03-02-2010.pdf 2010-02-03
4 0660-chenp-2010 power of attorney 03-02-2010.pdf 2010-02-03
5 0660-chenp-2010 drawings 03-02-2010.pdf 2010-02-03
6 0660-chenp-2010 abstract 03-02-2010.pdf 2010-02-03
7 0660-chenp-2010 form-5 03-02-2010.pdf 2010-02-03
8 0660-chenp-2010 form-3 03-02-2010.pdf 2010-02-03
9 0660-chenp-2010 form-1 03-02-2010.pdf 2010-02-03
10 0660-chenp-2010 correspondence others 03-02-2010.pdf 2010-02-03
11 660-chenp-2010 form-18 20-05-2010.pdf 2010-05-20
12 660-chenp-2010 form-1 20-05-2010.pdf 2010-05-20
13 660-chenp-2010 form 3 02-08-2010.pdf 2010-08-02
14 660-CHENP-2010 POWER OF ATTORNEY 21-08-2014.pdf 2014-08-21
15 660-CHENP-2010 FORM-6 21-08-2014.pdf 2014-08-21
16 660-CHENP-2010 CORRESPONDENCE OTHERS 21-08-2014.pdf 2014-08-21
17 660-CHENP-2010 ASSIGNMENT 21-08-2014.pdf 2014-08-21
18 660-CHENP-2010-Power of Attorney-271015.pdf 2016-04-05
19 660-CHENP-2010-Form 6-271015.pdf 2016-04-05
20 660-CHENP-2010-Correspondence-Notarized Copy of Assignment-Form 6- Power of Attorney-271015.pdf 2016-04-05
21 660-CHENP-2010-Assignment-271015.pdf 2016-04-05
22 660-CHENP-2010-FER.pdf 2017-09-18
23 660-CHENP-2010-DUPLICATE-FER-2017-09-20-16-53-59.pdf 2017-09-20
24 660-CHENP-2010-PETITION UNDER RULE 137 [16-03-2018(online)]_4.pdf 2018-03-16
25 660-CHENP-2010-PETITION UNDER RULE 137 [16-03-2018(online)].pdf 2018-03-16
26 660-CHENP-2010-OTHERS [16-03-2018(online)].pdf 2018-03-16
27 660-CHENP-2010-FORM 3 [16-03-2018(online)].pdf 2018-03-16
28 660-CHENP-2010-FER_SER_REPLY [16-03-2018(online)].pdf 2018-03-16
29 660-CHENP-2010-DRAWING [16-03-2018(online)].pdf 2018-03-16
30 660-CHENP-2010-COMPLETE SPECIFICATION [16-03-2018(online)].pdf 2018-03-16
31 660-CHENP-2010-CLAIMS [16-03-2018(online)].pdf 2018-03-16
32 660-CHENP-2010-ABSTRACT [16-03-2018(online)].pdf 2018-03-16
33 Marked Up Claims_Granted 296219_26-04-2018.pdf 2018-04-26
34 Drawings_Granted 296219_26-04-2018.pdf 2018-04-26
35 Description_Granted 296219_26-04-2018.pdf 2018-04-26
36 Claims_Granted 296219_26-04-2018.pdf 2018-04-26
37 Abstract_Granted 296219_26-04-2018.pdf 2018-04-26
38 660-CHENP-2010-PatentCertificate26-04-2018.pdf 2018-04-26
39 660-CHENP-2010-IntimationOfGrant26-04-2018.pdf 2018-04-26
40 660-CHENP-2010-RELEVANT DOCUMENTS [18-03-2019(online)].pdf 2019-03-18
41 660-CHENP-2010-RELEVANT DOCUMENTS [20-03-2020(online)].pdf 2020-03-20
42 660-CHENP-2010-FORM-26 [04-01-2021(online)].pdf 2021-01-04
43 660-CHENP-2010-RELEVANT DOCUMENTS [24-09-2021(online)].pdf 2021-09-24
44 660-CHENP-2010-RELEVANT DOCUMENTS [22-08-2022(online)].pdf 2022-08-22
45 660-CHENP-2010-FORM-27 [26-09-2024(online)].pdf 2024-09-26

Search Strategy

1 searchstrategy_18-09-2017.pdf

ERegister / Renewals

3rd: 16 May 2018

From 10/04/2005 - To 10/04/2006

4th: 16 May 2018

From 10/04/2006 - To 10/04/2007

5th: 16 May 2018

From 10/04/2007 - To 10/04/2008

6th: 16 May 2018

From 10/04/2008 - To 10/04/2009

7th: 16 May 2018

From 10/04/2009 - To 10/04/2010

8th: 16 May 2018

From 10/04/2010 - To 10/04/2011

9th: 16 May 2018

From 10/04/2011 - To 10/04/2012

10th: 16 May 2018

From 10/04/2012 - To 10/04/2013

11th: 16 May 2018

From 10/04/2013 - To 10/04/2014

12th: 16 May 2018

From 10/04/2014 - To 10/04/2015

13th: 16 May 2018

From 10/04/2015 - To 10/04/2016

14th: 16 May 2018

From 10/04/2016 - To 10/04/2017

15th: 16 May 2018

From 10/04/2017 - To 10/04/2018

16th: 16 May 2018

From 10/04/2018 - To 10/04/2019

17th: 08 Apr 2019

From 10/04/2019 - To 10/04/2020

18th: 01 Apr 2020

From 10/04/2020 - To 10/04/2021

19th: 03 Apr 2021

From 10/04/2021 - To 10/04/2022

20th: 04 Apr 2022

From 10/04/2022 - To 10/04/2023