EP2743903A2 - Verfahren und Vorrichtung zur Verschlüsselung eines 3D-Objekts durch Anwendung einer geheimem-Schlüssel abhängigen Funktion - Google Patents

Verfahren und Vorrichtung zur Verschlüsselung eines 3D-Objekts durch Anwendung einer geheimem-Schlüssel abhängigen Funktion Download PDF

Info

Publication number
EP2743903A2
EP2743903A2 EP13190592.9A EP13190592A EP2743903A2 EP 2743903 A2 EP2743903 A2 EP 2743903A2 EP 13190592 A EP13190592 A EP 13190592A EP 2743903 A2 EP2743903 A2 EP 2743903A2
Authority
EP
European Patent Office
Prior art keywords
graphical object
function
encrypted
encryption
functions
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP13190592.9A
Other languages
English (en)
French (fr)
Inventor
Marc Eluard
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Thomson Licensing SAS
Original Assignee
Thomson Licensing SAS
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Thomson Licensing SAS filed Critical Thomson Licensing SAS
Priority to EP13190592.9A priority Critical patent/EP2743903A2/de
Publication of EP2743903A2 publication Critical patent/EP2743903A2/de
Withdrawn legal-status Critical Current

Links

Images

Classifications

    • 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/24—Querying
    • G06F16/248—Presentation of query results
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/901—Indexing; Data structures therefor; Storage structures
    • G06F16/9024—Graphs; Linked lists
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/01—Input arrangements or combined input and output arrangements for interaction between user and computer
    • G06F3/048—Interaction techniques based on graphical user interfaces [GUI]
    • G06F3/0481—Interaction techniques based on graphical user interfaces [GUI] based on specific properties of the displayed interaction object or a metaphor-based environment, e.g. interaction with desktop elements like windows or icons, or assisted by a cursor's changing behaviour or appearance
    • G06F3/0482—Interaction with lists of selectable items, e.g. menus
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G—PHYSICS
    • G09—EDUCATION; CRYPTOGRAPHY; DISPLAY; ADVERTISING; SEALS
    • G09C—CIPHERING OR DECIPHERING APPARATUS FOR CRYPTOGRAPHIC OR OTHER PURPOSES INVOLVING THE NEED FOR SECRECY
    • G09C5/00—Ciphering apparatus or methods not provided for in the preceding groups, e.g. involving the concealment or deformation of graphic data such as designs, written or printed messages
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
    • G11B27/00—Editing; Indexing; Addressing; Timing or synchronising; Monitoring; Measuring tape travel
    • G11B27/02—Editing, e.g. varying the order of information signals recorded on, or reproduced from, record carriers
    • G11B27/031—Electronic editing of digitised analogue information signals, e.g. audio or video signals
    • G11B27/036—Insert-editing

Definitions

  • the present invention relates generally to 3-D models and in particular to the protection of graphical objects of such models.
  • 3D objects represent real money value.
  • socializing worlds and games players are selling virtual objects or avatars to other players for real money.
  • Building an experienced character within an online game is a very lengthy process that can require hundreds of hours behind the keyboard.
  • the 3D model of a real-world object from a simulation tool allows manufacturing the real (counterfeit) object and selling it. Leaking the 3D model for a scene of the next blockbuster from Hollywood studios may result in bad press for the studios.
  • 3D objects are assets of great value for their owner.
  • Strategies for content protection comprise confidentiality protection - intended to make it impossible for unauthorized users to access the content, e.g. by encryption - and watermarking - intended to make it possible to track a user who has disseminated the content without authorization to do so.
  • 3D content More subtle ways of protecting 3D content is to protect one or more of its 3D objects. This is possible as 3D content often is made up of a number of distinct objects positioned in a setting. When each 3D object is coded as a separate entity, it becomes possible to protect each of these separately and it is not necessary to protect all of them.
  • US 2008/0022408 describes a method of 3D object protection by storing the "bounding box" of the object as non-encrypted data in one file and the protected 3D object as encrypted data in a separate file. Any user may access the non-encrypted data, but only authorized users can access the encrypted data; non-authorized users see a basic representation thereof (i.e. the bounding box), such as a parallelepiped instead of a car.
  • this method was developed to be used with 3D rendering software and is less suited for multimedia content, such as video and film.
  • the file format (one file with non-encrypted data and one file with encrypted data) is non-standard and is thus usable only by adapted rendering devices, not standard ones. Indeed, the encrypted data does not respect the syntax of most 3D techniques and can thus normally not be used.
  • US 6678378 describes a solution for protecting a 3D Computer Aided Design (CAD) object by encryption.
  • the solution may encrypt one of the coordinate values of the nodes and the equations for the edges or the contours, by nonlinear or affine transformation, thereby distorting the 3D object or by 'normal' encryption such as RSA.
  • the calculations may be costly (in particular when using RSA) and that the distortions may not be sufficient to deter a malicious user from using the content nevertheless.
  • the 3D object may not be readable at all by a content consuming device - such as a computer or a television - which may be a drawback in some cases.
  • a digital rights enabled graphics processing system was proposed in 2006 by Shi, W., Lee, H., Yoo, R., and Boldyreva, A: A Digital Rights Enabled Graphics Processing System. In GH '06: Proceedings of the 21st ACM SIGGRAPH/ EUROGRAPHICS symposium on Graphics hardware, ACM, 17-26 .].
  • the data composing the 3D object (collection of vertices, textures) is encrypted. Their decryption is handled within the Graphic Processing Unit, under control of licenses. It is proposed also to use multi resolution meshes to deliver simultaneously a protected and unprotected version of a 3D element.
  • VRML Virtual Reality Modelling Language
  • David Koller and Marc Levoy describe a system for protection of 3D data in which high-definition 3D data is stored in a server.
  • the users have access to a low-definition 3D object that they can manipulate and when a user has chosen a view, a request is sent to the server that returns a two-dimensional JPEG that corresponds to the view.
  • the high-definition 3D data is protected as it is never provided to the users.
  • a common problem with the prior art solutions is that they are not format preserving, but that they are based on the encryption of 3D data and that they provide a second set of 3D data that is usable by non-authorized devices so that the user can see something, e.g. a bounding box.
  • European patent application 10305692.5 describes a format preserving solution in which a 3D object comprising a list of points (i.e. vertices) is protected by permuting the coordinates of at least some of its points.
  • European patent application 10306250.1 describes a similar solution in which the coordinates of at least one dimension of the vertices of a 3D object are permuted independently of the other dimensions. The lists detailing how the points are connected remain unchanged, but the 3D object no longer "makes sense" as these points no longer have the initial values.
  • the protected 3D object is readable also by devices that are not able to 'decrypt' the protected 3D object - although it does look very strange - and that the protected 3D object is inscribed in a bounding box of the same size as the original 3D object.
  • the invention is directed to a method of encrypting a graphical object.
  • An encryption device receives the graphical object; generates a set of secret functions using a secret key K ; selects an encryption function from the set of secret functions; encrypts the graphical object using the encryption function to obtain an encrypted graphical object; and outputs the encrypted graphical object and an indication f of the selected encryption function.
  • the selection comprises applying the functions of the set of secret functions to the graphical object to obtain a set of protected graphical objects; and selecting a function that gave a protected graphical object that satisfies a given fitness metric.
  • the encryption comprises selecting the modified graphical object that corresponds to the encryption function.
  • the graphical object is a three-dimensional object.
  • the set of secret functions is generated using also at least one adaptation parameter that is an intrinsic parameter of the graphical object.
  • the invention is directed to a method of decrypting an encrypted graphical object.
  • a decryption device receives the encrypted graphical object and an indication f of an encryption function used to encrypt the encrypted graphical object; generates a decryption function using a secret key K and the indication f ; decrypts the encrypted graphical object using the decryption function to obtain a decrypted graphical object; and outputs the decrypted graphical object.
  • the graphical object is a three-dimensional object.
  • the decryption device receives at least one adaptation parameter, an intrinsic parameter of the graphical object, that is also used to generate the decryption function.
  • the invention is directed to an encryption device for encrypting a graphical object.
  • the encryption device comprises an interface configured to: receive the graphical object; and output an encrypted graphical object and an indication f of a selected encryption function; and a processor configured to: generate a set of secret functions using a secret key K ; select the encryption function from the set of secret functions; encrypt the graphical object using the encryption function to obtain the encrypted graphical object.
  • the processor is configured to select the encryption function by: applying the functions of the set of secret functions to the graphical object to obtain a set of protected graphical objects; and selecting a function that gave a protected graphical object that satisfies a given fitness metric. It is advantageous that the processor is configured to encrypt the graphical object by selecting the modified graphical object that corresponds to the encryption function.
  • the invention is directed to a decryption device for decrypting an encrypted graphical object.
  • the decryption device comprises an interface configured to: receive the encrypted graphical object; receive an indication f of an encryption function used to encrypt the encrypted graphical object; and output a decrypted graphical object; and a processor configured to: generate a decryption function using a secret key K and the indication f ; and decrypt the encrypted graphical object using the decryption function to obtain the decrypted graphical object.
  • the graphical object is a three-dimensional object.
  • the invention is directed to a non-transitory computable readable storage medium comprising stored instructions that when executed by a processor performs the method of any embodiment of the first aspect of the invention.
  • the invention is directed to a non-transitory computable readable storage medium comprising stored instructions that when executed by a processor performs the method of any embodiment of the second aspect of the invention.
  • VRML Virtual Reality Modelling Language
  • X3D 3D graphical object o
  • a salient inventive idea of the present invention is to protect a 3D object by using a function with at least one parameter to warp the dimension space, which in a preferred embodiment 'shapes' the 3D object, i.e. gives a desired statistical characteristic to the protected 3D object.
  • a secret is used to define the at least one parameter of the function.
  • the present invention obtains a protected point by using a key to select a function that is applied to an input point. It should however be noted that the key K may also be used as input to the function f'.
  • the protection results in the creation of a new set of vertices, yielding a protected 3D object than can still be understood by any standard legacy 3D rendering application, but whose resulting display becomes distorted compared to the original.
  • Authorized users with access to the secret are able to reverse the protection so as to obtain the original points.
  • the function that is used to 'shape' the 3D object is advantageously chosen from a set of dynamically generated functions.
  • Figure 1 illustrates a flow-chart of a generic method for shaping-based object encryption and decryption.
  • This generation process will be fully detailed afterward and usually implicitly assumes the knowledge of some intrinsic parameters ⁇ ( o ) of the original object o , e.g. the bounding box.
  • This selection may be completely pseudo-random or accommodate to some intrinsic features of the object o in order to yield some very specific (statistical) properties, as will be detailed hereinafter.
  • the function identifier f* and the associated adaptation parameters ⁇ ( o ) can be sent using various techniques known in the art, depending e.g. on the desired level of security, such as for example:
  • the receiver uses the secret K and the parameters ⁇ ( o ) to generate S16 the secret function ( f *, P f * , D f * ), identical to the one generated by the emitter.
  • a permutation ⁇ f () is defined S22 in order to associate each element A f,p of the partition A f to another element B f , ⁇ f(p) of the partition B f in a bijective manner.
  • the functions a f,p () and c f,p () are fully determined by the partitioning defined in S21 and the permutation defined in S22.
  • This function set generation process essentially has 3 degrees of freedom, namely (i) the set of partitions A f and B f , (ii) the permutations ⁇ f (), and (iii) the set of warping functions W and the associated parameter values.
  • the system designer may decide not to exploit the full variability permitted by this generic design and fix some of the parameters e.g. using the same K -dependent partitions A and B for all functions in the set F.
  • the first step consists in generating two partitions A f and B f made of N p elements. In a first embodiment, this is done by seeding a pseudo-random numbers generator (PRNG) with K +2. f (resp. K +2. f +1), drawing N p -1 numbers uniformly distributed over ] L, R [ , and sorting them to yield a 1 ⁇ a 2 ⁇ ... ⁇ a Np -1 (resp.
  • PRNG pseudo-random numbers generator
  • the partitioning operation is determined by some characteristics of the object o .
  • additional information may need to be transmitted to the receiver through ⁇ ( o ) in order to guarantee that the recipient is able to replicate these operations even if the protection operation perturbs the statistics that the partitioning process rely on.
  • the boundaries of the segments A f,p can be chosen at the location where the density of vertices is highest in an attempt to strongly impact the rendering of the object. In this case, these boundaries may need to be forwarded to the recipient as it may be unfeasible to retrieve them exactly from the protected object o '.
  • the second step generates a permutation ⁇ f () to associate unequivocally elements from A f to elements from B f .
  • This can be done using any state-of-the-art technique e.g. using a lookup table generated by a PRNG seeded with a secret derived from K and the function index f .
  • Figure 3 illustrates the effect of each of these functions.
  • the parameter value of these functions can be pseudo-randomly drawn for each element of the partition.
  • the same function (or combination of functions) can be used for each element of the partition.
  • the function (or combination of functions) can be pseudo-randomly selected using the secret K for each element of the partition. It should be noted that inversing these functions b f,p () is also straightforward.
  • Figure 4 shows the type of function that can be obtained.
  • the partitioning is pseudo-random
  • the permutation ⁇ () is set to the identity
  • the second example (4B) illustrates what kind of function can be obtained when the diversity of the proposed system is fully exploited.
  • a first straightforward embodiment consists in applying the system for 1D object previously described to each dimension independently. An example of this is given for the 2D case by 5A in Figure 5 . It should be noted that it is preferred that specific care is required to guarantee that the PRNG is not seeded twice with the same secret derived from K for security purposes.
  • An alternate embodiment for the partitioning operation consists in iteratively splitting the largest partition element in two using a hyperplane aligned with one of the directions of the canonical coordinate system until the partition contains the desired number of elements N p .
  • the partition is initialized with the whole bounding box B( o ).
  • An example of this partitioning strategy is illustrated in the 2D case by 5B in Figure 5 - the order of the partitions has been illustrated to facilitate comprehension.
  • mapping function is to consider functions that cannot be reduced to individual functions operating independently along each dimension.
  • the warping functions defined in the 1D case can then be applied to ⁇ .
  • all secret functions ⁇ ( f , P f , D f ) ⁇ are applied to the object o in order to obtain N F protected objects o f '.
  • the selection process then identifies the secret function which best satisfies (i.e. minimizes or maximizes) some fitness metric.
  • the selection process is guided by the intrinsic properties of the object o and the characteristic of the secret functions ⁇ ( f , P f , D f ) ⁇ . For instance, for each function, one could compute a correlation score between (i) the proportion of vertices contained in each element of the partition A f and (ii) the volume of each element of the partition B f . By selecting the function having the highest correlation score, the selection process isolate the function which will spread the vertices of the object o the most evenly in the bounding box B( o ). Figure 6 illustrates this concept in one dimension.
  • 6A illustrates the distribution of input data
  • 6B illustrates the occurrences of the input data in each of four elements of partition A f1
  • 6C illustrates how the volume of each element of partition in B f1 can be chosen to generate smoothed output data illustrated by 6D
  • 6E illustrates a partition B f2 .
  • Figure 7 depicts the generic workflow to protect an object o made of N v vertices v v once the secret function ( f *, P f * , D f * ) has been selected.
  • the process loops through all the vertices of the object.
  • the first step identifies S71 to which element A f *, p * of the partition A f * the vertex v v belongs to.
  • Figure 8 depicts the generic workflow to deprotect an object o ' made of N v vertices v v ' once the secret function ( f *, P f * , D f * ) has been regenerated.
  • the process loops through all the vertices of the protected object.
  • the first step identifies S81 to which element B f *, p * of the partition B f * the vertex v v ' belongs to.
  • Figure 9 illustrates a system 900 for encrypting and decrypting a digital object such as a 3D object according to a preferred embodiment of the present invention.
  • the points correspond to the vertices of the surfaces composing the graphical object and are expressed in 3D coordinates.
  • the transformation may be performed on the static part (Coordinate node in VRML syntax) or the animation part (CoordinateInterpolator node in VRML syntax), or preferably both. In other words, it is the representation of the 3D object that is protected, which makes the correct rendering of the object impossible.
  • the system 900 comprises a sender 910 and a receiver 940, each comprising at least one processor 911, 941, memory 912, 942, preferably a user interface 913, 943, and at least one input/output unit 914, 944.
  • the sender 910 may for example be a personal computer or a workstation, while the receiver 920 for example may not only be a personal computer or a workstation, but also a television set, a video recorder, a set-top box or the like.
  • the sender 910 is configured to receive a 3D object via connection 920, encrypt the 3D object using a method according to any of the embodiments described herein, and send the encrypted 3D object to the receiver 940 via connection 930.
  • the receiver 940 is configured to receive an encrypted 3D object via connection 930, decrypt the encrypted 3D object using a method corresponding to the encryption method according to any of the embodiments described herein, and output or render the decrypted 3D object, possibly via connection 950.
  • connection' is to be interpreted in a broad sense. As such, it may for example cover storage on a recording medium that is then transferred.
  • Figure 9 also illustrates non-transitory computer-readable storage media 960, 970 storing instructions that, when executed by a processor, respectively perform encryption and decryption according to any of the embodiments described herein.
  • the present invention can provide a mechanism for ensuring the confidentiality of digital objects such as 3D models, and that the mechanism can visually differentiate protected and non-protected models for non-authorized users. It will also be appreciated that the protected 3D object (and the scene comprising the 3D object) can always be rendered, although it will be more or less recognizable.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Business, Economics & Management (AREA)
  • General Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • Data Mining & Analysis (AREA)
  • General Business, Economics & Management (AREA)
  • Educational Administration (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Marketing (AREA)
  • Development Economics (AREA)
  • Game Theory and Decision Science (AREA)
  • Tourism & Hospitality (AREA)
  • Computational Linguistics (AREA)
  • Software Systems (AREA)
  • Multimedia (AREA)
  • Human Computer Interaction (AREA)
  • Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
  • Storage Device Security (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Studio Devices (AREA)
EP13190592.9A 2012-12-13 2013-10-29 Verfahren und Vorrichtung zur Verschlüsselung eines 3D-Objekts durch Anwendung einer geheimem-Schlüssel abhängigen Funktion Withdrawn EP2743903A2 (de)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP13190592.9A EP2743903A2 (de) 2012-12-13 2013-10-29 Verfahren und Vorrichtung zur Verschlüsselung eines 3D-Objekts durch Anwendung einer geheimem-Schlüssel abhängigen Funktion

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
EP12306581 2012-12-13
EP13190592.9A EP2743903A2 (de) 2012-12-13 2013-10-29 Verfahren und Vorrichtung zur Verschlüsselung eines 3D-Objekts durch Anwendung einer geheimem-Schlüssel abhängigen Funktion

Publications (1)

Publication Number Publication Date
EP2743903A2 true EP2743903A2 (de) 2014-06-18

Family

ID=47738964

Family Applications (1)

Application Number Title Priority Date Filing Date
EP13190592.9A Withdrawn EP2743903A2 (de) 2012-12-13 2013-10-29 Verfahren und Vorrichtung zur Verschlüsselung eines 3D-Objekts durch Anwendung einer geheimem-Schlüssel abhängigen Funktion

Country Status (3)

Country Link
US (2) US20150317571A1 (de)
EP (1) EP2743903A2 (de)
WO (3) WO2014090728A1 (de)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113111361A (zh) * 2021-03-31 2021-07-13 杭州海康机器人技术有限公司 数据处理方法、装置及电子设备

Families Citing this family (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10817583B2 (en) * 2015-02-20 2020-10-27 Disney Enterprises, Inc. Systems and methods for non-linear content creation
BR112017019334A2 (pt) * 2015-03-12 2018-06-05 Repipe Pty Ltd métodos e sistemas para fornecer e receber informações para gerenciamento de riscos no campo
US10013157B2 (en) * 2015-07-22 2018-07-03 Box, Inc. Composing web-based interactive 3D scenes using high order visual editor commands
US10268728B2 (en) * 2015-11-04 2019-04-23 International Business Machines Corporation Providing search result content tailored to stage of project and user proficiency and role on given topic
US10452874B2 (en) 2016-03-04 2019-10-22 Disney Enterprises, Inc. System and method for identifying and tagging assets within an AV file
US10498741B2 (en) 2016-09-19 2019-12-03 Box, Inc. Sharing dynamically changing units of cloud-based content
US10373342B1 (en) * 2017-01-10 2019-08-06 Lucasfilm Entertainment Company Ltd. Content generation in an immersive environment
CN106951479B (zh) * 2017-03-08 2020-09-18 北京仿真中心 一种基于云环境的仿真数据可视化协作应用系统及方法
CN109783659A (zh) * 2017-10-06 2019-05-21 迪斯尼企业公司 基于自然语言处理和2d/3d预可视化的自动化故事板
US10453496B2 (en) 2017-12-29 2019-10-22 Dish Network L.L.C. Methods and systems for an augmented film crew using sweet spots
US10783925B2 (en) 2017-12-29 2020-09-22 Dish Network L.L.C. Methods and systems for an augmented film crew using storyboards
US10834478B2 (en) 2017-12-29 2020-11-10 Dish Network L.L.C. Methods and systems for an augmented film crew using purpose
US11281732B2 (en) * 2018-08-02 2022-03-22 Microsoft Technology Licensing, Llc Recommending development tool extensions based on media type
JP7409370B2 (ja) * 2019-03-27 2024-01-09 ソニーグループ株式会社 映像処理装置および映像処理方法
WO2021068105A1 (en) * 2019-10-08 2021-04-15 WeMovie Technologies Pre-production systems for making movies, tv shows and multimedia contents
US11302047B2 (en) 2020-03-26 2022-04-12 Disney Enterprises, Inc. Techniques for generating media content for storyboards
WO2021225608A1 (en) 2020-05-08 2021-11-11 WeMovie Technologies Fully automated post-production editing for movies, tv shows and multimedia contents
US11070888B1 (en) 2020-08-27 2021-07-20 WeMovie Technologies Content structure aware multimedia streaming service for movies, TV shows and multimedia contents
US11812121B2 (en) 2020-10-28 2023-11-07 WeMovie Technologies Automated post-production editing for user-generated multimedia contents
CN112396677B (zh) * 2020-11-25 2023-01-13 武汉艺画开天文化传播有限公司 动画制作方法、电子装置和存储介质
US11330154B1 (en) 2021-07-23 2022-05-10 WeMovie Technologies Automated coordination in multimedia content production
US11321639B1 (en) 2021-12-13 2022-05-03 WeMovie Technologies Automated evaluation of acting performance using cloud services

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6678378B1 (en) 1998-06-09 2004-01-13 Monolith Co., Ltd. 3-dimensional shape data encryption and decryption
US20080022408A1 (en) 2006-07-21 2008-01-24 Nicholas Phelps Method for exchanging a 3D view between a first and a second user

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4218264B2 (ja) * 2002-06-25 2009-02-04 ソニー株式会社 コンテンツ作成システム、コンテンツ企画作成プログラム、プログラム記録媒体、撮像装置、撮像方法、撮像プログラム
US8458595B1 (en) * 2006-05-31 2013-06-04 Adobe Systems Incorporated Video editing including simultaneously displaying timelines and storyboards
WO2008014487A2 (en) * 2006-07-28 2008-01-31 Accelerated Pictures, Inc. Scene organization in computer-assisted filmmaking
US8443284B2 (en) * 2007-07-19 2013-05-14 Apple Inc. Script-integrated storyboards
US8225228B2 (en) * 2008-07-10 2012-07-17 Apple Inc. Collaborative media production
US8429541B1 (en) * 2009-04-30 2013-04-23 Intuit Inc. Method and system for video sharing between users of an application
US8701008B2 (en) * 2009-06-18 2014-04-15 Cyberlink Corp. Systems and methods for sharing multimedia editing projects
US8819559B2 (en) * 2009-06-18 2014-08-26 Cyberlink Corp. Systems and methods for sharing multimedia editing projects
KR20110014403A (ko) * 2009-08-05 2011-02-11 주식회사 케이티 동영상 장면 별 키워드 정보 생성 시스템 및 방법
US8831403B2 (en) * 2012-02-01 2014-09-09 Cisco Technology, Inc. System and method for creating customized on-demand video reports in a network environment
US9684431B2 (en) * 2012-10-19 2017-06-20 Apple Inc. Sharing media content

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6678378B1 (en) 1998-06-09 2004-01-13 Monolith Co., Ltd. 3-dimensional shape data encryption and decryption
US20080022408A1 (en) 2006-07-21 2008-01-24 Nicholas Phelps Method for exchanging a 3D view between a first and a second user

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
DAVID KOLLER; MARC LEVOY: "Protecting 3D Graphics Content", COMMUNICATIONS OF THE ACM, vol. 48, no. 6, June 2005 (2005-06-01)
SHI, W.; LEE, H.; YOO, R.; BOLDYREVA, A: "GH '06: Proceedings of the 21st ACM SIGGRAPH/ EUROGRAPHICS symposium on Graphics hardware", 2006, ACM, article "A Digital Rights Enabled Graphics Processing System", pages: 17 - 26

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113111361A (zh) * 2021-03-31 2021-07-13 杭州海康机器人技术有限公司 数据处理方法、装置及电子设备
CN113111361B (zh) * 2021-03-31 2022-07-29 杭州海康机器人技术有限公司 数据处理方法、装置及电子设备

Also Published As

Publication number Publication date
US20150302067A1 (en) 2015-10-22
WO2014090727A1 (en) 2014-06-19
WO2014090730A1 (en) 2014-06-19
US20150317571A1 (en) 2015-11-05
WO2014090728A1 (en) 2014-06-19

Similar Documents

Publication Publication Date Title
EP2743903A2 (de) Verfahren und Vorrichtung zur Verschlüsselung eines 3D-Objekts durch Anwendung einer geheimem-Schlüssel abhängigen Funktion
EP2725567A2 (de) Verfahren und Vorrichtung zur Verschlüsselung eines 3D-Objekts durch Anwendung einer mittels geheimem Schlüssel modifizierten Funktion
US8869292B2 (en) Method and device for 3D object protection by transformation of its points
JP5875835B2 (ja) ３次元オブジェクトの座標点の置換による３次元オブジェクトの保護の方法及び装置
EP2725555B1 (de) Verfahren und Vorrichtungen zur Optimierung der Darstellung eines verschlüsselten 3D-Grafikobjekts
US9202064B2 (en) Methods and devices for 3D object protection using surface subdivision
US20140229742A1 (en) Methods and devices for protecting digital objects through format preserving coding
Beugnon et al. Format-compliant selective secret 3-D object sharing scheme
EP2400476A1 (de) Verfahren und Vorrichtung zum Schutz eines dreidimensionalen Gegenstands durch Permutation seiner Punkte
US20170169606A1 (en) Method for encrypting or decrypting a 3d object
Annaby et al. On 3D encryption schemes based on chaotic permutations and rotations with geometric stability
Nagaty Digital Rights Management of Images via LSB Embedding Square Numbers Sequence
Cho et al. 3d fingerprinting and encryption principle for collaboration
Dawood et al. A Comprehensive Review of Color Image Encryption Technology
Ali et al. Survey on 3D Content Encryption.
KR20120131121A (ko) 3ｄ 객체의 지점의 변환을 통한 3ｄ 객체의 보호를 위한 방법 및 디바이스

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20131029

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20160503