The Dijkstra method is a well-known algorithm for finding the optimum path in shortest-path search problems. With that method, however, the time required to find the optimum path becomes remarkably long when the search scope is broad, so the Djikstra method is not suitable for real-time problems. In this paper, we propose a method for obtaining, in a short time, a path that is as close as possible to the path obtained by the Dijkstra method (the optimum path). The new method extends the conventional Dijkstra method so as to obtain a solution to a problem given within a specified time, such as path search in a car navigation system. The effectiveness of that extended method is described through use of simulations.

Algorithms to detect pairs of edges that could be ends of a straight homogeneous generalized cylinder (SHGC) are proposed. Geometrical constraints for the ends of an SHGC are utilized to group edge elements and edge segments in a complex image. Two methods are investigated. The first algorithm is for a subset of SHGCs for which scaling factors of the cross section at both ends are the same. The second algorithm is for any SHGC. However, a modified version is implemented to reduce computation; given a reference and edge, it finds the edges possibly paired with it. Several examples of ends extracted from real images are reported to show the feasibility of the algorithm.>

An expert system for algorithm design for industrial machine vision is presented. Its knowledge base includes human experts' knowledge about image processing techniques, and it is capable of solving given vision problems. As a problem domain, the authors have chosen vision algorithms for a parts feeder, which determines the attitude of mechanical parts on a conveyor belt and rejects parts with inappropriate attitudes. The expert system for a parts feeder is designed to consist of three components: a feature selection expert, an image processing expert, and a decision tree generator. The knowledge necessary for the design of a vision algorithm for determining the attitudes of parts is discussed. A framework for representing the knowledge needed in order to find solutions to pattern classification problems is established.>

An image processing workstation called the vision and image engineering workstation, or VIEW-Station, which as developed in order to merge the state-of-the-art software environment of a UNIX workstation and the computing power of the fast image processor, is described. The software system of the VIEW-Station is constructed hierarchically in order to allow device independence in porting to various hardware configurations and to achieve flexibility in developing application systems. An image computing language called V-Sugar, which provides specific data types and a functional notation, allowing image processing algorithms to be expressed simply, is described. The image memory management mechanism, V-server, and the window system extensions, VIEW-Windows, are described. They are integrated to provide an independent basis to hardware configurations.>