US 9,436,780 B2Granted

Constructing incremental tree model for vein image recognition and authentication

AssigneeSeiko Epson Corporation

InventorsJinjun Wang, Jing Xiao

Life of this patent

Estimating the term…

Abstract

An indexed hierarchical tree search structure implements incremental tree modification to add new registrants to the tree without requiring reconstruction of the tree. Only data within a leaf node that receives new data is used in the incremental tree modification. Consequently, the original data set used in the creation of the hierarchical tree may be deleted after construction of the tree.

Claims20

Dependent claims

A method of creating an updatable search tree identifying a specific item within an item class, said method comprising the following steps:

(a) accessing a collection of unique registrable item samples belonging to said item class, each registrable item sample being a representation of a different target item and having a unique identification (ID) code identifying its corresponding target item;
(b) identifying a, separate and corresponding, registrable set of item descriptors for each of said registrable item samples;
(c) creating a composite collection of item descriptors from the separate registrable sets of item descriptors;
(d) organizing said composite collection of item descriptors into a hierarchical tree structure according to relations in the item descriptors, all item descriptors of the composite collection being further included into the determined leaf nodes of said hierarchical tree, each leaf node of said hierarchical tree being indexed according to its leaf index list, said leaf index list being comprised of the ID's of the target items corresponding to the item descriptors within the leaf node, wherein every leaf node is a bottom-most node of a branch in said hierarchical tree;
(e) accessing a new registrable item having a unique identification (ID) code identifying its corresponding target item;
(f) identifying a new registrable set of item descriptors for said new registrable item;
(g) distributing all the item descriptors in the new registrable set of item descriptors into the leaf nodes of said hierarchical tree according to said relations in the item descriptors by which said hierarchical tree is organized, each leaf node of said hierarchical tree that receives any part of said new registrable set of item descriptors being a target leaf node, and each target leaf node being subjected to an incremental tree modification of said hierarchical tree using only the item descriptors within the target leaf node, said incremental tree modification creating at least two additional child nodes under said target leaf node, each of said additional child nodes being indexed to the ID's on its index list, said index list including at least the IDs of the target items corresponding to the item descriptors within it, the resultant modified hierarchical tree being said updatable search tree.

4 more elements

A method of incremental hierarchical tree modification, comprising:

(a) accessing an indexed hierarchical tree wherein each leaf node is indexed to a set of ID's identifying all items represented by any one of a collection of data within the leaf node, the ID's represented by each leaf node constituting an index list of the leaf node, said hierarchical tree being organized by pre-defined data relations among the data clustered within the hierarchical tree, all item descriptors of the collection of data being further included into the leaf nodes of said hierarchical tree, each of said leaf node being a bottom-most node in the indexed hierarchical tree;
(b) accessing a new registrable item having a unique identification (ID) code identifying its corresponding target item, said unique ID not being represented by any ID list of any leaf node of said hierarchical tree;
(c) identifying a new registrable set of item descriptors for said new registrable item;
(d) distributing all of the new registrable set of item descriptors into said hierarchical tree according to said data relations by which said hierarchical tree is organized, each leaf node of said hierarchical tree that receives any part of said new registrable set of item descriptors being a target leaf node, and each target leaf node being subjected to an incremental tree modification of said hierarchical tree using only the item descriptors within the target leaf node, said incremental tree modification creating at least two additional child nodes under said target leaf node, each of said additional child nodes being indexed to the ID's on its index list, said index list including at least the IDs of the target items corresponding to the item descriptors within it.

1 more element

Dependencies are inferred from the claim text.

patentgrep

Loading patent…

Abstract

A method of creating an updatable search tree identifying a specific item within an item class, said method comprising the following steps:

(a) accessing a collection of unique registrable item samples belonging to said item class, each registrable item sample being a representation of a different target item and having a unique identification (ID) code identifying its corresponding target item;
(b) identifying a, separate and corresponding, registrable set of item descriptors for each of said registrable item samples;
(c) creating a composite collection of item descriptors from the separate registrable sets of item descriptors;
(d) organizing said composite collection of item descriptors into a hierarchical tree structure according to relations in the item descriptors, all item descriptors of the composite collection being further included into the determined leaf nodes of said hierarchical tree, each leaf node of said hierarchical tree being indexed according to its leaf index list, said leaf index list being comprised of the ID's of the target items corresponding to the item descriptors within the leaf node, wherein every leaf node is a bottom-most node of a branch in said hierarchical tree;
(e) accessing a new registrable item having a unique identification (ID) code identifying its corresponding target item;
(f) identifying a new registrable set of item descriptors for said new registrable item;
(g) distributing all the item descriptors in the new registrable set of item descriptors into the leaf nodes of said hierarchical tree according to said relations in the item descriptors by which said hierarchical tree is organized, each leaf node of said hierarchical tree that receives any part of said new registrable set of item descriptors being a target leaf node, and each target leaf node being subjected to an incremental tree modification of said hierarchical tree using only the item descriptors within the target leaf node, said incremental tree modification creating at least two additional child nodes under said target leaf node, each of said additional child nodes being indexed to the ID's on its index list, said index list including at least the IDs of the target items corresponding to the item descriptors within it, the resultant modified hierarchical tree being said updatable search tree.

4 more elements