Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Mathematics

Doctoral Theses

2003

Design

Articles 1 - 2 of 2

Full-Text Articles in Physical Sciences and Mathematics

Combinatorial Techniques For Digital Image Charecterization And Retrieval:Algorithms,Architectures,And Applications., Arijit Bishnu Dr. May 2003

Combinatorial Techniques For Digital Image Charecterization And Retrieval:Algorithms,Architectures,And Applications., Arijit Bishnu Dr.

Doctoral Theses

Interest in digital images stems mostly from its application to various areas of computer vision [33, 57] and pattern recognition [145). Problems include robotic vision and con- trol, geographic and topographic map matching, target recognition, space applications, character recognition, scene analysis, fingerprint and face recognition, etc. Lately, with the advent of content-based image retrieval (CBIR) and proliferation of the Internet, digital imaging applications are in vogue now than ever before. In almost all the cases, the data size is enormously large, and at the same time, fast on-line as well as real- time computation is needed. For example, in fingerprint …


On The Approximability Of Linear Ordering And Related Np-Optimization Problems., Sounaka Mishra Dr. Feb 2003

On The Approximability Of Linear Ordering And Related Np-Optimization Problems., Sounaka Mishra Dr.

Doctoral Theses

We investigate approximability of both maximum and minimum linear ordering problems (MAX-LOP and MIN-LOP) and several related problems such as the well known feedback set problems, acyclie subdigraph problem and several others and their variants.We show that both MAX-LOP and MIN-LOP are strongly NP-complete, and MIN- LOP, MIN-QAP(S) (a special case of minimum quadratic assignment problem) and MIN-W-FAS are equivalent with respect to strict-reduction. The strict-equivalence is also established among these problems as well as MIN-W-FVS, with weights on arcs/vertices bounded by a polynomial, and the unweighted versions of the feedback set. problems. We also show that MAX-LOP is strict-equivalent …