基于八邻域的边界跟踪代码（Border tracking code based on octa-based domain）.docVIP

下载本文档

13
0
约1.11万字
约 25页
2017-07-15 发布于河南
举报
版权申诉

基于八邻域的边界跟踪代码（Border tracking code based on octa-based domain）.doc

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

基于八邻域的边界跟踪代码（Border tracking code based on octa-based domain）

基于八邻域的边界跟踪代码（Border tracking code based on octa-based domain） # include iostream. H # include iomanip. H # define NumberOfPossiblePoints 64 # define Size_of_Array 8 Void main () { Int f [Size_of_Array] [Size_of_Array] = {0,0,0,0,0,0,0,0. 0,0,1,1,0,0,0,0, 0,0,1,1,0,0,0,0, 0,1,1,1,1,0,0,0, 0,0,1,1,1,1,0,0, 0,0,1,1,0,0,0,0, 0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0}; Int border [Size_of_Array] [Size_of_Array]; / / also, 0, 1 means that the border array records the path of the walk; int Trace [NumberOfPossiblePoints] [2]; / / you also need to use a second - dimensional array to record the walking coordinates in turn Int chaincode [NumberOfPossiblePoints]; / / store direction code Int dir. Int I, j; Int flag; Int count; Int p0x, p0y; / / the initial coordinates Int p1x p1y; / / the coordinates of the second point found Int pn_1x pn_1y, PNX, pny; / / used to record the target coordinates / / Initialization for some arrays: For (I = 0; I NumberOfPossiblePoints; i++) { Chaincode [I] = 0; For (j = 0; j 2; j++) Trace [I] [j] = 0; } / / begin, lets first look at the original data and, at the same time, clear border array: For (I = 0; I Size_of_Array; i++) { For (j = 0; j Size_of_Array; j++) { Cout setw (6) f [I] [j]; Border [I] [j] = 0; } Cout endl; } Count = 0; Flag = 1; Dir = 7. / / based on the algorithm, determine the direction of the next boundary point first / / find the initial point (pixel) whose value is not zero. P0x = 1; P0y = 2; I = p0x; J = p0y; Border [I] [j] = 1; Trace [count] [0] = I; Trace [count] [1] = j; / / repeat / / in order to keep the cycle going, the walking number must be more than 1, otherwise / / the first step is to find p0, p1, and since this is the coordinates of p0 and p1 of p0 and p1 for the final pn - 1, the loop exits. / / increase the count in the while loop condition, and when count is less than 2, it should not end. while (count 2 | | (pn_1x! = p0x) | | (pn_1y! = p0y) | | (PNX! = p1x) | | (pny! = p1y)) { / / log the coordinates of wa