CAN CSA-ISO IEC 16022-2007 Information technology - Automatic identification and data capture techniques - Data Matrix bar code symbology specification (Incorporated Corrigendum 1 .pdf

《CAN CSA-ISO IEC 16022-2007 Information technology - Automatic identification and data capture techniques - Data Matrix bar code symbology specification (Incorporated Corrigendum 1 .pdf》由会员分享，可在线阅读，更多相关《CAN CSA-ISO IEC 16022-2007 Information technology - Automatic identification and data capture techniques - Data Matrix bar code symbology specification (Incorporated Corrigendum 1 .pdf（175页珍藏版）》请在麦多课文档分享上搜索。

1、 Reference numberISO/IEC 16022:2006(E)ISO/IEC 2006Information technology Automatic identification and data capture techniques Data Matrix bar code symbology specification Technologies de linformation Techniques didentification automatique et de capture des donnes Spcification de symbologie de code b

2、arres Data Matrix International Organization for Standardization (ISO), 2006. All rights reserved. International Electrotechnical Commission (IEC), 2006. All rights reserved. NOT FOR RESALE. National Standard of CanadaCAN/CSA-ISO/IEC 16022:07(ISO/IEC 16022:2006)International Standard ISO/IEC 16022:2

3、006 (second edition, 2006-09-15) has been adopted withoutmodification (IDT) as CSA Standard CAN/CSA-ISO/IEC 16022:07, which has been approved as a NationalStandard of Canada by the Standards Council of Canada.ISBN 978-1-55436-641-5 November 2007LegalNoticeforStandardsCanadian Standards Association (

4、CSA) standards are developed through a consensus standards development process approved by theStandards Council of Canada. This process brings together volunteers representing varied viewpoints and interests to achieve consensusand develop a standard. Although CSA administers the process and establi

5、shes rules to promote fairness in achieving consensus, it doesnot independently test, evaluate, or verify the content of standards.Disclaimer and exclusion of liabilityThis document is provided without any representations, warranties, or conditions of any kind, express or implied, including, without

6、limitation, implied warranties or conditions concerning this documents fitness for a particular purpose or use, its merchantability, or itsnon-infringement of any third partys intellectual property rights. CSA does not warrant the accuracy, completeness, or currency of anyof the information publishe

7、d in this document. CSA makes no representations or warranties regarding this documents compliance withany applicable statute, rule, or regulation.IN NO EVENT SHALL CSA, ITS VOLUNTEERS, MEMBERS, SUBSIDIARIES, OR AFFILIATED COMPANIES, OR THEIR EMPLOYEES,DIRECTORS, OR OFFICERS, BE LIABLE FOR ANY DIREC

8、T, INDIRECT, OR INCIDENTAL DAMAGES, INJURY, LOSS, COSTS, OR EXPENSES,HOWSOEVER CAUSED, INCLUDING BUT NOT LIMITED TO SPECIAL OR CONSEQUENTIAL DAMAGES, LOST REVENUE, BUSINESSINTERRUPTION, LOST OR DAMAGED DATA, OR ANY OTHER COMMERCIAL OR ECONOMIC LOSS, WHETHER BASED IN CONTRACT,TORT (INCLUDING NEGLIGEN

9、CE), OR ANY OTHER THEORY OF LIABILITY, ARISING OUT OF OR RESULTING FROM ACCESS TO ORPOSSESSION OR USE OF THIS DOCUMENT, EVEN IF CSA HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES, INJURY, LOSS,COSTS, OR EXPENSES.In publishing and making this document available, CSA is not undertaking to render

10、professional or other services for or on behalf of anyperson or entity or to perform any duty owed by any person or entity to another person or entity. The information in this document isdirected to those who have the appropriate degree of experience to use and apply its contents, and CSA accepts no

11、 responsibilitywhatsoever arising in any way from any and all use of or reliance on the information contained in this document.CSA is a private not-for-profit company that publishes voluntary standards and related documents. CSA has no power, nor does itundertake, to enforce compliance with the cont

12、ents of the standards or other documents it publishes.Intellectual property rights and ownershipAs between CSA and the users of this document (whether it be in printed or electronic form), CSA is the owner, or the authorizedlicensee, of all works contained herein that are protected by copyright, all

13、 trade-marks (except as otherwise noted to the contrary), andall inventions and trade secrets that may be contained in this document, whether or not such inventions and trade secrets are protectedby patents and applications for patents. Without limitation, the unauthorized use, modification, copying

14、, or disclosure of this documentmay violate laws that protect CSAs and/or others intellectual property and may give rise to a right in CSA and/or others to seek legalredress for such use, modification, copying, or disclosure. To the extent permitted by licence or by law, CSA reserves all intellectua

15、lproperty rights in this document.Patent rightsAttention is drawn to the possibility that some of the elements of this standard may be the subject of patent rights. CSA shall not be heldresponsible for identifying any or all such patent rights. Users of this standard are expressly advised that deter

16、mination of the validity ofany such patent rights is entirely their own responsibility.Authorized use of this documentThis document is being provided by CSA for informational and non-commercial use only. The user of this document is authorized to doonly the following:If this document is in electroni

17、c form:.load this document onto a computer for the sole purpose of reviewing it;.search and browse this document; and.print this document.Limited copies of this document in print or paper form may be distributed only to persons who are authorized by CSA to have suchcopies, and only if this Legal Not

18、ice appears on each such copy.In addition, users may not and may not permit others to.alter this document in any way or remove this Legal Notice from the attached standard;.sell this document without authorization from CSA; or.make an electronic copy of this document.If you do not agree with any of

19、the terms and conditions contained in this Legal Notice, you may not load or use this document ormake any copies of the contents hereof, and if you do make such copies, you are required to destroy them immediately. Use of thisdocument constitutes your acceptance of the terms and conditions of this L

20、egal Notice.Information technology Automatic identification and data capture techniques Data Matrix bar code symbology specificationTECHNICAL CORRIGENDUM 2Technical Corrigendum 2:2012 (IDT) toNational Standard of CanadaCAN/CSA-ISO/IEC 16022:07(ISO/IEC 16022:2006, IDT)NOT FOR RESALE.PUBLICATION NON D

21、ESTINE LA REVENTE.CSA Standards Update ServiceTechnical Corrigendum 2:2012 toCAN/CSA-ISO/IEC 16022:07March 2012Title:Information technology Automatic identi fication and data capture techniques Data Matrix bar code symbology specificationPagination: 10 pagesTo register for e-mail notification about

22、any updates to this publication go on-line to shop.csa.caclick on E-mail Services under MY ACCOUNTclick on CSA Standards Update ServiceThe List ID that you will need to register for updates to this publication is 2418750.If you require assistance, please e-mail techsupportcsa.ca or call 416-747-2233

23、.Visit CSAs policy on privacy at csagroup.org/legal to find out how we protect your personal information.ICS 01.080.50; 35.040 Ref. No. ISO/IEC 16022:2006/Cor.2:2011(E) ISO/IEC 2011 All rights reserved INTERNATIONAL STANDARD ISO/IEC 16022:2006 TECHNICAL CORRIGENDUM 2 Published 2011-02-01 INTERNATION

24、AL ORGANIZATION FOR STANDARDIZATION ORGANISATION INTERNATIONALE DE NORMALISATIONINTERNATIONAL ELECTROTECHNICAL COMMISSION COMMISSION LECTROTECHNIQUE INTERNATIONALEInformation technology Automatic identification and data capture techniques Data Matrix bar code symbology specification TECHNICAL CORRIG

25、ENDUM 2 Technologies de linformation Techniques automatiques didentification et de capture des donnes Spcification de symbologie de code barres Data Matrix RECTIFICATIF TECHNIQUE 2 Technical Corrigendum 2 to ISO/IEC 16022:2006 was prepared by Joint Technical Committee ISO/IEC JTC 1, Information tech

26、nology, Subcommittee SC 31, Automatic identification and data capture techniques. Page 28 Replace Clause 9 with the following: 9 Reference decode algorithm for Data Matrix This reference decode algorithm finds a Data Matrix symbol in an image and decodes it. a) Define measurement parameters and form

27、 a digitised image: 1) Define a distance dmin which is 7,5 times the aperture diameter defined by the application. This will be the minimum length of the “L“ patterns side. Technical Corrigendum 2:2012 to CAN/CSA-ISO/IEC 16022:07ISO/IEC 16022:2006/Cor.2:2011(E) 2 ISO/IEC 2011 All rights reserved2) D

28、efine a distance gmax which is 7,5 times the aperture diameter. This is the largest gap in the “L“ finder that will be tolerated by the finder algorithm in step b). 3) Define a distance mmin which is 1,25 times the aperture diameter. This would be the nominal minimum module size when the aperture si

29、ze is 80% of the symbols X dimension. 4) Form a black/white image using a threshold determined according to the method defined in ISO/IEC 15415. b) Search horizontal and vertical scan lines for the two outside edges of the Data Matrix “L“: 1) Extend a scan line horizontally in both directions from t

30、he centre point of the image. Sample along the scan line. For each white/black or black/white transition found along the scan line resolved to the pixel boundary: i) Follow the edge upward sampling pixel by pixel until either it reaches a point 3,5mmin distant from the intersection of the scan line

31、and the edge starting point, or the edge turns back toward the intersection of the scan line and the edge - the starting point. ii) Follow the edge downward pixel by pixel until either it reaches a point 3,5mmin distant from the intersection of the scan line and the edge starting point, or the edge

32、turns back toward the intersection of the scan line and the edge - the starting point. iii) If the upward edge reaches a point 3,5mmin from the starting point: I) Plot a line A connecting the end points of the upward edge. II) Test whether the intermediate edge points lie within 0,5mmin from line A.

33、 If so, continue to step III. Otherwise proceed to step 1)iv) to follow the edge in the opposite direction. III) Continue following the edge upward until the edge departs 0,5mmin from line A. Back up to the closest edge point greater than or equal to mmin from the last edge point along the edge befo

34、re the departing point and save this as the edge end point. This edge point should be along the “L“ candidate outside edge. IV) Continue following the edge downward until the edge departs 0,5mmin from line A. Back up to the closest edge point greater than or equal to mmin from the last edge point al

35、ong the edge before the departing point and save this as the edge end point. This edge point should be along the “L“ candidate outside edge. V) Calculate a new adjusted line A1 that is a “best fit“ line to the edge in the two previous steps. The “best fit“ line uses the linear regression algorithm (

36、using the end points to select the proper dependent axis, i.e. if closer to horizontal, the dependent axis is x) applied to each point. The “best fit“ line terminates lines at points p1 and p2 that are the points on the “best fit“ line closest to the endpoints of the edge. VI) Save the line A1 segme

37、nt two end points, p1 and p2. Also save the colour of the left side of the edge viewed from p1 to p2. iv) If step iii) failed or did not extend upward by 3,5mmin in step iii)IV), test if the downward edge reaches a point 3,5mmin from the starting point. If so, repeat the steps in iii) but with the d

38、ownward edge. v) If neither steps iii) or iv) were successful, test if both the upward and downward edges terminated at least 2mmin from the starting point. If so, form an edge comprised of the appended 2mmin length upward and downward edge segments and repeat the steps in iii) but with the appended

39、 edge. vi) Proceed to and process the next transitions on the scan line, repeating from step i), until the boundary of the image is reached. Technical Corrigendum 2:2012 to CAN/CSA-ISO/IEC 16022:07ISO/IEC 16022:2006/Cor.2:2011(E) ISO/IEC 2011 All rights reserved 32) Extend a scan line vertically in

40、both directions from the centre point of the image. Look for line segments using the same logic in step 1) above but following each edge transition first left and then right. 3) Search among the saved line A1 segments for pairs of line segments that meet the following four criteria: i) If the two li

41、nes have the same p1 to p2 directions, verify that the closer of the interline p1 to p2 distances is less than gmax. If the two lines have opposite p1 to p2 directions, verify that the closer of the interline p1 to p1 or p2 to p2 distances is less than gmax. ii) Verify that the two lines are co-line

42、ar within 5 degrees. iii) Verify that the two lines have the same saved colour if their p1 to p2 directions are the same or that the saved colours are opposite if their p1 to p2 directions are opposite to each other. iv) Form two temporary lines by extending each line to reach the point on the exten

43、sion that is closest to the furthest end point of the other line segment. Verify that the two extended lines are separated by less than 0,5mmin at any point between the two extended lines. 4) For each pair of lines meeting the criteria of step 3) above, replace the pair of line segments with a longe

44、r A1 line segment that is a “best fit“ line to the four end points of the pair of shorter line segments. Also save the colour of the left side of the edge of the new longer line viewed from its p1 endpoint to its p2 endpoint. 5) Repeat steps 3) and 4) until no more A1 line pairs can be combined. 6)

45、Select line segments that are at least as long as dmin. Flag them as “L“ side candidates. 7) Look for pairs of “L“ side candidates that meet the following three criteria: i) Verify that the closest points on each line are separated by less than 1,5gmax. ii) Verify that they are perpendicular within

46、5 degrees. iii) Verify that the same saved colour is on the inside of the “L“ formed by the two lines. Note that if one or both lines extend past their intersection, then the two or four “L“ patterns formed will need to be tested for matching colour and maintaining a minimum length of dmin for the t

47、runcated side or sides before they can become “L“ candidates. 8) For each candidate “L“ pair found in step 7) form an “L“ candidate by extending the segments to their intersection point. 9) If the “L“ candidate was formed from line segments with the colour white on the inside of the “L“, form a colo

48、ur inverted image to decode. Attempt to decode the symbol starting with the appropriate normal or inverted image starting from step d) below using each of the “L“ candidates from step 8) as the “L“ shaped finder. If none decode, proceed to step c). c) Maintain the line A1 line segments and “L“ side

49、candidates from the previous steps. Continue searching for “L“ candidates using horizontal and vertical scan lines offset from previous scan lines: 1) Using a new horizontal scan line 3mmin above the centre horizontal scan line, repeat the process in step b)1), except starting from the offset from the centre point, and then b)3) through b)9). If there is no decode, proceed to the next step. 2) Using a new vertical scan line 3mmin le