KR20220074483A - Method and apparatus for controlling multimedia contents version - Google Patents

Abstract

A method and apparatus for managing multimedia content versions are provided. When a new content registration request is input, the management device calculates the similarity between the new content and the content included in the content version information of the tree data structure, respectively. And, based on the similarity, new content is registered as root content or child content in the content version information of the data tree structure, and the change history according to the registration of the new content is recorded in the block chain.

Description

Multimedia content version management method and apparatus {Method and apparatus for controlling multimedia contents version}

The present disclosure relates to content version management, and more particularly, to a blockchain-based multimedia content version management method and apparatus.

A version control system is a tool for preserving digital documents or source code and recording the change history. In particular, it accurately records who, when, and what modified content so that it can be recovered from errors that may occur during sharing and collaboration. One of the major problems of the existing version control system is that, due to the structure of storing digital documents or source codes in a central server, if a problem occurs in the central server, the documents or codes cannot be accessed. To solve the problem of such a centralized version control system, a distributed version control system such as Git has been provided, which stores digital documents or source code locally for each user and provides a tool to subsequently merge them. do.

However, in the distributed version control system, since there is no way to forcibly synchronize each user's locally stored digital document and source code, there is a possibility that each user has a different version of the digital document and source code. Big.

In addition, in a distributed version control system, since users can freely modify changes to a digital document and source code stored locally, it is impossible to prove the authenticity of a document and who the original author is.

On the other hand, in a digital document or source code stored as text, there are tools (eg, Unix Diff) that can specifically describe the change history of data. However, data that cannot be generally stored as text, such as multimedia data, cannot be applied with the change comparison tool used for text. Therefore, multimedia data such as images, videos, and audio, which are non-text data stored in binary, requires a different approach from the existing version control system.

An object to be solved by the present disclosure is to provide a method and apparatus for performing content version management so as to preserve distributed and stored multimedia content using a block chain and track changes thereof.

In addition, an object of the present disclosure is to provide a content version management method and apparatus capable of describing changes to multimedia data in binary form rather than text.

According to an embodiment of the present disclosure, a method for performing version management of multimedia content is provided. The method includes: calculating, by the management device, a degree of similarity between the new content and the content included in the content version information of the tree data structure, respectively, when a new content registration request is input; registering, by the management device, the new content as root content or child content in content version information of the data tree structure based on the similarity; and recording, by the management device, a change history according to the registration of the new content in the block chain.

In one embodiment, the step of recording in the block chain may include recording a content data registration transaction including a hash value of the parent content of the registered content and a similarity with the parent content in the block chain. have.

In one embodiment, when the new content is registered as root content, the hash value of the parent content is a hash value of the content of the root node having the highest similarity to the new content among the content of existing root nodes, and the new content When the content is registered as child content, the hash value of the parent content may be a hash value of the content determined to be the same as the new content.

In one embodiment, the recording in the block chain may further include recording a content hash registration transaction including a cryptographic hash for encryption of the registered content in the block chain. In this case, after the step of recording the content hash registration transaction in the block chain, the step of recording the content data registration transaction in the block chain may be performed.

In one embodiment, the calculating of the degree of similarity with the contents may include calculating a similarity between root contents corresponding to a root node and the new contents among all contents registered in the contents version information; selecting a route content having the greatest similarity among the root contents corresponding to the root node when there is a root content having a similarity exceeding a preset maximum root similarity among the calculated similarities; and calculating a similarity between the new content and the child content registered as a child node of the selected root content.

In one embodiment, the registering may include registering the new content as new route content when there is no route content having a similarity exceeding a preset maximum route similarity among the calculated similarities. .

In an embodiment, the registering may include, when there is no child content having a similarity exceeding a preset same similarity among child contents registered as a child node of the selected root content and the new content, the largest selecting child content having similarity; and registering the new content as child content of the selected child content.

In an embodiment, the calculating of the similarity may include calculating the similarity between the contents included in the content version information and the new content by using a similarity function obtained through deep neural network learning.

According to another embodiment of the present invention, an apparatus for performing version management of multimedia content is provided. The device may include: an interface device configured to receive content to be newly registered; and a processor configured to perform registration processing for content input through the interface device, wherein the processor is included in the content version information of the tree data structure when a registration request for new content is input through the interface device calculating a similarity between existing contents and the new contents, respectively; registering the new content as root content or child content in content version information of the data tree structure based on the similarity; And it is configured to perform an operation of recording the change history according to the registration of the new content in the block chain.

In one embodiment, when the processor performs the operation of recording in the block chain, the operation of recording the content data registration transaction including the hash value of the parent content of the registered content and the similarity with the parent content in the block chain may be configured to perform

In one embodiment, when the new content is registered as root content, the hash value of the parent content is a hash value of the content of the root node having the highest similarity to the new content among the content of existing root nodes, and the new content When the content is registered as child content, the hash value of the parent content may be a hash value of the content determined to be the same as the new content.

In one embodiment, the processor additionally performs an operation of recording a content hash registration transaction including a cryptographic hash for encryption of the registered content in the block chain when performing the recording operation in the block chain, and the content After the operation of recording the hash registration transaction in the block chain, the operation of recording the content data registration transaction in the block chain may be performed.

In an embodiment, when the processor performs the operation of calculating the degree of similarity with the contents, each of the similarities between the root contents corresponding to the root node and the new contents among all contents registered in the contents version information counting; selecting a route content having the greatest similarity from among the root contents corresponding to the root node when there is a root content having a similarity exceeding a preset maximum root similarity among the calculated similarities; and calculating a similarity between the new content and child content registered as a child node of the selected root content, respectively.

In one embodiment, when performing the registering operation, if there is no route content having a similarity exceeding a preset maximum route similarity among the calculated similarities, the processor registers the new content as new route content. may be configured to perform.

In one implementation, when the processor performs the registering operation, if there is no child content having a similarity exceeding a preset same similarity among child contents registered as a child node of the selected root content and the new content , selecting the child content having the greatest similarity; and registering the new content as child content of the selected child content.

In an embodiment, the processor may be configured to calculate a similarity between the contents included in the content version information and the new content by using a similarity function obtained through deep neural network learning.

According to embodiments, version management of data that is not expressed in text, such as multimedia content, may be performed. In particular, by storing content registration and changes in the blockchain distributed ledger, reliable content preservation and confirmation of copyright rights information can be expected.

1 is a diagram illustrating an example of content version information of a tree data structure according to an embodiment of the present invention.
2 is a diagram illustrating an example of adding a content node to content version information of a tree data structure according to an embodiment of the present invention.
3 is a diagram illustrating an example of obtaining a degree of similarity through a deep neural network according to an embodiment of the present invention.
4 is a flowchart of a process of recording content changes in a content version management method according to an embodiment of the present invention.
5 is a diagram showing an example of the structure of a block chain according to an embodiment of the present invention.
6 is a diagram illustrating an example of a content hash registration transaction according to an embodiment of the present invention.
7 is a diagram illustrating an example of a content data registration transaction according to an embodiment of the present invention.
8 is an exemplary diagram illustrating a block including a transaction according to an embodiment of the present invention.
9 is a flowchart of a method of propagating content registration or change history using a block chain according to an embodiment of the present invention.
10 is a structural diagram illustrating a computing device for implementing a content version management method according to an embodiment of the present disclosure.

Hereinafter, with reference to the accompanying drawings, embodiments of the present disclosure will be described in detail so that those of ordinary skill in the art to which the present disclosure pertains can easily implement them. However, the present disclosure may be implemented in several different forms and is not limited to the embodiments described herein. And in order to clearly explain the present disclosure in the drawings, parts irrelevant to the description are omitted, and similar reference numerals are attached to similar parts throughout the specification.

Throughout the specification, when a part "includes" a certain element, it means that other elements may be further included, rather than excluding other elements, unless otherwise stated.

In this specification, expressions described in the singular may be construed in the singular or plural unless an explicit expression such as “a” or “single” is used.

In addition, terms including an ordinal number such as first, second, etc. used in an embodiment of the present disclosure may be used to describe the components, but the components should not be limited by the terms. The terms are used only for the purpose of distinguishing one component from another. For example, without departing from the scope of the present disclosure, a first component may be referred to as a second component, and similarly, the second component may also be referred to as a first component.

Hereinafter, a block chain-based multimedia content version management method and apparatus according to an embodiment of the present disclosure will be described with reference to the drawings.

In an embodiment of the present invention, change details such as content registration are recorded using a tree data structure.

1 is a diagram illustrating an example of content version information of a tree data structure according to an embodiment of the present invention.

As shown in the accompanying FIG. 1, in the embodiment of the present invention, content version information is managed in a tree data structure.

In the content version information consisting of a tree data structure, each node (A, A1, A2, A11, A12, A21, A111) represents specific content data, and each content data indicates through an arrow line that the content is modified from which content. (or derived) can be known. A root node A represents unique original content, and child nodes A1 to A111 represent content derived from a root node or a parent node. For example, nodes A1 and A2 are contents derived from the root node A, and nodes A11 and A21 are contents derived from nodes A1 and A2, respectively. Each node stores the public key of the user who created the content and the hash value of the content data, so that it can be tracked who produced what content or created content derived from someone else's content. let it be Here, the user's public key may be generated using a public key encryption algorithm such as RSA, but the specific method is not limited in the present invention. Similarly, the hash value of the content data may also be generated through an encryption hash algorithm such as SHA256, but the specific method is not limited in the present invention.

In an embodiment of the present invention, the process of recording content change details is a process of inserting a node, that is, a content node, to the content version information of the tree data structure described above.

2 is a diagram illustrating an example of adding a content node to content version information of a tree data structure according to an embodiment of the present invention.

As illustrated in FIG. 2 , when trying to register new content (New), in an embodiment of the present invention, the content to be newly registered is selected as the original content (C) or the derived content by comparing the similarity with the previously registered content. Register as (A12 or B1). In other words, in the case of new content different from the existing content, the corresponding content is registered as the root node (C), and when similarity with the existing content is found, it is registered as a child node (A12 or B1) of the most similar content node. In an embodiment of the present invention, unlike a general distributed version control system such as Git, it does not allow a user to add content data as a child of an arbitrary node, and it can be added only through an algorithm based on a similarity function to be described later. have.

를 사용한다. 유사도 함수

는 두 콘텐츠 데이터

,

가 주어졌을 때, 이 둘 데이터가 얼마나 유사한지를 0(전혀 유사하지 않음)부터 1(동일함)까지의 숫자로 나타낸다. 이를 수식으로 나타내면 다음과 같다. In order to compare the similarity of the contents, in the embodiment of the present invention, the similarity function

use Similarity function

is the two content data

,

Given how similar these two data are, it is expressed as a number from 0 (not at all similar) to 1 (identical). This can be expressed as a formula as follows.

는 심층 신경망(deep neural network) 등을 통해 구현될 수 있다. Similarity function

may be implemented through a deep neural network or the like.

3 is a diagram illustrating an example of obtaining a degree of similarity through a deep neural network according to an embodiment of the present invention.

The similarity function may be implemented through a deep neural network, and may be uniquely defined as a configuration form of a deep neural network neuron and a weight value of each neuron. The definition data of these deep neural networks can be recorded on the blockchain for immutability and reliability. Also, how to configure and train the deep neural network may vary depending on the type and characteristics of each content. Various well-known methods may be used as a method for constructing and training a deep neural network, and the present invention does not specify a specific method.

,

가, 도 3에 예시된 바와 같이 구성되어 학습이 완료된 심층 신경망으로 입력되면, 두 콘텐츠 데이터

,

의 유사도 y가 출력된다. two content data

,

When is input to the deep neural network that is configured as illustrated in FIG. 3 and has completed learning, the two content data

,

The similarity y of is output.

Next, a method of recording content changes in content version information of a tree data structure using such a similarity function will be described.

4 is a flowchart of a process of recording content changes in a content version management method according to an embodiment of the present invention.

를 이용하여 새로운 콘텐츠와 이미 등록된 모든 루트 콘텐츠의 유사도를 각각 계산한다. When a content registration request is input by an operation such as requesting the user to register the content (S100), first, the similarity between the new content requested for registration and the already registered content is calculated. At this time, the similarity with the content (also called root content) corresponding to the root node among all the contents registered in the content version information of the tree data structure is calculated ( S110 ). Similarity function

is used to calculate the similarity between the new content and all previously registered root content, respectively.

와 비교하여, 최대 루트 유사도

를 넘는 유사도를 가지는 루트 콘텐츠가 있는지를 판단한다(S120). 여기서, 최대 루트 유사도

는 주어진 콘텐츠(등록을 요청한 새로운 콘텐츠)가 이전 콘텐츠의 파생 콘텐츠로 이해될 수 있는지 아니면 전혀 새로운 오리지널 콘텐츠인지를 판별하는 기준으로 사용된다. Calculated degree of similarity to preset maximum route similarity

Compared with , the maximum root similarity

It is determined whether there is a route content having a similarity greater than ( S120 ). Here, the maximum root similarity

is used as a criterion for determining whether a given content (new content that has requested registration) can be understood as a derivative content of the previous content or is a completely new original content.

를 넘는 유사도를 가지는 루트 콘텐츠가 없는 경우에는, 새로운 콘텐츠를 오리지널 콘텐츠로 인정하여 루트 노드로 등록한다(S130). 이에 따라 새로운 콘텐츠는 루트 콘텐츠로 등록된다. As a result of judgment, the maximum root similarity

If there is no root content having a similarity greater than , the new content is recognized as the original content and registered as a root node (S130). Accordingly, the new content is registered as the root content.

를 넘는 유사도를 가지는 루트 콘텐츠가 하나 이상인 경우, 새로운 콘텐츠와 유사한 콘텐츠가 이미 존재하는 것으로 간주하고, 가장 유사한 콘텐츠 노드를 검색한다. 구체적으로, 최대 루트 유사도

를 넘는 유사도를 가지는 루트 콘텐츠들 중에서 가장 큰 유사도를 가지는 루트 콘텐츠를 선택한다(S140).On the other hand, the maximum root similarity

When there is at least one root content having a similarity greater than , it is considered that content similar to the new content already exists, and the most similar content node is searched for. Specifically, the maximum root similarity

A route content having the greatest similarity is selected from among the route contents having a similarity greater than ? ( S140 ).

Then, the similarity between the content (also called child content) registered as a child node of the selected root content and the new content is calculated ( S150 ). Here, similarities between all child contents of the selected root contents and new contents are respectively calculated.

과 비교하여, 미리 설정된 동일 유사성

를 넘는 유사도를 가지는 자식 콘텐츠가 있는지를 판단한다(S150). 여기서, 미리 설정된 동일 유사성

은 주어진 콘텐츠(등록을 요청한 새로운 콘텐츠)가 이미 등록된 콘텐츠와 동일한 콘텐츠로 간주되는 값이다. Next, the calculation degree similarity is calculated as the preset same similarity.

Compared with the preset equal similarity

It is determined whether there is child content having a similarity greater than (S150). Here, the preset same similarity

is a value in which the given content (new content that has requested registration) is regarded as the same content as the content that has already been registered.

를 넘는 유사도를 가지는 자식 콘텐츠가 있는 경우에는, 이미 동일한 콘텐츠가 등록되어 있는 것으로 판단하고 콘텐츠 등록을 거부한다(S160).Judgment result, same similarity

If there is child content having a similarity greater than , it is determined that the same content has already been registered and the content registration is rejected (S160).

를 넘는 유사도를 가지는 자식 콘텐츠가 없는 경우에는 가장 유사한 자식 노드를 검색한다. 구체적으로, 단계(S150)에서 계산된 자식 콘텐츠들과의 유사도를 기반으로, 가장 큰 유사도를 가지는 자식 콘텐츠를 선택한다. 그리고 새로운 콘텐츠를 선택된 자식 콘텐츠의 자식 노드로 등록한다(S160). 이에 따라 새로운 콘텐츠는 임의 자식 콘텐츠로부터 파생되는 자식 콘텐츠로 등록된다. On the other hand, the same similarity

If there is no child content with a similarity greater than , the most similar child node is searched. Specifically, based on the degree of similarity with the child contents calculated in step S150, the child content having the greatest similarity is selected. Then, the new content is registered as a child node of the selected child content (S160). Accordingly, new content is registered as child content derived from arbitrary child content.

The content change history obtained through the process as described above is recorded and managed in the blockchain distributed ledger. In other words, the explicit contents of the creation of content version information consisting of a tree data structure and the process of adding nodes to this content version information are recorded in the distributed ledger of the block chain, so that a consistent and irreversible state can be maintained.

5 is a diagram showing an example of the structure of a block chain according to an embodiment of the present invention.

As shown in FIG. 5, a block chain is composed of several blocks, and one block includes a block header and a block body. The block header includes the hash value of the previous block (Prev Hash) to maintain irreversibility of information. That is, when a block is arbitrarily modified, the cryptographic hash value of the block is changed and affects all subsequent blocks, so it is easy to calculate the difference from the original. The block body contains a list of transactions. A transaction includes details of addition and modification of data, and the transaction list is a list of several transactions. A transaction is mapped corresponding to the transaction ID. In the block chain, blocks having this structure are correlated with each other using the hash value of the previous block, that is, the new block has a linked list structure including the hash value of the previous block.

In an embodiment of the present invention, by recording a transaction corresponding to the creation and update of a tree data structure for content version management in such a block chain, the content change history is preserved. Specifically, to create and update a tree data structure for content version management on the blockchain, we define two transactions: a content hash registration transaction and a content data registration transaction.

6 is a diagram illustrating an example of a content hash registration transaction according to an embodiment of the present invention.

Before a user registers his/her own created content, first, a cryptographic hash of the content data is generated and registered. This is to protect users' content ownership without protection devices such as digital rights management (DRM). If only the cryptographic hash of the content is preferentially registered in the block chain, a malicious user cannot check the actual content with only the hash value. Therefore, when considering the cost required to create a transaction, it can be said that there is no economic benefit in probabilistic terms of claiming the hash of another person's content as one's own. Accordingly, the user generates a transaction including his/her public key, a timestamp, and a cryptographic hash of the content data. Accordingly, the content hash registration transaction includes information related to encryption of content data, that is, a public key, a timestamp, and a cryptographic hash (Content Hash).

7 is a diagram illustrating an example of a content data registration transaction according to an embodiment of the present invention.

After the user confirms that his/her content hash is recorded on the blockchain, a content data registration transaction occurs. The content data registration transaction includes the user's public key, content type, content data (or accessor such as URL), and digital signature, as shown in the attached FIG. 7 . etc.

For a content data registration transaction with this structure, each node constituting the block chain applies a similarity function to the content data as described above to determine how to add it to the content version information of the tree data structure (root Register as content or child content), create a block with transactions with the corresponding result and record it in the distributed ledger.

8 is an exemplary diagram illustrating a block including a transaction according to an embodiment of the present invention.

In the embodiment of the present invention, for the content data registration transaction, the result of determining how to add to the content version information of the tree data structure by applying the similarity function to the content data is additionally recorded. Specifically, for the content data registration transaction, the hash of the parent content indicating from which content the corresponding content is derived and the similarity value, which is a calculated value of the similarity function with the corresponding parent content, are additionally recorded.

값을 초과하는 경우), 동일하다고 판단된 기존 콘텐츠의 해시값이 부모 콘텐츠의 해시(Parent Content Hash) 값으로 사용되며, 동일하다고 판단된 기존 콘텐츠와의 유사도가 유사도(Similarity Value)로서 사용되어, 콘텐츠 데이터 등록 트랜잭션에 기록된다. For example, if the content data is determined to be identical to the existing content and registered as a child node of the existing content (the similarity between the content and the existing content is the same

value), the hash value of the existing content determined to be identical is used as the Parent Content Hash value, and the similarity to the existing content determined to be identical is used as the Similarity Value, Content data is recorded in the registration transaction.

보다는 작은 값임)로서 사용되어, 콘텐츠 데이터 등록 트랜잭션에 기록된다. In addition, when content data is registered as original content (root node), the hash value of the content of the root node having the highest similarity to the content data among existing root nodes is used as the parent content hash value. The similarity with the content of the root node with the highest similarity is the Similarity Value (this value is the maximum root similarity).

less than ), and is recorded in the content data registration transaction.

In this way, when registering content, a content hash transaction including information related to encryption of the content (content hash) is recorded on the block chain, and then a similarity function is applied to the content data to add it to the content version information of the tree data structure. It is recorded on the blockchain as content data registration transactions including the result of deciding whether to do so.

9 is a flowchart of a method of propagating content registration or change history using a block chain according to an embodiment of the present invention.

In order to maintain the same blockchain, multiple devices establish a peer through a P2P network and exchange various information (blocks and transactions) entering the blockchain. A plurality of devices exchanges data modification history by propagating a transaction to the network, and a miner generating a block creates a block including the propagated transaction.

For example, when the first device tries to register new content according to the user's request as shown in FIG. 9 ( S300 ), first, as described above, based on the content version information of the tree data structure, the existing It is determined whether the content to be newly registered is registered as the root content or child content by comparing the similarity with the contents registered in , and the new content is added to the content version information of the tree data structure according to the determination result (S310). For the method performed in this step, refer to the description to be based on FIG. 4 .

After that, the first device generates a cryptographic hash of the content data (S320), and based on this, a content hash registration transaction including a public key, a timestamp, and a cryptographic hash (Content Hash) is generated and , propagates the generated content hash registration transaction to other devices on the blockchain network (S330).

The other device that has received the content hash registration transaction (referred to as a second device for convenience of description) performs validation on the received content hash registration transaction (S340), and when the validity is verified, the transaction is converted into its own block The chain is updated and propagated to another device (S350).

On the other hand, after the content hash registration transaction is registered in the block chain, the first device applies the similarity function to the content data to determine how to add it to the content version information of the tree data structure, that is, the hash of the parent content (Parent). Content Hash) and a content data registration transaction including a similarity value, which is a calculated value of a similarity function with the parent content, is generated and propagated (S360).

The second device that has received the content data registration transaction verifies the validity, and when the validity is verified, the second device updates the transaction in its own block chain and propagates it to another device (S370, S3800).

In this way, by storing content registration and changes in the blockchain distributed ledger, reliable content preservation and confirmation of copyright rights information can be expected.

10 is a structural diagram illustrating a computing device for implementing a content version management method according to an embodiment of the present disclosure.

10 , the content version management method according to an embodiment of the present disclosure may be implemented using the computing device 100 .

The computing device 100 may include at least one of a processor 110 , a memory 120 , an input interface device 130 , an output interface device 140 , a storage device 160 , and a network interface device 150 . . Each of the components may be connected by a bus 170 to communicate with each other. In addition, each of the components may be connected through an individual interface or a separate bus centering on the processor 110 instead of the common bus 170 .

The processor 110 may be implemented in various types such as an application processor (AP), a central processing unit (CPU), a graphic processing unit (GPU), and the like, and executes a command stored in the memory 120 or the storage device 150 . It may be any semiconductor device that does The processor 110 may execute a program command stored in at least one of the memory 120 and the storage device 160 . The processor 110 may be configured to implement the functions and methods described based on FIGS. 1 to 9 above.

The memory 120 and the storage device 150 may include various types of volatile or non-volatile storage media. For example, the memory may include a read-only memory (ROM) 121 and a random access memory (RAM) 122 . In an embodiment of the present disclosure, the memory 120 may be located inside or outside the processor 110 , and the memory 120 may be connected to the processor 110 through various known means.

The input interface device 130 is configured to provide data to the processor 110 , and the output interface device 140 is configured to output data from the processor 110 .

The network interface device 150 may transmit or receive signals with other entities (devices on the block chain network) through a wired network or a wireless network.

The computing device 100 having such a structure is called a content version management device, and may implement a content version management method according to an embodiment of the present disclosure.

In addition, at least a part of the content version management method according to an embodiment of the present disclosure may be implemented as a program or software executed in the computing device 100 , and the program or software may be stored in a computer-readable medium.

In addition, at least a part of the content version management method according to an embodiment of the present disclosure may be implemented as hardware capable of being electrically connected to the computing device 100 .

The embodiment of the present disclosure is not implemented only through the apparatus and/or method described above, and may be implemented through a program for realizing a function corresponding to the configuration of the embodiment of the present disclosure, a recording medium in which the program is recorded, etc. Also, such an implementation can be easily implemented by those skilled in the art to which the present disclosure pertains from the description of the above-described embodiments.

Although the embodiments of the present disclosure have been described in detail above, the scope of the present disclosure is not limited thereto, and various modifications and improved forms of the present disclosure are also provided by those skilled in the art using the basic concept of the present disclosure as defined in the following claims. is within the scope of the right.

Claims (16)

A method for performing version control of multimedia content, comprising:
calculating, by the management device, a degree of similarity between contents included in the contents version information of a tree data structure and the new contents, respectively, when a registration request for new contents is input;
registering, by the management device, the new content as root content or child content in content version information of the data tree structure based on the similarity; and
Recording, by the management device, a change history according to the registration of the new content in the block chain
How to include. According to claim 1,
The step of recording in the block chain is,
and recording, in the block chain, a content data registration transaction including a hash value of the parent content of the registered content and a degree of similarity between the parent content and the parent content. 3. The method of claim 2,
When the new content is registered as the root content, the hash value of the parent content is the hash value of the content of the root node having the highest similarity to the new content among the contents of the existing root nodes,
When the new content is registered as child content, the hash value of the parent content is a hash value of the content determined to be the same as the new content. 3. The method of claim 2,
The step of recording in the block chain is,
Recording a content hash registration transaction including a cryptographic hash for encryption of the registered content in the block chain
further comprising,
after recording the content hash registration transaction to the blockchain, recording the content data registration transaction to the blockchain is performed. According to claim 1,
The step of calculating the degree of similarity with the contents is
calculating a similarity between root contents corresponding to a root node and the new contents among all contents registered in the contents version information;
selecting a route content having a greatest similarity from among the root contents corresponding to the root node when there is a root content having a similarity exceeding a preset maximum root similarity among the calculated similarities; and
Calculating the similarity between the new content and the child content registered as a child node of the selected root content, respectively
A method comprising 6. The method of claim 5,
The registration step is
registering the new content as new route content when there is no route content having a similarity exceeding a preset maximum route similarity among the calculated similarities;
A method comprising 6. The method of claim 5,
The registration step is
selecting the child content having the greatest similarity when there is no child content having a similarity exceeding a preset same similarity among the child content registered as a child node of the selected root content and the new content; and
registering the new content as child content of the selected child content;
A method comprising According to claim 1,
The calculating of each of the similarities includes calculating the similarity between the contents included in the content version information and the new content by using a similarity function obtained through deep neural network learning. A device for performing version control of multimedia content, comprising:
an interface device configured to receive content to be newly registered; and
A processor configured to perform registration processing for content input through the interface device
including,
the processor is
calculating a similarity between the new content and the content included in the content version information of the tree data structure when a new content registration request is input through the interface device;
registering the new content as root content or child content in content version information of the data tree structure based on the similarity; and
The device is configured to perform an operation of recording change details according to the registration of the new content in the block chain. 10. The method of claim 9,
When the processor performs the operation of writing to the block chain,
and perform an operation of recording a content data registration transaction including a hash value of a parent content of the registered content and a degree of similarity with the parent content to the block chain. 11. The method of claim 10,
When the new content is registered as the root content, the hash value of the parent content is the hash value of the content of the root node having the highest similarity to the new content among the contents of the existing root nodes,
When the new content is registered as child content, the hash value of the parent content is a hash value of the content determined to be the same as the new content. 11. The method of claim 10,
When the processor performs the operation of writing to the block chain,
Further performing an operation of recording a content hash registration transaction including a cryptographic hash for encryption of the registered content in the block chain,
After the operation of recording the content hash registration transaction in the block chain, the operation of recording the content data registration transaction in the block chain is performed. 10. The method of claim 9,
When the processor performs an operation of calculating each similarity with the contents,
calculating a similarity between root contents corresponding to a root node and the new contents among all contents registered in the contents version information;
selecting a route content having the greatest similarity from among the root contents corresponding to the root node when there is a root content having a similarity exceeding a preset maximum root similarity among the calculated similarities; and
and calculate a similarity between child contents registered as a child node of the selected root contents and the new contents, respectively. 14. The method of claim 13,
When the processor performs the registration operation,
and when there is no route content having a similarity exceeding a preset maximum route similarity among the calculated similarities, registering the new content as new route content. 14. The method of claim 13,
When the processor performs the registration operation,
selecting the child content having the greatest similarity when there is no child content having a similarity exceeding a preset same similarity among the child content registered as a child node of the selected root content and the new content; and
and register the new content as child content of the selected child content. 10. The method of claim 9,
The processor is configured to calculate a similarity between the content included in the content version information and the new content by using a similarity function obtained through deep neural network learning.

Images