A Comparison between Top-Down and Bottom-Up Image Analysis in Terms of the Complexity of Searching a Problem Space

Ali-Akbar Abkar, Nanno Mulder

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

20 Downloads (Pure)


In the context of the analysis of remotely sensed data the question arises of how to analyze large volumes of data. In the specific case of agricultural fields in flat areas these fields can often be modeled in terms of geometric primitives such as triangles and rectangles. In this case the options are classical i.e. bottom-up, starting at the pixel level and resulting in a segmented, labeled image or topdown, starting with a model for image partitioning and resulting in a minimum cost estimation of shape hypotheses with corresponding parameters. We report on an investigation of the search effort needed for resolving a simplified segmentation problem of partitioning an image into two segments. Experimental factors are edge length and overlap of monospectral probability distributions of two classes. The method for quantifying the complexity of an approach is to determine the number of possible solutions at each stage in the process and the convergence rate towards a final solution of the segmentation and labeling problem.
Original languageEnglish
Title of host publicationProceedings of MVA '96
Subtitle of host publicationIAPR Workshop on Machine Vision Applications : November 12-14 1996, Tokyo, Japan
Place of PublicationTokyo, Japan
PublisherKeio University
Number of pages7
Publication statusPublished - 12 Nov 1996
EventIAPR Workshop on Machine Vision Applications, MVA 1996 - Tokyo, Japan
Duration: 12 Nov 199614 Nov 1996


WorkshopIAPR Workshop on Machine Vision Applications, MVA 1996


  • ADLIB-ART-645
  • NRS

Cite this