Shape Recognition and Twenty Questions

Shap eRecognitionandTwentyQuestionsDonaldGeman,BrunoJedynakProgramme4|Rob otique,imageetvisionPro jetSyntimRapp ortderecherchen2155|Novembre199331pagesAbstract:Weformulateshap erecognitionasaco dingproblem.Thereis nitelistofp ossible\hyp otheses"-shap eclassesand/orspatialp ositionings-andwewishtodeterminewhichoneistruebasedontheresultsofvarious\tests,"whicharelo calimagefeatures.Weuseadecisiontree:eacinteriorno deisassignedoneofthetestsandeachterminalthehyp otheses.Theassignmentoftests,or\strategy,"isrecursive:alongeachbranccho osethenexttesttoremoveasmucuncertaintyp ossible(asmeasuredbyentropy)ab outthetruehyp othesis.Incontrasttostan-dardapproachof\hyp othesizeandtest,"thereisnorep eatedelicitationhyp otheses;instead,the\indexing"isdynamicandsto chastic.Wegraduallyformulatesp eci cconjecturesastheevolvingdistributiononhyp othesesb e-comesincreasinglyp eaked.Weapplythis\twentyquestions"approachtotherecognitionoftwoyp eslinear,deformablestructures:handwrittennumer-alsandroadsinsatelliteimages.Key-words:shap erecognition,decisiontree,entropystrategy,caracterrecog-nition,satelliteimages,road-tracking(Resume:tsvp)Thisworkaspartiallysupp ortedbytheNationalScienceFoundationundergrantDMS-8813699,bytheOceofNavalResearchundercontractN00014-91-J-1021,andCNESunderMarche833/CNES/93/0972/00

[1]  Ronald L. Rivest,et al.  Inferring Decision Trees Using the Minimum Description Length Principle , 1989, Inf. Comput..

[2]  R. Tosic.  An optimal search procedure , 1980 .

[3]  Sujata Das.  Automatic detection of roads in spot satellite images , 1988 .

[4]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[5]  Martin A. Fischler,et al.  Detection of roads and linear structures in low-resolution aerial imagery using a multisource knowledge integration technique☆ , 1981 .

[6]  David G. Lowe,et al.  Perceptual Organization and Visual Recognition , 2012 .

[7]  Patchigolla Kiran Kumar,et al.  A Survey of Some Results in Stochastic Adaptive Control , 1985 .

[8]  Thomas C. Henderson,et al.  Towards The Automatic Generation Of Recognition Strategies , 1988, [1988 Proceedings] Second International Conference on Computer Vision.

[9]  Juan Humberto Sossa Azuela,et al.  Model indexing: the graph-hashing approach , 1992, Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[10]  R. Keener.  Second Order Efficiency in the Sequential Design of Experiments , 1984 .

[11]  Christian M. Ernst,et al.  Multi-armed Bandit Allocation Indices , 1989 .

[12]  Ching Y. Suen,et al.  Analysis and Design of a Decision Tree Based on Entropy Reduction and Its Application to Large Character Set Recognition , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  Ronald L. Graham,et al.  Performance bounds on the splitting algorithm for binary testing , 1974, Acta Informatica.

[14]  D. Huffman.  A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[15]  David A. Huffman,et al.  A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.

[16]  Ronald L. Rivest,et al.  Constructing Optimal Binary Decision Trees is NP-Complete , 1976, Inf. Process. Lett..

[17]  Steven Skiena,et al.  Decision trees for geometric models , 1993, SCG '93.

[18]  Donald W. Loveland.  Performance bounds for binary testing with arbitrary weights , 2004, Acta Informatica.

[19]  Josiane Zerubia,et al.  A Curvature-Dependent Energy Function for Detecting Lines in Satellite Images , 1993 .