Answer the question
In order to leave comments, you need to log in
Answer the question
In order to leave comments, you need to log in
Strictly IMHO. I have never been interested in this, but I will express my idea.
In a specific case, you can go from left to right, read the columns and count the number of non-green segments, memorize, look at the next one and compare so that for each segment from the previous column there is at least one non-green pixel in the same range along the Y axis. If in some point was not found, then count ++, otherwise we remember the new segments and go to the next column.
ps left-to-right or top-to-bottom without a difference on idea. This Frankenstein will work both ways.
If it is assumed that the objects are of the same shape and size, sum the colors (or otherwise) in the 1st object, sum all the colors except for the green of the whole picture and compare
Didn't find what you were looking for?
Ask your questionAsk a Question
731 491 924 answers to any question