/** Tag family with 30 distinct codes. bits: 16, minimum hamming: 5, minimum complexity: 5 Max bits corrected False positive rate 0 0.045776 % 1 0.778198 % 2 6.271362 % Generation time: 0.309000 s Hamming distance between pairs of codes (accounting for rotation): 0 0 1 0 2 0 3 0 4 0 5 120 6 172 7 91 8 33 9 13 10 6 11 0 12 0 13 0 14 0 15 0 16 0 **/ #pragma once namespace AprilTags { const unsigned long long t16h5[] = { 0x231bLL, 0x2ea5LL, 0x346aLL, 0x45b9LL, 0x79a6LL, 0x7f6bLL, 0xb358LL, 0xe745LL, 0xfe59LL, 0x156dLL, 0x380bLL, 0xf0abLL, 0x0d84LL, 0x4736LL, 0x8c72LL, 0xaf10LL, 0x093cLL, 0x93b4LL, 0xa503LL, 0x468fLL, 0xe137LL, 0x5795LL, 0xdf42LL, 0x1c1dLL, 0xe9dcLL, 0x73adLL, 0xad5fLL, 0xd530LL, 0x07caLL, 0xaf2eLL }; static const TagCodes tagCodes16h5 = TagCodes(16, 5, t16h5, sizeof(t16h5)/sizeof(t16h5[0])); }
时间: 2023-12-08 16:03:51 浏览: 27
这是一个 AprilTags 库中的标签族,包含了 30 个不同的编码。它的最小汉明距离为 5,最小复杂度为 5,可以纠正最多 2 位错误。生成这个标签族的时间为 0.309 秒。这个标签族中每对编码之间的汉明距离(考虑旋转)如下:
0 0
1 0
2 0
3 0
4 0
5 120
6 172
7 91
8 33
9 13
10 6
11 0
12 0
13 0
14 0
15 0
16 0
标签族的代码存储在一个名为 t16h5 的数组中,通过调用 TagCodes 构造函数创建一个名为 tagCodes16h5 的对象来包含这些编码。
相关问题
mismatched input 'as'. Expecting: '*', 'ALL', 'DISTINCT', <expression>
这个错误通常是由于 SQL 语句中语法错误引起的。通常情况下,它表示在 SQL 语句中使用了不正确的关键字或语法。以下是一些可能导致该错误的情况:
1. 语法错误:检查 SQL 语句,看看是否有错别字或语法错误。
2. SELECT 语句错误:检查 SELECT 语句中的表名、列名等是否正确。
3. WHERE 子句错误:检查 WHERE 子句中的条件是否正确。
4. 聚合函数错误:检查聚合函数的使用方式是否正确。
5. 表别名错误:检查表别名是否正确。
6. SQL 注释错误:检查 SQL 注释是否正确。
如果您可以提供详细的 SQL 语句和错误信息,我可以帮助您更好地解决问题。
*** WARNING L5: CODE SPACE MEMORY OVERLAP FROM: 000BH TO: 000DH
This warning indicates that there is a memory overlap issue in the code space. The code space is the area of memory where the program code is stored. The warning indicates that there are two or more sections of code that are using the same memory addresses, which can cause unexpected behavior or even crashes.
To fix this issue, you will need to review your code and make sure that the memory addresses used by each section of code are unique and do not overlap. This may require restructuring your code or making other changes to ensure that each section is using its own distinct memory space. Once you have resolved the overlap, you should recompile and test your code to ensure that it is functioning correctly.