Re: [math-fun] Fast image matching
This problem is called "image registration". rotation & scaling can be taken care of by the log polar (i.e., complex log) transform: http://www.researchgate.net/profile/Jorge_Dias4/publication/255591825_An_Int... At 08:43 AM 9/11/2015, Warren D Smith wrote:
Given two images, each consisting of N pixels. We want to find the way to rotate, scale, and translate image #1 so it best matches up with image #2.
I believe I have invented algorithmic ways to do this in O(NlogN) time.
I'm somewhat surprised nobody ever thought of them before. But maybe that is because somebody DID think of them before... QUESTION: did they?
(It also might be because I'm wrong... I'll describe my methods later...)
WWII provided European art historians with a huge amount of material to subject to such analysis. One such project used a photograph taken before WWII and photos of little pieces of rubble to reconstruct portions of a fresco. Hilarie
This problem is called "image registration".
rotation & scaling can be taken care of by the log polar (i.e., complex log) transform:
http://www.researchgate.net/profile/Jorge_Dias4/publication/255591825_An_Int...
At 08:43 AM 9/11/2015, Warren D Smith wrote:
Given two images, each consisting of N pixels. We want to find the way to rotate, scale, and translate image #1 so it best matches up with image #2.
I believe I have invented algorithmic ways to do this in O(NlogN) time.
I'm somewhat surprised nobody ever thought of them before. But maybe that is because somebody DID think of them before... QUESTION: did they?
(It also might be because I'm wrong... I'll describe my methods later...)
participants (2)
-
Henry Baker -
Hilarie Orman