CN103853945B - The map vector data copy-right protection method of anti-interpretation Attack - Google Patents

The map vector data copy-right protection method of anti-interpretation Attack Download PDF

Info

Publication number
CN103853945B
CN103853945B CN201410013158.2A CN201410013158A CN103853945B CN 103853945 B CN103853945 B CN 103853945B CN 201410013158 A CN201410013158 A CN 201410013158A CN 103853945 B CN103853945 B CN 103853945B
Authority
CN
China
Prior art keywords
imaginary circles
coordinate
line segment
circle
point
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.)
Active
Application number
CN201410013158.2A
Other languages
Chinese (zh)
Other versions
CN103853945A (en
Inventor
朱文忠
杨曦
叶露涵
朱龙泽
李岩
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.)
Huzhou You Yan Intellectual Property Service Co ltd
Original Assignee
Zhejiang University of Technology ZJUT
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 Zhejiang University of Technology ZJUT filed Critical Zhejiang University of Technology ZJUT
Priority to CN201410013158.2A priority Critical patent/CN103853945B/en
Publication of CN103853945A publication Critical patent/CN103853945A/en
Application granted granted Critical
Publication of CN103853945B publication Critical patent/CN103853945B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/10Protecting distributed programs or content, e.g. vending or licensing of copyrighted material ; Digital rights management [DRM]
    • G06F21/16Program or content traceability, e.g. by watermarking
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/10Protecting distributed programs or content, e.g. vending or licensing of copyrighted material ; Digital rights management [DRM]
    • G06F21/106Enforcing content protection by specific content processing
    • G06F21/1063Personalisation

Abstract

The map vector data copy-right protection method of anti-interpretation Attack, comprises the following steps: designs one according to copyright information and has uniquely identified virtual pattern fingerprint;The embedding grammar of virtual pattern fingerprint characteristic;Map vector digital finger-print feature point detecting method based on imaginary circles.

Description

The map vector data copy-right protection method of anti-interpretation Attack
Technical field
The present invention relates to the copyright protection in the fields such as map vector data and vector figure data Method.
Map vector is GIS-Geographic Information System, traffic mobile information service, automobile navigation, military affairs The core resource in the fields such as mapping, map vector digital watermarking provides copyright authentication and content is complete The service of whole property protection, but many copyright notice problem that interpretation Attack is caused, digital watermarking Defencive function often lose effect.
Vector figure data watermarking algorithm is different from traditional based on watermarking algorithm, and this is main It is the reason such as universality due to vector figure data without view data application, the most also exists In vector figure data in data structure, storage form, manifestation mode, applied environment, use Require and the multi-medium data such as the aspect such as possible aggressive behavior and image is the most different.
Interpretation Attack is acknowledged as the bottleneck of digital watermark technology application, and it is different from software and attacks Hitting or entity is attacked, interpretation Attack is not for watermark telescopiny or watermark information, but sharp There is characteristic with isolated in map vector of watermark, embed pseudo-watermark to map vector and make to use Family cannot judge the true and false and the embedding order of watermark, reaches the purpose of copyright notice entanglement.
As can be seen here, research has the map vector data digital watermark of anti-interpretation Attack at vector Application on map datum has more potential purposes.Owing to geographical spatial data is to describe to close In the important information of the earth that the mankind depend on for existence, it is national basis, public welfare facility, is The supportive achievement of national basis Facilities Construction and geoscience research, is national economy, national defence Indispensable resource in construction, plays an important role to society's sustainable development.
Summary of the invention
In order to overcome easily being illegally duplicated of existing map vector data, inversely cracked and The deficiency of initial data Distortionless, the present invention provides one can solve map vector number with effective According to being illegally duplicated, inversely cracked anti-interpretation Attack with initial data Distortionless problem Map vector data copy-right protection method.
The technical solution adopted for the present invention to solve the technical problems is:
The map vector data copy-right protection method of a kind of anti-interpretation Attack, comprises the following steps:
(1), design one according to copyright information and there is uniquely identified virtual pattern fingerprint
(1.1), a grid reference direction based on map north pointer direction, identification characteristics are determined For the direction α of grid, 0≤α≤360;
(1.2), define one group and there is the virtual round fingerprint of copyright information;
(1.3), between copyright information is contained mainly between the radius of each circle, and circle with circle In data;
(1.4), described virtual round fingerprint is expanded can cover vector numerical map full figure;
(2), the embedding grammar of virtual pattern fingerprint characteristic
The telescopiny of virtual round digital finger-print feature, to having 2 tops in map vector data Each imaginary circles in the above coordinate sequence of point and one group of imaginary circles has detected whether intersection point, If there is intersection point, relevant intersection is inserted in coordinate sequence, specific as follows:
(2.1), map vector coordinate sequence data are read;
(2.2) central coordinate of circle (X of imaginary circles, is calculated0, Y0);
(2.3) the horizon radius γ of imaginary circles, is determined;
(2.4), to adjacent 2 points in coordinate sequence data, it is judged that virtual in imaginary circles group Circle (X-X0)2+(Y-Y0)2=r2Line segment (X1, Y1)-(X2, Y2Whether intersection point is had between);
(2.5) intersection point, is then set as (X, Y), then it must be (X1, Y1)-(X2, Y2) line segment On a bit, its (X, Y) coordinate is by (X1, Y1)-(X2, Y2) 2 determine:
X = X 2 + μ ( X 1 - X 2 ) Y = Y 2 + μ ( Y 1 - Y 2 ) - - - ( 1 )
The intersection point (X, Y) that formula (2) is determined substitutes into known imaginary circles equation (X-X0)2+(Y-Y0)2=r2Try to achieve μ quadratic equation with one unknown A μ2+ B μ+C=0;
Wherein:
According to the rooting discriminant Δ in the quadratic equation with one unknown of μ, when Δ=0, line segment is with virtual Circle tangent, when Δ > 0 time, line segment intersects with imaginary circles, and has two intersection points;When Δ < when 0, Line segment does not has alternation with circle;Try to achieve μ quadratic equation with one unknown solution again and substitute into (2) formula, can try to achieve The coordinate figure of intersection point (X, Y) coordinate;
(2.6), finally according to the characteristic point embedding strategy in imaginary circles watermarking algorithm design philosophy, (the X that virtual round digital finger-print characteristic point is inserted in coordinate sequence1, Y1) and (X2, Y2) it Between, obtain the map vector data that characteristic point distribution is overall;
(3) map vector digital finger-print feature point detecting method based on imaginary circles, described detection side Method step is as follows:
(3.1), map vector coordinate sequence data are read;
(3.2), input has the imaginary circles elements of a fix and the imaginary circles horizon radius of key;
(3.3), according to the imaginary circles elements of a fix and horizon radius, in coordinate sequence data Adjacent 2 points, it is judged that the imaginary circles (X-X in imaginary circles group0)2+(Y-Y0)2=r2With line segment (X1, Y1)-(X2, Y2Whether intersection point is had between);
(3.4) intersection point, is set as (X, Y), then it must be (X1, Y1)-(X2, Y2) on line segment A bit, its (X, Y) coordinate is by (X1, Y1)-(X2, Y2) 2 determine:
X = X 1 + &mu;X 2 1 + &mu; Y = Y 1 + &mu;Y 2 1 + &mu; - - - ( 2 )
The intersection point (X, Y) that formula (2) is determined substitutes into known imaginary circles equation (X-X0)2+(Y-Y0)2=r2Try to achieve μ quadratic equation with one unknown;
According to the rooting discriminant Δ in the quadratic equation with one unknown of μ, when Δ=0, line segment is with virtual Circle tangent, when Δ > 0 time, line segment intersects with imaginary circles, and has two intersection points;When Δ < when 0, Line segment does not has alternation with circle;Try to achieve μ quadratic equation with one unknown solution again and substitute into (2) formula, i.e. try to achieve friendship The coordinate figure of point (X, Y) coordinate;
(3.5), according to trying to achieve the coordinate figure of intersection point (X, Y) coordinate, the extreme coordinates of line segment (X1, Y1) and (X2, Y2) compare;Limit difference in prescribed limit, i.e. intersection point and end points non-it During the error amount d that spacing limits less than, this end points is as the watermark feature point in imaginary circles Extract;
(3.6), according to the feature point set extracted, build imaginary circles, determine circle with 3, Remaining point is verified, meets the addition watermark information collection of imaginary circles equation, incongruent abandons;
(3.7), finally, parameter is constituted according to the imaginary circles inverse imaginary circles detected, then Copyright information is solved, it is achieved the extraction of copyright information according to key information.
The technology of the present invention core concept is the Shandong for map vector digital watermarking opposing interpretation Attack The feature of rod poor-performing, it is proposed that the map vector data copyright protection of a kind of anti-interpretation Attack Method.
The invention have the advantage that whole geometry feature and the application characteristic utilizing map vector data, By structure virtual pattern fingerprint feature information, through graphics set computing, virtual pattern is referred to Stricture of vagina characteristic information is embedded into vector figure data sequence with the form of map vector data characteristic point In, it is achieved that virtual pattern fingerprint feature information organically blends with map vector data, figure Set operation possess copyright uniqueness statement condition, in conjunction with frequency-domain small wave watermarking algorithm Robustness, thus efficiently solve many copyright statements problem that interpretation Attack causes.
Accompanying drawing explanation
Fig. 1 is the map vector data copyright embedding grammar principle schematic of anti-interpretation Attack.
Fig. 2 is the map vector data copyright detection method principle schematic of anti-interpretation Attack.
Fig. 3 is the virtual copyright pictorial diagram with copyright information built based on imaginary circles.
Detailed description of the invention
The invention will be further described below in conjunction with the accompanying drawings.
With reference to Fig. 1~Fig. 6, the map vector data copy-right protection method of a kind of anti-interpretation Attack.
The specific works process of the present embodiment is:
Fig. 1-Fig. 2 is the principle signal of the map vector data copy-right protection method of anti-interpretation Attack Figure.
(1), as shown in Figure 3 be to design one according to copyright information to have uniquely identified virtual Figure fingerprint.
(1.1), a grid reference direction based on map north pointer direction, identification characteristics are determined For the direction α of grid, 0≤α≤360;
(1.2), define one group and there is the virtual round fingerprint of copyright information;
(1.3), between copyright information is contained mainly between the radius of each circle, and circle with circle Every etc. in data;
(1.4), described virtual round fingerprint is expanded can cover vector numerical map full figure;
(2), Fig. 4 be map vector original graph, after Fig. 5 is for being hacked, loss partial fingerprints is special Levy a little there is copyright information map vector.
The embedding grammar of its concrete virtual pattern fingerprint characteristic is as follows:
The telescopiny of virtual round digital finger-print feature, to having 2 tops in map vector data Each imaginary circles in the above coordinate sequence of point and one group of imaginary circles has detected whether intersection point, If there is intersection point, relevant intersection is inserted in coordinate sequence, specific as follows:
(2.1), map vector coordinate sequence data are read;
(2.2) central coordinate of circle (X of imaginary circles, is calculated0, Y0);
(2.3) the horizon radius γ of imaginary circles, is determined;
(2.4), to adjacent 2 points in coordinate sequence data, it is judged that virtual in imaginary circles group Circle (X-X0)2+(Y-Y0)2=r2With line segment (X1, Y1)-(X2, Y2Whether intersection point is had between);
(2.5) intersection point, is then set as (X, Y), then it must be (X1, Y1)-(X2, Y2) line segment On a bit, its (X, Y) coordinate is by (X1, Y1)-(X2, Y2) 2 determine:
X = X 2 + &mu; ( X 1 - X 2 ) Y = Y 2 + &mu; ( Y 1 - Y 2 ) - - - ( 1 )
The intersection point (X, Y) that formula (2) is determined substitutes into known imaginary circles equation (X-X0)2+(Y-Y0)2=r2Try to achieve μ quadratic equation with one unknown A μ2+ B μ+C=0;
Wherein:
According to the rooting discriminant Δ in the quadratic equation with one unknown of μ, when Δ=0, line segment is with virtual Circle tangent, when Δ > 0 time, line segment intersects with imaginary circles, and has two intersection points;When Δ < when 0, Line segment does not has alternation with circle;Try to achieve μ quadratic equation with one unknown solution again and substitute into (2) formula, can try to achieve The coordinate figure of intersection point (X, Y) coordinate;
(2.6), finally according to the characteristic point embedding strategy in imaginary circles watermarking algorithm design philosophy, (the X that virtual round digital finger-print characteristic point is inserted in coordinate sequence1, Y1) and (X2, Y2) it Between, obtain the map vector data that characteristic point distribution is overall;
(3) map vector digital finger-print feature point detecting method based on imaginary circles, described detection side Method step is as follows:
(3.1), map vector coordinate sequence data are read;
(3.2), input has the imaginary circles elements of a fix and the imaginary circles horizon radius of key;
(3.3), according to the imaginary circles elements of a fix and horizon radius, in coordinate sequence data Adjacent 2 points, it is judged that the imaginary circles (X-X in imaginary circles group0)2+(Y-Y0)2=r2With line segment (X1, Y1)-(X2, Y2Whether intersection point is had between);
(3.4) intersection point, is set as (X, Y), then it must be (X1, Y1)-(X2, Y2) on line segment A bit, its (X, Y) coordinate is by (X1, Y1)-(X2, Y2) 2 determine:
X = X 1 + &mu;X 2 1 + &mu; Y = Y 1 + &mu;Y 2 1 + &mu; - - - ( 2 )
The intersection point (X, Y) that formula (2) is determined substitutes into known imaginary circles equation (X-X0)2+(Y-Y0)2=r2Try to achieve μ quadratic equation with one unknown;
According to the rooting discriminant Δ in the quadratic equation with one unknown of μ, when Δ=0, line segment is with virtual Circle tangent, when Δ > 0 time, line segment intersects with imaginary circles, and has two intersection points;When Δ < when 0, Line segment does not has alternation with circle;Try to achieve μ quadratic equation with one unknown solution again and substitute into (2) formula, i.e. try to achieve friendship The coordinate figure of point (X, Y) coordinate;
(3.5), according to trying to achieve the coordinate figure of intersection point (X, Y) coordinate, the extreme coordinates of line segment (X1, Y1) and (X2, Y2) compare;Limit difference in prescribed limit, i.e. intersection point and end points non-it During the error amount d that spacing limits less than, this end points is as the watermark feature point in imaginary circles Extract;
(3.6), according to the feature point set extracted, build imaginary circles, determine circle with 3, Remaining point is verified, meets the addition watermark information collection of imaginary circles equation, incongruent abandons;
(3.7), finally, parameter is constituted according to the imaginary circles inverse imaginary circles detected, then Copyright information is solved, it is achieved the extraction of copyright information according to key information.

Claims (1)

  1. The map vector data copy-right protection method of the most anti-interpretation Attack, comprises the following steps:
    (1), design one according to copyright information and there is uniquely identified virtual pattern fingerprint
    (1.1), a grid reference direction based on map north pointer direction, identification characteristics are determined For the direction α of grid, 0≤α≤360;
    (1.2), define one group and there is the virtual round fingerprint of copyright information;
    (1.3), between copyright information is contained mainly between the radius of each circle, and circle with circle In data;
    (1.4), described virtual round fingerprint is expanded can cover vector numerical map full figure;
    (2), the embedding grammar of virtual pattern fingerprint characteristic
    The telescopiny of virtual round digital finger-print feature, to having 2 tops in map vector data Each imaginary circles in the above coordinate sequence of point and one group of imaginary circles has detected whether intersection point, If there is intersection point, relevant intersection is inserted in coordinate sequence, specific as follows:
    (2.1), map vector coordinate sequence data are read;
    (2.2) central coordinate of circle (X of imaginary circles, is calculated0, Y0);
    (2.3) the horizon radius Υ of imaginary circles, is determined;
    (2.4), to adjacent 2 points in coordinate sequence data, it is judged that virtual in imaginary circles group Circle (X-X0)2+(Y-Y0)2=r2With line segment (X1, Y1)-(X2, Y2Whether intersection point is had between);
    (2.5) intersection point, is then set as (X, Y), then it must be (X1, Y1)-(X2, Y2) line segment On a bit, its (X, Y) coordinate is by (X1, Y1)-(X2, Y2) 2 determine:
    X = X 2 + &mu; ( X 1 - X 2 ) Y = Y 2 + &mu; ( Y 1 - Y 2 ) - - - ( 1 )
    The intersection point (X, Y) that formula (2) is determined substitutes into known imaginary circles equation (X-X0)2+(Y-Y0)2=r2Try to achieve μ quadratic equation with one unknown A μ2+ B μ+C=0;
    Wherein:
    According to the rooting discriminant Δ in the quadratic equation with one unknown of μ, when Δ=0, line segment is with virtual Circle tangent, when Δ > 0 time, line segment intersects with imaginary circles, and has two intersection points;When Δ < when 0, Line segment does not has alternation with circle;Try to achieve μ quadratic equation with one unknown solution again and substitute into (2) formula, can try to achieve The coordinate figure of intersection point (X, Y) coordinate;
    (2.6), finally according to the characteristic point embedding strategy in imaginary circles watermarking algorithm design philosophy, (the X that virtual round digital finger-print characteristic point is inserted in coordinate sequence1, Y1) and (X2, Y2) it Between, obtain the map vector data that characteristic point distribution is overall;
    (3) map vector digital finger-print feature point detecting method based on imaginary circles, described detection side Method step is as follows:
    (3.1), map vector coordinate sequence data are read;
    (3.2), input has the imaginary circles elements of a fix and the imaginary circles horizon radius of key;
    (3.3), according to the imaginary circles elements of a fix and horizon radius, in coordinate sequence data Adjacent 2 points, it is judged that the imaginary circles (X-X in imaginary circles group0)2+(Y-Y0)2=r2With line segment (X1, Y1)-(X2, Y2Whether intersection point is had between);
    (3.4) intersection point, is set as (X, Y), then it must be (X1, Y1)-(X2, Y2) on line segment A bit, its (X, Y) coordinate is by (X1, Y1)-(X2, Y2) 2 determine:
    X = X 1 + &mu;X 2 1 + &mu; Y = Y 1 + &mu;Y 2 1 + &mu; - - - ( 2 )
    The intersection point (X, Y) that formula (2) is determined substitutes into known imaginary circles equation (X-X0)2+(Y-Y0)2=r2Try to achieve μ quadratic equation with one unknown;
    According to the rooting discriminant Δ in the quadratic equation with one unknown of μ, when Δ=0, line segment is with virtual Circle tangent, when Δ > 0 time, line segment intersects with imaginary circles, and has two intersection points;When Δ < when 0, Line segment does not has alternation with circle;Try to achieve μ quadratic equation with one unknown solution again and substitute into (2) formula, i.e. try to achieve friendship The coordinate figure of point (X, Y) coordinate;
    (3.5), according to trying to achieve the coordinate figure of intersection point (X, Y) coordinate, the extreme coordinates of line segment (X1, Y1) and (X2, Y2) compare;Limit difference in prescribed limit, i.e. intersection point and end points non-it During the error amount d that spacing limits less than, this end points is as the watermark feature point in imaginary circles Extract;
    (3.6), according to the feature point set extracted, build imaginary circles, determine circle with 3, Remaining point is verified, meets the addition watermark information collection of imaginary circles equation, incongruent abandons;
    (3.7), finally, parameter is constituted according to the imaginary circles inverse imaginary circles detected, then Copyright information is solved, it is achieved the extraction of copyright information according to key information.
CN201410013158.2A 2014-01-10 2014-01-10 The map vector data copy-right protection method of anti-interpretation Attack Active CN103853945B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410013158.2A CN103853945B (en) 2014-01-10 2014-01-10 The map vector data copy-right protection method of anti-interpretation Attack

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410013158.2A CN103853945B (en) 2014-01-10 2014-01-10 The map vector data copy-right protection method of anti-interpretation Attack

Publications (2)

Publication Number Publication Date
CN103853945A CN103853945A (en) 2014-06-11
CN103853945B true CN103853945B (en) 2017-01-04

Family

ID=50861593

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410013158.2A Active CN103853945B (en) 2014-01-10 2014-01-10 The map vector data copy-right protection method of anti-interpretation Attack

Country Status (1)

Country Link
CN (1) CN103853945B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106991300A (en) * 2017-03-03 2017-07-28 浙江工业大学 A kind of digital finger-print insertion of hyperbola graphic feature and detection method

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103279915A (en) * 2013-05-24 2013-09-04 浙江工业大学 Watermark embedding method for virtual graph bar code-based graphs

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPWO2011121927A1 (en) * 2010-03-31 2013-07-04 日本電気株式会社 Digital content management system, apparatus, program, and method

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103279915A (en) * 2013-05-24 2013-09-04 浙江工业大学 Watermark embedding method for virtual graph bar code-based graphs

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
一种基于POS判断树的病毒入侵预估性安全防范算法;朱文忠;《科技通报》;20130413;第29卷(第4期);第112-114页 *

Also Published As

Publication number Publication date
CN103853945A (en) 2014-06-11

Similar Documents

Publication Publication Date Title
CN102968757B (en) Based on vector map watermark embedding grammar and the detection method of imaginary circles
CN102982500B (en) Based on vector map watermark embedding grammar and the detection method of virtual grid
Yi et al. Enhancing the accuracy of automatic eddy detection and the capability of recognizing the multi-core structures from maps of sea level anomaly
Sofia et al. High‐resolution topography and anthropogenic feature extraction: Testing geomorphometric parameters in floodplains
Voigt et al. Feature-based watermarking of 2D vector data
CN102622721B (en) Three-dimensional grid model blind-watermarking method based on depth image mapping
CN108254784B (en) Fault identification method, device and system based on two-dimensional seismic data
CN105045976B (en) A kind of method that war game map terrain properties are established with grid matrix
Pardo‐igúzquiza et al. Morphometric analysis of karst depressions on a Mediterranean karst massif
Li et al. Study on copyright authentication of GIS vector data based on Zero-watermarking
CN103853945B (en) The map vector data copy-right protection method of anti-interpretation Attack
CN103955634A (en) Copyright protecting method based on digital watermark technology and aiming at tile remote sensing data
Neyman et al. Reversible fragile watermarking based on difference expansion using manhattan distances for 2d vector map
CN103886539A (en) Embedding and detection method of circular characteristic digit fingerprint
CN106599727A (en) Vector map integrity authentication method
CN102682246B (en) Vector geographic data digital watermark method based on data point positioning
Kambesis et al. Morphometric analysis of cave patterns using fractal indices
CN103279915A (en) Watermark embedding method for virtual graph bar code-based graphs
CN114563785A (en) Earth surface deformation detection method, device, equipment and medium based on phase gradient
CN103778356A (en) Vector graph data copyright protection method based on geometric steganography
CN103793872A (en) Interpretation attack resistance digital watermark embedding method based on fingerprint features
CN105426710A (en) Method for accurately authenticating vector geographic data based on spatial domain sequencing
Abbas et al. Digital vector map watermarking: Applications, techniques and attacks
CN103020886B (en) Digital scanning map watermarking method based on linear characteristic
CN107301399B (en) Water surface bridge identification method based on overlook image

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
TR01 Transfer of patent right

Effective date of registration: 20201021

Address after: Room 1,020, Nanxun Science and Technology Pioneering Park, No. 666 Chaoyang Road, Nanxun District, Huzhou City, Zhejiang Province, 313000

Patentee after: Huzhou You Yan Intellectual Property Service Co.,Ltd.

Address before: 310014 Hangzhou city in the lower reaches of the city of Zhejiang Wang Road, No. 18

Patentee before: ZHEJIANG University OF TECHNOLOGY

TR01 Transfer of patent right