Finding Connected Components of Superpixels?
조회 수: 3 (최근 30일)
이전 댓글 표시
If I know the idx of the following figure to be [ 261 325 331 333 339]. What sort of algorithm can I use that would detect that idxs [325 331 333 339] are all connected to one another, and that 261 has no connected components? The end goal being detecting regions that have 3 or more connected superpixels.
One method I am thinking of is using bwconncomp, which will return the 2 connected objects. And then for each connected object, check weather the idxs are 'contained' in it. I think this might not be a good solution though. Please any feedback is welcome. Thank you all kindly.
![](https://www.mathworks.com/matlabcentral/answers/uploaded_files/207497/image.png)
댓글 수: 2
Image Analyst
2019년 3월 8일
Why are you computing superpixels in the first place? What would you do if you knew the adjacent blobs? To help me understand what you really want to do, please attach your original gray scale image and tell us what you want to find or measure in it, or how you want to change it's appearance.
채택된 답변
Image Analyst
2019년 3월 8일
There is a superpixels() function in the Image Processing Toolbox. Using that could significantly simplify your homwwork assignment.
댓글 수: 0
추가 답변 (0개)
참고 항목
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!