×

Hierarchical image model adaptation

  • US 7,596,276 B2
  • Filed: 07/30/2002
  • Issued: 09/29/2009
  • Est. Priority Date: 08/01/2001
  • Status: Active Grant
First Claim
Patent Images

1. A method of using a computing device to process digitised picture data by matching of picture matching models, comprising:

  • (i) provision of an hierarchical structure graph comprising;

    nodes, wherein each node represents at least one parameterised picture matching model,a specified number of levels, arranged one above the other, whereby at least one node is located in each level,edges connecting pairs of predetermined nodes of different levels and defining, for each pair of nodes, a father node as the node in the lower level and a son node as the node in the upper level;

    (ii) application of the structure graph to the picture data in that, starting with the lowermost level, at least one node is processed,wherein the processing of a node comprises using the computing device to perform the steps of;

    matching of its at least one picture matching model to the picture data by variation of the model parameters,determination of a matching quantity for each parameter variation as a measure of the quality of the picture match, anddetermination of an assessment for each parameter variation, taking into account the at least one determined matching quantity, andwherein the assessment found for each parameter variation is applied as a criterion for the processing of a son node of the processed node and, if the criterion is fulfilled, the processing of the son node starts with the initialisation of its at least one matching model through predetermined parameters of the father node,wherein the picture matching models comprise graphs of features which are the result of the application of predetermined filters on reference picture data,wherein the features include jets, whereby the scaling of the filters from which the features are obtained becomes smaller from the lower levels to the upper levels in the structure graph, andwherein the matching quantity for the parameter variations is computed according to the formula
    S(n)=f(n)(Pk(n)j(k,m),Pk(n){tilde over (j)}(k),d(0)(k,m),d(n)(k,m)),

    K


    (n)

    K,
    wherein;

    j(k,m) is the jet of the picture matching model m on the node k,{tilde over (j)}(k) is the jet of the picture on the position of the node k,d(0)(k,m) is the original position of the node k of the picture matching model m,d(n)(k,m) is the position of the node k of the picture matching model m in step n,f(n)( . . . ) is a functional of the picture matching model jet and the picture jet at corresponding locations,Pk(n) represents an image of the jets j(k,m) or {tilde over (j)}(k), andK′

    (n) is a subset of the set K of all graph nodes k.

View all claims
  • 2 Assignments
Timeline View
Assignment View
    ×
    ×