Fast invariant matching using template decomposition and synthesis
First Claim
1. A fast decomposition and synthesis invariant matching method comprises the steps of:
- a) Input an image;
b) Input a pattern template;
c) Perform fast decomposition and synthesis invariant pattern search using the input image and the pattern template to create a match result output;
d) Perform refined invariant match using the match result and the pattern template to create a refined invariant match result output.
5 Assignments
0 Petitions
Accused Products
Abstract
A fast decomposition and synthesis invariant matching method receives an input image and a pattern template. The input image and pattern template image are used to create a match result output. A refined invariant match uses the initial match result and the pattern template to create a refined invariant match result. The fast decomposition and synthesis invariant pattern search method performs pattern decomposition and synthesis learning to create a pattern search recipe that is used by an invariant pattern search and synthesis method to generate the match result. The pattern search recipe includes template component invariant profiles, component weights, and allowable partial pattern configurations. The invariant matching method supports partial pattern match.
This invention decomposes a template into multiple compact shaped components and performs search using separate rotation and scale invariant profiles for each component. It then synthesizes the search results for the complete template or partial template using the component search results. This invention can be directly generalized to three-dimensional or higher dimensional invariant pattern search and can achieves greater speed and accuracy than the prior art methods. Therefore, it can be used in applications such as 3D medical imaging, dynamic medical imaging, confocal microscopy, live cell assays in drug discovery, or ultrasound imaging.
-
Citations
25 Claims
-
1. A fast decomposition and synthesis invariant matching method comprises the steps of:
-
a) Input an image;
b) Input a pattern template;
c) Perform fast decomposition and synthesis invariant pattern search using the input image and the pattern template to create a match result output;
d) Perform refined invariant match using the match result and the pattern template to create a refined invariant match result output. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A pattern decomposition and synthesis learning method comprises the steps of:
-
a) Input a pattern template;
b) Perform pattern decomposition using the pattern template to create a pattern decomposition result output;
c) Perform pattern search recipe creation using the pattern decomposition result and the pattern template to create a pattern search recipe output. - View Dependent Claims (8, 9, 10, 11, 12)
-
-
13. A fast decomposition and synthesis invariant search method comprises the steps of:
-
a) Input an image;
b) Input a pattern template;
c) Perform pattern decomposition and synthesis learning using the pattern template to create a pattern search recipe output;
d) Perform invariant pattern search and synthesis using the pattern search recipe and the input image to create a match result output. - View Dependent Claims (14, 15, 16)
-
-
17. An invariant pattern search and synthesis method comprises the steps of:
-
a) Input an image;
b) Input a pattern search recipe containing template decomposition component invariant profiles and decomposition component weights and allowable partial pattern configuration;
c) Perform invariant profile matching using the template decomposition component invariant profiles and the input image to create an invariant profile matching result images output;
d) Perform match synthesis using the invariant profile matching result images and the decomposition component weights and allowable partial pattern configuration to create a match result output. - View Dependent Claims (18, 19, 20, 21, 22, 23, 24, 25)
-
Specification