JP4453867B2 - Content cooperation degree calculation device and program - Google Patents

Description

  The present invention relates to a technology for assisting acquisition of a license when a license for use of the content is not obtained from the right owner of the content.

  In recent years, content distribution services have been actively performed. And in order to be able to provide more information, the media cooperation system which can acquire information from another medium by operation of one medium is proposed (for example, refer nonpatent literature 1).

  According to this, when an end user tries to acquire content from the system, information on other content registered in cooperation with the entire content or a part of the content is acquired together. can do. This is made possible by creating a link between both contents in advance and registering it in the system.

Sawase, Hirano, Ueno, Higashino, “Cross-Media Collaboration System Design”, IEICE General Conference, A-16-27, 2003

  In a media linkage system or the like, it is necessary to create a link between contents. At that time, if the contents are linked to each other without permission, there is a possibility that a claim can be made later from the right holder of the contents. Therefore, it is important to obtain permission in advance from the right holders of both contents regarding linking.

  However, the content rights are currently diversifying, such as copyright, portrait rights, publicity rights, etc., and how difficult it is to negotiate with all rights holders related to the content. In many cases, it was not possible to complete negotiations for permission because the actual situation would not be known without hearing from industry representatives how much operation was required.

  The present invention has been made in view of the above-described problems, and its object is to provide an objective measure indicating the ease of obtaining permission for cooperation between contents, and to create a link request for a link applicant Is to support.

  The present invention includes means for calculating a content cooperation level that represents the ease of obtaining a permission regarding cooperation between a plurality of contents based on the degree of permission acquisition that represents the ease of obtaining permission for each content desired to be linked. In addition, a calculation means for obtaining a spatial distance between contents from the degree of content cooperation and visualizing as a content space is also provided.

  The permission acquisition ease is an evaluation value that quantitatively indicates the ease of obtaining permission for content use from the content owner. The degree of permission acquisition is, for example, the human ease obtained from the number of rights holders of the content, the time ease obtained from the time taken to obtain the license for the content, and the licenses made in the past for the content It is calculated from the three elements of probabilistic ease obtained from the probability that the permission is granted in the procedure.

  The content cooperation level is an evaluation value that quantitatively indicates the ease of obtaining permission for cooperation between two contents. The content cooperation level is calculated using the permission acquisition ease of each content. If the value of the degree of permission acquisition of both contents to be linked is large, the value of the degree of content cooperation between the two contents is large, indicating that it is easy to obtain permission regarding the cooperation between the two contents. ing.

  According to the present invention, it is possible to express a content space that reflects the degree of content cooperation, so that it is possible to quantitatively know the easiness of obtaining permission regarding cooperation between contents without having to open a talk from industry stakeholders. Is possible. Therefore, when creating a link, the user can consider which content to create a link while looking at the content space in which the degree of content cooperation is reflected, and support the link creation work of link applicants It becomes possible.

  FIG. 1 shows a system configuration example of an embodiment of the present invention. In FIG. 1, a content information management center 100, a link applicant terminal (EU) 200, and a content rights holder terminal (RH) 300 are connected via a communication network 400, and the content information (CI) is content. Managed by the information management center 100. The content entity may exist on another server.

  The link applicant uses the link applicant terminal (EU) 200 to access the content information management center 100 via the communication network 400, and refers to the content information (CI) managed by the content information management center 100. Then, a link permission request is issued to the content rights holder terminal (RH) 300. The permission procedure between the link applicant and the content right holder is performed via the content information management center 100. Based on the license procedure log obtained by a series of license procedures, the license acquisition ease of each content is calculated in the content information management center 100, and the degree of cooperation between contents is calculated from the calculated license acquisition ease. Then, the spatial distance and content space of each content are created. The link applicant can refer to the content space of the content information management center 100 using the link requester terminal (EU) 200, and negotiate permission with the content right holder to create a link between the contents. Can be used as a guideline.

  FIG. 2 shows a configuration example of the content information management center 100 as the content cooperation degree calculation apparatus according to the present invention. The content information management center 100 includes a communication interface 10 that manages necessary communication with a link applicant terminal (EU) 200 and a content right holder terminal (RH), content information management means 11 that manages content information, a link applicant and content. Permission procedure management means 12 for managing the permission procedure with the right holder, permission acquisition ease calculation means 13 for calculating the permission acquisition ease of each content, and cooperation between the contents based on the permission acquisition ease of each content Content cooperation degree calculating means 14 for calculating the degree of content, spatial distance calculating means 15 for calculating the spatial distance between contents from the degree of cooperation between contents, and creation of a content space based on the spatial distance between contents Means 16, a rule setter that searches and sets rules to be described later from the rule database 20 17. Content information database 18 for storing information related to content such as information on the right holder of the content, license procedure log management database 19 for storing a log of the details of the license procedure, and necessary for calculating the license acquisition ease Permission acquisition degree calculation rule, content cooperation degree calculation rule necessary for calculating content cooperation degree, further, spatial distance calculation rule for calculating the spatial distance between contents from the degree of cooperation between contents, and spatial distance between contents A rule database 20 for storing content space creation rules necessary for creating a content space based on the content space.

  The content information management center 100 is a kind of server device configured using computer hardware and software resources, and the communication interface 10 and the units 11 to 17 cooperate with each other to execute necessary processing. In addition, data and the like are read / written to / from the databases 18, 19, and 20 as necessary. The databases 18, 19, and 20 can use a hard disk or any other storage device.

  The operation of the content information management center 100 is broadly divided into creation / management of permission procedure logs, calculation of permission acquisition ease and content cooperation degree, calculation of spatial distance of each content, and creation of content space. Hereinafter, these operations will be described in detail.

  FIG. 3 shows a processing flow until a permission procedure log necessary for calculating the permission acquisition ease and the content cooperation degree is created. In FIG. 3, the communication interface 10 in the content information management center 100 is omitted.

  Here, consider a case where a link applicant creates a link between content A and content B. The link applicant accesses the content information management center 100 via the communication network 400 by the link requester terminal (EU) 200 and passes the link request between the contents A and B to the content information management means 11. The content information management unit 11 acquires the right holder information (license request destination) of the content A and the content B from the content information database 18 using the content name as a key, and obtains the obtained license request destination and the link requester's information. The desired link contents are transferred to the permission procedure management means 12. The permission procedure management means 12 transmits the desired link contents to all received permission request destinations. The right holder of the content A confirms the received link desired content, and transmits permission / inhibition from the content right owner terminal (RHa) 300 to the permission procedure management means 12 of the content information management center 100 via the communication network 400. To do. The permission procedure management means 12 transmits information regarding permission / inhibition received from the content rights holder terminal (RHa) 300 to the link applicant terminal (EU) 200. Similarly, for the content B, a permission procedure is performed between the link applicant terminal (EU) 200 and the content rights holder terminal (RHb) 300 of the content B via the permission procedure management unit 12. When there are a plurality of right holders for one content, a permission procedure is performed between all the right holders and the link applicant. RHa and RHb mean a generic term for one or more right holders.

  The license procedure log management database 19 accumulates and stores the contents of the above-described series of license procedures between the link applicant and the content rights holder (the number of rights holders of the content, the time required for the procedure, whether permission is granted, etc.). deep. Although only the processing flow related to the contents A and B has been described here, many procedure details related to other contents are stored and managed in the permission procedure log management database 19.

  FIG. 4 is a configuration example of the content information management database 18 and shows that the right holder name, permission request destination, and the like are stored as the right holder information regarding the content A. In this example, there are three rights holders of content A, RH1, RH2, and RH3. Similarly, right holder information regarding the content B and other content is stored in the content information database 18.

  FIG. 5 shows a configuration example of the license procedure log management database 19. As a past license procedure log related to the content A, a license procedure ID for uniquely identifying the license procedure, each right holder of the content A (here, RH 1, RH2, RH3), a license permission response, a finally determined permission permission determination result, the number of times required for permission negotiation, and the like are accumulated. In FIG. 5, only when permission responses from all right holders (RH1, RH2, RH3) are permitted, the permission permission determination result is allowed. Similarly, past license procedure logs of content B and other content are stored in the license procedure log management database 19.

  Next, FIG. 6 shows a processing flow from the information in the content information database 18 and the permission procedure log management database 19 until the permission acquisition degree and the content cooperation degree are calculated. Also in FIG. 6, the communication interface 10 in the content information management center 100 is omitted.

  The permission acquisition ease calculation means 13 first obtains the number of rights holders of content A and the number of rights holders of content B from the content information database 18 upon receiving a link request between the contents A and B from the link applicant. . Next, the permission acquisition ease calculation means 13 acquires the permission procedure logs of the content A and the content B (time required for the permission procedure, permission permission, etc.) from the permission procedure log management database 14. And in order to acquire the calculation rule for calculating permission acquisition ease, a rule request | requirement is performed with respect to the rule setting means 17. FIG. The rule setting unit 17 searches the rule database 20, acquires a permission acquisition ease calculation rule, and passes it to the permission acquisition ease calculation unit 13. The number of right holders of the contents A and B may be acquired from the content information database 18 by the content information management unit 11 and passed to the permission acquisition ease calculation unit 13.

  The permission acquisition ease calculation means 13 calculates the permission acquisition ease of each of the contents A and B based on the acquired permission acquisition ease calculation rule and passes it to the content cooperation degree calculation means 14. Here, the human ease, temporal ease, and probabilistic ease of content A are calculated, and similarly, the human ease, temporal ease, and probabilistic ease of content B are calculated respectively. Assume that the data is passed to the calculation means 14. The degree of human ease is obtained from the number of rights holders of content. The larger the value, the fewer rights holders, and the easier it is to obtain permission. The time ease is obtained from the time (number of times) required for the permission procedure in the content permission procedure log. The larger the value, the less time it takes to obtain permission, and the easier it is to obtain permission. . The probabilistic ease is obtained from the probability that the permission has been established in the permission procedures performed in the past. The larger the numerical value, the higher the probability of obtaining the permission.

Specifically, the permission acquisition ease calculation means 13 uses the number of rights holders of the acquired content and the content permission procedure log based on the license acquisition ease calculation rule as follows. Calculate probabilistic ease. Here, the permission acquisition ease calculation rule is as shown in FIGS. The human ease is obtained by grouping the number of content holders according to the rules shown in FIG. The time ease is obtained by obtaining the average value of the days required for the negotiation for permission from the content permission procedure log and grouping it according to the rules shown in FIG. The probabilistic ease refers to the permission permission determination result from the content permission procedure log, and the following expression permission acquisition probability (%) = number of permitted permission permission determination results / total number of permission procedure logs × 100
Is used to obtain the permission acquisition probability, and is obtained by grouping according to the rules shown in FIG.

  As an example, when obtaining the permission acquisition degree for the content A having the right holder information as shown in FIG. 4 and the permission procedure log as shown in FIG. 5, the following is obtained. As shown in FIG. 4, since the number of right holders is 3 (persons), the human ease is obtained as “8” from the rule of FIG. Moreover, since the average number of days for negotiation is calculated as (4 + 6 + 9 + 6 + 5) / (5 = 6 (days) from FIG. 5, the average number of negotiation days is “6” from the rule of FIG. 5 is “3”, the permission acquisition probability is 3/5 × 100 = 60 (%), and the probability is obtained from the rule of FIG. The degree of ease is determined as “6”.

  The data of the permission procedure log shown in FIG. 5 is an example. In addition, it is confirmed that the discussion was made between the link requester terminal (EU) and the right holder (RH) such as costs necessary for negotiation. It is conceivable to record it in a log and use it as one of the elements when calculating the permission acquisition ease. In connection with this, it is also conceivable to use calculation rules other than those shown in FIGS. The calculation of the permission acquisition ease may be performed using only a part of the rules as necessary.

  The content cooperation level calculation means 14 is the same as the permission acquisition ease calculation means 13 from the human ease, time ease, probabilistic ease of content A, and the same human ease, time ease of content B, When the probabilistic ease is passed, a rule request is made to the rule setting means 17 in order to obtain a calculation rule for calculating the content cooperation degree. The rule setting unit 17 searches the rule database 20, acquires a content cooperation level calculation rule, and passes it to the content cooperation level calculation unit 14. The content cooperation degree calculation means 14 calculates the content cooperation degree between the contents A and B based on the acquired content cooperation degree calculation rule.

  Now, let A_m, A_t, and A_p be the human ease, temporal ease, and probabilistic ease of content A, and similarly, the human ease, temporal ease, and stochastic ease of content B are B_m, Let B_t and B_p. At this time, for example, if the content cooperation degree calculation rule is expressed by a function G and A_m, A_t, A_p, B_m, B_t, and B_p are used as parameters, the content cooperation degree between the contents A and B (AB_m, AB_t) , AB_p) can be calculated by the following equation.

  Here, AB_m, AB_t, and AB_p, which are each element of the content cooperation level, represent a human ease, a temporal ease, and a probabilistic ease regarding the linkage between the contents A and B, respectively. The larger the numerical value of AB_m, the smaller the number of rights holders related to the contents A and B. The larger the numerical value of AB_t, the longer it takes to obtain permission for cooperation between the contents A and B. The larger the value is, the higher the probability of obtaining permission for cooperation between the contents A and B.

  FIG. 10 shows an example of the content cooperation degree calculation rule G. For example, when focusing on the elements of the probabilistic ease, by setting a calculation table as shown in FIG. 10 in advance, the probabilistic ease AB_p regarding the cooperation between the contents A and B can be obtained from A_p and B_p. Can be calculated. As shown in FIG. 10, since it is necessary to obtain permission from the respective right holders of both contents A and B in order to obtain permission regarding cooperation between contents A and B, the probabilistic ease of each of contents A and B It can be considered that the larger the value, the larger the value of the probabilistic ease AB_p regarding the cooperation between the contents A and B. AB_m and AB_t can also be calculated by setting a calculation table in the same way. The calculation table has various patterns depending on the combination of contents. Furthermore, G may be calculated using an existing calculation method or a function derived from experience.

  Next, FIG. 11 shows a processing flow from calculating the spatial distance between contents based on the degree of cooperation between contents to creating a content space based on the spatial distance between the contents.

  In FIG. 11, the processing flow is the same as that in FIG. 6 until the content cooperation level (AB_m, AB_t, AB_p) is calculated. The content cooperation degree calculation means 14 passes the content cooperation degrees (AB_m, AB_t, AB_p) between the contents A and B to the spatial distance calculation means 15. The spatial distance calculation means 15 obtains a calculation rule for calculating the spatial distance between the contents A and B in the content space from the content cooperation degree between the contents A and B. Make a rule request. The rule setting means 17 searches the rule database 20, acquires a spatial distance calculation rule, and passes it to the spatial distance calculation means 15.

  An example of the spatial distance calculation rule is shown below. Considering that the content cooperation level (AB_m, AB_t, AB_p) between the contents A and B is a vector having three elements and going from A to B, the magnitude of the content cooperation level vector is as follows: expressed.

  The larger the values of human ease AB_m, temporal ease AB_t, and probabilistic ease AB_p between contents A and B, the easier it is to obtain permission for cooperation between contents A and B. The larger the magnitude vector, the easier it is to obtain permission for cooperation. Consider reflecting this in the spatial distance between the contents A and B in the contents space. If it is expressed so that the spatial distance between the contents becomes smaller as the permission regarding the cooperation becomes easier, the reciprocal of the magnitude of the content cooperation degree vector in [Formula 2] may be used as the spatial distance between the contents. That is, the spatial distance between the contents A and B is represented by the following calculation rule.

  The spatial distance calculation means 15 calculates the spatial distance between the contents A and B based on the spatial distance calculation rule from the content cooperation degree between the contents A and B (AB_m, AB_t, AB_p). The spatial distance calculated by the spatial distance calculation means 15 is passed to the content space creation means 16.

  The content space creation unit 16 makes a rule request to the rule setting unit 17 in order to acquire the content space creation rule. The rule setting unit 17 searches the rule database 20 to acquire a content space creation rule and passes it to the content space creation unit 16. The content space creation means 16 creates a content space based on the content space creation rule based on the spatial distance between the contents A and B.

  Here, as an example of the content space creation rule, if multidimensional scaling is used, the spatial distance between the contents of [Equation 3] is calculated as the Eugrid distance in the multidimensional scaling, and the coordinates are calculated. Accordingly, as shown in FIG. 12, the content can be arranged on the content space 21, and the ease of obtaining permission regarding the cooperation between the content can be expressed by the closeness of the distance between the content.

  As an example of the content space creation rule, for example, if the display color generation method proposed in Japanese Patent Laid-Open No. 9-90924 is used, by specifying the spatial distance between contents as an attribute to be converted into color information, The size of the spatial distance can be mapped and expressed on a color palette created by gradation between two specified colors. As a result, as shown in FIG. 13, on the content space 22, the ease of obtaining permission regarding cooperation with other content around the content A is reflected in the color of the line connecting the content. Can do. For example, if two colors of black and white are designated, it is possible to express the black color darker as the line connecting the content with a shorter spatial distance.

  Data of the content space created by the content space creating means 16 is sent to the link applicant terminal (EU) 200 via the communication network 400, and the content space is displayed visually. As a result, the link applicant can examine which content should create a link while looking at the content space (FIG. 12, FIG. 13, etc.) reflecting the degree of content cooperation representing the ease of obtaining permission. This makes it easier to negotiate permission when creating links.

  Note that a part or all of the processing functions of each means in the content information management center 100 shown in FIG. 2 are configured by a computer program, and the present invention can be realized by executing the program using the computer. Alternatively, it is needless to say that the processing procedure shown in FIG. 3, FIG. 6, FIG. 11, etc. can be configured by a computer program and the program can be executed by the computer. In addition, a computer-readable recording medium such as an FD, MO, ROM, memory card, CD, or the like is stored in the computer. In addition, the program can be recorded and stored on a DVD, a removable disk, etc., and the program can be distributed through a network such as the Internet.

It is a system configuration figure of an embodiment of the present invention. It is a block diagram of the Example of the content information management center by this invention. It is a processing flowchart (the 1) of the Example of this invention. It is an example of right holder information. It is an example of a permission procedure log. It is a processing flowchart (the 2) of the Example of this invention. It is an example of a calculation rule of human ease. It is an example of a calculation rule of time ease. It is an example of a calculation rule of probabilistic ease. It is an example of a calculation rule of a content cooperation degree. It is a processing flow figure (the 3) of the Example of this invention. It is an example of content space. It is another example of content space.

Explanation of symbols

DESCRIPTION OF SYMBOLS 100 Content information management center 200 Link applicant terminal 300 Content right holder terminal 400 Communication network 10 Communication interface 11 Content information management means 12 License procedure management means 13 License acquisition ease calculation means 14 Content cooperation degree calculation means 15 Spatial distance calculation means 16 Content space creation means 17 Rule setting means 18 Content information database 19 License procedure log management database 20 Rule database

Claims (4)

A content cooperation degree calculation device in a system that obtains permission from a right holder of content when creating a link between a plurality of contents and using the link,
Content information management means for managing content information;
A licensing procedure management means for managing licensing procedures performed between the link applicant and the content right holder,
Permission acquisition ease calculation means for calculating permission acquisition ease of each content desired to be linked from a link applicant from the content information and log information of the permission procedure;
Content cooperation degree calculating means for calculating the degree of cooperation between the contents from the calculated permission acquisition degree of each content;
Rule setting means for managing and setting calculation rules necessary for calculating the permission acquisition degree and the content cooperation degree;
The content cooperation degree calculation apparatus characterized by comprising. In the content cooperation degree calculation apparatus of Claim 1,
A spatial distance calculating means for calculating the spatial distance of each content from the degree of cooperation between the contents;
Content space creating means for creating a content space using the spatial distance of each content,
The rule setting means further manages and sets a calculation rule necessary for calculating the spatial distance and a content space creation rule necessary for creating the content space.
The content cooperation degree calculation apparatus characterized by the above. In the content cooperation degree calculation apparatus according to claim 1 or 2,
The license acquisition ease calculation means has been carried out in the past as content permission acquisition ease from the number of right holders of content to human ease, time required to obtain permission for content, time ease, and content Calculate part or all of the probabilistic ease from the probability that the license was granted in the licensing procedure,
The content cooperation degree calculation means uses part or all of the human ease, temporal ease, and probabilistic ease of each content, and the human ease, temporal ease, probabilistic Calculate some or all of the ease,
The content cooperation degree calculation apparatus characterized by the above. The content cooperation degree calculation program for functioning a computer as each means which comprises the content cooperation degree calculation apparatus of any one of Claims 1 thru | or 3.

Images