chain code for line

3 次查看（过去 30 天）
majed majed
majed majed 2015-11-5
评论： majed majed 2015-11-7
here is my question : in this image which I have attached , starting from (x,y) or (s,t)how can I write the chain code for the line ? what is proper idea to write its code ? a lot of thank for everyone help me or try to help .

请先登录，再回答此问题。

采纳的回答

Walter Roberson
Walter Roberson 2015-11-6
  1 个评论
majed majed
majed majed 2015-11-7
Thank you to your answer, I have traied it , but I didn't get the gall.

请先登录，再进行评论。

更多回答（1 个）

Guillaume
Guillaume 2015-11-5
编辑：Guillaume 2015-11-5
I've no idea what a chain code is, but if you're wanting to trace the path from (s,t) to (I,J) isn't it simply finding which of the eight neighbouring pixel is black, excluding pixels you've already been through.
currentrow = s;
currentcol = t;
path = [currentrow currentcol]
while currentrow ~= I && currentrow ~= J
[neighbours(:, 1), neighbours(:, 2)] = find(img(currentrow-1:currentrow+1, currentcol-1:currentcol+1) & [1 1 1;1 0 1;1 1 1])); %ignoring edge issues here
notvisited = ~ismember(neighbours, path, 'rows');
path = [path; neighbours(notvisited)]; %assumes there's only ever one non-visited neighbour
currentrow = neighbours(notvisited, 1);
currentcol = neighbours(notvisited, 2);
end
  1 个评论
majed majed
majed majed 2015-11-6
编辑：majed majed 2015-11-6
Thank you a lot , in my question if I start from any edge ,I don't know where is the other edge , so when I find the starting point (one of the edges) ,I need to extract the angle between current pixel and next pixel according to freeman chaincode edea ,suppose that the pixels inside line has just tow neighbors. that's it exactly what I want, thanks

请先登录，再进行评论。

类别

在 Help Center 和 File Exchange 中查找有关 Image Processing Toolbox 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by