Issue No. 04 - April (1995 vol. 17)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.385984
<p><it>Abstract</it>—We present a hierarchically structured approach to organizing large structural modelbases using an information theoretic criterion. Objects (patterns) are modeled in the form of <it>random parametric structural descriptions</it> (RPSDs), an extension of the parametric structural description graph-theoretic formalism [<ref rid="BIBP03211" type="bib">1</ref>]. Objects in scenes are modeled as <it>parametric structural descriptions</it> (PSDs). The organization process is driven by pairwise dissimilarity values between RPSDs. We also introduce the <it>node pointer lists</it>, which are computed offline during modelbase organization. During recognition, the only exponential matching process involved is between the scene PSD and the RPSD at the root of the organized tree. Using the organized hierarchy along with the node pointer lists, the remaining work simplifies to a series of inexpensive linear tests at the subsequent levels of the tree search. We develop the theory and present three modelbases: 50 objects built from real image data, 100 CAD models, and 1000 synthetic abstract models.</p>
Object recognition, model based recognition, organizing modelbases, structural descriptions, large modelbases.
Kim L. Boyer, Kuntal Sengupta, "Organizing Large Structural Modelbases", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 17, no. , pp. 321-332, April 1995, doi:10.1109/34.385984