CN1818926A - Two-dimensional code area precisive positioning method for two-dimensional recognition - Google Patents

Two-dimensional code area precisive positioning method for two-dimensional recognition Download PDF

Info

Publication number
CN1818926A
CN1818926A CN 200610064938 CN200610064938A CN1818926A CN 1818926 A CN1818926 A CN 1818926A CN 200610064938 CN200610064938 CN 200610064938 CN 200610064938 A CN200610064938 A CN 200610064938A CN 1818926 A CN1818926 A CN 1818926A
Authority
CN
China
Prior art keywords
point
outermost point
dimension code
dimensional code
mentioned
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.)
Granted
Application number
CN 200610064938
Other languages
Chinese (zh)
Other versions
CN100377167C (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.)
Yet the Internet (Beijing) Technology Co., Ltd.
Original Assignee
Ziguang Jietong Science And Technology Co Ltd Beijing
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 Ziguang Jietong Science And Technology Co Ltd Beijing filed Critical Ziguang Jietong Science And Technology Co Ltd Beijing
Priority to CNB2006100649385A priority Critical patent/CN100377167C/en
Publication of CN1818926A publication Critical patent/CN1818926A/en
Application granted granted Critical
Publication of CN100377167C publication Critical patent/CN100377167C/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Image Analysis (AREA)

Abstract

A two-dimensional code region accurate orientation method of the two-dimensional code recognition belongs to the field of information memory, orientation and discriminating technique. It is: transform multicolor bitmap of the collective and undiscriminating two-dimensional code to 256 ash bitmap, transform the ash bitmap to binary image, projecting to the X axis and Y axis of the binary image respectively to get the central-point of the two-dimensional code region; the central-point as the jumping-off, scan to the four directions of up, down, left and right, to get the four most-outside points of the two-dimensional code region; the any most-outside point as the new jumping-off turn to counter-clockwise of clockwise direction, to get the new most-outside point; redo the up steps to get the accurate orientation two-dimensional code region. The invention is: improve the data capacity of the code image indirectly that enhance the identified efficiency one time because do not use the seeking-image graph during the process of searching the two-dimensional code region, the confirming process of the two-dimensional code region do not need the image line-in-line scanning, therefore the speed of region orientation is faster.

Description

A kind of two-dimension code zone accurate positioning method that is used for two-dimension code identification
Technical field
The present invention relates to a kind of two-dimension code zone accurate positioning method that is used for two-dimension code identification, belong to information stores, location and recognition technology field.
Background technology
Existing two-dimension code as shown in Figure 1, the bar code in the two-dimensional space canned data of level and vertical direction is called two-dimension code (2-dimensional bar code), can directly show English, Chinese, numeral, symbol, pattern; The storage data volume is big, can deposit the 1K character, and the direct reading of content of available scanning device need not to connect in addition database.
Two-dimension code can be divided into stack/row row formula two-dimension code and matrix type two-dimension sign indicating number, wherein is that bar code by the multirow cutting back piles up and forms on stack/row row formula two-dimension code form; The matrix type two-dimension sign indicating number is formed with the form of matrix, with " point " expression binary one, represents binary zero with " sky ", by the code that rearranges of " point " and " sky " on matrix respective element position.
The matrix type two-dimension sign indicating number claims the checkerboard type two-dimension code again, and it is to encode by black, the different distributions of white pixel in matrix at a coffin.On matrix respective element position, represent binary one with the appearance of point (square point, round dot or other shapes), not the occurring of point represents that binary " 0 ", the permutation and combination of point determined the meaning of matrix type two-dimension sign indicating number representative.The matrix type two-dimension sign indicating number is that a kind of novel graphical symbol automatically identifying and reading that is based upon on the bases such as computer image processing technology, assembly coding principle is handled code system.
The method in two-dimension code zone, existing location comprises:
1, existing two-dimensional sign indicating number zone location is to determine the target area of two-dimensional bar code by the view finding figure, and the view finding figure in the QR sign indicating number is made up of 3 identical position sensing figures on 3 angles at 4 angles that are arranged in the two-dimension code figure.Each sequence of modules of surveying figure is made of dark color-light color-dark color-light color-dark order, and the ratio of the relative width of each element is 1: 1: 3: 1: 1.
2, when detecting pre-selected zone, the outward flange of one-row pixels and position sensing figure meets in the detected image first and last point.Capable first straight line with last point detection figure that meets with the outward flange position sensing figure to the adjacent image point in this image all discerned.
3, repeat above step, in the Y direction of image, all pixel columns of position sensing centre of figure square are passed in identification.
4, determine to survey centre of figure, central point by A, 2 lines of B on the outermost pixel line that passes position sensing centre of figure piece in X-direction connects a straight line, use the same method and draw a straight line on another vertical direction, the intersection point of two straight lines is exactly the center of position sensing figure.
5, repeating step 1-3 determines the center of other two position sensing figures.
6, survey the coordinate of centre of figure by analysis position, the anglec of rotation of discerning which position sensing figure and be upper left corner figure and symbol is determined the orientation of symbol.
Above-mentioned existing method is to realize locating by the special pattern of seeking in the target area, and the time of seeking target area consumption is long, and bearing accuracy is low.
Goal of the invention
The objective of the invention is to propose a kind of two-dimension code zone accurate positioning method that is used for two-dimension code identification, to improve the recognition speed and the precision of two-dimension code.
The two-dimension code zone accurate positioning method that is used for two-dimension code identification that the present invention proposes may further comprise the steps:
(1) the colored bitmap-converted with the two-dimension code to be identified gathered is 256 color shade bitmaps;
(2) set a threshold value, with the gray-scale value and the threshold of each pixel of above-mentioned gray bitmap, if greater than threshold value, then assignment 1, if less than threshold value, then assignment 0, obtains binary image, and threshold value be less than 255 positive integer greater than zero;
(3) respectively to X-axis, the Y-axis projection of above-mentioned binary image, write down X value, the Y value in jump frequency highest region territory, with this X, the combination of Y value is as the central point in two-dimension code zone;
(4) be starting point from above-mentioned central point, up and down, left and right four direction scans successively, when light areas and darker regions generation saltus step, and the cumulative length of light areas is during less than a length thresholding, finish scanning, obtain four original outermost point in two-dimension code zone;
(5) be that starting point is according to counterclockwise or clockwise direction with above-mentioned any one original outermost point, press its excess-three point of track process of the square box of above-mentioned four outermost point formation, get back to starting point at last, scan, if one side of outermost point of process light areas and darker regions generation saltus step are arranged, then this outermost point is moved to the binary image edge by a fixed step size, obtain a new outermost point, and substitute corresponding original outermost point with this new outermost point;
(6) being more arbitrarily starting point in above-mentioned original outermost point and the new outermost point, repeating step (5), all there is not saltus step between light areas and the darker regions until every limit of described square box, obtain four last outermost point, the square box that is formed by these four last outermost point is the zone of two-dimension code.
In the said method, colored bitmap-converted is that the formula of 256 color shade bitmaps is:
Gray scale=0.2126 * red component+0.7152 * green component+0.0722 * blue component
The two-dimension code zone accurate positioning method that is used for two-dimension code identification that the present invention proposes, its advantage be, owing to do not adopt the view finding figure in the process of seeking the two-dimension code zone, improved the data capacity of sign indicating number figure indirectly, and recognition efficiency is doubled.Definite process in two-dimension code zone does not need the image of input is lined by line scan, so zone location speed is faster.
Description of drawings
Fig. 1 is the structural representation of two-dimension code.
Fig. 2 and Fig. 3 are respectively the pilot process synoptic diagram of zone location in the inventive method.
Among Fig. 1~Fig. 3, the 1st, the clear area, the 2nd, chromatic zones, the 3rd, upwards scan the top outermost point of determining for the first time, the 4th, the left part outermost point that scanning is for the first time left determined, the 5th, through the central point in the definite two-dimension code zone of projection, the 6th, the bottom outermost point that scanning is for the first time downwards determined, the 7th, the right part outermost point that scanning is for the first time to the right determined, the 8th, scan the square box that determined outermost point is formed for the first time, the two-dimension code zone of the guestimate that i.e. scanning for the first time obtains, the 9th, because there is saltus step N the determined outermost point of pixel that move right on limit, 7 place, the 10th, outermost point 3,4,6,9 determined square boxs, i.e. the two-dimension code zone of the estimation that scanning for the second time obtains, the 11st, final determined top outermost point, the 12nd, final determined left part outermost point, the 13rd, final determined right part outermost point, the 14th, final determined bottom outermost point, the 15th, be outermost point 11,12,13,14 definite square boxs.
Embodiment
The two-dimension code zone accurate positioning method that is used for two-dimension code identification that the present invention proposes, at first the colored bitmap-converted with the two-dimension code to be identified gathered is 256 color shade bitmaps; Set a threshold value, with the gray-scale value and the threshold of each pixel of above-mentioned gray bitmap, if greater than threshold value, then assignment 1, if less than threshold value, then assignment 0, obtains binary image, and threshold value be less than 255 positive integer greater than zero; To X-axis, the Y-axis projection of binary image, write down X value, the Y value in jump frequency highest region territory respectively, with this X, the combination of Y value is as the central point in two-dimension code zone; From above-mentioned central point is starting point, up and down, left and right four direction scans successively, when light areas and darker regions generation saltus step, and the cumulative length of light areas is during less than a length thresholding, finish scanning, obtain four original outermost point in two-dimension code zone; With any one original outermost point is that starting point is according to counterclockwise or clockwise direction, press its excess-three point of track process of the square box of above-mentioned four outermost point formation, get back to starting point at last, scan, if one side of outermost point of process light areas and darker regions generation saltus step are arranged, then this outermost point is moved to the binary image edge by a fixed step size, obtain a new outermost point, and this new outermost point is substituted corresponding original outermost point; Being more arbitrarily starting point in above-mentioned original outermost point and the new outermost point, repeat said process, all there is not saltus step between light areas and the darker regions until every limit of square box, obtain four last outermost point, the square box that is formed by these four last outermost point is the zone of two-dimension code.。
In the said method, colored bitmap-converted is that the formula of 256 color shade bitmaps is:
Gray scale=0.2126 * red component+0.7152 * green component+0.0722 * blue component
In the inventive method, be starting point from above-mentioned central point for the first time, up and down, left and right four direction carries out scanning process successively, the two-dimension code zone that obtains is the guestimate to the two-dimension code zone, whenever finish single pass, the capital has an outermost point outwards to move, and the outermost point after moving substitutes original outermost point, and remaining outermost point invariant position.Subsequent scanning is with outermost point after substituting and original outermost point formation square box.
Introduce an embodiment of the inventive method below in conjunction with accompanying drawing 2,3,4,5:
The binary image that the coloured image of being gathered is changed into, as shown in Figure 2, central point 5 by the definite two-dimension code zone of sciagraphy, with central point 5 be starting point up and down, left and right four direction scanning determines four original outermost point 3,4,6,7, the 8th, scan the square box that determined outermost point is formed for the first time, the two-dimension code zone of the guestimate that i.e. scanning for the first time obtains, as shown in Figure 3.To put 7 has been to press counterclockwise track along square box successively through point 3,4,6, get back to a little 7 at last, on the limit of 7 place square boxs, saltus step is arranged, to put the 7 N pixels that move right, be the new outermost point 9 of Fig. 4, the 10th, outermost point 3,4,6,9 determined square boxs, i.e. the two-dimension code zone of the estimation that scanning for the second time obtains.Be starting point to put 9 again, by counterclockwise along the track of square box successively through point 3,4,6, and whether the limit of detecting by each some place has saltus step, if have, then outwards move this point, so circulation, the limit to the last determined four outermost point 11,12,13,14 places does not all have till the saltus step, the 15th, last outermost point 11,12,13,14 determined square boxs are pinpoint two-dimension code zone, as shown in Figure 5.

Claims (2)

1, a kind of two-dimension code zone accurate positioning method that is used for two-dimension code identification is characterized in that this method may further comprise the steps:
(1) the colored bitmap-converted with the two-dimension code to be identified gathered is 256 color shade bitmaps;
(2) set a threshold value, with the gray-scale value and the threshold of each pixel of above-mentioned gray bitmap, if greater than threshold value, then assignment 1, if less than threshold value, then assignment 0, obtains binary image, and thresholding be less than 255 positive integer greater than zero;
(3) respectively to X-axis, the Y-axis projection of above-mentioned binary image, write down X value, the Y value in jump frequency highest region territory, with this X, the combination of Y value is as the central point in two-dimension code zone;
(4) be starting point from above-mentioned central point, up and down, left and right four direction scans successively, when light areas and darker regions generation saltus step, and the cumulative length of light areas is during less than a length thresholding, finish scanning, obtain four original outermost point in two-dimension code zone;
(5) be that starting point is according to counterclockwise or clockwise direction with above-mentioned any one original outermost point, press its excess-three point of track process of the square box of above-mentioned four outermost point formation, get back to starting point at last, scan, if one side of outermost point of process light areas and darker regions generation saltus step are arranged, then this outermost point is moved to the binary image edge by a fixed step size, obtain a new outermost point, and substitute corresponding original outermost point with this new outermost point;
(6) being more arbitrarily starting point in above-mentioned original outermost point and the new outermost point, repeating step (5), all there is not saltus step between light areas and the darker regions until every limit of described square box, obtain four last outermost point, the square box that is formed by these four last outermost point is the zone of two-dimension code.
2, the method for claim 1 is characterized in that the formula that wherein said colored bitmap-converted is 256 color shade bitmaps is:
Gray scale=0.2126 * red component+0.7152 * green component+0.0722 * blue component.
CNB2006100649385A 2006-03-17 2006-03-17 Two-dimensional code area precisive positioning method for two-dimensional recognition Active CN100377167C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB2006100649385A CN100377167C (en) 2006-03-17 2006-03-17 Two-dimensional code area precisive positioning method for two-dimensional recognition

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB2006100649385A CN100377167C (en) 2006-03-17 2006-03-17 Two-dimensional code area precisive positioning method for two-dimensional recognition

Publications (2)

Publication Number Publication Date
CN1818926A true CN1818926A (en) 2006-08-16
CN100377167C CN100377167C (en) 2008-03-26

Family

ID=36918934

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB2006100649385A Active CN100377167C (en) 2006-03-17 2006-03-17 Two-dimensional code area precisive positioning method for two-dimensional recognition

Country Status (1)

Country Link
CN (1) CN100377167C (en)

Cited By (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101482933B (en) * 2008-01-08 2010-09-01 纬创资通股份有限公司 Identification data generation method used for high-speed recognition code and its correlated apparatus
CN103761062A (en) * 2014-01-24 2014-04-30 孔阳 Method for displaying corresponding materials in two-dimension code area on screen of mobile terminal
CN102043940B (en) * 2009-10-14 2014-06-18 北大方正集团有限公司 Method and device for reading two-dimensional code symbol data
CN104463292A (en) * 2013-09-16 2015-03-25 深圳市同盛绿色科技有限公司 Optical identification method and mobile device
CN104951828A (en) * 2015-06-12 2015-09-30 矽照光电(厦门)有限公司 Generation method for color high-order invisible image code
CN105069393A (en) * 2015-09-09 2015-11-18 杭州甄别网络科技有限公司 Two-dimensional code malicious reading-preventing method and device
CN105095938A (en) * 2015-08-18 2015-11-25 矽照光电(厦门)有限公司 Method for generating color multi-order invisible image code
CN105335771A (en) * 2015-11-12 2016-02-17 深圳Tcl数字技术有限公司 Two-dimensional code generating and displaying method and apparatus
CN105868724A (en) * 2016-04-07 2016-08-17 广州智慧城市发展研究院 Two-dimensional bar code identification method and system based on connected domain
CN106295454A (en) * 2015-06-23 2017-01-04 柯尼卡美能达美国研究所有限公司 For processing data handling equipment and the method for 2D color bar code
CN106271882A (en) * 2016-08-29 2017-01-04 中航动力股份有限公司 A kind of for turbine disk Quick Response Code labelling add man-hour to pin and detection device
CN106326801A (en) * 2016-09-22 2017-01-11 华中科技大学 Scanning method of stereoscopic two-dimensional codes
CN106529368A (en) * 2016-09-29 2017-03-22 上海正雅齿科科技有限公司 Method for localizing recognition region of two-dimensional code
CN106969766A (en) * 2017-03-21 2017-07-21 北京品创智能科技有限公司 A kind of indoor autonomous navigation method based on monocular vision and Quick Response Code road sign
CN110758477A (en) * 2019-11-07 2020-02-07 交控科技股份有限公司 Train positioning method and system based on two-dimensional code recognition
CN112414679A (en) * 2020-12-04 2021-02-26 歌尔光学科技有限公司 Method and device for extracting SFR algorithm knife edge area

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TW201308213A (en) * 2011-08-04 2013-02-16 Tritan Technology Inc Method of defining 2D message coding area of optical recognizer
CN102955927B (en) * 2011-08-17 2015-04-15 硕呈科技股份有限公司 Defining method for two-dimensional information coding area of optical recognizer
JP2022542625A (en) * 2019-08-06 2022-10-06 ライカ バイオシステムズ イメージング インコーポレイテッド Real-time focusing in slide scanning systems

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5319181A (en) * 1992-03-16 1994-06-07 Symbol Technologies, Inc. Method and apparatus for decoding two-dimensional bar code using CCD/CMD camera
JP2835274B2 (en) * 1994-02-24 1998-12-14 株式会社テック Image recognition device
DE60118051T2 (en) * 2000-04-06 2006-08-31 Seiko Epson Corp. Method and apparatus for reading a two-dimensional bar code and data storage medium
CN1472704A (en) * 2003-06-27 2004-02-04 上海龙贝信息科技有限公司 Strengthening method for two-dimensional barcode digital image information

Cited By (26)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101482933B (en) * 2008-01-08 2010-09-01 纬创资通股份有限公司 Identification data generation method used for high-speed recognition code and its correlated apparatus
CN102043940B (en) * 2009-10-14 2014-06-18 北大方正集团有限公司 Method and device for reading two-dimensional code symbol data
CN104463292A (en) * 2013-09-16 2015-03-25 深圳市同盛绿色科技有限公司 Optical identification method and mobile device
CN104463292B (en) * 2013-09-16 2018-01-09 深圳市同盛绿色科技有限公司 Optical identification method and mobile device
CN103761062A (en) * 2014-01-24 2014-04-30 孔阳 Method for displaying corresponding materials in two-dimension code area on screen of mobile terminal
CN103761062B (en) * 2014-01-24 2016-06-22 孔阳 A kind of method at the corresponding material of two-dimension code area display and mobile terminal
CN104951828A (en) * 2015-06-12 2015-09-30 矽照光电(厦门)有限公司 Generation method for color high-order invisible image code
CN106295454B (en) * 2015-06-23 2019-10-01 柯尼卡美能达美国研究所有限公司 For handling the data processing equipment and method of 2D color bar code
CN106295454A (en) * 2015-06-23 2017-01-04 柯尼卡美能达美国研究所有限公司 For processing data handling equipment and the method for 2D color bar code
CN105095938A (en) * 2015-08-18 2015-11-25 矽照光电(厦门)有限公司 Method for generating color multi-order invisible image code
CN105069393B (en) * 2015-09-09 2017-10-10 杭州甄别网络科技有限公司 The anti-malice read method of Quick Response Code and device
CN105069393A (en) * 2015-09-09 2015-11-18 杭州甄别网络科技有限公司 Two-dimensional code malicious reading-preventing method and device
CN105335771B (en) * 2015-11-12 2018-09-04 深圳Tcl数字技术有限公司 Quick Response Code generates display methods and device
WO2017080190A1 (en) * 2015-11-12 2017-05-18 深圳Tcl数字技术有限公司 Two-dimensional code generation and display method and device
CN105335771A (en) * 2015-11-12 2016-02-17 深圳Tcl数字技术有限公司 Two-dimensional code generating and displaying method and apparatus
CN105868724A (en) * 2016-04-07 2016-08-17 广州智慧城市发展研究院 Two-dimensional bar code identification method and system based on connected domain
CN105868724B (en) * 2016-04-07 2019-09-10 广州智慧城市发展研究院 A kind of two-dimension bar code recognition method and system based on connected domain
CN106271882A (en) * 2016-08-29 2017-01-04 中航动力股份有限公司 A kind of for turbine disk Quick Response Code labelling add man-hour to pin and detection device
CN106326801A (en) * 2016-09-22 2017-01-11 华中科技大学 Scanning method of stereoscopic two-dimensional codes
CN106326801B (en) * 2016-09-22 2019-02-05 华中科技大学 A kind of scan method of stereoscopic two-dimensional code
CN106529368B (en) * 2016-09-29 2019-06-07 上海正雅齿科科技股份有限公司 The method of two dimensional code identification region positioning
CN106529368A (en) * 2016-09-29 2017-03-22 上海正雅齿科科技有限公司 Method for localizing recognition region of two-dimensional code
CN106969766A (en) * 2017-03-21 2017-07-21 北京品创智能科技有限公司 A kind of indoor autonomous navigation method based on monocular vision and Quick Response Code road sign
CN110758477A (en) * 2019-11-07 2020-02-07 交控科技股份有限公司 Train positioning method and system based on two-dimensional code recognition
CN112414679A (en) * 2020-12-04 2021-02-26 歌尔光学科技有限公司 Method and device for extracting SFR algorithm knife edge area
CN112414679B (en) * 2020-12-04 2022-06-03 歌尔光学科技有限公司 Method and device for extracting SFR algorithm knife edge area

Also Published As

Publication number Publication date
CN100377167C (en) 2008-03-26

Similar Documents

Publication Publication Date Title
CN100377167C (en) Two-dimensional code area precisive positioning method for two-dimensional recognition
US6181839B1 (en) Two-dimensional code reader
CN100527156C (en) Picture words detecting method
US4813078A (en) Character recognition apparatus
CN108921163A (en) A kind of packaging coding detection method based on deep learning
CN104331697B (en) A kind of localization method of area-of-interest
US20080253633A1 (en) Aligning grids derived from fluorescent images of an array of signal sources
CN109902527B (en) Automatic QR code recognizing and reading method and device
CN106778717B (en) Evaluation table identification method based on image identification and K neighbor
CN105095937B (en) A kind of visual identity method of the circular array graphic code based on straight line cluster
CN102750530B (en) Character recognition method and device
CN102763121B (en) Method for decoding a linear bar code
CN113177959A (en) QR code real-time extraction algorithm in rapid movement process
CN1598487A (en) Method for visual guiding by manual road sign
JP2001043313A (en) Character segmenting method
CN103235951B (en) A kind of Primary Location method of matrix two-dimensional barcode
CN116306731A (en) Method and device for identifying bar codes, electronic equipment and storage medium
CN113920140B (en) Wagon pipe cover falling fault identification method based on deep learning
CN114782975A (en) OCR (optical character recognition) method for electronic file table format
Jia et al. Grayscale-projection based optimal character segmentation for camera-captured faint text recognition
CN110263597B (en) Quick and accurate QR (quick response) code correction method and system
Noor et al. Handwritten arabic (indian) numerals recognition using fourier descriptor and structure base classifier
CN116824183B (en) Image feature matching method and device based on multiple feature descriptors
Kumar A three tier scheme for devanagari hand-printed character recognition
JP3567904B2 (en) 2D code reader

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
C41 Transfer of patent application or patent right or utility model
TR01 Transfer of patent right

Effective date of registration: 20090327

Address after: Room 413A, Violet building, east gate, Tsinghua University, Beijing, Haidian District

Patentee after: Beijing purple best code technology Co., Ltd.

Address before: Room 415, Violet building, east gate, Tsinghua University, Haidian District, Beijing, Beijing

Patentee before: UNIS JIETONG TECHNOLOGY CO., LTD.

ASS Succession or assignment of patent right

Owner name: BEIJING ZHIGUANG YOUMA SCIENCE + TECHNOLOGY CO., L

Free format text: FORMER OWNER: ZIGUANG JIETONG SCIENCE CO., LTD.

Effective date: 20090327

ASS Succession or assignment of patent right

Owner name: KEESAIL INTERCONNECTION (BEIJING) TECHNOLOGY CO.,

Free format text: FORMER OWNER: BEIJING ZIGUANG YOUMA TECHNOLOGY CO., LTD.

Effective date: 20110905

C41 Transfer of patent application or patent right or utility model
COR Change of bibliographic data

Free format text: CORRECT: ADDRESS; FROM: 100084 HAIDIAN, BEIJING TO: 100191 HAIDIAN, BEIJING

TR01 Transfer of patent right

Effective date of registration: 20110905

Address after: 100191, Taixing building, 11 Garden East Road, Beijing, Haidian District 601

Patentee after: Yet the Internet (Beijing) Technology Co., Ltd.

Address before: 100084 413A building, east gate, Violet building, Tsinghua University, Beijing, Haidian District

Patentee before: Beijing purple best code technology Co., Ltd.