Shaped Neighborhood based Flood Filled Conditional Iterators
No opinion
ITK's flood filling iterator represents a way to visit pixels/voxels within an image having a specific connectivity. The iterator is initialized at known seed points and starting from these, neighbors that are within the desired connectivity are marked as to [...]

Component tree: an efficient representation of grayscale connected components
No opinion
Connected component is a well known and very useful notion in binary case. As often in mathematical morphology, this notion can be extended to the grayscale case, and allow to perform lot of the useful transforms based on binary connected components in the [...]

Sort results by

Refine the search results



Powered by Midas