E1AR0002@SMUVM1.BITNET (11/04/86)
TECHNICAL NOTE: 173\hfill PRICE: \$15.00\\[0.01in]
\noindent TITLE: A SCENE-ANALYSIS APPROACH TO REMOTE SENSING\\
AUTHORS: J. MARTIN TENENBAUN, MARTIN A. FISCHLER, and HELEN C. WOLF\\
DATE: OCTOBER 1978\\[0.01in]
ABSTRACT: A scene-analysis approach to interpretation of remotely
sensed imagery is described, with emphasis on applications involving
continuous monitoring of predetermined ground sites. A key concept is
the use of knowledge contained in various kinds of maps to guide the
extraction of relevant information from the image.
Geometric correspondence between a sensed image and a symbolic
map is established in an initial stage of processing by adjusting
parameters of a sensor model so that image features predicted from the
optimally match corresponding features extracted from the sensed
image. Information in the map is then used to constrain where to look
in an image, what to look for, and how to interpret what is seen. For
simple monitoring tasks involving multispectral classification, these
constraints can significantly reduce computation, simplify
interpretation, and improve the utility of the resulting information.
Moreover, previously intractable tasks requiring spatial and textural
analysis may become straightforward in the context established by the
map knowledge. Three such tasks are demonstrated: monitoring the
volume of water in a reservoir, monitoring the number of boxcars in a
railyard, and monitoring the number of ships in a harbor.
The conceptual approach of map-guided image analysis is described
in sufficient generality to suggest numerous other applications.
Details of the map-image correspondence procedure and a general
technique for locating boundaries to subpixel accuracy using map
knowledge are described in appendices.\\
--------------------------------------------------------------------------------
------------------------------------------------\\
TECHNICAL NOTE: 175\hfill PRICE: \$10.00\\[0.01in]
\noindent TITLE: PROSPECTS FOR INDUSTRIAL VISION\\
AUTHORS: J. MARTIN TENENBAUM, HARRY G. BARROW, and ROBERT C. BOLLES\\
DATE: NOVEMBER 1978\\[0.01in]
ABSTRACT: Most current industrial vision systems are designed to
recognize known objects seen from standard view points in high
contrast scenes. Their performance and reliability are marginal; many
tasks including such as bin picking, recognition of parts on overhead
conveyors, and implicit inspection of surface flaws are beyond current
competence.
Recent image understanding research suggests that the limitations
of current industrial vision systems stem from inadequate
representations for describing scenes; physical attributes
(reflectance, texture, etc.) and three-dimensional pictorial features
and object models. This paper builds a case for needed additional
levels of representation and outlines the design of a general-purpose
computer-vision system capable of high performance in a wide variety
of industrial vision tasks.
This paper was originally presented at the General Motors
Symposium on Computer Vision and Sensor-Based Robots," September
1978, the proceedings of which will be published by Plenum Press in
1979.\\
--------------------------------------------------------------------------------
------------------------------------------------\\
TECHNICAL NOTE: 176\hfill PRICE: \$10.00\\[0.01in]
\noindent TITLE: WHY IS DISCOURSE COHERENT?\\
AUTHOR: JERRY R. HOBBS\\
DATE: NOVEMBER 1978\\[0.01in]
ABSTRACT: When people produce a discourse, what needs are they
responding to when they make it coherent, and what form does this
coherence take? In this paper, it is argued that coherence can be
characterized in terms of a set of coherence relations" between
segments of a discourse. It is shown, from an abstract description of
the discourse situation, that these relations correspond to the kinds
of communicative work that needs to get done in discourse. In
particular, four requirements for successful communication are
isolated: the message itself must be conveyed; the message must be
related to the goals of the discourse; what is new and unpredictable
in the message must be related to what the listener's inference
processes toward the full intended meaning of the message.
Corresponding to each requirement is a class of coherence relations
that help the speaker satisfy the requirements. The coherence
relations in each class are discussed and defined formally. Finally,
a fragment of a conversation is analyzed in detail to illustrate the
problems that face a speaker in trying to satisfy these requirements,
and to demonstrate the role the coherence relations play in the
solution.\\
--------------------------------------------------------------------------------
------------------------------------------------\\
TECHNICAL NOTE: 177\hfill PRICE: \$10.00\\[0.01in]
\noindent TITLE: A DEDUCTIVE APPROACH TO PROGRAM SYNTHESIS\\
AUTHORS: ZOHAR MANNA and RICHARD WALDINGER\\
DATE: DECEMBER 1978\\[0.01in]
ABSTRACT: Program synthesis is the systematic derivation of a
program from a given specification. A deductive approach to program
synthesis is presented for the construction of recursive programs.
This approach regards program synthesis as a theorem-proving task and
relies on a theorem-proving method that combines the features of
transformation rules, unification, and mathematical induction within a
single framework.\\
--------------------------------------------------------------------------------
-------------------------------------------------\\
TECHNICAL NOTE: 182\hfill PRICE: \$10.00\\[-0.15in]
\begin{tabbing}
\noindent TITLE: \= HIERARCHICAL REPRESENTATION OF THREE-DIMENSIONAL OBJECTS\\
\> USING VERBAL MODELS\\
AUTHOR: GERALD J. AGIN\\
DATE: MARCH 1979\\[-0.15in]
\end{tabbing}
ABSTRACT: We present a formalism for the computer representation
of three-dimensional shapes, that has as its goal to facilitate
man-machine communication using verbal, graphic, and visual means.
With this method, pieces may be assembled hierarchically using any of
several ways of specifying attachment. The primitives of the
representation are generalized cylinders, and the creating of
assemblies may make use of the axes inherent in the primitives.
Generic models may be described that may leave some parameters or
dimensions unspecified, so that when a specific instance of the model
is described, those parameters may either be explicitly specified or
take on default values. The axes of local coordinate frames may be
given symbolic names. A set of computer programs translate
descriptions of objects into polyhedral models and line drawings.\\
--------------------------------------------------------------------------------
-------------------------------------------------\\
TECHNICAL NOTE: 185\hfill PRICE: \$10.00\\[0.01in]
\noindent TITLE: FOCUSING AND DESCRIPTION IN NATURAL LANGUAGE DIALOGUES\\
AUTHOR: BARBARA J. GROSZ\\
DATE: APRIL 1979\\[0.01in]
ABSTRACT: When two people talk, they focus their attention on
only a small portion of what each of them knows or believes. Both
what is said and how it is interpreted depend on a shared
understanding of this narrowing of attention to a small highlighted
portion of what is known.
Focusing is an active process. As a dialogue progresses, the
participants continually shift their focus and thus form an evolving
context against which utterances are produced and understood. A
speaker provides a hearer with clues of what to look at and how to
look at it--what to focus on, how to focus on it, and how wide or
narrow the focusing should be. As a result, one of the effects of
understanding an utterance is that the listener becomes focused on
certain entities (both objects and relationships) from a particular
perspective.
Focusing clues may be linguistic or they may come from knowledge
about the relationships between entities in the domain. Linguistic
clues may be either explicit, deriving directly from certain words, or
implicit, deriving from sentential structure and from rhetorical
relationships between sentences.
This paper examines the relationships between focusing and
definite descriptions in dialogue and its implications for natural
language processing systems. It describes focusing mechanisms based
on domain structure clues which have been included in a computer
system and, from this perspective, indicates future research problems
entailed in modeling the focusing process more generally.\\
--------------------------------------------------------------------------------
------------------------------------------------\\
TECHNICAL NOTE: 187\hfill PRICE: \$10.00\\[-0.15in]
\begin{tabbing}
\noindent TITLE: \= COMPUTATIONAL MODELS OF BELIEFS AND THE SEMANTICS\\
\> OF BELIEF-SENTENCES\\
AUTHORS: ROBERT C. MOORE and GARY G. HENDRIX\\
DATE: JUNE 1979\\[-0.15in]
\end{tabbing}
ABSTRACT: This paper considers a number of problems in the
semantics of belief sentences from the perspective of computational
models of the psychology of belief. We present a semantic
interpretation for belief sentences and show how this interpretation
overcomes some of the difficulties of alternative approaches,
especially those based on possible-world semantics. Finally, we argue
that these difficulties arise from a mistaken attempt to identify the
truth conditions of a sentence with what a competent speaker knows
about the meaning of the sentence.\\
--------------------------------------------------------------------------------
-------------------------------------------------\\
TECHNICAL NOTE: 188\hfill PRICE: \$10.00\\[-0.15in]
\begin{tabbing}
\noindent TITLE: \= UTTERANCE AND OBJECTIVE: ISSUES IN NATURAL\\
\> LANGUAGE COMMUNICATION\\
AUTHOR: BARBARA J. GROSZ\\
DATE: JUNE 1979\\[-0.15in]
\end{tabbing}
ABSTRACT: Communication in natural language requires a combination of
language-specific and general common-sense reasoning capabilities, the
ability to represent and reason about the beliefs, goals, and plans of
multiple agents, and the recognition that utterances are multifaceted.
This paper evaluates the capabilities of natural language processing
systems against these requirements and identifies crucial areas for
future research in language processing, common-sense reasoning, and
their coordination.\\
--------------------------------------------------------------------------------
-------------------------------------------------\\
TECHNICAL NOTE: 191\hfill PRICE: \$25.00\\[0.01in]
\noindent TITLE: REASONING ABOUT KNOWLEDGE AND ACTION\\
AUTHOR: ROBERT C. MOORE\\
DATE: SEPTEMBER 1979\\[0.01in]
ABSTRACT: This thesis deals with the problem of
making a computer reason about the interactions between knowledge and
action. In particular, we want to be able to reason about what
knowledge a person must have in order to perform an action, and what
knowledge a person may gain by performing an action. The first
problem we face in achieving this goal is that the basic facts about
knowledge which we need to use are most naturally expressed as a modal
logic. There are, however, no known techniques for efficiently doing
automatic deduction directly in modal logics. We solve this problem
by taking the possible-world semantics for a modal logic of knowledge
and axiomatizing it directly in first-order logic. This means that we
reason not about what facts someone knows, but rather what possible
worlds are compatible with what identifying possible worlds with the
situations before and after an action is performed. We use these
notions to express what knowledge a person must have in order to
perform a given action and what knowledge a person acquires by
carrying out a given action. Finally, we consider some
domain-specific control heuristics that are useful for doing
deductions in this formalism, and we present several examples of
deductions produced by applying these heuristics.\\
--------------------------------------------------------------------------------
-------------------------------------------------\\
TECHNICAL NOTE: 195\hfill PRICE: \$15.00\\[-0.15in]
\begin{tabbing}
\noindent TITLE: \= AN ICONIC TRANSFORM FOR SKETCH COMPLETION AND \\
\> SHAPE ABSTRACTION\\
AUTHORS: MARTIN A. FISCHLER and PHYLLIS BARRETT\\
DATE: OCTOBER 1979\\[-0.15in]
\end{tabbing}
ABSTRACT: This paper shows how a simple label propagation technique, in
conjunction
with some novel ideas about how labels can be applied to an image to
express semantic knowledge, lead to the simplification of a number of
diverse and difficult image analysis tasks (e.g., sketch completion
and shape abstraction). A single algorithm technique, based on
skeleton and distance transform concepts, is applied to appropriately
labeled images to obtain the desired results. A key point is that the
initial semantic labeling is not required at every location in the
image, but only at those few critical locations where significant
changes or discontinuities occur.\\
--------------------------------------------------------------------------------
-------------------------------------------------\\
TECHNICAL NOTE: 196\hfill PRICE: \$10.00\\[-0.15in]
\begin{tabbing}
\noindent TITLE: MAP-GUIDED INTERPRETATION OF REMOTELY-SENSED IMAGERY\\
AUTHORS: \= J. MARTIN TENENBAUM, HARRY G. BARROW, ROBERT C. BOLLES,\\
\> MARTIN A. FISCHLER, and HELEN C. WOLF\\
DATE: SEPTEMBER 1979\\[-0.15in]
\end{tabbing}
ABSTRACT: A map-guided approach
to interpretation of remotely sensed imagery is described, with
emphasis on applications involving continuous monitoring of
predetermined ground sites. Geometric correspondence between a sensed
image and a symbolic reference map is established in an initial stage
of processing by adjusting parameters of a sensor model so that image
features predicted from the map optimally match corresponding features
extracted from the sensed image. Information in the map is then used
to constrain where to look in an image and what to look for. With
such constraints, previously intractable remote sensing tasks can
become feasible, even easy, to automate. Four illustrative examples
are given, involving the monitoring of reservoirs, roads, railroad
yards, and harbors.\\
--------------------------------------------------------------------------------
------------------------------------------------\\
TECHNICAL NOTE: 197\hfill PRICE: \$10.00\\[-0.15in]
\begin{tabbing}
\noindent TITLE: \= A FRAMEWORK FOR A PORTABLE NATURAL LANGUAGE\\
\> INTERFACE TO LARGE DATA BASES\\
AUTHOR: KURT G. KONOLIGE\\
DATE: OCTOBER 1979\\[-0.15in]
\end{tabbing}
ABSTRACT: A framework is proposed
for developing a portable natural language interface to large data
bases. A discussion of problems arising from portability leads to the
identification of a key concept of the framework: a conceptual schema
for representing a user's model of the domain as distinct from the
data base schema. The notions of conceptual completeness and
linguistic coverage are shown to be natural consequences of this
framework. An implementation of the framework, called D-LADDER, is
presented, and some preliminary performance results reported.\\
--------------------------------------------------------------------------------
-------------------------------------------------\\
TECHNICAL NOTE: 198\hfill PRICE: \$14.00\\[0.01in]
\noindent TITLE: ARTIFICIAL INTELLIGENCE: STATE OF THE ART\\
AUTHOR: HARRY G. BARROW\\
DATE: OCTOBER 1979\\[0.01in]
ABSTRACT: NONE\\
--------------------------------------------------------------------------------
-------------------------------------------------\\
TECHNICAL NOTE: 199\hfill PRICE: \$10.00\\[-0.15in]
\begin{tabbing}
\noindent TITLE: \= THEORETICAL FOUNDATIONS OF LINGUISTICS AND \\
\> AUTOMATIC TEXT PROCESSING\\
AUTHOR: JANE J. ROBINSON\\
DATE: OCTOBER 1979\\[-0.15in]
\end{tabbing}
ABSTRACT: Texts are viewed as purposeful transactions whose
interpretation requires inferences based on extra-linguistic as well
as on linguistic information. Text processors are viewed as systems
that model both a theory of text and a theory of information
processing. The interdisciplinary research required to design such
systems have a common center, conceptually, in the development of new
kinds of lexical information, since words are not only linguistics
objects, they are also psychological objects that evoke experiences
from which meanings can be inferred. Recent developments in
linguistic theory seem likely to promote more fruitful cooperation and
integration of linguistic research with research on test processing.\\
--------------------------------------------------------------------------------
-------------------------------------------------\\
TECHNICAL NOTE: 200\hfill PRICE: \$10.00\\[-0.15in]
\begin{tabbing}
\noindent TITLE: \= AERIAL IMAGERY USING A MULTISOURCE KNOWLEDGE \\
\> INTEGRATION TECHNIQUE\\
AUTHORS: M. A. FISCHLER, J. M. TENENBAUM, and H. C. WOLF\\
DATE: OCTOBER 1979 (revised December 1979)\\[-0.15in]
\end{tabbing}
ABSTRACT: This paper describes a computer-based approach to the
problem of detecting and precisely delineating roads, and similar
line-like" structures, appearing in low-resolution aerial imagery.
The approach is based on a new paradigm for combining local
information from multiple, and possibly incommensurate, sources,
including various line and edge detection operators, map knowledge
about the likely path of roads through an image, and generic knowledge
about roads (e.g., connectivity, curvature, and width costraints).
The final interpretation of the scene is achieved by using either a
graph search or dynamic programming technique to optimize a global
figure of merit. Implementation details and experimental results are
included.\\
--------------------------------------------------------------------------------
-------------------------------------------------\\
-------