WO2004070955A1 - 符号化装置及び方法、復号装置及び方法、プログラム、並びに記録媒体 - Google Patents
符号化装置及び方法、復号装置及び方法、プログラム、並びに記録媒体 Download PDFInfo
- Publication number
- WO2004070955A1 WO2004070955A1 PCT/JP2004/000563 JP2004000563W WO2004070955A1 WO 2004070955 A1 WO2004070955 A1 WO 2004070955A1 JP 2004000563 W JP2004000563 W JP 2004000563W WO 2004070955 A1 WO2004070955 A1 WO 2004070955A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- position information
- encoding
- decoding
- pieces
- value
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
- H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
- H04N21/435—Processing of additional data, e.g. decrypting of additional data, reconstructing software from modules extracted from the transport stream
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
- H04N21/235—Processing of additional data, e.g. scrambling of additional data or processing content descriptors
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
- H04N21/235—Processing of additional data, e.g. scrambling of additional data or processing content descriptors
- H04N21/2353—Processing of additional data, e.g. scrambling of additional data or processing content descriptors specifically adapted to content descriptors, e.g. coding, compressing or processing of metadata
Definitions
- Encoding device and method decoding device and method, program, and recording medium
- the present invention relates to an encoding device, an encoding method, a decoding device, a decoding method, a program, and a recording medium, and more particularly, efficiently encodes a plurality of pieces of positional information on leaves and / or nodes in a tree structure.
- the present invention relates to an encoding device, an encoding method, a decoding device, a decoding method, a program, and a recording medium for decoding.
- Tree-based data representation is used in various fields of information processing.
- a typical example is a tree structure representation of search information provided corresponding to moving image content.
- FIG. 26 is a diagram illustrating an example of search information having a tree structure provided corresponding to moving image content according to the related art.
- One moving image content is composed of one or a plurality of scenes, and one scene is composed of one or a plurality of shots. Then, assuming that each shot is provided with data representing the characteristics of the shot, such as the motion intensity and color frequency for each shot, or a summary sentence indicating the content of the shot, the search information of the moving image content is It is represented by a tree structure as shown in Fig. 26.
- the moving image content is composed of three scenes (# 0, # 1, and # 2), and each scene is composed of three more shots (# 0, # 1, and # 2).
- the moving image content corresponds to the root
- the tag information of the motion intensity indicating the type of scene, shot, and data corresponds to the node
- the data representing the actual motion intensity corresponds to the leaf.
- the scene is the first branch point from the root, that is, the first layer node
- the shot is the second layer node.
- FIG. 26 is an example, and the moving image content and its search information often have a more complex hierarchical structure.
- search information for moving image content there is a request to retrieve and transmit or store search data corresponding to each leaf as needed.
- information for identification is added to each data.
- the data 260 1 in FIG. 26 is merely a numerical value of “1” by itself, and indicates what kind of search information is related to the scene number, shot number, and shot number. Only when there is identification information can it be used as search data.
- this search data identification information for leaves is transmitted from the root of the tree structure to the leaves. Given by tree path information.
- the information on this path is called "branch code (T1-e eBranchCode)". For example, in Figure 26 2 60 1
- the identification information for each node is also given by the information of the path of the tree from the root of the tree structure to the node.
- identification information such as “scene”, “shot”, and “motion intensity” is information indicating the element type of the search information.
- information given by numbers such as “0” and “1” is an identification number assigned to distinguish each element when the same element branches from a certain node. It is called “location information” because it determines the position of the node.
- location information is an identification number assigned to distinguish each element when the same element branches from a certain node. It is called “location information” because it determines the position of the node.
- MPEG-7 these element type information and position information are individually encoded and handled together with the search data.
- the identification information of each of the data 260 1 to 2609 has the same element type information, and only the position information is different.
- MPEG-7 a data format for transmitting or storing a plurality of pieces of search data to which identification information different only in such position information is added is specified.
- MPEG-7 multiple different location information The following position information encoding / decoding techniques for differential encoding are defined.
- 3 ⁇ 427 is a functional block diagram showing a schematic configuration of a position information encoding device by differential encoding according to MPEG-7 according to the related art.
- FIG. 28 is a diagram showing an example of position information encoded by the position information encoding apparatus according to the related art and an example of the encoded position information code string.
- FIG. 10 is a diagram showing a relationship between a position information extracted from identification information of 01 to 260 9 and a position information code string obtained by encoding the extracted position information.
- leaf 26601 and leaf2602 which are two adjacent search data in Fig. 26, from the root 2610 of the tree structure to the leaves 2601 and 2602 respectively Comparing the path of the tree that passes through the route, the root (moving image content) to the first-level node (scene # 0) are common, and are below the scene # 0, that is, the second-level node (shot # It can be seen that the branches are divided after 0 and shot # 1).
- the layer immediately after branching is referred to as “branch layer j” for two adjacent leaves.
- the branch layer for leaf 2601 and leaf 2602 is the second layer, that is, the shot layer.
- the two paths between the two adjacent leaves 2 603 and 2 604 have only the same root (moving image content), and the first-level nodes (scene # 0 and scene # 1) Since the branching has already occurred, the branching hierarchy for the two adjacent leaves 2603 and 2640 is the first hierarchy, that is, the scene hierarchy.
- the branch hierarchy When viewed from the relationship between the location information extracted from the identification information as shown in Fig. 28, the branch hierarchy indicates the value of each hierarchy in two adjacent location information from the upper hierarchy to the lower hierarchy. When comparing in order to, it corresponds to the hierarchy where the value changed first.
- Differential coding in the prior art is based on the premise that the change in the value of the position information at this time is always one increase, and the change in the value of the position information is used to determine which layer value has increased.
- the original position information is encoded by encoding the information of the branch hierarchy. In such differential encoding, since it is sufficient that the number of existing branch layers can be distinguished by encoding, information is compressed as compared to encoding position information as it is.
- the start position information encoding unit 2702 encodes the start position information by a normal method using no difference.
- the head position information (0, 0) is input to and held in the previous position information holding unit 2703, and is used for encoding the next position information (0, 1).
- the branch layer determining unit 274 4 compares the input next position information to be coded with the position information stored in the previous position information storage unit 270 3, and branches based on these. The layer is determined, and the result of the determination is output to the difference position information encoder 275.
- the head position information (0, 0) is input to and held in the previous position information holding unit 2703, and is used for encoding the next position information (0, 1).
- This determination result is output to difference position information encoding section 275.
- the difference position information coding unit 275 5 selects and outputs a position information code according to the determination result of the branch layer determination unit 270 4.
- the branching hierarchy of (0, 1) and (0, 0) is determined to be the second hierarchy by the branching hierarchy determination unit 2704, the branching hierarchy is determined as shown in FIG. A code indicating that there are two layers (a position information code indicating that the second layer is incremented by 1) “10” is given.
- the third position information (0, 2) is also given a code “10” representing the second layer.
- the fourth position information (1, 0) is compared with the third position information (0, 2), the value of the position information of the first layer, that is, the layer of the scene is increased.
- Hierarchy branching at the scene hierarchy. For this reason, a code indicating that the branch layer is the first layer (a position information code indicating that the first layer is incremented by 1) “01” is given.
- the position information code string obtained by encoding to the end in this way is the position information code string shown in FIG. At the end of the code string, there is no subsequent position information, that is, an end code “11” indicating the end of the code is added.
- the position information code corresponding to the branch hierarchy used in FIG. 28 is shown in FIG.
- FIG. 30 is a functional block diagram showing a schematic configuration of a conventional position information decoding device using differential encoding.
- the head position information decoding unit 3001 decodes the head position information by a normal decoding method.
- the decoded position information is input to and held in the previous position information holding unit 3002.
- the branch information determining unit 3003 reads the position information code.
- the branch hierarchy is determined based on the read code, and the determination result is sent to the difference position information decoding unit 304.
- the difference position information decoding unit 304 updates and updates the value of the position information held in the previous position information holding unit 3002 from the determination result of the branch layer determination unit 3003.
- the updated position information is held in the previous position information holding unit 3Q02. This is repeated until the end code is read.
- the branch hierarchy determining unit 3003 reads the code “10”. Since the code “10” is a code indicating that branching has occurred in the second layer, the difference position information decoding unit 3004 increments the value of the second layer of (0, 0) by 1, and the next position information (0, 1) ) Is required. Similarly, the code “01” is read into the branch hierarchy determination unit 3003 while being decoded to (0, 2) and held in the previous position information holding unit 3002.
- the difference position information decoding unit 3004 Since the code “01” is a code indicating that branching has occurred in the first layer, the difference position information decoding unit 3004 stores the (0, 2) first-layer position information held in the previous position information holding unit 3002 as 1 increase. At the same time, since the value of the first layer has changed, the position information of the lower layers is set to the initial value 0. Thus, the next position information (1, 0) is obtained. This processing is performed to the end, and the decoding ends when the end code "11" is read. By the way, recently, the above-mentioned position information is being expressed by a rational number. For example, as shown in FIG.
- the position information is all rational numbers greater than 0 and less than 1; here, a natural number of a power of 2 (the denominator is a power of 2 and the numerator is a natural number) is represented. This is introduced to enable processing such as arbitrarily adding an additional leaf or node between the existing leaf or node positions.
- position information is given as an integer, and the interval between adjacent position information Is a fixed amount, that is, 1. Because of this premise, it was possible to encode only the hierarchy at which the branch occurred as the encoding information.
- the interval between adjacent position information changes arbitrarily.
- the location information next to location 1/4 may be 1 2 or 3/8. Or it may be 5 Z 16. Therefore, the premise that is satisfied with the position information expressed as an integer as described above does not apply to the position information expressed as a rational number, and therefore, the encoding / decoding technology of the plural position information defined by MPEG-7 is expressed as a rational number. It could not be applied directly to the location information provided.
- the present invention has been made in view of the above situation, and is capable of performing differential encoding and Z-decoding even with position information of a plurality of leaves and / or nodes expressed in a rational number. It is an object of the present invention to provide an apparatus and a method, a decoding apparatus and a method, an encoding program, a decoding program, and a computer-readable recording medium recording the program.
- a first invention of the present application is an encoding device that encodes a plurality of pieces of position information corresponding to a plurality of leaves and a Z or a node in the same hierarchy in a tree structure, the plurality of pieces of position information being encoded.
- a second invention of the present application is an encoding device that encodes a plurality of pieces of position information corresponding to a plurality of leaves and / or nodes in the same hierarchy in a tree structure, wherein the plurality of pieces of position information to be encoded are A judging means for judging a branch hierarchy in accordance with the predetermined order relationship from two consecutive pieces of position information of the plurality of position information to be encoded, and Encoding means for outputting a code.
- the third invention of the present application is the invention according to the first or second invention, wherein the plurality of pieces of position information are rational number position information represented by rational numbers, and the predetermined order relation is a resolution of a rational number. It is characterized in that it is determined according to the order of magnitude.
- a fourth invention of the present application is an encoding apparatus that encodes a plurality of pieces of position information corresponding to a plurality of leaves and a Z or a node in the same hierarchy in a tree structure, the plurality of pieces of position information being encoded.
- Increase width determining means for determining the increase width of the position information value based on the following information; increase width encoding means for encoding the increase width to output a code; and two consecutive plurality of the plurality of pieces of position information to be encoded. It is characterized by comprising determining means for determining a branching layer from position information, and a branching layer encoding means for outputting a code corresponding to the branching layer.
- the plurality of pieces of position information are rational. It is rational number position information expressed as a number, and the increase width is determined for each of the branch layers so that all of the plurality of pieces of position information can be encoded.
- the tree structure represents a search information, and a leaf or a leaf corresponding to the plurality of pieces of position information to be encoded. It is characterized in that the node is a leaf or node corresponding to the same kind of element included in the search information.
- a seventh invention of the present application relates to an encoding method for encoding a plurality of pieces of position information corresponding to a plurality of leaves and Z or a node in the same hierarchy in a tree structure, wherein the plurality of pieces of position information to be encoded are encoded. And a determination step of determining a branch hierarchy according to the predetermined order relationship from two consecutive pieces of position information of a plurality of pieces of position information output from the rearrangement step. And an encoding step for outputting a code corresponding to the branch hierarchy.
- An eighth invention of the present application is an encoding method for encoding a plurality of pieces of position information corresponding to a plurality of leaves and / or nodes in the same hierarchy in a tree structure, wherein the plurality of pieces of position information to be encoded are encoded.
- the plurality of pieces of position information to be encoded are encoded.
- the plurality of pieces of position information are rational number position information represented by a rational number
- the predetermined order relation is a rational number resolution. It is characterized in that it is determined according to the order of magnitude.
- a tenth invention of the present application is an encoding method for encoding a plurality of pieces of position information corresponding to a plurality of leaves and / or nodes in the same hierarchy in a tree structure, wherein the plurality of pieces of position information to be encoded are encoded.
- An increase width determining step of determining an increase width of the value of the position information based on: an increase width encoding step of encoding the increase width and outputting a code; and
- the method is characterized by comprising: a determination step of determining a branch layer from position information; and a branch layer encoding step of outputting a code corresponding to the branch layer.
- the eleventh invention of the present application is further characterized in that, in the tenth invention, the plurality of pieces of position information are rational number position information represented by a rational number, and the increment is:
- the encoding is determined for each of the branch layers so that encoding is possible.
- the twelfth invention of the present application is further characterized in that, in any one of the seventh to eleventh inventions,
- the tree structure represents search information
- the leaf or node corresponding to the plurality of pieces of position information to be encoded is a leaf or node corresponding to the same type of element included in the search information.
- a thirteenth invention of the present application is a decoding device for decoding a position information code string in which a plurality of pieces of position information corresponding to a plurality of leaves and / or nodes in the same hierarchy in a tree structure are encoded.
- Holding means for sequentially holding the obtained position information; determining means for determining a branch hierarchy of two consecutive pieces of position information based on the position information code; Decoding means for increasing the value of the position information corresponding to the branch hierarchy by one according to a predetermined order relationship.
- the fifteenth invention of the present application is further characterized in that the apparatus further comprises a rearranging means for rearranging the plurality of decoded position information in accordance with numerical values.
- the fifteenth invention of the present application is the invention according to the fifteenth invention, wherein the rearranging means calculates a serial number representing a numerical value order, assigned to each of the decoded position information. It is characterized by including calculation means.
- the sixteenth invention of the present application is the invention according to any one of the thirteenth to fifteenth inventions, wherein the plurality of pieces of position information are rational number position information represented by a rational number, and the predetermined order
- the relation is characterized in that it is determined according to the order of resolution of rational numbers.
- a seventeenth invention of the present application is a decoding device that decodes a position information code string in which a plurality of pieces of position information corresponding to a plurality of leaves and / or nodes in the same hierarchy in a tree structure are encoded, Increase width decoding means for decoding the increase width of the value of the position information; holding means for sequentially holding the decoded position information; and determination of judging a branch hierarchy of two consecutive pieces of position information based on the position information code.
- Means, and position information decoding means for increasing the value of the position information corresponding to the branch hierarchy by the increase width with respect to the position information held by the holding means.
- An eighteenth invention of the present application is the invention according to any one of the thirteenth to seventeenth inventions, wherein the tree structure represents search information, and a leaf or a leaf corresponding to the decoded position information.
- the node is a leaf or node corresponding to the same type of element included in the search information.
- a nineteenth invention of the present application is a decoding method for decoding a position information code string in which a plurality of pieces of position information corresponding to a plurality of leaves and / or nodes in the same hierarchy in a tree structure are encoded, A holding step of sequentially holding the decoded position information; a determining step of determining a branch hierarchy of two consecutive pieces of position information based on the position information code; and the position information held by the holding step. And a decoding step of increasing the value of the position information corresponding to the branch hierarchy by one in accordance with a predetermined order relation. .
- a twenty-second invention of the present application is the invention according to the nineteenth invention, further comprising a rearranging step of rearranging the plurality of pieces of decoded position information in descending numerical order.
- the twenty-first invention is further characterized in that, in the twenty-second invention, the rearranging step includes a step of calculating a serial number representing a numerical value order, assigned to each of the decoded position information. It is characterized by including.
- the twenty-second invention of the present application is the invention according to any one of the nineteenth to twenty-first inventions, wherein the plurality of pieces of position information are rational number position information represented by a rational number, and the predetermined order
- the relation is characterized in that it is determined according to the order of resolution of rational numbers.
- a twenty-third invention of the present application is a decoding method for decoding a position information code string in which a plurality of pieces of position information corresponding to a plurality of leaves and / or nodes in the same hierarchy in a tree structure are encoded.
- An increment decoding step for decoding the increment of the value of the information, a holding step for sequentially holding the decoded position information, and determining a branch hierarchy of two consecutive pieces of position information based on the position information code.
- a twenty-fourth invention of the present application is the invention according to any one of the ninth to twenty-third inventions, wherein the tree structure represents search information, and a leaf or a leaf corresponding to the decoded position information.
- the node is a leaf or node corresponding to the same type of element included in the search information.
- a twenty-fifth invention of the present application is a program for causing a computer to function as the encoding device according to any one of the first to sixth inventions.
- a 26th invention of the present application is a program for causing a computer to execute the encoding method according to any one of the 7th to 12th inventions.
- a twenty-seventh invention of the present application is a program for causing a computer to function as the decoding device according to any one of the thirteenth to eighteenth inventions.
- a twenty-eighth invention of the present application is a program for causing a computer to execute the decoding method according to any one of the nineteenth to twenty-fourth inventions.
- a twentieth invention of the present application is a recording medium which can be read by a computer in a convenient manner, in which the data of the twenty-fifth to twenty-eighth inventions is recorded.
- a new order relation between predetermined values is provided for a plurality of position information expressed as rational numbers, the order relation of which cannot be uniquely specified when viewed in the order of numerical values.
- By rearranging the position information in accordance with the order relation it is possible to encode / decode a plurality of position information by differential coding, as in the case of the position information in the integer representation.
- the difference code is similarly notified by using the information indicating the missing position. Encoding of multiple position information by encoding Z decoding is possible.
- the increasing range of the values when viewed in the order of numerical values Is determined and encoded and given together with the sign of the position information, it is possible to encode and decode a plurality of pieces of position information by differential coding in the same manner as in the case of the position information in the integer representation.
- the difference encoding is similarly performed. Encoding / decoding of multiple position information is possible.
- FIG. 1 is a functional block diagram showing a schematic configuration of the position information encoding device according to the first embodiment of the present invention.
- FIG. 2 is a diagram illustrating an example of search information having a tree structure in which position information is given in a rational number expression.
- FIG. 3 shows, in the first embodiment of the present invention, identification information corresponding to each data of the search information shown in FIG. 2, position information extracted from the identification information, and rearrangement of the position information.
- FIG. 14 is a diagram showing position information after rearrangement.
- FIG. 4A is a diagram showing the order relation of values of the position information represented by a rational number in the first embodiment of the present invention.
- FIG. 4B is a diagram showing a method for determining the order relation of FIG. 4A in the first embodiment of the present invention.
- FIG. 5 is a diagram showing an example of position information to be encoded by a configuration example of the position information encoding apparatus according to the first embodiment of the present invention and an encoded position information code sequence.
- FIG. 6 is a diagram showing a position information code used in one configuration example of the position information encoding device according to the first embodiment of the present invention, and also a diagram showing the position information code used in FIG. .
- FIG. 7 is a diagram illustrating another example of search information having a tree structure in which position information is given in a rational number expression.
- FIG. 8 shows identification information corresponding to each piece of data of the search information shown in FIG. 7, position information extracted from the identification information, and an arrangement obtained by rearranging the position information in the first embodiment of the present invention.
- FIG. 14 is a diagram showing position information after the replacement.
- FIG. 9 is a diagram showing another example of the position information to be encoded and the encoded position information code string in one configuration example of the position information encoding device according to the first embodiment of the present invention.
- FIG. 10 is a flowchart for explaining the position information encoding method according to the first embodiment of the present invention.
- FIG. 11 is a functional block diagram illustrating a schematic configuration of the position information decoding device according to the first embodiment of the present invention.
- FIG. 12 is an explanatory diagram showing an operation example of the position information reordering process at the time of decoding in the position information decoding device according to the first embodiment of the present invention.
- FIG. 13 is a functional block diagram showing a functional configuration of a position information rearranging process at the time of decoding in the position information decoding device according to the first embodiment of the present invention.
- FIG. 14 is a diagram showing an example of integration order information handled by the position information decoding apparatus according to the first embodiment of the present invention in the position information rearrangement process at the time of decoding.
- FIG. 15 is a diagram showing another example of the integration order information handled in the position information rearrangement process at the time of decoding in the position information decoding device according to the first embodiment of the present invention.
- FIG. 16 is a flowchart for explaining a position information decoding method according to the first embodiment of the present invention.
- FIG. 17 is a functional block diagram showing a schematic configuration of a position information encoding device according to the second embodiment of the present invention.
- FIG. 18 is a diagram showing an example of position information encoded and an encoded position information code string in one configuration example of the position information encoding device according to the second embodiment of the present invention.
- FIG. 19 is a diagram showing still another example of search information having a tree structure in which positional information is given in a rational number expression.
- FIG. 20 is a diagram showing another example of the position information to be encoded and the encoded position information code sequence in one configuration example of the position information encoding device according to the second embodiment of the present invention. .
- FIG. 21 is a diagram showing still another example of the position information to be encoded and the encoded position information code string in one configuration example of the position information encoding device according to the second embodiment of the present invention. is there.
- FIG. 22 is a flowchart for explaining a position information encoding method according to the second embodiment of the present invention.
- FIG. 23 is a functional block diagram illustrating a schematic configuration of the position information decoding device according to the second embodiment of the present invention.
- FIG. 24 is a flowchart for explaining a position information decoding method according to the second embodiment of the present invention.
- FIG. 25 is a diagram illustrating a configuration example of a general information processing device, and is a diagram for describing the device according to the present invention.
- FIG. 26 is a diagram illustrating an example of search information having a tree structure provided corresponding to moving image content according to the related art.
- FIG. 27 is a functional block diagram illustrating a schematic configuration of a position information encoding device according to MPEG-7 according to the related art.
- FIG. 28 is a diagram illustrating an example of position information encoded by a position information encoding device according to the related art and an encoded position information code sequence.
- FIG. 29 is a diagram showing the position information code used in FIG. '
- FIG. 30 is a functional block diagram showing a schematic configuration of a position information decoding apparatus according to the related art.
- FIG. 1 is a functional block diagram showing a schematic configuration of a position information encoding device according to the first embodiment of the present invention. It is a lock figure.
- the position information encoding device includes a position information reordering unit 101, a head position information report encoding unit 102, a previous position information holding unit 103, a branch hierarchy determination unit. 104 and a difference position information encoding unit 105.
- the element type information and the position information are individually encoded and handled together with the search data.
- the present invention relates to the encoding of the position information.
- the encoding according to the present invention is not limited to MPEG-7.
- the present invention can also take a form as an encoding device that performs encoding including the position information encoding described here.
- FIG. 2 is a diagram illustrating an example of search information having a tree structure in which position information is given in a rational number expression.
- FIG. 2 shows search information corresponding to video content, where video content 210 is composed of three scenes, each scene is composed of three shots, and each shot has a motion. It is assumed that search data indicating strength is added.
- FIG. 3 shows identification information corresponding to each piece of data of the search information shown in FIG. 2, position information extracted from the identification information, and an arrangement obtained by rearranging the position information in the first embodiment of the present invention.
- FIG. 14 is a diagram showing position information after the replacement.
- FIG. 3 shows identification information 301 corresponding to each of the search data 201 to 209 included in the search information of FIG. 2, and position information 302 extracted from the identification information.
- the position information to which the encoding and decoding of the present invention is applied is, as shown in FIG. 3, position information included in a plurality of pieces of identification information having the same element type information and different only in the position information. is there.
- Figure 2 shows an example of search information for video content.
- the actual video content is recursively, where one scene is converted to multiple scenes, and each scene is recursively converted to another multiple scenes. It has a complicated hierarchical structure, such as decomposition, and the search information often has a complicated hierarchical structure.
- search data may be added to each scene or to the entire moving image content. However, even for search information having such a complicated hierarchical structure, the position information encoding and decoding of the present invention can be similarly applied. It is.
- search information for other multimedia contents such as audio contents and text other than moving image contents, or information other than search information can be applied in principle as long as the information has a tree structure.
- the most characteristic functional configuration of the present invention is a positional information reordering unit 101 provided at a stage prior to encoding. .
- the processing of the position information rearranging unit 101 will be described.
- the position information to be coded becomes a rational number expression and the position information cannot be coded by the differential coding shown in the conventional example is that the position information becomes a rational number.
- the next position information value that follows cannot be uniquely determined.
- the value of the next position information is uniquely determined, such as 1 after 0, 2 after 1 and so on.
- the position information following the position information 1/4 may be 1/2, 3Z8, or may be 5/16.
- FIG. 4A and FIG. 4B are diagrams showing the order relation of the values of the position information represented by rational numbers and the method of determining the same in the first embodiment of the present invention.
- a predetermined order relation is provided for the value of the position information represented by a rational number.
- the position information of a rational number represented by "natural number of powers of 2 (the denominator is a power of 2 and the numerator is a natural number)" is treated, and the order relation of the values of the position information is expressed as "1/2 ⁇ 1./4 ⁇ 3Z4 ⁇ 1Z8 ⁇ 3/8 ⁇ 5Z8 ⁇ 7Z8 ⁇ 1/1 6— ”(see Fig. 4A).
- the position information rearranging unit 101 rearranges the respective position information according to the new order relationship thus defined, FIG. 4A.
- rearrangement of the position information 302 of FIG. 3 is also the rearranged position information 303 shown in FIG.
- Sorting is based on the value of the location information assigned to each layer, and the position information is sorted from the upper layer to the values of the layer according to the order of Fig.
- Information with the same information value is recursively repeated by reordering one level down the hierarchy and rearranging it in the order shown in Fig. 4A.
- the position information may be rearranged by collectively treating the values of the position information of all the layers in the leaf or the node.
- an existing sort algorithm such as quick sort etc. is defined for the position information of a leaf or node and the position information of another leaf or node according to the size relationship. By applying, position information can be sorted.
- any sort method can be used as long as a similar sort can be performed, and the sort method is not limited to the method shown here.
- a state is created in which all the position information is extracted and arranged in the order of numerical values, and then the position information is rearranged.
- the position information rearranging unit 101 performs this operation.
- the rearrangement process does not necessarily need to take such a step. For example, at the stage of extracting location information, or before that, at the stage of selecting and extracting search data to be handled collectively, they are sequentially extracted in the order according to Figure 4A. Processing is also possible. Such a process can also be considered to be a kind of rearrangement process performed by the position information rearranging unit 101 widely.
- differential encoding is performed by the same processing as the conventional encoding of position information expressed as an integer.
- the head position information coding unit 102 codes the head position information in the rearranged position information by a normal method using no difference. This top position information is also recorded in the previous position information holding unit 103, and the next position information is encoded. Used in
- FIG. 5 is a diagram showing an example of position information to be encoded by a configuration example of the position information encoding apparatus according to the first embodiment of the present invention and an encoded position information code sequence.
- no particular reference is made to the encoding method relating to this head position information.
- the previous position information holding unit 103 records the position information processed immediately before, and outputs and provides it when encoding the next position information.
- the position information encoded after (12, 1/2) is (1/2, 1/4). That is, when (1/2, 1/4) is encoded, the position information (1/2, 1/2) is recorded and held in the previous position information holding unit 103.
- the branch hierarchy determining unit 104 compares the input positional information with the positional information stored in the previous positional information storing unit 103, determines in which hierarchy the two branches, and determines the determination result. Output to difference position information encoding section 105. Then, difference position information encoding section 105 outputs a position information code corresponding to the branch layer based on the determination result output from branch layer determination section 104.
- the branch hierarchy means that, when viewed in a tree structure, two types of position information, that is, the input position information and the position information stored in the previous position information holding unit 103, are used to determine the root of the corresponding search information tree.
- This refers to the hierarchy of the node or leaf that separates into different nodes or leaves only after branching when it is directed toward the leaves.
- the value of the location information is viewed in order from the upper level to the lower level, and indicates the level where the value of the location information changes first.
- the branch hierarchy determining unit 104 outputs information indicating the second hierarchy as a determination result. More precisely, the position information of the branched layer, in this case, the position information of the shot layer is changed from 1/2 to 1/4, and is correctly updated by one for the order shown in Fig. 4A. You need to make sure you are there. As a result, the case where the update is not correct will be described in another example shown together with FIGS. 7 to 9 described later.
- the input location information is (1/4, 1 2) and the location information (1/2, 3/4) is recorded in the previous location information holding unit 103, the The two location information values already differ in the first layer. From these facts, it can be seen that branching has occurred in the first hierarchy, that is, the scene hierarchy, and thus information indicating the first hierarchy is output as a determination result.
- the position information of the branched layer here the position information of the scene layer, is correctly updated from 1/2 to 1 to 4 in accordance with the order shown in Fig. 4A. You need to make sure. In this case, since the branch occurs at the scene hierarchy, it is necessary to confirm whether the position information of the lower hierarchy, that is, the shot hierarchy, has the initial value 1 to 2 or not.
- the difference position information encoding unit 105 outputs a position information code corresponding to the branch layer based on the determination result output from the branch layer determination unit 104.
- the position information to be encoded is (1
- the difference position information encoding unit 105 receives the judgment result of the branch layer judgment unit 104, and The position information code "1 0" indicating the second layer is output. Since the second layer is a branching layer when decoding this position information code "10", the value of the position information of the second layer is incremented by one according to the order relationship in FIG. 4A. It is a sign which means that. Or, if the position information to be encoded is (1Z4, 1/2
- the differential location information encoding section 105 It outputs the position information code "01" indicating that it is a hierarchy.
- the position information code “01” increases the value of the position information of the first layer by one in accordance with the order relationship in FIG. 4A, since the first layer is a branch layer.
- the value of the position information of the layer below the first layer, the second layer in this example, is Is a code that means the initial value 1 Z 2 in.
- FIG. 6 is a diagram showing a position information code used in one configuration example of the position information encoding device according to the first embodiment of the present invention, and also a diagram showing the position information code used in FIG. .
- the position information code illustrated in FIG. 6 is a code indicating in which hierarchy the tree corresponding to each of the coded position information and the position information processed before is branched, and the bit length of the code. Is determined by the number of branchable hierarchies in the tree structure. When viewed as the identification information added to the search data, the number of position information included in the identification information, that is, the number of search information elements that can take position information corresponds to the number of branchable layers.
- the element type information is also encoded together with the encoding of the position information, and is stored or transmitted together with the encoded position information. . Therefore, by referring to this element type information, it is possible to know the number of hierarchies that can be branched on both the encoding side and the decoding side. Can be known.
- position information without information such as the element type information indicating the number of layers that can be branched is encoded, information indicating the bit length of the code is generated and stored or stored together with the encoded position information. It may be transmitted. The bit length of the above-described code is determined separately from the encoding process in the encoding apparatus shown in FIG.
- Missing code "0 0" is a special code indicating that there is a missing position information.
- the missing code actually indicates that there is no corresponding search data at the position updated with the position information code following the missing code. That is. This will be described in detail in an example shown in conjunction with FIGS. 7 to 9 described later.
- all the position information of the data 201 to 209 contained in the tree is encoded. Not all the position information contained in the tree is necessarily encoded. Any one of the tree structure It is also possible to cut out and encode the part.
- extracting and encoding only the temporally later position information in the tree structure for example, in FIG. 2, when excluding the position information included in the first scene and encoding only in the second and third scenes, The position information at the beginning may be changed to the beginning of the second scene.
- encoding only the temporally previous position information in the tree structure for example, when encoding in only the first and second scenes excluding the position information included in the third scene in FIG. 1.
- an end code may be added, and the encoding may be terminated. If you want to cut out the middle part of the tree structure in time, you can combine them.
- the start position of the changed encoding or the end position of the encoding forcedly terminated by the end code can be any position in the tree structure.
- FIG. 7 is a diagram showing another example of search information having a tree structure in which position information is given in a rational number expression.
- FIG. 8 is a diagram showing each of the search information shown in FIG. 7 in the first embodiment of the present invention.
- FIG. 4 is a diagram showing identification information corresponding to data, position information extracted from the identification information, and position information after rearrangement obtained by rearranging the position information.
- FIG. 9 is a diagram showing another example of the position information to be encoded and the encoded position information code string in one configuration example of the position information encoding apparatus according to the first embodiment of the present invention. is there.
- the position information of the data 701 to 707 included in the search information corresponding to the moving image content 710 of FIG. 7 is encoded.
- the search data indicating the motion intensity is not attached to the shot corresponding to the position information (1/2, 1/4) and (3/4, 1/2). It is an example of information.
- FIG. 3 Like the example shown in FIG. 3, FIG.
- FIG. 9 shows the same rearranged position information as in FIG. 8 and a generated position information code string.
- Fig. 9 explains the operation when encoding the position information (1/2, 3/4).
- the previous position information holding unit 103 stores the position information (1/2, 1 / 2) is held. Then, the branch hierarchy is determined based on the preceding position information. (1/2, 1/2) and (1Z2, 3/4) have the same value in the first layer and different values in the second layer. I understand. However, if it is determined here that the value of the position information of the second layer has been updated by one according to FIG. 4A, the value following 1/2 is 14 in the order relation of FIG. 4A. On the other hand, since the input position information is 3Z4, it can be seen that the position is missing, that is, missing.
- branch layer determining section 104 outputs information indicating that there is a dropout to differential position information encoding section 105 together with information indicating that the branch layer is the second layer.
- the branch hierarchy determination unit 104 generates position information (1/2, 1/4) next to (1/2, 1/2) assuming that there is no loss, and holds the preceding position information.
- the difference position information coding unit 105 receives the determination result received from the branch layer determination unit 104, that is, there is a lack, and the branch layer is the second layer. Outputs information code "10".
- the position information of the first layer is from 1/4 to 3
- branch layer determining section 104 If it is determined whether the value of the two-level location information is the initial value 1/2 according to Fig. Since the position information obtained is 1/4, it can be seen that the position is missing, that is, missing. Therefore, branch layer determining section 104 outputs information indicating that there is a dropout to difference position information encoding section 105 together with information indicating that the branch layer is the first layer. At the same time, the branch hierarchy determining unit 104 generates position information (34, 1/2) assuming that there is no loss and sends it to the previous position information holding unit 103 for recording. From this state, the position information (3/4, 1Z4) is encoded again.
- the difference position information encoding unit 105 receives the determination result received from the branch layer determination unit 104, that is, the presence of a missing part and the fact that the branch layer is the first layer. Outputs information code "01".
- difference encoding can be performed even for position information of a tree structure having a missing part. Furthermore, by actively using the missing codes, the same kind of search data included in the search information having a tree structure can be arbitrarily selected and grouped, or a part of the search data can be trimmed. Operations such as transmission and recording are possible.
- FIG. 10 is a flowchart for explaining the position information encoding method according to the first embodiment of the present invention.
- the position information encoding method includes a position information rearranging step (step S1), a head position information encoding step (step S2), a previous position information holding step (step S1). S3), a branch layer determination step (step S6), and a difference position information encoding step (step S8).
- the encoding method according to the first embodiment of the present invention also relates to encoding of position information, and the present invention relates to an encoding method for performing encoding including the position information encoding described here. It can also take the form. First, a plurality of pieces of position information to be encoded are rearranged in accordance with the order shown in FIG. 4A (step S 1). Next, the rearranged top position information is encoded by a normal method (step S2). At the same time, the first position information is held as previous position information for encoding the next position information (step S3).
- step S4 It is determined whether there is next position information to be encoded (step S4). If there is, the position information to be encoded is read (step S5). The read position information to be encoded is compared with the held previous position information to determine a branching layer (step S6). At this time, it is determined whether or not there is a gap between the two pieces of position information (step S7). As described above, the method of determining the loss is determined by whether or not the position information follows the order relation of FIG. 4A.
- step S8 the encoded position information is held again as the previous position information (step S3), and the same processing is continued. If there is any missing part, the missing code is output first (step S9), and then the position information code corresponding to the branch hierarchy is output (step S8). Next, from the position information held as the previous position information, the next position information obtained assuming that there is no missing is generated, and the missing position information is held as the previous position information (step S10). . Thereafter, the branch hierarchy is determined again based on the previous position information and the already read position information to be encoded (step S6). That is, if it is determined that there is a missing position information to be processed, the same position information is coded again. Thereafter, the presence / absence of a missing portion is determined in the same manner. If there is a missing portion, a process of outputting a missing code (step S 9) and subsequent processes are performed.
- step S8 the encoding is continued using this encoded position information as the previous position information (step S3).
- step S4 If it is determined that there is no next position information to be encoded (step S4), an end code is output (step S11), and the encoding is terminated.
- the coding efficiency becomes highest because the lack of position information
- there are no values at all that is, a case where the values of the position information represented by a plurality of rational numbers to be encoded are continuously given according to a predetermined rational number order relationship and the order relationship of FIG. 4A.
- the order relation of the predetermined rational numbers as shown in FIG. It can be used to assign location information to search data (leaves or nodes) that have type information.
- the M values from the top according to the ordering relationship in Figure 4A Sort them in numerical order, and assign them as location information for each search data. For example, if there are five pieces of search data (leaves or nodes) that have the same element type information to be given position information, the first five and the first ones according to the ordering relationship in Fig. 4A. 2, 1/4, 3/4, 1/8, 3/8 are selected, and these are sorted in numerical order, 1/8, 1/4, 3/8 ,, 1/2, 3 Z4 And assign it as the value of the location information corresponding to each search data.
- each rational value is individually coded, generally, a lower-resolution rational value (a rational value with a smaller denominator value) is coded with a shorter code. From this, the assignment of the value of the rational position information using the order relation as shown in FIG. 4A is not limited to the difference encoding of a plurality of pieces of position information as in the embodiment of the present invention.
- the rational position information attached to (leaves or nodes) is separately encoded, the code length of the code relating to the position information is minimized as a whole.
- the assignment of the position information according to the order relation in FIG. 4A can be similarly realized by performing the following processing.
- the minimum resolution (minimum denominator value) N required to represent the number of position information M to be assigned is determined.
- N is a power of 2
- N indicates the number of pieces of position information that cannot be expressed, that is, the number of pieces of position information whose denominator is ⁇ . Therefore
- this method provides the two step widths 1 / N, 1 / N 'and the predetermined position 2M' at which the step widths are switched, so that the M positions from the top in the order shown in FIG.
- the value of the location information is obtained in the order of numerical values.
- the operation of rearranging the obtained position information values in the order of numerical values is unnecessary, so that the position information values can be assigned at high speed according to the order relationship shown in FIG. .
- the value of M 'that specifies the switching position of the step width is biased toward a smaller value. You can also. However, at this time, 2M 'does not exceed the number M.
- FIG. 11 is a functional block diagram illustrating a schematic configuration of the position information decoding device according to the first embodiment of the present invention.
- the position information decoding device according to the first embodiment of the present invention includes a head position information decoding unit 111, a previous position information holding unit 1102, a branch layer determination unit 1103, and a difference position information decoding unit. It consists of 1104 and a position information rearranging unit 1105.
- the element type information and the position information are individually encoded and handled together with the search data.
- the present invention relates to decoding of the position information.
- decoding according to the present invention is limited to MPEG-7 but is not a CD. It should be noted that the present invention can also take a form as a decoding device that performs decoding including the position information decoding described here.
- the most characteristic functional configuration of the present invention is a position information reordering unit 1 provided at the subsequent stage of decoding the position information. It is 105.
- the position information rearranging unit 1105 converts the position information of the rational number representation obtained by decoding up to the preceding difference position information decoding unit 111 They are rearranged in order based on the numerical value. As shown in this specification, when the location information corresponding to each search data (or clause) included in the search information is handled, the search data (or clause) remains contained in the original tree structure. In many cases, it is necessary to rearrange the corresponding position information in the original order as described above, because it is considered that it is easier to handle.
- the decoding process performed up to the stage before the position information is rearranged by the position information rearranging unit 1105 is the same as the conventional decoding process using position information expressed in integers. The operation of the position information rearranging section 1105 will be described later in detail. .
- the head position information decoding unit 1101 decodes the head position information and outputs the position information. What is performed here is decoding of the position information coded by the normal method, and this operation is not particularly mentioned in the present invention like the coding.
- the operation of the position information decoding apparatus will be described on the assumption that the position information code string shown in FIG. 5 is input.
- the position information code sequence of FIG. 5 is obtained by encoding the position information of each of the search data 201 to 209 included in the search information shown in FIG. 2 by the position information encoding device of FIG. 1 described above.
- the position information code sequence decoded by the decoding device of the present embodiment is not particularly limited to the code sequence generated by the coding device of FIG.
- the leading position information (1/2, 1/2) obtained by decoding by the leading position information decoding unit 1101 is input to the position information reordering unit 1105 and also holds the previous position information. Recorded in part 1 1 0 2 P2004 / 000563.
- the previous position information holding unit 1102 records and holds the position information that has been decoded just before the position information to be currently decoded.
- the branch layer determining unit 1103 sequentially reads the position information code of each input position information code string, determines the branch layer, that is, determines which layer of the position information value to be updated, and determines The result is sent to difference position information decoding section 1104. Note that the bit length of the position information code to be sequentially read by the branch layer determination unit 1103 is determined by the number of layers of the position information. As described in the description of the encoding device, in decoding the position information included in the identification information of the search data, the element type information is encoded together with the encoded position information, that is, the position information code string, and both are decoded. It is usually multiplied or transmitted.
- the number of layers of the position information can be known, and the bit length of the position information code to be read can be known.
- the bit length of the position information code to be read can be known using the information.
- the difference position information decoding unit 1104 reads the position information held in the previous position information holding unit 1102 and, based on the determination result from the branch hierarchy determination unit 1103, determines the value of the position information, Update according to. That is, the difference position information decoding unit 1104 compares the position information recorded in the previous position information holding unit 1102 with the value of the position information of the branch layer based on the determination result of the branch layer determination unit 1103 in FIG. In the order relationship shown in Fig. 4A, the value of the positional information of all the layers is set to the initial value 12 in the order relationship shown in Fig. 4A for the layer that is increased by one according to the order relationship and is lower than the branch layer. The value of the position information of the hierarchy higher than the branch hierarchy is retained as it is.
- the next position information code to be read is "10".
- the branch layer determination unit 1103 determines that the code is “01”, the first layer, that is, a code indicating that there is a branch in the scene layer, and the difference position information decoding unit 1104 determines the code based on the determination result.
- the first layer the value of the position information of the scene layer is updated by one in accordance with the order relationship in Fig. 4 (1).
- the value of the position information of the lower layer, that is, the second layer—the layer of the shot is set as the initial value 1-2 in the order relationship of FIG. 4A.
- the next value of 1/2 is 1Z4, so the position (1/4, 1/2) obtained by updating the value of the position information of the first and second layers from (1/2, 3Z4) is obtained.
- the position information obtained by the difference position information decoding unit 1104 is output to the position information rearranging unit 1105, and is also sent to the previous position information holding unit 1102 and recorded, and the next position information is decoded. Used for
- the position information reordering unit 1105 arranges the position information of the rational number expression decoded and output by the difference position information decoding unit 1104 according to the order relationship shown in FIG. 4A.
- the position information is rearranged in the order according to.
- the position information code string in FIG. 5 illustrated here is decoded
- the position information 303 after rearrangement shown in FIG. 3 is rearranged in the order of the position information 302 before rearrangement. Will be.
- the sorting is performed in order from the upper layer, so that the position information values in the hierarchy are arranged in descending numerical order, and if the value of the position information in the hierarchy is the same, the hierarchy is changed. This is done by recursively repeating the operation of descending and reordering numerical values.
- the position information may be rearranged by collectively treating the values of the position information of all the layers in the leaf or the node. For example, a magnitude relationship between the position information of one leaf or node and the position information of another leaf or node is defined, and according to the magnitude relationship, existing information such as quick sort is applied to the leaf or node position information.
- Position information can be rearranged by applying a sorting algorithm.
- any sort method that can perform the same sort—sort can be used, and the sort method is not limited to the method shown here.
- FIG. 12 is an explanatory diagram illustrating an operation example of the rearrangement process at the time of decoding described here. This rearrangement processing is performed inside the position information rearranging unit 1105.
- reference numeral 1201 denotes 10 pieces of position information (the number of branches that can be branched is 3) output and decoded by the difference position information decoding unit 1104, and these are They are arranged in the order of decoding, that is, in the order according to the order relation of FIG. 4A.
- a consecutive number representing the numerical value order (starting from 0) is finally assigned to each of the decoded position information. (See 1203 in Fig. 12.) If an index is assigned to each piece of position information, the position information can be rearranged according to its value. As an internal configuration of, there is prepared an index calculating unit represented by Fig. 13. In Fig. 12, since the number of position information 1 2 0 1 to be rearranged is 10, the given index 1 2
- the value of 0 3 is from 0 to 9, but according to the number of location information, for example, the index from 0 to 14 for 15 and the index from 0 to 29 for 30 Get dumped.
- the value of the index assigned to each piece of position information is obtained as follows.
- FIG. 13 is a functional block diagram showing, as a functional configuration of a device, a process performed at a certain branch position in a certain hierarchy in order to calculate an index value added to each position information. That is, FIG. 13 is an example further illustrating the internal configuration of the index calculation unit serving as the internal configuration of the position information rearranging unit 1105. The processing in Fig. 13 is performed by the position information counting unit 1301, the update width calculation unit
- index value update unit 1 receives the decoded position information, the count value and the index value processed in the next higher layer, Output the updated index value.
- update width calculation unit 1 receives the decoded position information, the count value and the index value processed in the next higher layer, Output the updated index value.
- the position information counting unit 1301 receives the decoded position information and the count value in the next higher layer as inputs.
- Fig. 12 shows an example of the counting result. I have. However, the counting results 1 202 show the counting results at all the hierarchies and branch positions. For example, in the first layer (branch position), out of the 10 pieces of location information, there are six pieces of location information that take the value 1/2 in the first layer and four pieces of location information that take the value 1 Z4. Is counted.
- the "branch position” referred to here means, when viewed as a tree structure, starting from one node in the hierarchy one level higher than the target hierarchy and starting from all elements (leaves or (Clause), and based on the value of the location information, it refers to a set of location information that has exactly the same value in a layer higher than the target layer. Then, the number of pieces of position information included in each branch position is given by the input count value of the next higher layer. In the first layer of FIG. 12, the elements hanging from the root, that is, the position information of all the elements is the “branch position” of the first layer.
- the order of appearance of the value of the position information to be counted is the decoding order, it always follows the order relationship in FIG. 4A at any branch position. Therefore, the above counting process always calculates the numerical value according to Fig. 4A. If there is a missing value (a value that does not appear is in the middle), the number of occurrences of that value is counted as 0. In other words, in the obtained counting result, the first counting value is always the number of appearances of the first value 1/2 in Fig. 4A, and the second counting value is always 4 represents the number of occurrences of the second value 1/4 of A.
- the counted result is output to the update width calculating section 1302 and the index value updating section 1303. It is output and used for processing in the next layer.
- the update width calculation unit 1302 calculates, based on the count value received from the position information counting unit 1301, the update width of the index value of each position information according to the position information value of the target layer. For a given branch position, the update range of the index value for the position information having a certain value in the target hierarchy is determined by the number of position information having a value smaller than that value in the hierarchy. For example, if there are Ml, M2, and M3 pieces of position information with the values 1/4, 1/2, and 3/4 at the target hierarchy at a certain branch position, the position with the value 1/2 Before the information, there is M 1 position information having the value 1/4, so for the position information having the value 1/2, Ml is added to the position information index having the value 1/4. Need to be indexed.
- the value 1 The update width of the index value for the position information having / 2 is Ml.
- the update width for the position information having the value 3Z4 is given by Ml + M2.
- the numbers M 1, M 2, and M 3 of these pieces of position information correspond to the respective count values obtained by the position information counting section 1301. That is, by adding up the count values obtained by the position information counting section 1301 in order of numerical value, an update width corresponding to each position information value is obtained.
- each count value counted by the position information counting unit 1301 may represent the number of occurrences of each position information value according to the order relationship of FIG. 4A. know. From this, it is possible to know the magnitude relationship of the values in the order in which the numerical values were obtained without comparing the values of the position information with each other. Since no comparison is made between the values, the amount of calculation can be reduced.
- the information for this is the integration order information 1304.
- the integration order information 1304 will be described with reference to FIGS. 14 to 15.
- Table 1401 in FIG. 14 and Table 1501 in FIG. 15 are examples of the integration order information 1304. For example, if the counted position information values are up to three-quarters in the order shown in Fig. 4A, up to 3/4
- the second value (1/4), the first value (1Z2), and the third value (3Z4) The count values may be integrated in that order. If the counted position information values are 7 from 7 to 8, the magnitudes are in the order of Table 1501 in FIG. 15, and the count values may be integrated in that order. In other words, depending on how far the position information is counted (decoded) in the order relationship shown in FIG. 4A, the order of magnitude in the counting order (decoding order) is uniquely determined.
- integrated order information The information in the order of magnitude with respect to the counting order.
- the value of the position information decoded last in the order of Fig. 4A if it is the integration order information corresponding to ( ⁇ 1) ZN that is more than that value, it can be used to determine the integration order. it can. Furthermore, in order to minimize the extra integration processing, the minimum (N-1) ZN that is equal to or larger than that value is selected, and the corresponding integration order information is used. At this time, N is equal to the value of the denominator of the last decoded value. For example, if the value of the position information decoded at a certain branch position is two, 1Z2, 1 ⁇ 4, since the denominator of the last decoded value 1Z4 is 4, the decoding order information up to 3Z4, that is, Use Table 1401 in Figure 14.
- the denominator of the value 1/8 is 8, so the decoding order information up to 7Z8, Use Table 15 01.
- the count values obtained by the position information counter 1301 are integrated in the order indicated by the integration order information 1304, and the update width of the index value corresponding to each value of the position information is obtained.
- the corresponding count value is integrated as 0.
- the obtained update width is output to index value updating section 1303.
- the index value update unit 1303 uses the update width obtained by the update width calculation unit 1302, the count result obtained by the position information counting unit 1301, and the count value of the next higher layer to obtain each position information. Update the value of the attached index.
- the first count value obtained by the position information counting unit 1301 indicates the number of position information having the value 1Z2 in the target hierarchy.
- the index value is updated with the update width corresponding to the value 1/2 obtained by the update width calculation unit 1302 for the location information. At this time, the head of the branch position is obtained from the count value of the input one level higher. Similarly, processing is performed for the second and subsequent count values.
- the initial value of the index of each position information is set to 0.
- Table 1401 in Fig. 14 is used for 304.
- the update width of the index value is set to 0 for the first position information value 1Z4.
- the update width calculation unit 1302 adds the count value 4 corresponding to the value 1 Z4 to the update width 0, and obtains the next value in Table 1401. Obtain the update width 4 of the index value for 1/2. 1 2 0 2
- the integration order information 1 3 0 For Table 4, Table 1401 in Fig. 14 is used.
- the update width of the index value is set to 0 for the first position information value 1 Z4.
- the update width calculation unit 1332 adds the total value 2 corresponding to the value 1/4 to the update width 0, and calculates the update width 2 of the index value for the next value 1 2 in Table 1401.
- the calculated index value updating unit 1303 adds the update width 2 corresponding to the value 1 Z 2 to the index value 4 attached to the first four pieces of position information.
- the updated index value 6 is obtained.
- the update width 0 corresponding to the value 1-4 is added to the index value 4 of the following two pieces of position information corresponding to the second count value, and the updated index value 4 is obtained.
- the table 1401 in FIG. 14 is used for the integration order information 1304, and the update width calculation unit 1302 Calculate the update width 0 for the position information value 1/4 and the update width 1 for the value 1/2.
- the index value updating unit 1303 adds the update width 1 to the three pieces of position information from the head of the branch position, adds the update width 1 to the index value 1, and sets the remaining The index is updated to the index value 0 by adding the update width 0 to the location information.
- the head of the second branch position of the second hierarchy is obtained by the input count value of the immediately higher hierarchy.
- the two count values of the first layer of the counting result 1222, 6 and 4 directly represent the number of pieces of position information at the two branch positions of the second layer. Therefore, after the second branch position of the second hierarchy, The head is 7, which is obtained by adding 1 to the number 6 of the position information of the first branch position. In this way, the head of the branch position is specified, and the index of each position information included in the branch position can be updated.
- the information converted at the head position of each branch position may be held and received from the upper layer.
- 1 203 represents the index value after update at each layer and the value of the update width (in parentheses) obtained at each branch position when the execution is performed in order from the upper layer. It is written. In the lowest third layer, each position information value appears once, so that an index value with one difference is finally obtained. The index thus obtained indicates the order relationship of the position information, and the position information can be rearranged by reading out according to this index.
- the rearranged position information is output from the position information rearranging unit 1105 in FIG.
- the index value is sequentially updated by adding the update width value each time the process is performed.
- the update width of each hierarchy is separately obtained, and finally, each hierarchy is updated.
- the value of the update width of may be summed.
- the position information counting processing, the multiplication processing, and the index value update processing are performed for each branch position, but the position information counting processing is performed for all the hierarchies. May be performed first for all branch positions, and the obtained count value may be held as shown in the count result 122 of FIG. 12 and used for the subsequent processing. In this case, extra memory is required to hold the counting results, but the counting results of other layers can be used at any time.
- the described position information rearrangement process is performed by using the integration order information 1304 that reflects that the value of the decoded position information follows the order relationship in Fig. 4A. Sorting can be performed without having to compare the values of each signal, which has the advantage of reducing calculation processing.
- the processing in the update width calculation unit 1322 is the integration processing of the number of occurrences of the position information, even if the value of the position information that is missing or does not appear is in the middle, By counting the number of occurrences of the position information as 0, processing can be performed in exactly the same framework. For this reason, there is no need for branch processing, etc. Even if there is a missing part, the sorting process can be performed quickly.
- the reordering method has been described specifically for the reordering process at the time of decoding.
- the reordering method described above can be similarly used for the reordering process at the time of encoding.
- the integration order information 1304 is not converted from “order of FIG. 4A” shown in FIGS. All you have to do is change the order of the numerical values, which corresponds to, from “large to small” to “order of Fig. 4A”.
- the position information expressed as a rational number of “natural number of a power of 2 (the denominator is a power of 2 and the numerator is a natural number)” used in the present embodiment is shown as an example. The same can be applied to other rational position information, or to any position information that needs to be rearranged even if it is not a rational number expression.
- the position information code that is read next by the branch hierarchy determination unit 1103 indicates a lack.
- the missing code is "0 0".
- the branch hierarchy determination unit 1103 notifies the difference position information decoding unit 1104 that the next position information is a missing position, and reads the next position information code "10". Since the current position information is a code indicating the branch of the second layer, the determination result is notified to the difference position information decoding unit 110.
- the difference position information decoding unit 1104 receives that the next update position is a missing position, and that the branch hierarchy to be updated is the second hierarchy.
- the difference position information decoding unit 1104 calculates the value of the second layer from the position information (1/2, 1 2) held in the previous position information holding unit 1102 according to the order relationship of FIG. One half is updated from 1/2 to 1/4, and the updated location information (1 / 2.1 / 4) is obtained. However, since this is notified that this is a missing location, the location information sorting unit 1
- the value (1/2, 1/4) is output and held only in the previous position information holding unit 1102 without being output to 105.
- the branch layer determining unit 1103 determines that the next branch layer is the second layer, and compares the result with the difference position information decoding unit. Notify 1 1 04
- the difference position information decoding unit 1104 receives that the branch layer is the second layer, and The value of the second layer of the location information (1/2, 1/4) held in the information holding unit 1 102 is updated from 1 to 4 to 3Z4 according to the ordering relationship of FIG. 4A, and (1Z2, 3/4) is obtained. Since this is not a missing position, it is output to the position information rearranging section 1105. Thus, the next position information is correctly decoded.
- the position information code read next by the branch hierarchy determination unit 1103 indicates a lack.
- the missing code is "0 0".
- the branch layer determining unit 1103 notifies the difference position information decoding unit 1104 that the next position information is a missing position, and reads the next position information code “01”. Since the current position information is a code indicating the branch of the first hierarchy, the determination result is notified to the difference position information decoding unit 1104.
- the difference position information decoding unit 111 receives that the next update position is a missing position and that the branch hierarchy to be updated is the first hierarchy.
- the difference position information decoding unit 1104 calculates the value of the first layer from the position information (1/4, 3/4) held in the previous position information holding unit 1102 according to the order relationship in FIG. In this case, the updated location information (3/4, 1) is updated from 1/4 to 3/4, and the value of the second layer is set to the initial value 1/2 in the order relationship shown in FIG. 4A. / 2), but it is notified that this is a missing position, so it is not output to the position information rearranging unit 1105, but only to the previous position information holding unit 1102, and its value ( 3/4, 1/2) is output and held. Since the next position information code to be read is "1 0", the next hierarchical level is the second hierarchical level in the branch hierarchical level determination unit 1103. Is determined, and the result is notified to the difference position information decoding unit 1104.
- the difference position information decoding unit 1104 receives that the branching layer is the second layer, and receives the position information (3/4, 1 / '2) of the position information held in the previous position information holding unit 1102.
- the values of the two hierarchies are updated from 1/2 to 1/4 according to the order relationship in Fig. 4A, and (3/4, 1/4) is obtained. Since this is not a missing position, it is output to the position information rearranging section 1105. Thus, the next position information is correctly decoded.
- the decoded position information corresponds to each of the search data (or sections), and the search data (or section) is Are treated in order of appearance in the original tree structure, that is, in order of numerical value For example, they are often transmitted or stored in that order.
- the position information in the original order in which the numerical values are arranged in ascending and descending order is obtained by sorting, so that correspondence with the search data (or section) can be obtained. ) Can be identified.
- search data (or clause) can be selected to appear in the original tree structure, or to be treated in the same order as in the position information in accordance with Fig. 4A.
- a flag is separately provided to indicate whether or not the search data (or section) is rearranged, and transmitted or stored together with the position information code string, and the position information rearranging unit 1105 according to the value of the flag. May be used to select whether or not to rearrange the position information.
- FIG. 16 is a flowchart for explaining a position information decoding method according to the first embodiment of the present invention.
- the position information decoding method includes a head position information decoding step (step S21), a previous position information holding step (step S22), a branch hierarchy determination / difference position information decoding. Step (step S26) ⁇ and a position information rearranging step (step S29).
- the decoding method according to the first embodiment of the present invention also relates to the decoding of position information, and the present invention may take a form as a decoding method for performing decoding including the position information decoding described here.
- the head position information is decoded by a normal method (step S21). Then, the decrypted top position information is held as previous position information (step S22).
- step S23 the position information code is read (step S23). Then, it is determined whether or not the read position information code is an end code (step S24). If it is not the end code, it is next determined whether or not it is a missing code (step S25).
- the branch hierarchy is determined based on the position information code, and the position information is updated based on the determination result, that is, the position tt information of the next position is obtained (step S26).
- the value of the position information is increased by one in accordance with the order relationship of FIG. For the lower layers, the initial value 1 Z 2 in Fig. 4A is set, and for the upper layers, the change is not changed. Then, the obtained position information is output (step S27), and is held as the previous position information (step S22), and the same processing is continued. If it is determined that the code is a missing code, the next position information code is read (step S28).
- step S26 the branch hierarchy is determined from the read position information code, and the next position information is obtained in the same manner as described above.
- the position information obtained here is a missing position, it is not output and is simply held as the next previous position information (step S22), and the same processing is continued thereafter.
- the position information is determined to be the end code (step S24), the position information finally decoded and output is rearranged in numerical order (step S29), and the decoding is completed.
- the position information expressed as a rational number a position of a power rational number expression given as an example given by a “natural number of a power of 2” is used.
- the information is not limited to this.
- the same processing can be performed for "natural numbers of powers of 3 (the denominator is a power of 3 and the numerator is a natural number)".
- the “natural number of powers of 2” in the embodiment of the present invention does not include 0 as a matter of course, but 0 may be included here as a possible value of the position information.
- the ordering relationship in FIG. 4A is such that 0 is placed before 1/2 and the initial value is 0.
- the present invention can be applied to any position information having a property that the order relation is not determined as it is even if it is other than a rational number and the ordering can be performed by rearranging.
- the essence of the present invention is that, when there is position information such that the next value to be updated cannot be uniquely specified for a certain value from the numerical order relationship, the position information is determined in a predetermined order.
- FIG. 17 is a functional block diagram illustrating a schematic configuration of the position information encoding device according to the second embodiment of the present invention.
- the position information encoding device includes a head position information encoding unit 170
- step width determination section 1701 previous position information storage section 1703
- the head position information coding unit 1702 is composed of a branch layer determining unit 1704 and a difference position information encoding unit 1705.
- the head position information coding unit 1702 is composed of a branch layer determining unit 1704 and a difference position information encoding unit 1705.
- the head position information coding unit 1702 is composed of a branch layer determining unit 1704 and a difference position information encoding unit 1705.
- the position information encoding apparatus in order to encode a plurality of position information expressed as rational numbers of search information having a tree structure as shown in FIG.
- the order relation is defined in advance, and a plurality of pieces of position information to be encoded are rearranged according to the order relation.
- the position information encoding apparatus includes a position information rearranging unit 101, and is used to return the rearranged position information to the original numerical value in descending order.
- the positional relationship of the positional information is kept in the order of the numerical value, and instead, the step width at which the value of the rational number increases is obtained, and encoding / decoding is performed together with the positional information code.
- encoding / decoding is performed together with the positional information code.
- a fixed step width is determined and given to each hierarchy, and this step width is assigned to a lower hierarchy when a certain hierarchy branches.
- the position information encoding device according to the second embodiment shown in FIG. 17 is different from the position information reordering unit 101 in FIG.
- the position information decoding device according to the second embodiment shown in FIG. 23, which will be described later, includes a width encoding unit 1706, and is replaced with the position information rearranging unit 1105 in FIG.
- a step width decoding unit 2305 is provided.
- the position information encoding device, the encoding method, the decoding device, and the decoding method according to the second embodiment will be described in order, but these descriptions are based on the position information code according to the first embodiment already described. It is assumed that the description of the encoding device, the encoding method, the decoding device and the method is given, and the overlapping parts will be omitted as appropriate. Therefore, detailed descriptions such as the limitations described in the first embodiment are not described again in this embodiment, but unless otherwise specified, the limitations described in the first embodiment are not described. And the like also apply to the second embodiment as it is.
- FIG. 18 shows position information encoded by one configuration example of the position information encoding apparatus according to the second embodiment of the present invention (included in the identification information corresponding to each data of the search information shown in FIG. 2).
- FIG. 3 is a diagram showing an example of position information) and a position information code string obtained by encoding them.
- the operation of the position information encoding device according to the second embodiment of the present invention shown in FIG. 17 will be described with reference to FIG.
- the head position information encoding unit 1702 encodes the head position information among a plurality of pieces of position information to be encoded by a normal method using no difference.
- the present invention does not particularly refer to the encoding method for the head position information.
- the previous position information holding unit 1703 records the position information processed immediately before, It is output and provided when encoding the position information. First, the encoded head position information (1Z4, 1/4) is recorded and held.
- the step width determining unit 17001 obtains a fixed “step width” corresponding to an increasing width from a certain value to the next value for each level with respect to the position information values arranged in a numerical value order, and obtains a step width code.
- the signal is output to the encoding unit 1706 and the branch hierarchy determining unit 17004.
- the value of the position information that can be expressed is determined by the step width.
- the value of the step width for a certain hierarchy is set so that all the position information values assigned to that hierarchy can be expressed.
- the step width is selected as large as possible.
- the position information expressed as a rational number of “natural number of power of 2 (the denominator is a power of 2 and numerator is a natural number)” is calculated as follows. Here is an example using the power of 2 and the numerator is 1). Of course, just as rational numbers are not limited to this, step widths are not so limited.
- the value of the position information existing in the first layer is 1./4
- the initial value is 1/4 and the value is updated as the step width is 1/4.
- the step width is 1 of ⁇ the denominator of the last value>. This is because, when the values of the position information are arranged according to the order relationship in Fig. 4A, the last value has the highest resolution, and other values with lower (or the same) resolution can be represented by that resolution. Is guaranteed.
- all the values of the position information in a certain hierarchy are arranged according to the magnitude relation of the numerical values, and a difference is calculated between two adjacent values, and the difference value and the minimum By obtaining the value that is the greatest common divisor for the value of the position information, it is possible to set a more efficient step width.
- the difference between 3/16 and 3Z8, 3Z16, and the difference between 3Z8 and 3/4 is 3/16. Therefore, this value can be set as the step width of the position information value and the initial value, and three values 3/16, 3/8, and 3Z4 can be represented efficiently.
- Step width encoding section 1706 encodes and outputs the step width corresponding to each layer determined by step width determining section 1701. Encoding is performed for each step width corresponding to each layer, and is encoded in the usual manner, similar to the encoding of the leading position information described above.
- the step width 1/4 of the first layer and the step width 1Z4 of the second layer are each given by being encoded with 5 bits.
- the coding method of the step width like the coding method of the head position information, is not particularly mentioned in the present invention.
- the encoding of the step width is performed after the encoding of the head position information.
- the processing may be performed before the head position information.
- the value of the step width defined here is determined by the value of the position information of the branch layer in the differential encoding / decoding. When updating, it is also used as the initial value of the location information given to the location information of the hierarchy lower than the branch hierarchy. --...
- the processing performed by the one-branch hierarchy determination unit 1704 is basically the same as the processing performed by encoding the conventional position information expressed as an integer. The difference is that the step width is fixed at “1” in the position information expressed as an integer, whereas the step width obtained by the step width determination unit 1701 is used.
- the step width value obtained by the step width determining unit 1701 is also used as the initial value of the position information. As described in detail in the position information encoding device according to the first embodiment, in the encoding device in FIG. 17, the value of the step width is used for the determination of the missing.
- the branch layer determining unit 1704 compares the input position information to be coded with the position information stored in the previous position information storing unit 1703, and determines the branch layer based on the comparison. The result is output to difference position information encoding section 1705. At this time, based on the value of the step width output from the step width determining unit 1701, the branch hierarchy determining unit 1704 determines and outputs the missing data in the same manner as described in the first embodiment. . ⁇
- the difference position information coding unit 1705 selects and outputs a position information code according to the determination result (the presence or absence of a branch layer and a lack) of the branch layer determination unit 1704.
- the previous position information holding unit 1703 stores the position information (1/4, 1 / 4) is held.
- the value of the first layer that is, the level of the scene is the same
- the value of the position information of the second layer that is, the layer of the shot is increasing.
- the value of the position information of the second layer is increased from 1/4 to 1/2 by the step width 1Z4 of the second layer, so that it is understood that branching is performed without omission.
- This determination result is output to difference position information encoding section 1705, and position information code "10" corresponding to the second layer is output from difference position information encoding section 1705. Note that the description in the first embodiment is applied to the type of the position information code and the bit length of the position information code as they are.
- the value of the location information on the first layer increases from 1/4 to 1Z2, and the step width on the first layer increases by 1Z4.
- the value of the second hierarchy is the same as the initial value 1/4 of the step width of the second hierarchy, it can be understood that the branching is performed without omission.
- the result of this determination is output to the difference position information encoding unit 1705, and the difference position information encoding unit 1705 outputs a position information code "01" corresponding to the first layer.
- FIG. 19 shows an example of search information having a tree structure that requires encoding using missing codes.
- the moving image content 1910 is composed of two scenes, the first scene (scene # 1/4) consists of three shots, and the second scene (scene # 1/2) consists of four shots.
- the position information value is 1Z4, 1/2, 3-4 for each shot of scene # 1-4, and the position information 1Z8, 1 is for 4 shots of scene # 1-2. / 4, 3Z8, 1Z2 are waved.
- step width 1/8, all values can be included in the update value, so the step width is 1-8.
- FIG. 20 shows an example of position information extracted from identification information corresponding to each of the data 1901 to 1907 of the search information shown in FIG. 19, and a position information code string obtained by encoding the position information.
- the position information of each shot that composes scene # 1Z4 is 1Z4, 1/2, 3, / 4, and it is considered that a step width of 1/4 is appropriate with them alone, but the overall step width is 1Z8 Therefore, positions (1/4, 3/8) and (1/4, 5/8) that are not originally present appear as missing positions and are coded.
- the step width to be coded when the tree branches is given for a layer existing below the branch layer.
- the step width for the lower layer than the first layer that is, the second layer is encoded and given.
- the number of step widths given when branching also increases. That is, if there are three hierarchies and a branch occurs in the first hierarchy, two step widths corresponding to the second and third hierarchies are encoded and given.
- FIG. 22 is a diagram illustrating a position information encoding method according to the second embodiment of the present invention, and in particular, position information codes corresponding to the operation of the encoding device described with the example of the position information code sequence in FIGS. 18 and 20. It is a flowchart for demonstrating the conversion method.
- the position information encoding method according to the second embodiment of the present invention shown in FIG. 22 is different from the position information encoding method according to the first embodiment shown in FIG. Step S1) is eliminated, and instead, a step width encoding step (step S32) is added, and the missing step (step S7) is replaced by a missing step (step S37) based on the obtained step width. ).
- Other processes are the same as those of the position information encoding method according to the first embodiment, and the steps S2, S3, S4, S5, S6, S8, S9, and S in FIG. 10 and S11 correspond to steps S31, S33, S34, S35, S36, S38, S39, S40, and S41 in FIG. 22, respectively.
- FIG. 23 is a functional block diagram illustrating a schematic configuration of the position information decoding device according to the second embodiment of the present invention.
- the position information decoding apparatus includes a head position information decoding unit 230 1, a previous position information holding unit 2302, a step width decoding unit 2305, a branch hierarchy determination unit 2303, and difference position information decoding. It consists of part 2304.
- the first position information decoding unit 2301, the previous position information holding unit 2302, and the branch layer determination unit 2303 are the function blocks that constitute the position information decoding device according to the first embodiment described with reference to FIG.
- the step width decoding unit 230 5 is the same as the head position information decoding unit 111, the previous position information holding unit 1102, and the branch layer determining unit 1103.
- the operation except for the difference position information decoding unit 2304 is basically the same as the conventional decoding process of the position information expressed as an integer.
- the operation of the position information decoding apparatus according to the present embodiment will be described in the case where the position information code sequence shown in FIG. 18 is input.
- the head position information decoding unit 2301 decodes the head position information and outputs the position information. As in the first embodiment, this is decoding of position information encoded by a normal method, and its operation is not particularly mentioned in the present invention.
- the first position information (1/4, 1/4) is decoded from the first 10 bits (5 bits X number of layers 2) and recorded in the previous position information holding unit 2302. Been kept It is.
- the step width decoding section 2305 decodes and obtains the !! of the stetab width corresponding to each layer.
- the code of the step width following the sign of the head position information is read as 10 bits (5 bits, the number of X layers is 2), and the step width 1Z4 of the first layer and the step width 1Z4 of the second layer are decoded.
- the decoded value of the step width of each layer is output to the difference position information decoding unit 2304 and used to decode the position information.
- the step width like the head position information, is coded and Z-decoded in the usual manner. Therefore, the operation is not specifically mentioned in the present invention.
- the number of bits of 5 bits of each code of the above-described head position information and the number of 5 bits of pits of each code of the step width are determined by the encoding method.
- the branch layer determining unit 2303 sequentially reads the position information code, and notifies the difference layer information decoding unit 2304 of the branch layer indicated by the position information. At this time, as described in the description of the position information decoding apparatus according to the first embodiment, it is also possible to read the missing code and to process the missing position.
- the branch layer determining section 2303 reads the position information code “10”.
- the position information code “10” is a code indicating that the second layer, that is, the layer of the shot is branched, and the determination result is notified to the difference position information decoding unit 2304.
- the description in the first embodiment is applied as it is to the type of the position information code and the pit length of the position information code.
- the difference position information decoding unit 2304 decodes the position information based on the previous position information held in the previous position information holding unit 2302 and the judgment result obtained from the branch hierarchy judgment unit 2303.
- the step width obtained by decoding in the step width decoding unit 2305 is the update width of the value of the position information expressed as a rational number, and the position information given to the lower layer when branching in the upper layer. Is used as the initial value of
- the front position information storage unit 2302 stores the position information (
- the difference position information decoding unit 2304 adds 1/4 of the step width of the second layer obtained by the step width decoding unit 2305 to the value of the second layer corresponding to the branch layer to the held position information. Thus, the location information (1/4, 1/2) is restored. This value is output and the value is stored in the previous position information storage unit 2302.
- the branch hierarchy determination unit 2303 next stores the position information code “0 1 "Is read.
- the position information code “01” is a code indicating that there is a branch in the first layer, that is, the scene layer, and the determination result is output to the difference position information decoding unit 2304.
- the difference position information decoding unit 2304 determines whether the position information (1Z4, 3/4) held in the previous position information holding unit 2302 is to be branched based on the determination result notified from the branch layer determination unit 2303.
- the value of the position information of the first layer, which is the first layer, is increased by 1/4 of the step width of the first layer obtained by the step width decoding unit 2305, and the second layer, which is a layer lower than the branch layer, is Give the step width 1Z4 of the two layers as the initial value.
- the position information (1Z2, 1/4) is decoded.
- the decoded position information (1/2, 1/4) is output and input to the previous position information holding unit 2302 and held.
- This process is performed until the end code "1 1" is read by the branch hierarchy determining unit 2303, and the decoding ends when the end code is read.
- a decoding process in the case where there is a missing will be described with reference to FIG.
- a plurality of missing pieces of position information can be decoded using missing codes.
- the processing up to decoding the step width is the same as the decoding processing described above with reference to FIG. In the position information code string of FIG. 20, the step width decoding section 2305 decodes and obtains the first layer step width 1/4 and the second layer step width 1/8.
- the branch layer determining section 2303 reads the position information code “00”.
- the position information code "0 0" is a missing code indicating a missing position. For this reason, the difference position information decoding unit 2304 is notified that there is a position missing, and the branch layer determination unit 2303 reads the next position information code “10”.
- the position information code “10” is a code indicating that the second layer, that is, the layer of the shot is branched, and the determination result is notified to the difference position information decoding unit 2304.
- the difference position information decoding unit 2304 decodes the next position information based on the previous position information held in the previous position information holding unit 2302 and the judgment result obtained from the branch hierarchy judgment unit 2303. Now, the judgment result is that the branch hierarchy is the second hierarchy, and the position is missing Has been notified.
- the previous position information holding unit 2302 holds position information (1/4, 1/4).
- the position information (1/4) obtained by adding the step width 1/8 of the second layer obtained by the step width decoding unit 2305 to the value of the second layer corresponding to the branch layer to the held position information. , 3/8) is decoded. However, it is notified that this position is a missing position. Therefore, this position information is recorded and held only in the previous position information holding unit 2302 without being output to the outside as decoded position information.
- the branch hierarchy determining unit 2303 reads the position information code “10”.
- the position information code “10” is a code indicating that the second layer, that is, the shot layer is branched, and the determination result is notified to the difference position information decoding unit 2304.
- the position information (1/4, 3/8) is held in the previous position information holding unit 2302.
- the stored position information is added to the value of the second layer corresponding to the branching layer by the step width 1/8 of the second layer obtained by the step width decoding unit 2305, and the position information (14, 1/2) is decrypted. Since this position is not a missing position, this position information is output to the outside as decoded position information, and is held in the previous position information holding unit 2302. In this way, even if there is a missing position, correct position information can be decoded and obtained. Next, a decoding process for the position information code string in FIG. 21 will be described.
- the process up to decoding the position information (1/4, 3/4) is the same as the decoding process described above with reference to FIG.
- the step width decoding unit 2305 outputs a step width 1/4 of the first layer and a step width 1Z4 of the second layer.
- the position information (1/4, 1/2) and (1/4, 3/4) are sequentially decoded and output by the position information codes "10" and "10" which are read thereafter.
- the branch hierarchy determining unit 2303 reads the position information code “01”.
- the position information code "01" is a code indicating that the first hierarchy is a branch hierarchy.
- the position information code sequence in FIG. 21 is obtained by coding a new step width for a layer below the branch layer when the branch layer is determined.
- the step width for the lower layer than the first layer, that is, the second layer is coded and given. Therefore, when it is determined that the first layer is a branch layer, the code of 5 bits corresponding to the step width of the second layer is used as the step width decoding unit 2305. And the new step width 1/8 of the second layer is obtained by decoding.
- the second layer is a branching layer
- the above example is an example of the first and second two layers, for example, it is determined that the first layer is the branching layer based on the positional information including the first to third layers.
- the code that encodes the step width of the second and third layers that immediately follow it is decoded. That is, the step widths for the number of layers below the branching layer are decoded. The same is true even if the number of layers further increases.
- the previous position information storage unit 2302 stores position information (1/4, 3/4).
- the difference position information decoding unit 2304 adds the step width 1Z4 of the first layer obtained by the step width decoding unit 2305 to the value of the first layer corresponding to the branch layer to the held position information. .
- a step width 1/8 of the second layer obtained by newly decoding in the step width decoding unit 2305 is given as an initial value.
- the position information (1/2, 1/8) is obtained by decoding.
- the decoded position information (1 2, 1/8) is output and input to and held by the previous position information holding unit 2302.
- the position information code “10” indicating that the second layer is a branch layer is read by the branch layer determination unit 2303.
- the difference position information decoding unit 2304 adds the step width 1-8 of the second layer to the position information (1Z2, 1/8) held in the previous position information holding unit 2302, and adds the next position information (1 / 2, 1/4), and after that, (1/2, 3/8) and (1/2, 1/2) are decoded, and then the end code "1 1" is read. To end decoding.
- the step width for encoding and Z-decoding in the present embodiment described above serves as both the increment of the position information value and the initial value. In the present invention, by sharing the increment of the value and the initial value in this way, it is possible to perform differential encoding of position information expressed as a rational number while suppressing a decrease in encoding efficiency. Alternatively, it is also possible to encode each of them without sharing the initial step width.
- a differential encoding / decoding method of position information that encodes / decodes the step width for all position information codes at the same time and attaches them at will and changes the step width freely. You can also.
- FIG. 24 is a diagram illustrating a position information decoding method according to the second embodiment of the present invention, in particular, position information corresponding to the operation of the decoding device described with the example of the position information code string in FIGS. 18 and 20.
- FIG. 21 is a flowchart for explaining a decoding method.
- the position information decoding method according to the second embodiment of the present invention shown in FIG. 24 is different from the position information decoding method according to the first embodiment shown in FIG. Step S 29) is eliminated, and instead, a step width decoding step (step S 52) is added, and the difference position information decoding step (step S 26) is decoded to obtain the difference position based on the step width obtained by decoding. It is configured by changing to the location information decoding step (step S57).
- the other processing is the same as the processing of the position information decoding method according to the first embodiment, and steps S 21, S 22, S 23, S 24, S 25, and S 2 in FIG. 7, S28 correspond to steps S51, S53, S54, S55, S56, S58, S59 in FIG. 24, respectively.
- the position information encoding device e including the step width encoding unit 1706 has been described as being implemented separately.
- the present invention is not limited to this, and a position information encoding device including any of those functional blocks may be used. It can also be configured.
- encoding with accompanying rearrangement of position information was performed, or encoding of the step width (step width determining unit 1701 and step width encoding unit) was performed.
- a flag is prepared to indicate whether or not encoding was performed, and the value of the flag is recorded together with the position information code string.
- the attribute information of the position information code string may be recorded in a separate stream or file from the position information code string.
- a position information decoding device including the position information rearranging unit 1105 shown in the first embodiment, and a position information decoding device including the step width decoding unit 2305 shown in the second embodiment.
- the position information decoding device receives the flag recorded by the position information encoding device, and performs decoding accompanied by rearrangement (processing in the position information rearranging section 1105) according to the value of the flag. Or decoding with step width decoding (processing in the step width decoding unit 2305) is switched.
- the updated value cannot be uniquely identified from the numerical order relation by the rational number expression.
- the differential encoding can be performed while maintaining the original positional information order relation. It has different effects such as being able to perform encoding and decoding of position information which is easy to understand intuitively. Therefore, by switching using the flag, it is possible to select and use an appropriate encoding method according to the situation.
- the position information encoding method having the position information reordering step S1 shown in the first embodiment and the position information encoding method having the step width encoding step S32 shown in the second embodiment. From the coding method, it is also possible to configure a position information coding method having any of those steps. Also, the position information decoding method having the position information reordering step S29 shown in the first embodiment and the position information decoding method having the step width decoding step S52 shown in the second embodiment However, it is also possible to configure a position information decoding method having any of those steps. "
- each embodiment has been mainly described with respect to the position information encoding apparatus and method and the position information decoding apparatus and method of the present invention.
- the present invention is directed to the apparatus (encoding apparatus and / or method) in each of the above embodiments.
- a program for causing a computer to function as a decoding device or for causing a computer to execute the processing procedure of the method (encoding method and Z or decoding method) in each of the above-described embodiments.
- a form as a recorded computer-readable recording medium is also possible.
- a program incorporated in the computer to make the computer function is a function for writing a description to operate a CPU or MPU of a combination as each unit (corresponding to each means) in each device described above. , In each of the above methods It can be easily realized by writing a description that causes the CPU or MPU to execute the processing of each step.
- FIG. 25 is a diagram illustrating a configuration example of a general information processing device, and is a diagram for describing the device according to the present invention.
- the processing of various types of information in the device according to the present invention will be described with reference to a configuration example of a general information processing device shown in FIG.
- the information handled by the apparatus according to the present invention is temporarily stored in the RAM 2502 during processing in any of the apparatuses, and then stored in various ROMs 2503 as configuration data such as an image database.
- a program for causing a computer to function as the device according to the present invention is stored in the ROM 2503 and executed by the CPU 2501 reading it out.
- the progress of the processing and the results of the processing are presented to the user through the display device 2505, and when necessary, the user inputs and designates the parameters necessary for the processing using a keyboard, a mouse (pointing device) or the like. do it.
- the program should include a graphical user interface for the display device 2505 that is easy for the user to use.
- intermediate data generated during execution of other processing is also stored in the RAM 2502, and is read and modified / written by the CPU 2501 as necessary.
- a network such as a LAN.
- a communication device is a device for exchanging data with another device via a communication line.
- OM magneto-optical disk
- DVD-ROM digital versatile disc
- FD flash memory
- memory stick various other types of R ⁇ M and RAM
- the program is read out by installing the recording medium as described above in an information processing apparatus such as a computer, or the program is stored in a recording medium provided in the information processing apparatus, and the program is stored as necessary.
- the position information according to the present invention can be encoded / Can perform decryption functions
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Multimedia (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Remote Sensing (AREA)
- Library & Information Science (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
- Signal Processing For Digital Recording And Reproducing (AREA)
Abstract
Description
Claims
Priority Applications (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP04704340A EP1598941A4 (en) | 2003-02-03 | 2004-01-22 | DEVICE AND METHOD FOR CODING, DEVICE AND METHOD FOR DECODING, PROGRAM AND RECORDING MEDIUM |
CN2004800091626A CN1768480B (zh) | 2003-02-03 | 2004-01-22 | 编码装置和方法、解码装置和方法 |
US10/543,005 US7624326B2 (en) | 2003-02-03 | 2004-01-22 | Encoding device and method, decoding device and method, program, and recording medium |
JP2005504794A JP4004521B2 (ja) | 2003-02-03 | 2004-01-22 | 符号化装置及び方法、復号装置及び方法、プログラム、並びに記録媒体 |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2003-025365 | 2003-02-03 | ||
JP2003025365 | 2003-02-03 | ||
JP2003189517 | 2003-07-01 | ||
JP2003-189517 | 2003-07-01 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2004070955A1 true WO2004070955A1 (ja) | 2004-08-19 |
Family
ID=32852648
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2004/000563 WO2004070955A1 (ja) | 2003-02-03 | 2004-01-22 | 符号化装置及び方法、復号装置及び方法、プログラム、並びに記録媒体 |
Country Status (6)
Country | Link |
---|---|
US (1) | US7624326B2 (ja) |
EP (1) | EP1598941A4 (ja) |
JP (1) | JP4004521B2 (ja) |
KR (1) | KR100742738B1 (ja) |
CN (1) | CN1768480B (ja) |
WO (1) | WO2004070955A1 (ja) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7362909B2 (en) | 2003-04-10 | 2008-04-22 | Sharp Kabushiki Kaisha | Coding device and method and decoding device and method |
JPWO2006035813A1 (ja) * | 2004-09-30 | 2008-07-31 | シャープ株式会社 | 符号化装置、符号化方法、復号装置、復号方法、プログラムおよび該プログラムを記録した機械読取り可能な記録媒体 |
Families Citing this family (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7333667B2 (en) * | 2004-12-23 | 2008-02-19 | Kabushiki Kaisha Toshiba | Image encoding apparatus and image encoding method |
KR100961444B1 (ko) * | 2007-04-23 | 2010-06-09 | 한국전자통신연구원 | 멀티미디어 콘텐츠를 검색하는 방법 및 장치 |
US8990673B2 (en) * | 2008-05-30 | 2015-03-24 | Nbcuniversal Media, Llc | System and method for providing digital content |
US8532437B2 (en) * | 2009-05-18 | 2013-09-10 | Citrix Systems, Inc. | Systems and methods for block recomposition for compound image compression |
JP2013523043A (ja) | 2010-03-22 | 2013-06-13 | エルアールディシー システムズ、エルエルシー | ソースデータセットの完全性を識別及び保護する方法 |
EP3699771A1 (en) * | 2019-02-21 | 2020-08-26 | CoreMedia AG | Method and apparatus for managing data in a content management system |
CN113886433A (zh) * | 2021-10-01 | 2022-01-04 | 浙江大学 | 一种层次结构区域检索方法 |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2001326901A (ja) * | 2000-05-18 | 2001-11-22 | Sharp Corp | 動画像シーン情報管理装置 |
JP2002123523A (ja) * | 2000-10-18 | 2002-04-26 | Sharp Corp | 検索情報生成装置 |
JP2002132834A (ja) * | 2000-10-20 | 2002-05-10 | Sharp Corp | 検索情報伝送装置 |
JP2003092757A (ja) * | 2001-07-10 | 2003-03-28 | Sharp Corp | 符号化装置及び方法、並びに復号装置及び方法 |
Family Cites Families (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2780306B2 (ja) * | 1989-02-22 | 1998-07-30 | 三菱電機株式会社 | 位置情報符号化方法 |
EP0494709B1 (en) * | 1991-01-09 | 1998-05-27 | Philips Electronics Uk Limited | Signal transmission system with sepatate tree coding for each of the parameters |
US5781237A (en) * | 1994-03-25 | 1998-07-14 | Matsushita Electric Industrial Co., Ltd. | Video coding apparatus and video coding method |
JP3278297B2 (ja) * | 1994-07-20 | 2002-04-30 | 富士通株式会社 | データ圧縮方法及びデータ復元方法並びにデータ圧縮装置及びデータ復元装置 |
US5737596A (en) * | 1995-12-11 | 1998-04-07 | Seagate Technology, Inc. | Sequential numerical information encoder and decoder |
US6195392B1 (en) * | 1998-06-30 | 2001-02-27 | U.S. Philips Corporation | Method and arrangement for generating program clock reference values (PCRS) in MPEG bitstreams |
JP3483806B2 (ja) * | 1999-07-28 | 2004-01-06 | 松下電器産業株式会社 | 動画像信号の符号化装置及び符号化方法 |
WO2002052857A2 (de) * | 2000-12-22 | 2002-07-04 | Siemens Aktiengesellschaft | Verfahren zur verbesserung der funktionalität der binären repräsentation von mpeg-7 und anderen xml-basierten inhaltsbeschreibungen |
-
2004
- 2004-01-22 CN CN2004800091626A patent/CN1768480B/zh not_active Expired - Fee Related
- 2004-01-22 KR KR1020057014289A patent/KR100742738B1/ko not_active IP Right Cessation
- 2004-01-22 WO PCT/JP2004/000563 patent/WO2004070955A1/ja active Application Filing
- 2004-01-22 EP EP04704340A patent/EP1598941A4/en not_active Withdrawn
- 2004-01-22 JP JP2005504794A patent/JP4004521B2/ja not_active Expired - Fee Related
- 2004-01-22 US US10/543,005 patent/US7624326B2/en not_active Expired - Fee Related
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2001326901A (ja) * | 2000-05-18 | 2001-11-22 | Sharp Corp | 動画像シーン情報管理装置 |
JP2002123523A (ja) * | 2000-10-18 | 2002-04-26 | Sharp Corp | 検索情報生成装置 |
JP2002132834A (ja) * | 2000-10-20 | 2002-05-10 | Sharp Corp | 検索情報伝送装置 |
JP2003092757A (ja) * | 2001-07-10 | 2003-03-28 | Sharp Corp | 符号化装置及び方法、並びに復号装置及び方法 |
Non-Patent Citations (2)
Title |
---|
AVARO O. ET AL: "MPEG-4 Systems: overview", IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, vol. 11, no. 6, June 2001 (2001-06-01), pages 760 - 764, XP001059680 * |
See also references of EP1598941A4 * |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7362909B2 (en) | 2003-04-10 | 2008-04-22 | Sharp Kabushiki Kaisha | Coding device and method and decoding device and method |
JPWO2006035813A1 (ja) * | 2004-09-30 | 2008-07-31 | シャープ株式会社 | 符号化装置、符号化方法、復号装置、復号方法、プログラムおよび該プログラムを記録した機械読取り可能な記録媒体 |
Also Published As
Publication number | Publication date |
---|---|
JPWO2004070955A1 (ja) | 2006-06-01 |
KR100742738B1 (ko) | 2007-07-25 |
KR20050097974A (ko) | 2005-10-10 |
CN1768480A (zh) | 2006-05-03 |
EP1598941A1 (en) | 2005-11-23 |
US20060188167A1 (en) | 2006-08-24 |
EP1598941A4 (en) | 2009-02-18 |
JP4004521B2 (ja) | 2007-11-07 |
CN1768480B (zh) | 2012-03-14 |
US7624326B2 (en) | 2009-11-24 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7358874B2 (en) | Data compression using a stream selector with edit-in-place capability for compressed data | |
Fiat et al. | Generalized'write-once'memories | |
JP3989745B2 (ja) | 接頭語予測を用いた符号化方法及び装置 | |
US6621429B2 (en) | Huffman decoding method and decoder, huffman decoding table, method of preparing the table, and storage media | |
CN1998241B (zh) | 用于对xml文档编码和/或解码的方法及装置 | |
CN100417028C (zh) | 执行霍夫曼解码的方法 | |
JP2005236993A (ja) | 複数画像の要約方法および装置 | |
JP3865694B2 (ja) | 構造化文書の木構造におけるパスの符号化および復号化方法 | |
JP2005525625A (ja) | データ構造によるコンピュータ表現及びそれに関連する符号化/復号化方法 | |
JP5656593B2 (ja) | 符号化データを復号する装置及び方法 | |
JP2012533921A (ja) | データの圧縮方法 | |
WO2004070955A1 (ja) | 符号化装置及び方法、復号装置及び方法、プログラム、並びに記録媒体 | |
KR100486251B1 (ko) | 가변 길이 코드 복호화 장치 및 방법 | |
TWI245999B (en) | Efficient means for creating mpeg-4 intermedia format from mpeg-4 textual representation | |
US7617237B2 (en) | Encoding device, encoding method, decoding device, decoding method, program and machine readable recording medium containing the program | |
JP4005918B2 (ja) | Mpeg−7および他のxmlベースの内容記述のバイナリ表現における機能を改善する方法 | |
US7362909B2 (en) | Coding device and method and decoding device and method | |
US20120319875A1 (en) | Method for storing node information of huffman tree and corresponding decoding method | |
JP4120980B2 (ja) | 符号化装置及び方法、並びに復号装置及び方法 | |
JP5149454B1 (ja) | Ykm形式圧縮プログラムを記録した記録媒体 | |
Furht et al. | Lossless JPEG image compression | |
Béal | Extensions of the method of poles for code construction | |
CN1523766B (zh) | 记录媒体的编码与解码方法 | |
Leighton et al. | Optimizing XML compression | |
JP2002057585A (ja) | 復号装置 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): BW GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2005504794 Country of ref document: JP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2006188167 Country of ref document: US Ref document number: 10543005 Country of ref document: US |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1020057014289 Country of ref document: KR |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2004704340 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 20048091626 Country of ref document: CN |
|
WWP | Wipo information: published in national office |
Ref document number: 1020057014289 Country of ref document: KR |
|
WWP | Wipo information: published in national office |
Ref document number: 2004704340 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 10543005 Country of ref document: US |