Shi-Kuo Chang

Iconic Indexing by 2-D Strings

In this paper, we describe a new way of representing a symbolic picture by a two-dimensional string. A picture query can also be specified as a 2-D string. The problem of pictorial information retrieval then becomes a problem of 2-D subsequence matching. We present algorithms for encoding a symbolic picture into its 2-D string representation, reconstructing a picture from its 2-D string representation, and matching a 2-D string with another 2-D string. We also prove the necessary and sufficient conditions to characterize ambiguous pictures for reduced 2-D strings as well as normal 2-D strings. This approach thus allows an efficient and natural way to construct iconic indexes for pictures.

An intelligent image database system

A prototype intelligent image database system (IIDS) that is based on a novel pictorial data structure is presented. This prototype system supports spatial reasoning, flexible image information retrieval, visualization, and traditional image database operations. A pictorial data structure, based on 2-D strings, provides an efficient means for iconic indexing in image database systems and spatial reasoning. The modular design of IIDS facilitates its implementation. Further extensions of the prototype system are discussed. >

Visual Languages: A Tutorial and Survey

Research into visual and growing in popularity. The concept of generalized icons is a framework for the design of the next genertion of visual languages.

Fuzzy sets : theory and applications to policy analysis and information systems

In this volume, we present a spectrum of original research works ranging from the very basic properties and characteristics of fuzzy sets to specific areas of applications in the fields of policy analysis and information systems. The first part, theory, presents some fine added contributions toward a deeper basic understanding of fuzzy set theory and serves to enrich set theory in the direction of maturity and completeness of its theoretical development.

Picture Indexing and Abstraction Techniques for Pictorial Databases

We present an approach for picture indexing and abstraction. Picture indexing facilitates information retrieval from a pictorial database consisting of picture objects and picture relations. To construct picture indexes, abstraction operations to perform picture object clustering and classification are formulated. To substantiate the abstraction operations, we also formalize syntactic abstraction rules and semantic abstraction rules. We then illustrate by examples how to apply these abstraction operations to obtain various picture indexes, and how to construct icons to facilitate accessing of pictorial data.

Pictorial Data-Base Systems

New applications in digital picture processing—notably in handling geographic data and in computer-aided design—have prompted development of a variety of pictorial data-base systems.

A method for the structural analysis of two-dimensional mathematical expressions

A structure specification scheme is described which can be used to specify the structures of certain two-dimensional patterns. Algorithms are developed to test whether a pattern has a (strongly) well-formed structure with respect to a given structure specification scheme. This method is applicable to the analysis of two-dimensional mathematical expressions and the format of printed material. The usefulness of this method is limited to the analysis of patterns whose structures are based upon a number of operators. When it is applicable, a strongly well-formed structure can be constructed in time n^2, where n is the number of primitive components of the pattern.

The reconstruction of binary patterns from their projections

Given the horizontal and vertical projections of a finite binary pattern <italic>f</italic>, can we reconstruct the original pattern <italic>f</italic>? In this paper we give a characterization of patterns that are reconstructable from their projections. Three algorithms are developed to reconstruct both unambiguous and ambiguous patterns. It is shown that an unambiguous pattern can be perfectly reconstructed in time <italic>m</italic> × <italic>n</italic> and that a pattern similar to an ambiguous pattern can also be constructed in time <italic>m</italic> × <italic>n</italic>, where <italic>m</italic>, <italic>n</italic> are the dimensions of the pattern frame.

Advances in Software Engineering and Knowledge Engineering

The papers collected in this book were invited by the editors as tutorial courses or keynote speeches for the Fourth International Conference on Software Engineering and Knowledge Engineering. The book offers wide coverage of the main topics involved with the specifications, prototyping, development and maintenance of software systems and knowledge-based systems. The main issues in the area of software engineering and knowledge engineering are addressed and for each analyzed topic the corresponding research state is reported.

Representation And Retrieval Of Symbolic Pictures Using Generalized 2D Strings

We present a methodology for pictorial database design, based upon a new spatial knowledge structure. This spatial knowledge structure consists of an image database, symbolic projections representing the spatial relations among objects or sub-objects in an image, and rules to derive complex spatial relations from the generalized 2D string representation of the symbolic projections. The most innovative aspect of this spatial knowledge structure is the use of symbolic projections to represent pictorial knowledge as generalized 2D strings. Since spatial knowledge is encoded into strings, inference rules can be applied for spatial reasoning.