The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Mar. 08, 2011

Filed:

Feb. 12, 2007
Applicants:

Xiaolei Huang, Bethlehem, PA (US);

Arun Krishnan, Exton, PA (US);

Kazunori Okada, Los Angeles, CA (US);

Xiang Zhou, Exton, PA (US);

Inventors:

Xiaolei Huang, Bethlehem, PA (US);

Arun Krishnan, Exton, PA (US);

Kazunori Okada, Los Angeles, CA (US);

Xiang Zhou, Exton, PA (US);

Assignee:
Attorney:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
G06K 9/00 (2006.01); G06K 9/62 (2006.01); G06K 9/46 (2006.01); G06K 9/32 (2006.01);
U.S. Cl.
CPC ...
Abstract

Disclosed is robust click-point linking, defined as estimating a single point-wise correspondence between data domains given a user-specified point in one domain or as an interactive localized registration of a monomodal data pair. To link visually dissimilar local regions, Geometric Configuration Context (GCC) is introduced. GCC represents the spatial likelihood of the point corresponding to the click-point in the other domain. A set of scale-invariant saliency features are pre-computed for both data. GCC is modeled by a Gaussian mixture whose component mean and width are determined as a function of the neighboring saliency features and their correspondences. This allows correspondence of dissimilar parts using only geometrical relations without comparing the local appearances. GCC models are derived for three transformation classes: pure translation, scaling and translation, and similarity transformation. For solving the linking problem, a variable-bandwidth mean shift method is adapted for estimating the maximum likelihood solution of the GCC.


Find Patent Forward Citations

Loading…