Need to find matching sections in two bitmaps, how to do it?

Question

Programming

Good evening!
I need an algorithm to find matching patches in two bitmaps.
Googling and posts on other forums didn't help.
If you do not know a specific answer, at least advise the literature where it makes sense to look, well, share your own, even modest, ideas.
Thanks in advance =)

Answer 1

Greatest Common Subsequence
Just the way you want it.
If the problem is to extract bits from somewhere, or somehow represent them, then the programming language is in the studio. Or you can even ask a separate question.
UPD: Here's more precisely: The largest common substring - for the case when there should not be breaks in the chain ( Mrrl correctly noted that they can be in the subsequence).

Answer 2

I think that the suffix array will help you. If you combine the original strings (by inserting a space between them) and build a suffix array for the resulting string, then the answer will be on one of the index transitions from one string to another. It is only necessary to find (or maintain) the length of the matching fragment at the transitions.