High-speed algorithm for hypercomplex number Fourier transform and hypercomplex number cross correlation of color image
A color image and Fourier transform technology, applied in image communication, color signal processing circuits, electrical components, etc., can solve the problems of inability to apply complex fast Fourier transform and inconvenience
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0050] We describe an embodiment of the invention in terms of image registration of two color images.
[0051] 1. Let x=(x, y) be the coordinates of pixels in the color image, and the RGB model of each pixel in the two color images f and g is expressed as a pure hypercomplex number form: f(x, y)=f R (x,y)i+f G (x,y)j+f B (x,y)k and g(x,y)=g R (x,y)i+g G (x,y)j+g B (x,y)k.
[0052] 2. Find the real Fourier transform of each color of the color images f and g respectively: f RRFT , f GRFT , f BRFT , g RRFT , g GRFT and g BRFT .
[0053] 3. Calculate f and g hypercomplex cross-correlation. We use g to match f, assuming that the image to be matched is g(χ+ξ), where ξ=(m, n) represents the relative movement of the matching point in the image, then the hypercomplex number of the two images in (m, n) The cross-correlation cr(m, n), as shown in (4), is expanded according to R, G, B (red, green, blue) three colors as shown in (6), so that it can be quickly calculated by RFT...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com