Computer Sciences Commons^™

New Algorithms For Mid-Crack Codes In Image Processing, Wai-Tak Wong

Theses

The chain code is a widely-used description for a contour image. Recently, a mid-crack code algorithm has been proposed as another more precise method for image representation. New algorithms using this new mid-crack code for image representation, restoration, and skeletonization are developed. The efficiency and accuracy can be increased obviously.

Firstly, the conversion of a binary image with multiple regions into the mid-crack codes is presented. A fast on-line implementation can be achieved using tables look-up. The input binary image may contain several object regions and their mid-crack codes can be extracted at the same time in a single-pass row-by-row …

Real-Tv : Rtp/L3'S Visual Monitor, Richard Czop

Theses

Today many real-world activities are being monitored and controlled by some type of micro-processor based system. Emphasis is placed on manufacturing and controlling through the use of computers. The inherent nature of these real-world applications makes them difficult to control and monitor. They must be built meeting strict timing constraints and must be predictable. We need to develop simplistic, reliable, and cost effective methods for building, evaluating, monitoring and controlling these complex systems. These tools should provide the user with system insight. At the New Jersey Institute of Technology Real-Time Computing Laboratory, we are building a system that will provide …

Binary Image Decomposition And Compression Using Mathematical Morphology For Object Recognition, Venu Gopal Gogusetti

Theses

Image segmentation has been studied for several years. There are several segmentation techniques which are fast and effective but all of them are lacking the property of invariency to shift, rotation and sizing. In this study a new process is introduced which overcomes the shift, size and rotation variance and the compressed data can be used for object recognition.

Euclidean distance measurement is used in the compression process which is rotation invarient but is expensive in terms of time. Eucledean distance transformation is calculated using optimal double two scan algorithm with gray scale morphology, a new method developed by Dr. …

Searching For Orthogonal States Of Neural Networks, Heng Wang

Theses

Two approaches to find orthogonal states of neural network are presented in the paper. The first approach is a recursive one, it builds N orthogonal vectors based on N /2 orthogonal vectors. The second approach is a formula approach, in which orthogonal vectors can be obtained using a formula. Using these approaches, orthogonal states of neural network are found. Some properties of the neural network built on these orthogonal vectors are presented in Appendix A and some examples are given in Appendix B.

A Machine Entity For A Coordinate Measurement Machine : The Generic Workcell Project, Richard C. Meyer

Theses

The Center for Manufacturing Systems (CMS) department at New Jersey Institute of Technology and Siemens Corporate Research located in Princeton have agreed to jointly implement a research project in generic workcell control architectures. This paper discusses the module, called a Machine Entity, developed by the author that interfaces the Brown & Sharpe Coordinate Measurement Machine located on the CMS factory floor with the cell control software. The module has been designed in such a manner to simplify the development of future Machine Entities, thereby reducing the time required to integrate the CMS factory floor.

A Heuristical Method Of Corner Points Detection On An Image Boundary, Qiulin Li

Theses

A heuristics-based method of corner points detection on an image boundary is proposed and implemented. The method uses the sampled boundary distances to find all of the candidate corner points along the image boundary. Then the curvature characteristical value is used to measure the severity of curvature change of the candidate points. Those candidates whose curvature characteristical value is under some threshold are eliminated. The paper also proposed some mechanism to reduce the effect of noises on the boundary. Experiments show that it is an efficient method and it gives satisfactory results on some image boundaries.

Dynamic Machine Scheduling, Expansion, And Control Of A Generic Workcell, Peter A. Murray

Theses

Factory automation has come a long way since the invention of the automatic flour mill. A workcell is a group of machines (robots) working together to produce a product. In the past workcells have been hard wired using methods such as Programmable Logic Controllers (PLCs). To change a part of this system would require reprogramming the entire system.

The Generic Work Cell (GWC) is a dynamic architecture which allows a workcell to be modified on the fly. The architecture enables the generation of new cells with minimal effort, and the modification of the system without reprogramming the entire system. The …

A Study In Systems Integration Architecture, Sashidhar M. Prasad

Theses

This Thesis studies the two architectures OSCA and ANSA which support the ODPSE principle in the first two parts. In the third part the framework for integrating these two architectures is described. The idea of integration architectures in relation to open architectures is studied using the enabling technologies.

Editing Digital Audio Using A Perceptual Model, J. Mark Goode

Theses

In this paper we describe an intelligent system used to aid an audio recording producer in the selection of edit points in a musical sequence. It is possible to make meaningful recommendations concerning auditory input data without the ability to fully classify that data or interpret all outside goals. Perceptual modeling of the auditory input can allow sufficient reasoning ability for an intelligent system to be of use editing digital audio. To create a perceptual model, the information which can be extracted by the ear is embodied in several expert sections which communicate with a rule based decision maker via …

Communications Network For Distributed Real-Time Systems, Charles Silva

Theses

No abstract provided.

Representation Of Graphical Deep Knowledge In An Object-Oriented Database System, Prasanna S. Venkatesh

Theses

Object-oriented approaches to the design of complex graphical interfaces have received an enormous impetus in the database and knowledge representation disciplines. As traditional CAD systems store information about all the objects for display purposes but do not store any knowledge for reasoning purposes, they are considered as "knowledge poor" and they cannot support efficient environments for design. In Artificial Intelligence the notion of "Graphical Deep Knowledge" has been proved successful to represent knowledge about objects for display purposes as well as reasoning purposes. To design "knowledge rich" systems which can support better graphical interfaces, the theory of "Graphical Deep Knowledge" …

A Synthesis Technique Of General Petri Nets For Flexible Manufacturing And Multi-Rate Digital Signal Processing, Murthy S. Valluri

Theses

General Petri nets are useful for modeling flexible manufacturing system with multiple robots and workstations [KOH 90] and for multi-rate digital signal processing systems [CHA 91].. A problem of using Petri nets for modeling various systems is the large number of states generated. Various synthesis approaches have been proposed. Most of them do not deal with general Petri nets. Koh et. al. [KOH 90] invented a synthesis technique for generalized Petri nets. The purpose of this thesis is to extend their work by modifying the knitting technique by adding the Arc-Ratio rule.

A Common Application Model For Interfacing With Advanced Program To Program Communication/Vm, Joseph Viviano Jr.

Theses

The Merrill Lynch data processing environment is composed of a conglomeration of applications which reside on various platforms. LAN and minicomputer based applications coexist with those making their home in the mainframe arena. Unfortunately, coexistence does not imply cooperation, data uniformity, data centralization or coordinated application development. Within the Merrill Lynch mainframe arena alone there are two operating systems which reside across several computing complexes, MVS (Multiple Virtual Storage) and VM (Virtual Machine). Critical business applications and data are unique to each of these environments. The problem lies in the need for cooperative processing and sharing of distributed data among …

An Experimental Sequence Examining The Effect Of Task Type, Memory Condition, And Display Presentation Type On Performance Time And Error Rate, Using Columnar Table Versus Vertical Bar Graph Versus Line Graph, Suparna Das

Theses

A total of 126 subjects at various levels of school and a health related manufacturing firm participated in three experiments that compared Tables, Line graphs and Bar graphs forms of data presentation. The experiments were performed each consisting of a training task followed by answering some questions based on the presented material. The experimental series were presented to six groups. Group 1, 3, 5 viewed Line graphs, Tables or Bar graphs respectively while answering the questions while the other three groups answered questions based on memory of either Line graphs, Table or Bar graph presentation.

The independent variables were:

1. Memory …

Cascading Space Efficient Variation Of The Lzw Algorithm And Arithmetic Coding, Shobha Raj

Theses

Two known compression algorithms appropriate for communication are LZW and the Arithmetic Coding method. Both are adaptive and require no extra communication from the encoder to the decoder. Here we have considered a space efficient variation of the LZW algorithm which achieves better compression.

We present a scheme to cascade the space efficient variation of the LZW algorithm with Arithmetic Coding into a space efficient data compression algorithm which achieves a higher compression ratio and is appropriate for communication.

Work-Preserving Real-Time Emulation Of Meshes On Butterfly Networks, Alf-Christian Achilles

Theses

The emulation of a guest network G on a host network H is work-preserving and real-time if the inefficiency, that is the ratio W_G/W_H of the amounts of work done in both networks, and the slowdown of the emulation are O(1).

In this thesis we show that an infinite number of meshes can be emulated on a butterfly in a work-preserving real-time manner, despite the fact that any emulation of an s x s-node mesh in a butterfly with load 1 has a dilation of Ω(logs).

The recursive embedding of a mesh in a butterfly presented by …

Graphical User Interface For Image Processing, Kumar Chebrolu

Theses

A user friendly, menu driven, highly interactive X Windows package for Image Processing Applications using Motif Widget Set under Motif Window Manager is developed. Modules related to Segementation, Enhancement, Representation, Transformations are developed. The above routines are useful for image manipulation. The current gray scale/binary image is displayed on the window. Online histogram is provided so that the user can change the threshold value interactively. The OSF/Motif toolkit is used efficiently and also Xlib calls to display the image by allocating colormap. An on-line image manipulation help menu facility is incorparated in the tool to make it more versatile.

Experiments With The Gap Variation Of Interpolation Search For Semi Uniform Distributed Alphabetic Files, Jatin M. Bhavsar

Theses

There are various techniques for searching a data from a data base. One of them is interpolation search. It works on uniformly distributed and sorted numerical tables and considered to be one of the fastest methods. On an average this method takes 'lg lg n'

Burton and Lewis [BL] shows the inefficiency of interpolation sarch for an alphabetic table whose distribution is not known or non-uniform. They introduce GAP variations of interpolation search to compare the inefficiency. However another approach to a non-uniform is to apply the cumulative distribution function F which transfer a non-uniform distribution to uniform one, for …

Rule-Based Module And Object-Oriented Design For Optical Character Recognition, Min Gao

Theses

In this thesis, I present a optical character recognition technique based on the rule-based module and object-oriented design. A document image is first scanned, and then segmented into isolated characters by the use of projection profiles. The recognition procedures include three steps: contour extraction, strokes detection and rule-based classification. The contour extraction is to extract the outbound boundary and to perform the boundary linking and noise removal. The stroke detection is to detect the features or strokes of the outbound boundary, such as horizontal/vertical lines, left/right slash lines and left-/right-opened curves. The rule-based classification consists of two rules: character definition …

The Performance Of Training Pattern Sets In A New Art-Based Neural Architecture For Image Enhancement, Fu-Chun Chang

Theses

Neural network can be applied on the image enhancement after adding another two layers into the Adaptive Resonance Theory architectures (ART 1). The analysis for selecting a nice training pattern set associate the appropriate vigilance values is the main concerns in this thesis. For a single training pattern ,the network can act as a mathematical morphology operators such as erosion , dilation, opening and closing. With more than one training patterns in the network, 16 experiments are tested and are compared to each other in order to find the best selection for doing the image enhancement work. With both the …

Multiple Expert System, Umesh Kumar Mittal

Theses

In many domains, for example medical diagnosis, there are several sources of knowledge, e.g., several domain experts. These domain experts may have disagreements over some issues in the domain. Research in the area of human decision making suggests that a human decision is not always made based on the advice of a single expert. Many current expert systems, however, expect consistency in their knowledge bases. An expert system does not deliberate by reasoning that "on one hand..." but "on the other hand..." The knowledge engineer, who is not necessarily an expert in the same domain, ensures consistency by eliminating all …

Implementation Of Object Oriented University Database Using Vodak/Vml-0 Prototype, Abhay V. Bhave

Theses

In recent years object - oriented programming has gained a tremendous popularity in the design and implementation of emerging data - intensive application systems. Object oriented knowledge based approaches have proved to be very powerful vehicle when developing, integrating complex systems.

Using a University database demonstrated here is an object oriented model. This model uses VODAK/VML-0 prototype which was developed by GMD - IPSI, Darmstadt FRG. The Conceptual Schema of this database was done using The Dual Model, but as the current VODAK/VML version does not support dual model, the schema was modified before use. There are 167 classes defined …

Cascading Of Ever Adaptive Variation Of Lzw Algorithm With Arithmetic Coding Method, Ramesh Vishwanatham, Ketan Tejani

Theses

Two known compression algorithms appropriate for communication are LZW and the Arithmetic Coding method. Both algorithms are adaptive and require no extra communication from the encoder to the decoder. We have considered a variation of LZW algorithm known as Online version which result in better compression. Here we present a scheme to cascade Online LZW with Arithmetic algorithms into an Ever Adaptive data compression algorithm which achieves higher compression ratio and is appropriate for communication.

Cascading Of Arithematic Coding Method With The Lzw Algorithm, Venkat R. Maram, Nageshwar R. Kadakuntla

Theses

Two known compression algorithms appropriate for communication are the LZW algorithm and the Arithmetic Coding method. Both algorithms are adaptive and require no extra communication from the encoder to the decoder. We present a scheme to cascade these algorithms into an adaptive algorithm which achieves higher compression ratio and is appropriate for communication.

Interpolation Search For Alphabetic Tables, Loizos Gabriel

Theses

One of the fastest search techniques for uniformly distributed sorted numerical tables is interpolation search. This divide and conquer technique accesses the most probable key rather than the middle key as in binary search and continues to search similarly the appropriate part of the table . In the previous work we proved a lg lg n average number of accesses for interpolation search.

The inefficiency of interpolation search for an alphabetic table is demonstrated by Burton and Lewis and a robust variation suggested by them to improve the efficiency. This inefficiency is expected since such tables are usually far from …

Cascading Lzw Algorithm With Huffman Coding : A Variable To Variable Length Compression Algorithm, Ashish Khandubhai Mehta

Theses

Two common schemes in data compression are fixed to variable length coding and variable to fixed length coding. Higher compression is expected from the more flexible scheme of variable to variable length coding. In such a scheme a compression dictionary is used to transfer variable length string over the text alphabet into variable length strings over the coding alphabet. The compression is achieved due to matching longer more frequent text strings with shorter coding strings.

To obtain a variable to variable length coding we choose to cascade the LZW , variable to fixed , coding with the Huffman , fixed …

Program Analysis Tool For Extensive Reverse Software Engineering : A Tool To Understand The Software (Patern), Bubulal R. Rawal

Theses

This thesis describes a computer aided software engineering tool called Program Analysis Tool for Extensive Reverse software eNgineering (PATERN). Conceptually, PATERN provides systems analysts/programmers with a powerful tool independent of programming language, operating system, and programmer style of coding for documenting existing software. PATERN has been tested with C code in the UNIX environment. This thesis also describes the interface between PATERN and two subsystems that interact with PATERN: relational databases and data flow diagram generators. The implementation of these interfaces was investigated using Informix and another software tool, Directed Acyclic Graphs (DAG) for generating hierarchical structure charts and flow …

Towards A Bound For The Compression Of The Lzw Algorithm, Anoop Kumar Srivastava, Shinu Gupta

Theses

The LZW algorithm is a well known efficient adaptive compression algorithm. It is based on constructing a dictionary containing character strings from the text. A number of researchers have attempted to add variations to the original algorithm to achieve higher compression values. In this thesis we attempt to find a bound for the LZW approach. That is, we build a dictionary which gives maximum compression and satisfies prefix property of LZW algorithm.

In order to build such an optimum dictionary, the dynamic programming technique is applied. The final dictionary selected consists of entries which give maximum overall compression and also …

Multiple-Screen Panning System, Abdo Fathy Youssef

Theses

There is a need to provide graphics capabilities for the objective of "Group Graphics". This is the ability of a group of humans to work collaboratively on the same diagram. It is the intent of this project to provide some of the fundamental software tools to allow a group of individuals to deal with a "mosaic" form of graphics made up of many separate screens that can be panned and conceptually edited by each individual who is working on portions of the overall document.

Simple tools are provided for the creation of graphics screens as well as saveing and retrieving …

Implementation Of Case (Common Application Service Element) And Application Interface For Manufacturing Automation Protocol, Amit Limaye

Theses

In 1980 General Motors formed a task force committee to explore solution to incompatibility of computer network on machine floor which control programmable devices, Robots etc. After receiving the various existing standards, the committee came up with first draft of Manufacturing & Automation Protocol (MAP 1.0) in April 1984. Further reviews resulted in different versions of MAP standards and presently, efforts are being made to come up with MAP 3.0.

MAP enables information to be readily transferred between computers, people and equipment and thus truely interconnecting open systems. The ultimate goal of these efforts is to be able to produce …