If you don't care computational time, Hough Transform is a good solution to lines/line-segments detection in a binary image. parallel lines are lines with a same orientation.
once a line is extracted, those pixels along the line can be identifed. then removed.
Firstly, you have to detect lines at all - eg. starting with the caculating 'oriented gradients' and gathering points of similar orientation to 'lines'. From the oriented gradients you already have the orientation of the lines, so finding parallel lines means comparing the orientation of the lines identified.
I'm guessing the issue here is that an operation that is simple in vectors is difficult if you convert to a "binary image" .... clearly after this conversion you have just a collection of pixels with 1/0 code and no global knowledge of how these pixels make a line ... and of course without knowing what is a line it is hard to removed related lines. Could you do this process BEFORE conversion to binary image? Of course if you have lines in point slope form the parallel ones are the ones with the same slope.
You could even tolerate small error ("almost" parallel line)
Finally, if you are doing this on a curved surface (the earth) you will have to be careful what you mean by parallel.
Like the other answers, I recommend a specific example so we can be more help.
If you don't care computational time, Hough Transform is a good solution to lines/line-segments detection in a binary image. parallel lines are lines with a same orientation.
once a line is extracted, those pixels along the line can be identifed. then removed.