Parallel Architecture and Algorithms for Fast Detection of Basis Polygons.

Date of Submission

December 1997

Date of Award

Winter 12-12-1998

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Advance Computing and Microelectronics Unit (ACMU-Kolkata)


Sinha, Bhabani Prasad (ACMU-Kolkata; ISI)

Abstract (Summary of the Work)

Though a human brain is inherently slower than digital computer, in the computations involving vision it usually has an edge over the later due to its massive parallelismand ability to deal with analog data directly. However, with the advent of parallel processing it is possible to devise algorithms following human reasoning closely. In this dissertation we choose the problem of polygon detection which is actually a subclass of the general problem problem of simple geometrical figure recognition. For such problems digital computer is quite efficient because the description of a scene comprising of geometrical figures can be represented with simple numerical data. Here we try to devise some efficient algorithms for parallel processors that follows the sort of reasoning a human being makes when trying to comprehend a visual scene. Here we develop two O(n) algorithms using an architecture comprising of an n x n array of processors. This makes the cost of computation O(n3), which is optimal.


ProQuest Collection ID:

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.


This document is currently not available here.