Visual Object Representation Scheme.

Date of Submission

December 1992

Date of Award

Winter 12-12-1993

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science

Department

Theoretical Statistics and Mathematics Unit (TSMU-Bangalore)

Supervisor

Bagchi, Aditya (CSSS-Kolkata; ISI)

Abstract (Summary of the Work)

Visual Object recognition problem is a well known problem in the field of Computer vision. Many people has contributed different propositions to answer the question : how an input object or One simple to store an object (i.e., knowledge) and retrieve information from that storage ( proposition is to extract sufficient amount how to recognise knowledge features known feature vector ) for each object and store them in An input this system is compared with each stored object linearly get suitable match. Such a system faces problem when the number of increases sufficiently. A search procedure will perform poorly in such situation. Also there is chance huge amount information repetition especially when all in groups has some uniformity. In this dissertation work an in-memory storage scheme visual has been we have basically the decomposablity property of a visual repetition of information to some extend

Comments

ProQuest Collection ID: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:28843100

Control Number

ISI-DISS-1992-167

Creative Commons License

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

DOI

http://dspace.isical.ac.in:8080/jspui/handle/10263/6335

This document is currently not available here.

Share

COinS