bluuebunny/crossref_metadata_2025_split huggingface dataset:
Adaptive control of linear discrete‐time stochastic systems with colored noise and randomly switched parameters
Authors: Ohuchi Takao , Ohtomo Teruhiko 
Published: July 2007

AbstractThis paper describes a structure of the linear discrete‐time stochastic system which contains colored observation noise and changes its system parameters randomly due to, say, abrupt load changes. In the system under consideration, the switching system parameters are not identified during adaptive control; rather a priori identified parameters are used in determining the adaptive control input. First, an algorithm for optimal control from an arbitrary initial state to an arbitrary state space (target state) is derived by extending the dynamic programming technique. Also, an algorithm is derived for realizing the state estimate of a system with colored observation noise with a discrete‐time Kalman filter. Next, the a posteriori probability of each system parameter is found from the probabilities of system parameters at a certain time by using the Bayes' formula, and it is shown that the adaptive control input can be determined by summing the products of a posteriori probability and the optimal control input calculated from dynamic programming for each parameter. Also, the effectiveness of the proposed stochastic adaptive control algorithm is confirmed by computer simulation of a two‐dimensional model system and by comparing four different methods of probability calculation when the system parameters are switched randomly.
A new method of software structural testing by path analysis
Authors: Masuyama Hiroshi , Ichimori Tetsuo 
Published: July 2007

AbstractThis paper discusses the structural software testing method by path analysis. The problem of the method is discussed, and a coverage measure is proposed. The problem in the structural testing is discussed first. If the evaluation is made based on the past coverage measures, the quality of the software tends to be overestimated. A problem occurs of testing the cost when the number of steps for determining the test data increases with the size of the software. Also, another problem occurs wherein if a new coverage measure is introduced so that the quality is not overestimated, additional test cost is produced. From such a viewpoint, this paper proposes a method which can essentially avoid these problems by using the minimum number of test paths. An algorithm for determining the test paths is presented which is independent of the earlier method. Then it is shown that the number of test paths determined by that algorithm is the minimum. The total distance of the test paths is also discussed. Finally, the computational complexity in determining the test paths is discussed.
Studies on Noisy word recognition
Authors: Takahashi Kazuaki , Matsumoto Yoshihiro , Kobatake Hidefumi 
Published: July 2007

AbstractThis paper presents theoretical and experimental studies of the effect of noise on the speech spectrum. It is shown that the logarithmic spectrum is not suitable for the features of noisy speech because it is sensitive to stochastic noise effects when the signal‐to‐noise ratio is low. A new distance measure for spoken word recognition is proposed which is effective in evaluating the distance between the reference and the input under the influence of noise. Experiments in noisy word recognition show the effectiveness of the proposed method.
A region extraction method using a distance function between images
Authors: Nagao Tomoharu , Agui Takeshi , Nakajima Masayuki 
Published: July 2007

AbstractThis paper discusses the distance function between images and its application, which is applicable to any monochrome binary image and monochrome gray‐valued image with 2n × 2n pixels (n is a nonnegative integer). By denoting the original image as the 0th image, the first to the nth images are generated by successively partitioning the edges. Each image is composed of a finite number of subimages. Then the center of gravity is defined with the gray‐value of the pixel as the weight. Using these notions, the distance between images is defined between two images. The rotational transformation is introduced for the subimages of the images at each stage, and the application of the distance function between images is discussed. An application example is the region extraction in the geographical information processing. The extraction of the contour (equal‐height) line and the extraction of building region in the 1/25,000 map are discussed. The distance function between images proposed in this paper does not depend on the property of the original image, and is considered as being suited to the hierarchical processings.
A top‐down error‐correcting parser for a context‐sensitive language
Authors: Kobayashi Hironari , Ikeda Mitsuru , Tanaka Eiichi 
Published: July 2007

AbstractA context‐free grammar, a stochastic grammar, and a context‐free tree grammar have been used in the past in the syntactic approach to pattern recognition. However, since a pattern is primarily context‐dependent, some top‐down and bottom‐up parsers have been proposed for context‐sensitive language (CSL). Although the bottom‐up version of the error‐correcting parser for CSL has been known, it has a disadvantage in that it converts an input string of length n into a string of length (n + 1) k + n (k is the maximum number of consecutive deletions of terminal symbols). As a result, this paper proposes a top‐down ECP (error‐correcting parser) for a context‐sensitive language.
Determining a depth map from a pair of needle maps by a pair of photometric stereo systems with region matching
Authors: Ikeuchi Katsushi 
Published: July 2007

AbstractThis paper describes a method for determining a depth map from a pair of surface‐orientation maps obtained by a pair of photometric stereo systems. A photometric stereo system determines surface orientations by taking three images from the same position under different lighting conditions, based on the shading information. A pair of photometric stereo systems can generate a pair of surface orientation maps.Then the surface‐orientation maps can be segmented into isolated regions with respect to surface orientations, using a geodesic dome. The resulting left and right regions are compared to pair corresponding regions. The following three kinds of constraints will be used to search for corresponding regions efficiently: (1) a surface orientation constraint; (2) an area constraint; and (3) an epipolar constraint. Region matching is done iteratively starting from a coarse segmented result and proceeding to a fine segmented result, using a parents‐children constraint.The horizontal difference in the position of the center of mass of a region pair determine the absolute depth value for the physical surface patch imaged onto that pair. This system takes only a few minutes to determine an absolute depth map in complicated scenes, on a Lisp machine, and could be used as an input device for a bin‐picking system.
Measurement of 3‐d objects using recorded image projection and two cameras
Authors: Aoki Norio , Yachida Masahiko , Tsuji Saburo 
Published: July 2007

AbstractThe measurement of three‐dimensional objects has been conducted by various methods such as by projection of a slit light pattern. One problem in previous methods is the time‐consuming procedure of inputting the image. In order to solve the time problem in image input this paper proposes a method which provides stereotaxic vision with two cameras by projecting a relatively complex pattern light on the object, revealing the three‐dimensional information of the object. The measurement method proposed in this paper has the advantage that correspondence between images can be made by repeating the same procedure, based on a virtual projection line called the epipolar line, without using heuristic information. Utilizing the projected pattern and two input images, unique correspondence can be established for a fairly complex projection pattern. Experiments are performed by projecting a slit pattern or a grid pattern and it is found that false correspondence is rarely generated by the grid pattern and a large number of points can be matched.
A discrete software reliability growth model with two types of errors
Authors: Kitaoka Takeshi , Yamada Shigeru , Osaki Shunji 
Published: July 2007

AbstractAs the social missions of computer systems increase, it becomes more important to develop high‐reliability software. For this reason software systems are tested repeatedly to remove latent errors in the testing phase during software development. One of the most interesting methods is to evaluate software reliability by using test data observed in the error‐detection process. In this paper we model the error‐detection process as a stochastic model and introduce several effective measures to evaluate software reliability. In modeling we use the number of test run trials as a unit of the error‐detection period and assume that the cumulative number of software errors detected in an arbitrary testing time interval is a nonhomogeneous Poisson process. Further, we consider the difficulty of error detection because the reliability of software is evaluated from the characteristics and frequency of the errors. Applying the model to the actual test data, we perform the goodness‐of‐fit test and infer the software reliability measures. Finally, we discuss an optimum software release problem based on the software reliability index.
Design of lsi‐oriented digital signal processing system Based on Pulse‐Train Residue Arithmetic Circuits
Authors: Tomabechi Nobuhiro , Kameyama Michitaka , Higuchi Tatsuo 
Published: July 2007

AbstractThis paper describes a design method of high‐speed digital signal processing systems suitable for LSI fabrication. It utilizes the pulse‐train residue arithmetic circuit as a basic building block. This circuit lends itself to parallel and pipeline operations suitable f o r high‐speed digital signal processing, and permits modular‐design of the systems. A new master‐slice LSI on which the pulse‐train residue arithmetic circuits are arranged regularly, is presented. A method of minimizing the chip‐area for NMOS fabrication of the master‐slice is discussed. The layout of the pulse train residue arithmetic circuits on the LSI chip, and several parameters of the master‐slice such as the number of channels are discussed. Some demonstrative examples are presented to show the application of the master‐slice in the design of digital filter. The design method using master‐slices is relatively simple; it minimizes the chip‐count and improves the processing speed.
Determinacy problem in relaxation method‐analysis of asynchronous parallel processing
Authors: Kato Toshikazu , Wakimoto Koji , Inagaki Kosaku , Sakai Toshiyuki 
Published: July 2007

AbstractIn image pattern understanding, global and unspecific processing are required. Thus it is important to develop an asynchronous processing algorithm with high efficiency and MIMD type. This paper formulates and analyzes the determinacy problem on the newly introduced transformation model, as a basic theory for the asynchronous parallel processing algorithm for the pattern information processing. The major results are as follows: (i) a transformation model is introduced which can describe and analyze the mathematically parallel processing algorithm, into the content of the processing; (ii) the determinacy problem is formulated, arriving at a convergence theorem representing a sufficient condition; (iii) a discussion is made from the viewpoint of the determinacy problem on the possibility of asynchronous parallel processing of the relaxation method, which is already applied to the image processing. It is concluded that the asynchronous parallel processing is possible in the discrete and fuzzy relaxations, but is impossible in the linear and nonlinear stochastic relaxations.
Dynamic fault recovery in mesh‐connected parallel computers
Authors: Yokota Takashi , Amano Hideharu , Aiso Hideo 
Published: July 2007

AbstractA trend in computer development aiming at high‐speed processing is high‐level parallel processing using a large number of processing elements. This scheme is becoming more realistic with the recent progress of VLSI technology. On the other hand, there arises a problem of how to cope with the generation of faults with the increased number of processing elements. A faulttolerant computer with multiple redundancy has been developed, but no method has been presented in the parallel computer environment whereby sufficient redundancy against fault can be provided, to recover from fault and to continue the computation without a system down. In general, completeness of data is lost by a fault. In the field of numerical computation, however, there are problems with less stringent requirement for completeness of data (e.g., in iterative solution of a system of equations). This paper discusses the case where such a problem is solved by a parallel computer with lattice topology. Three structural types are proposed for dynamic fault recovery during execution, mutual connection and the method of recovery. The result of evaluation by simulation is shown.
Adaptive Character Segmentation Method Based on Minimum Variance Criterion
Authors: Tsuji Yositake , Asai Ko 
Published: July 2007

AbstractCharacter segmentation is a technique which separates individual characters from character line image. It is one of the most important prerequisites for character recognition. In the past, segmentation of individual characters from a general object, such as mailing address and existing document, had strong constraints imposed on the character segmentation. These included contact between adjacent characters and separation of a single character, thereby preventing the segmentation technique from being a systematic approach. This paper discusses character segmentation, an indispensable means of pre‐processing in character recognition which has been considered to cope with the individual cases. A character segmentation method is proposed which is based on the clustering for the character cluster interval histogram by linear square‐error function, and on the dynamic programming using the minimum variance criterion for separation between character sectioning candidate positions in a line image. The first method is applied to the estimation of the character pitch, i.e., estimating the statistically best character pitch. It also extracts the parameters representing the placement properties for a series of characters. The second method is used to determine in a stable way a series of character sectioning positions. In the experiment, the method is applied to English language mail addresses, containing fixed and unspecified character pitches as well as contact between adjacent characters. A 99.2% correct segmentation rate was obtained for characters and 98.0% was obtained for words, indicating the effectiveness of the method.
Relationships of accepting powers between cellular space with bounded number of state‐changes and other automata
Authors: Ito Akira , Inoue Katsushi , Takanami Itsuo , Taniguchi Hiroshi 
Published: July 2007

AbstractPreviously, we proposed the state‐change‐bounded rectangular‐array cellular‐space acceptor, which is a rectangular‐array cellular‐space acceptor with cells of bounded state‐changes. At that time, we also discussed its basic properties. The major purpose of this paper is to describe the relations among the accepting power of the state‐change‐bounded rectangular‐array cellular‐space acceptor with square pattern as the input and those of other various kinds of two‐dimensional automata. It is shown, for example, that the deterministic rectangular‐array cellular‐space acceptor with the state‐change bounded by a constant, can be simulated by the two‐dimensional alternating finite automaton. At the end of this paper, a family of sets of square tapes which are accepted by the state‐change‐bounded rectangular‐array cellular‐space acceptor, is considered. Also, the closure properties of the operations, such as union, intersection, and projection, are discussed.
Improvement of efficiency of captioning video pictures for the deaf by use of a japanese word processor
Authors: Nishikawa Satoshi , Takahashi Hidechika , Kobayashi Masayuki 
Published: July 2007

AbstractVideo pictures and voice information play an important role in the present‐day social life. Captioned video tapes are one of the most important sources of information for hearing‐impaired people. In Japan, however, the usual method of captioning uses telop cards because of the complexity of the Japanese language. Moreover, this method requires considerable time and money. We developed a video information processor that superimposes the printout of a Japanese word processor on the images of video devices. As a result, anyone (not necessarily a professional operator) can make captioned video tapes easier, faster, and cheaper than by the usual method. In particular, the captioning process speeds up the usual method by about ten times. This enables captioning on video pictures faithful to speech and hence is effective for enriching information in video pictures.
Recognition of human kidney ultrasonic organ images by two‐dimensional dp matching method
Authors: Yamada Hiromitsu , Yamamoto Kazuhiko , Matsuura Masahiko 
Published: July 2007

AbstractThis paper discusses the application of two‐dimensional dynamic programming (DP) matching to ultrasonic kidney images. By introducing the model‐matching technique, feature extraction of the object organ is achieved. It is also possible to reconstruct the three‐dimensional structure of the organ. The proposed technique has the following features. (1) Unlike the monotone continuous condition employed in speech recognition, the two‐dimensional DP method has no time‐sequence constraints. (2) The recognition performance is improved by utilizing the edge information. (3) Hierarchical construction of DP from coarse to fine grids improves the processing speed. (4) The method allows man‐machine interaction by fixing a point on the contour of the object. (5) The method can be applied to time‐series and/or three‐dimensional consecutive images and the speed is improved by using the object from the previous image.
An efficient algorithm for the dot generation of arbitrary ellipses
Authors: Koda Goro , Shimizu Kensuke 
Published: July 2007

AbstractThis paper presents an algorithm which provides a high‐speed dot representation of an ellipse on the raster‐scan graphic display device. In the usual graphic display, straight‐lines and circles are used as the graphic primitives. In the three‐dimensional graphics, a projection on the two‐dimensional plane is often employed where a circle is in general projected as an ellipse. When a curve with rapidly varying curvature is to be represented, the approximation can be effected by a fewer number of components if ellipses are used instead of circles. From such viewpoints, an efficient generation algorithm for the ellipse is required. The ellipse considered in this paper need not have the long or short axis parallel to the coordinate axis. The lengths of the long and the short axis are arbitrary, and the correct dot generation is observed for an extremely oblong ellipse. The location of each dot is determined so that the deviation from the ellipse is small. Sometimes the past method does not work due to the fact that the ellipse is a two‐valued function. By contrast, this paper contains a simple scheme to convert the ellipse into a single‐valued function. To improve the speed of the algorithm, only addition‐subtraction and conditional test are used in the internal loop determining the dot location.
Relationship between the accepting powers of (k, l)‐neighborhood template δ‐type one‐dimensional bounded cellular acceptors and other types of two‐dimensional automata
Authors: Taniguchi Hiroshi , Inoue Katsushi , Takanami Itsuo , Seki Shigeko 
Published: July 2007

AbstractPreviously, we proposed a (k, l)‐neighborhood template δ‐type bounded cellular acceptor (abbreviated as δ‐‐BCA (k, l)), which is composed of a pair of converters and a configuration‐reader and operates on a two‐dimensional tape. Its basic properties have already been discussed. δ‐BCA (k, l) is a parallel automaton, which, in a sense, is a generalization of the one‐dimensional bounded cellular acceptor. This paper attempts a more detailed examination of the properties of δ‐BCA (k, l), and compares its accepting power with those of other automata operating on the two‐dimensional tape. The objects of comparison are the various kinds of two‐dimensional finite automata and various kinds of parallel sequential array acceptors. It is known that there exists an equivalent tape‐bounded Turing machine for each of these automata in the sense of the accepting power. Consequently, the comparison of the accepting power of δ‐BCA (k, l) and those of two‐dimensional automata amounts in a sense to the evaluation of the accepting power of δ‐BCA (k, l) in terms of the tape complexity of the tape‐bounded Turing machine.
The emptiness problem for indexed language is exponential‐time complete
Authors: Tanaka Shinichi , Kasai Takumi 
Published: July 2007

AbstractThe class of indexed languages properly includes the class of context‐free languages and is properly included in the class of context‐dependent languages [1]. The emptiness problem (the problem of determining whether or not the given language is empty) is polynomial‐time complete for the class of context‐free languages and is undecidable for the class of context‐dependent languages. The recognition problem (the problem, given a language L and word w, of determining whether or not w belongs to L) is polynomial‐time complete for the class of context‐free languages and is polynomialspace complete for the class of contextdependent languages. This paper shows that both the emptiness and recognition problems are exponential‐time complete for the class of indexed languages. It is known in the pebble game [2] that the problem of determining whether or not the first player has the winning strategy is exponential‐time complete. This paper reduces the problem to the emptiness problem for the class of indexed languages in the logarithmic space, indicating the exponential‐time difficulty of the emptiness problem for the indexed language. Since Aho has shown that the problem can be answered in exponential time, the exponential‐time completeness is shown. The exponential‐time difficulty is also directly indicated from the fact that the emptiness problem is exponential‐time complete. Consequently, the recognition problem is also exponential‐time complete.
A distributed algorithm for maximum flow on processor‐arrays
Authors: Onaga Kenji , Marumoto Satoshi 
Published: July 2007

AbstractThis paper considers the maximum flow computation of a network N = (V, E, C), and presents a design of its hardware algorithm which executes the computation in a distributed and MIMD way by a processor array of the same structure as N. The node of N corresponds to a node processor and the edge to a communication link carrying the computational information. The computation of the flow is performed on the flow table FTABLE established on each node. Each node processor performs distributed and MIMD instructions indicated by tokens which are generated in particular nodes (host, input and output nodes) modified and transferred through adjacent nodes. The proposed algorithm can be readily utilized in hardware simulation of traffic and communication networks.