User:Jitender Jal/sandbox

=Assignment 2=

Image processing method for detection human figure in digital image

 * publication number US6697502 B2
 * Publication date feb 24, 2004
 * Filing data dec 14, 2004
 * Priority date dec 14, 2004
 * inventor Jiebo Luo

Abstract

 * A digital image processing method for detecting human figures in a digital color image, comprising the steps of: providing a digital color image having pixels representing RGB values; segmenting the image into non-overlapping regions of homogeneous color or texture; detecting candidate regions of human skin color; detecting candidate regions of human faces; and for each candidate face region, constructing a human figure by grouping regions in the vicinity of the face region according to a pre-defined graphical model of the human figure, giving priority to human skin color regions.

Summary

 * According to the present invention, there is provided a solution to the problems of the prior art. The need is met according to the present invention by providing a digital image processing method for detecting human figures in a digital color image having pixels representing RGB values, comprising the steps of: segmenting the image into non-overlapping regions of homogeneous color or texture; detecting candidate regions of human skin color; detecting candidate regions of human faces; and for each candidate face region, constructing a human figure by grouping regions in the vicinity of the face region according to a predefined graphical model of the human figure, giving priority to human skin color regions.


 * According to a feature of the present invention, there is provided a digital image processing method for detecting human figures in a digital color image having pixels representing RGB values, comprising the steps of:


 * providing a digital color image having pixels representing RGB values;


 * segmenting the digital color image into non-overlapping regions of homogeneous color or texture;


 * detecting candidate regions of human skin color; detecting candidate regions of human faces; and for each candidate face region, constructing a human figure by grouping regions in the vicinity of the face region according to a pre-defined graphical model of the human figure, giving priority to human skin color regions.

Method of organizing hierarchical data in a relational database

 * publication number US6480857 B1
 * Publication date Nov 12, 2002
 * Filing data  Jan 7, 2001
 * Priority date Jan 7, 2001
 * inventor David Chandler

Abstract

 * A relational database is provided with a plurality of data entries stored in the database. The data entries have a hierarchical relationship. The data entries are assigned an item identifier that uniquely identifies each of the data items. A multiple digit outline number is assigned to each of the data entries wherein the digits of the outline number correspond to the hierarchical levels of the data entries. A hierarchical level identifier is assigned to each of the data entries wherein the hierarchical level identifier equal the number of non-zero digits in the outline number. An organizational table is created wherein the table includes a row for each of the data entries and the table includes multiple columns. The columns comprise a column for the item identifier, a plurality of outline number columns where each outline number column comprises one digit of the outline number such that each of the digits is stored in a separate column, and a hierarchical level column comprising the level identifier.

Summary

 * An object of the present invention comprises providing an improved method of organizing hierarchical data stored in a relational database.


 * These and other objects of the present invention will become apparent to those skilled in the art upon reference to the following specification, drawings, and claims.


 * The present invention intends to overcome the difficulties encountered heretofore. To that end, a relational database is provided with a plurality of data entries stored in the database. The data entries have a hierarchical relationship. The data entries are assigned an item identifier that uniquely identifies each of the data items. A multiple digit outline number is assigned to each of the data entries wherein the digits of the outline number correspond to the hierarchical levels of the data entries. A hierarchical level identifier is assigned to each of the data entries wherein the hierarchical level identifier represents the depth of the entry in the hierarchy and is equal to the number of non-zero digits in the outline number. An organizational table is created wherein the table includes a row for each of the data entries and the table includes multiple columns. The columns comprise a column for the item identifier, a plurality of outline number columns where each outline number column comprises one digit of the outline number such that each of the digits is stored in a separate column, and a hierarchical level column comprising the level identifier.

Method of organizing hierarchical data in a relational database.

Method of organizing hierarchical data in a relational database

 * publication number US6480857 B1
 * Publication date Nov 12, 2002
 * Filing data  Jan 7, 2001
 * Priority date Jan 7, 2001
 * inventor David Chandler

Abstract

 * A relational database is provided with a plurality of data entries stored in the database. The data entries have a hierarchical relationship. The data entries are assigned an item identifier that uniquely identifies each of the data items. A multiple digit outline number is assigned to each of the data entries wherein the digits of the outline number correspond to the hierarchical levels of the data entries. A hierarchical level identifier is assigned to each of the data entries wherein the hierarchical level identifier equal the number of non-zero digits in the outline number. An organizational table is created wherein the table includes a row for each of the data entries and the table includes multiple columns. The columns comprise a column for the item identifier, a plurality of outline number columns where each outline number column comprises one digit of the outline number such that each of the digits is stored in a separate column, and a hierarchical level column comprising the level identifier.

Summary

 * An object of the present invention comprises providing an improved method of organizing hierarchical data stored in a relational database.


 * These and other objects of the present invention will become apparent to those skilled in the art upon reference to the following specification, drawings, and claims.


 * The present invention intends to overcome the difficulties encountered heretofore. To that end, a relational database is provided with a plurality of data entries stored in the database. The data entries have a hierarchical relationship. The data entries are assigned an item identifier that uniquely identifies each of the data items. A multiple digit outline number is assigned to each of the data entries wherein the digits of the outline number correspond to the hierarchical levels of the data entries. A hierarchical level identifier is assigned to each of the data entries wherein the hierarchical level identifier represents the depth of the entry in the hierarchy and is equal to the number of non-zero digits in the outline number. An organizational table is created wherein the table includes a row for each of the data entries and the table includes multiple columns. The columns comprise a column for the item identifier, a plurality of outline number columns where each outline number column comprises one digit of the outline number such that each of the digits is stored in a separate column, and a hierarchical level column comprising the level identifier.

Method of organizing hierarchical data in a relational database