This paper presents a bibliography of over 1250 references related to the computer processing of pictorial information, arranged by subject matter. Coverage is restricted, for the most part, to a selected set of U.S. journals and proceedings of specialized meetings. The topics covered include digitization, approximation, and compression; transforms, filtering, enhancement, restoration, and reconstruction; hardware and software; pictorial pattern recognition; feature detection, segmentation, and image analysis; matching and time-varying imagery; shape and pattern; texture; formal models; and three-dimensional scene analysis. No attempt is made to evaluate or summarize the items cited; the purpose is simply to provide a convenient compendium of references.

Picture processing 1984

Recently, tree-searched chain codes have been proposed that reduce the reconstruction distortion significantly compared to chain codes. The authors study tree coding schemes to encode line drawings and show that they outperform the basic and tree-searched chain codes. Both adaptive and nonadaptive tree coding schemes are studied. The adaptive schemes considered include an adaptive gradient algorithm and a Kalman filtering algorithm, both in conjunction with tree coding. The adaptive tree encoding schemes outperform all other schemes considered. >

Tree encoding of line drawings

A prediction-based congestion avoidance scheme is presented for ISDN frame-relay networks. Frame relay is a new bearer service recommended for ISDN to support packet mode communications. Unlike an X.25-based switching technique, frame-relay terminates the data link layer protocol at the end user, thus requiring flow control and error recovery to be performed end-to-end. Since the network does not send explicit congestion messages to the end users, an effective congestion avoidance scheme is needed to prevent severely degraded performance which can result from network congestion. A prediction method for the congestion avoidance scheme is presented. It is based on the recursive digital filter known as the Kalman one-step predictor. The model developed from this idea is analyzed briefly to demonstrate adaptive end-to-end window flow control and error recovery procedures, which depend upon the predicted congestion states of the network. >

Kalman prediction method for congestion avoidance in ISDN frame-relay networks

In this paper, we address the problem of synthesizing connected handwritten script from individual characters written in isolation. Connected writing is viewed as a natural evolution from writing the characters in isolation, characterized by the use of continuous pen-down connecting movement from one character to the next. The problem is one of concatenation of individual character shapes to generate the connected script and consists in synthesizing a so called transition stroke from one character to the next. Particular emphasis is laid on recreating the context effect underlying the pen-down transition stroke and in preserving the continuity of motion and shape in the transition. Under this framework, we propose an approach based on a shape specific splining technique where the transition stroke is generated from the isolated character shapes by a direct application of the Bezier curve formulation, Here, in the concatenation of two characters, the end segments of the characters are considered as the con...

Connected Script Synthesis by Character Concatenation—A Bezier Curve Based Formulation

A method of handwriting signal encoding based on adaptive linear predictive coding (ALPC) is studied. The ALPC is a form of DPCM which uses a sequentially adaptive predictor in which a sequential estimation algorithm is used to update predictor coefficients. To improve the estimates of the predictor coefficients in the presence of quantization noise, Kalman filtering has been investigated for its feasibility. This results in improvements of not only the estimation of the predictor coefficients, but the signal-to-quantization-noise ratio (SNR) of the signals reconstructed at the receiver as well. Computer simulations have verified that the ALPC system employing the Kalman filter promises high performance and feasibility at the rate of 192 bits/s when applied to handwriting signal encoding.

Y. Yasumoto

Papers

An Improved Adaptive Predictor in DPCM Based on the Kalman Filter and Its Application to Handwriting Signal Encoding