Click here to Skip to main content
15,910,358 members
Please Sign up or sign in to vote.
3.00/5 (1 vote)
See more:
i have some problem with my program.
i must detect neighbor pixel from seed pixel.
and detect neighbor can grow up until full of pixel on image..
for example :
1. i have seed pixel at (5,5)
2. detect first at (4,5),(6,5), (4,4),(5,4),(6,4), (4,6),(5,6),(6,6)
3. and now detect (3,3)(4,3)(5,3)(6,3)(7,3), (3,4)(3,5)(3,6), ........
4. more grow up to detect neighbor

how algorithm of this problem??
thx.
Posted
Comments
Henry Minute 23-Nov-10 7:58am    
In response to your comment: I gave you the link, which contains code to do essentially what you want to do, it is up to you to decide if it fits your circumstances or is useable at all, by running it and dissecting the code. Does it matter if it is 'from the center area'? If it detects neighbouring cells and includes them or not according to a rule that you define, it would do so even if it started in one of the corners. That is the nature of the process.

1 solution

Edge Detection algorithm[^] from here on Code Project, might give you some ideas.
 
Share this answer
 
Comments
gunkrr 23-Nov-10 7:44am    
in the last block of code
we can see detect neighbor pixel
but i rather confused
is it from center area???
or scanline normal??

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900