Fast correlation matching in large (edge) image databases | Zendy

Dariu M. Gavrila | Zendy; Larry S. Davis | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

<title>Fast correlation matching in large (edge) image databases</title>

Author(s) -

Dariu M. Gavrila,

Larry S. Davis

Publication year - 1995

Publication title -

proceedings of spie, the international society for optical engineering/proceedings of spie

Language(s) - English

Resource type - Conference proceedings

SCImago Journal Rank - 0.192

H-Index - 176

eISSN - 1996-756X

pISSN - 0277-786X

DOI - 10.1117/12.200787

Subject(s) - filter (signal processing) , enhanced data rates for gsm evolution , matching (statistics) , pattern recognition (psychology) , correlation , computer science , harmonic , artificial intelligence , composite image filter , binary number , mathematics , correlation coefficient , algorithm , image (mathematics) , computer vision , statistics , physics , geometry , arithmetic , quantum mechanics

Correlation-based matching methods are known to be very expensive when used on large imagedatabases. In this paper, we will examine ways of speeding up correlation matching by phasecodedfiltering. Phase coded filtering is a technique to combine multiple patterns in one filter byassigning complex weights of unit magnitude to the individual patterns and summing them up ina composite filter. Several of the proposed composite filters are based on this idea, suchastheCircular Harmonic...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research