An algorithm that has been plagued for several days. how can this problem be solved?

An algorithm that has been plagued for several days. at last, shenyulv edited an algorithm & nbsp; idea from 2013-05-010. for example, it is probably an & nbsp; "against, it is composed of "1", and there are scattered "1" around it. I want to worry about an algorithm that has been plagued for several days.
At the end of this post, shenyulv edited an algorithm idea at 01:13:36 on.



For example, it is probably an "against", which is composed of "1", and there are scattered "1" around it ", I want to remove these scattered "1. My idea is to calculate the number of "1" connected together. when the number of "1" does not exceed a constant, set them to 0 to get the stored block.

Simply put, I want to obtain the number of "1" in a pattern composed of "1", which is composed of "1" in. . How to write this algorithm? the algorithm is so bad that the Color of the algorithm is shared:
------ Solution --------------------
Gaussian noise reduction algorithm
------ Solution --------------------
Take the surrounding area of each point to see if it is three consecutive steps (there can be one shift ). No, it must be deleted.
------ Solution --------------------
I think we can only use graphics-related algorithms and mathematical algorithms to avoid the mistaken removal of vertices on I in against.