bluuebunny/crossref_metadata_2025_split huggingface dataset:
Spline approximation of line images by modified dynamic programming
Authors: Ishimura Nobumichi , Hashimoto Takeshi , Tsujimoto Shuichi , Arimoto Suguru 
Published: July 2007

AbstractThe image data generally requires a large memory area and it is often necessary to improve the processing efficiency by compressing the data. This paper discusses a method of data compression in which two kinds of cubic spline functions of classes C1 and C0 are used to approximate the line image and the image data are replaced by the parameter set of the spline function. A method is proposed to optimize the knot positions of the spline function by dynamic programming. The effect of the different continuity conditions of the spline functions on the data compression is discussed. In general, dynamic programming requires a large amount of computation. A modified dynamic programming is also proposed which can decrease the computation time without substantially affecting the accuracy of approximation. Such methods are robust, being independent of the image features and are expected to be generally applicable to various kinds of line images.
Iterative Gradient Method for Movement Estimation
Authors: Wada Masahiro , Yamaguchi Hirohisa 
Published: July 2007

AbstractIn the processing and coding of moving images, the movement of the image is one of the most important parameters. In the realtime processing, it is desirable that the movement be estimated with less computation and simple hardware. From such a viewpoint, this paper proposes a movement estimation method with less computation and satisfactory estimation accuracy. In the proposed method, the gradient method is applied iteratively to the pixel blocks, improving the accuracy of estimation while retaining the merit of the gradient method. This paper describes first the principle of the gradient method, indicating the deterioration of the accuracy. The trend is demonstrated by experiment. Then the principle of the proposed method is described, and it is shown by theoretical discussion and simulation experiment that the accuracy of estimation can be improved. Finally, from the standpoint of motion‐compensation coding, a comparison is made with other methods based on the interframe error entropy. As a result, it is shown that estimated movement among adjacent blocks can be utilized in the proposed method, and a motion‐compensation performance can be obtained which is as stable as in the matching method, which requires a larger amount of computation.
Some techniques for document and image preparation
Authors: Suenaga Yasuhito 
Published: July 2007

AbstractAs a preliminary to the coming era of new media, editing and preparation techniques for document and image are becoming more important. This paper discusses various kinds of technqiues needed in the realization of more powerful and convenient document‐image systems. The topics discussed in this paper are: (i) facsimile‐based document and image editing using auxiliary mark recognition; and (ii) construction of videotex image by electronic pen/eraser. As an example, of (i), the construction and operation of FLEX (a Facsimile‐based manuscript Layout and Editing system by auxiliary mark recognition) are described. This system receives through facsimile the handwritten or printed text and graphic manuscript as the source information, together with the auxiliary marks for correction, and recognizing marks perform the automatic editine. Some experimental results of document and image editing are shown. As an example of (ii), an experimental system for a picture drawing and coloring system using electronic pen/eraser is presented, together with an experimental result of color image preparation. A method for editing and preparation of videotex image is outlined. Finally, a discussion is made on the characteristics required in the future document‐image editing and preparation system.
Process assignment on multiprocessor with communication contentions
Authors: Shimojo Shinji , Miyahara Hideo , Takashima Kensuke 
Published: July 2007

AbstractThis paper discusses the process assignment problem in the multiprocessor system with communication contentions due to interprocess communications (IPCs). As a model for the multiprocessor system, a system is considered in which the processing elements (PEs) with local memory (LM) are connected through a communication network (CN). As a model for the distributed‐type algorithm realized on such a system, a scheme is considered in which the process assigned on a PE is executed with IPC with other processes. Based on these models, a problem is formulated where a set of processes is assigned on the multiprocessor system so that the overall processing time is minimized. Especially, for the problem where a single common bus is used as the CN and the processes are assumed as uniform, the optimum number of PEs is determined by introducing an approximation to the waiting time for the CN. The strict solution obtained by exhaustive search is compared with the approximate solution, and the validity of the approximate solution is evaluated.
Embedding area of d‐way shuffle graph on a VLSI model
Authors: Wada Koichi , Hagihara Ken'Ichi , Nobuki  , Tokura  
Published: July 2007

AbstractAn important problem in the design of a VLSI chip is that of determining how much area is taken to embed a graph G into a planar grid when the VLSI chip is modeled using a graph called a planar grid and a circuit is expressed by a graph G representing wiring connections between elements. Discussed for various graphs will be the upper and lower bounds on the planar grid area into which a graph is embedded. In this paper we consider the problem of embedding a d‐way shuffle graph into a planar grid, using a model which has been extended so that a graph with degree five or more can be embedded. d‐way shuffle graphs are also of theoretical interest since data exchange can be done in high speed like a shuffle exchange graph and a CCC. By using a relationship between the number of crossings of a graph and its area, we show that for the infinite number of d and k an area proportional to dk+1/k)2 is required to embed a dk‐vertex, d‐way shuffle graph. Using this result, the previous lower bound of the area can be improved. Further, for an embedding of a graph G we present an embedding method of G which uses a graph with a known embedding area. By using this result we show that if d is a power of 2, a dk‐vertex, d‐way shuffle graph can be embedded in an area proportional to (dk+1/2)2.
A geographic information overlay method for regional analysis
Authors: Tsurutani Tateyuki , Kasahara Yutaka , Miyashita Toshiaki 
Published: July 2007

AbstractA geographic information overlay method is defined whereby the intersection of figures caused by overlaid maps is detected and socio‐economic information about the detected region is restructured. By this method map information compiled with the different social attributes can be compared and their consistency can be checked for regional analysis. This method can be used as an alternative simulation model in generating indices for certain problems. For given map data geometric figure intersections are treated by intersection calculus theory in computational geometry. For socio‐economic information, integration and distribution of numerical data and representation of attributes are implemented from the practical point of view. As a case study, this method is applied to the overlay of geological and administrative maps in earthquake disaster prevention. It is found that the method is effective in achieving consistency between maps with different attributes and can be an alternative method to calculation of risk factors by complex algorithms.
ALU control code assignment
Authors: Takagi Shigeru 
Published: July 2007

AbstractThe number of gates in the ALU decoder depends on the control code assignment in the specification of the functions. This paper presents an assignment method which achieves the quasi‐minimum number of gates in the decoder. The ALU functions are specified by the function identifiers and the relations between the data input and output terminals. The logical structure model for ALU is constructed and together with the function specifications, leads to the logical expression for the decoder. The obtained logical expression is the logical disjunction of the function identifiers. The function identifiers are replaced by the control codes, and the code assignment is made so that the number of product terms is the quasi‐minimum when the simplification is made. The assignment time for the control codes of ALU with 32 function is approximately 160 s in the 2 MIPS computer.
Automatic position detection method for mounting ic parts on high‐density printed circuit boards
Authors: Shima Yoshihiro , Kashioka Seiji , Sakou Hiroshi , Suzuki Kunio 
Published: July 2007

AbstractIn the automatic mounting system, which mounts electronic parts on a printed board, a problem is that the object printed circuit board is becoming of higher density and the parts have a fine lead structure. It is necessary that the positions of the part and the printed board should be detected with a high accuracy. It also became important to cope with the diversified parts with different shapes. This paper proposes a new practical method of automatic position detection to solve those problems. The proposed system is composed of the position detection process for the part and the position detection process for the printed board. In the process for position detection of parts, the positions of more than one lead are detected by the pattern matching, determining the similarity between partial images, and the position and the inclination of the part are calculated based on the result of matching. The viewing field is set so that only several leads are observed by the TV camera, and the object lens is moved to X and J directions so that the viewing field can be shifted to any desired position. In the position detection of the printed board, the positions of the two marks printed on the board are detected, and the position and the inclination of the printed board are calculated based on the mark positions. To evaluate the effectiveness of the proposed method, the position detection experiment was performed for the actual part and printed board, indicating that the position can be detected with a high accuracy.
3‐D measurement of polyhedron position and orientation using multiple binary images
Authors: Hisano Atushi , Yamaguti Yoshinori , Masaki Toshimiti , Saka Kazuhiko 
Published: July 2007

AbstractThis paper describes the measurement system for the three‐dimensional position and orientation of a polyhedron by binary image processing. In the proposed system, to simplify the binary image processing, the shadow is eliminated by a coaxial illumination and the contrast of the image is enhanced by placing a retroreflector in the background. The three‐dimensional position and the orientation of the polyhedron is calculated from the three‐dimensional coordinates of the feature points obtained by the triangulation principle. The trinocular vision is employed to cope with the correspondence problem. The labelling of the feature points is executed with high speed by the maximal clique method. The accuracy of the position measurement in the proposed system is 1.0 percent of the visual field, indicating the usefulness of the method.
Decoding method for shortened fire codes and its application to VLSI processor
Authors: Iwasaki Kazuhiko , Funabashi Tsuneo , Ueno Tatsuaki 
Published: July 2007

AbstractThe disc system is one of the areas of applications for the error‐correcting code. For this purpose, a Fire code with the generating polynomial G(x) = (xc + 1) × p(x) is frequently used. This paper considers the shortened Fire code, where the length of the code can be reduced according to the length of the record used. A decoding method suitable for VLSI is proposed. It is noted that the content of the feedback shift register with p(x) as the divider returns to the original pattern when it is shifted by the period e of p(x), and the speed is improved by ignoring the integer multiple shifts of e. This decoding method requires less hardware (i. e., shift registers and counters), and has the merits of easiness in design and expandability, according to the record length. The principle is expanded to the general cyclic code. The proposed decoding method is implemented on the hard disc controller (peripheral LSI for HDC 16 bit microcomputers). A 32‐bit Fire code is used. For a typical record length of 512 bits in the disc system, the speed was comparable to that of the high‐speed decoding. The error‐correcting part is composed of 6700 Tr, which is 5.2% of the whole system (129 kTr). This figure demonstrates the practical usefulness of the proposed method in VLSI design.
A method to reconstruct shape and position of three‐dimensional objects using photometric stereo system
Authors: Hong Hai , Kawashima Toshio , Aoki Yoshinao 
Published: July 2007

AbstractThis paper proposes a reconstruction method for the shape of a three‐dimensional object. The proposed method is the intensity‐difference stereo method utilizing several gray‐scale images obtained by a fixed camera and a light source with varying position. In the earlier method, the surface shape of the object is restored based on the gradient of the object surface determined by the intensity‐difference stereo method, where other methods must be combined in order to determine the three‐dimensional position of the object. In the proposed method, the shadow information is combined with the intensity‐difference stereo method, and an algorithm is proposed which can determine not only the three‐dimensional shape, but also the absolute coordinate in the three‐dimensional space with the plane carrying the object as the reference. As a result of experiment, it was verified that the proposed method can be applied to the case where more than one object is involved.
Transformation of orthogonal coordinates into polar coordinates using DDA‐computation of the angle of rotation of an object
Authors: Ueno Masayuki , Hama Hiromitsu , Yamashita Kazumi 
Published: July 2007

AbstractThis paper describes the algorithm which directly processes the gray‐level image to determine the rotational angle. A complex computation is required to transform the orthogonal coordinates into the polar coordinates. In this paper, a transformation algorithm is proposed using DDA, which is a high‐speed algorithm to generate the digital segment. To evaluate the usefulness of the proposed algorithm, a computer experiment was performed using several input images from a TV camera. The mean error of the rotational angle was ±0.8 deg, and the maximum error was ±3.9 deg, which is quite satisfactory.
Verification system for freedom from deadlock of communicating sequential processes
Authors: Murakami Masaki , Inagaki Yasuyoshi 
Published: July 2007

AbstractThe communicating sequential processes (CSP) proposed by Hoare are a model for parallel computation in which the processes do not share a variable and perform the interprocess information exchange and synchronization by the communication instruction function. This paper first extends the verification system for the partial validity of CSP previously proposed by the authors and an axiomatic system is presented by implementing part of the inference rules which can deal with the deadlock‐free property of CSP. The soundness of the system is shown. The system previously proposed by the authors can provide the inferences in a concurrent way independently of the processes, without following the sequential procedure of proving a property for a process and proving a certain relation between processes. The system proposed in this paper employs a similar procedure and verification is made in parallel for the partial validity and deadlock‐free property of CSP.
Computer classification of rosette‐forming cells from microscope images
Authors: Ohta Hiroki , Ozawa Shinji , Miyauchi Minami , Takata Hajime , Sonoda Akira , Iri Hisami 
Published: July 2007

AbstractThis paper presents a method of rosette‐forming cell classification by image processing. This method is useful in the field of clinical immunology in dividing lymphocytes into some subpopulations and quantifying each component. The “Rosette Formation Test” is one of the most popular methods of classifying lymphocytes which consist of the different functional subsets. However, the rosette‐nonrosette judgment has been done by a human expert using a microscope. Considerable manpower is needed to judge rosette/non‐rosette cells. To solve this problem, we present a computer classification system of rosette‐forming cells in the microscopic image. The system constructs an accumulative gray‐level histogram for each cell, extracts features from histograms, and then classifies cells with the discriminant function.To confirm the effectiveness, we examined the classification system for several images. As a result with learning data (991 cells), the accuracy of classification is 84.5 percent, and the correct rate of resetted and nonrosetted cells is 86.6 percent. With unknown data (509 cells), the accuracy of classification is 84.1 percent, and the correct rate of resetted and nonrosetted cells is 86.2 percent.
Extraction of Nth‐order features of line patterns considering redundant information
Authors: Nishiyama Norifusa , Inoue Kazuo 
Published: July 2007

AbstractThe extraction of geometric features is a basic and significant process for pattern recognition. This paper proposes a method of extracting geometric feature by referring redundant information around the feature point.For written or oral information, even if some information is unable to be understood, we can infer meaning by knowing redundant information. Using the same principle as mentioned in the opening paragraph, this paper introduces a method to extract the geometric feature by detecting redundant information around the feature point.Finally, to verify the usefulness and effectiveness of this method, computer simulation experiment is performed on test patterns and handwritten numerals.
Descriptive power of synchronized shuffle expressions
Authors: Uoi Hirotaka , Araki Toshiro , Tokura Nobuki 
Published: July 2007

AbstractAs a model to describe the concurrent system with a synchronization mechanism, Holenderski has proposed the synchronized shuffle expression (SSE). SSE is a shuffle expression obtained by adding a synchronized shuffle operator with its closure and projection operator. This paper considers various subclasses of SSE. It is shown that the class of languages represented by the subclass excluding the projection operator is the same as the class of recursively enumerable languages. The hierarchical relations among the subclasses are described.
Three‐dimensional motion analysis of scene containing multiple moving objects from image sequence and depth
Authors: Yamamoto Masanobu 
Published: July 2007

AbstractOptical flow analysis is a powerful means to extract an object from the dynamic image. Not only can it extract an object, but it can also recover the three‐dimensional structure. However, in practice, there are many cases where the optical flow is difficult to obtain or the motion of the object does not permit a unique interpretation. Based on the gradient method, this paper proposes a method of three‐dimensional motion analysis for multiple moving objects which may include an object for which a unique interpretation of the motion is difficult. By the gradient method, the three‐dimensional motion parameters of a rigid object can be estimated without using the optical flow as a least‐square‐error solution for the system of linear equations, if the three‐dimensional structure of the object is already given. Based on the residual square‐sum error in the estimation, the image plane is segmented if it contains regions of different motions. If the motions are recognized as being similar, the regions are merged. Thus, the object is extracted by iterating the segmentation and merge on the image plane. The uniqueness of the motion is evaluated by the condition number for the coefficient matrix of the system equations. If the motion of the extracted object can be interpreted uniquely, the displacement vector can be determined accurately by iterating the estimation of the object motion.
Finding of objects moving against a static environment by a moving observer
Authors: Yagi Yasushi , Asada Minoru , Tsuji Saburo 
Published: July 2007

AbstractThis paper describes a method by which a robot with vision can detect moving objects or obstacles in an environment, by analyzing the consecutive images obtained during its movement in an artificial environment such as inside of a building or a plant. In this paper, it is assumed that the environment is a corridor in a building, which satisfies the following two conditions.(1) The wall of the corridor is planar and is vertical to the floor, and (2) the floor is flat. Under these two assumptions, the optical flow pattern can be estimated for the background (corridor). Assuming that the moving object is performing a parallel translation, the moving object can be extracted from the background by comparing the relative magnitudes of their optical flows, providing the necessary informations to the moving robot. The proposed method has a versatility since no geometrical model is employed which is composed of numerical data. The method utilizes only those properties which are valid in most cases of the artificial environment. An experimental example, the result of analysis for a corridor in a building is shown.
Pattern‐separating function of two‐layered random nerve‐net receiving a fixed number of inputs
Authors: Torioka Toyoshi 
Published: July 2007

AbstractThe pattern‐separating function of the two‐layered random nerve‐net, which has forward inhibitory connections, depends on the input structure of the second layer. Among the nerve‐nets with various input structures, the nerve‐net with the fixed number of input connections exhibits a very interesting property that under a certain condition, the input patterns are separated uniformly, independently of the overlapping rate of the patterns. This paper derives the theoretical expression for this property as a polynomial of the overlapping rate among the input patterns. Based on the theoretical expression, the condition is derived for the input patterns to be separated uniformly, independently of the overlapping rate among patterns. Then an example is considered and the condition is examined in detail. The effects of the input pattern and the firing rate of the second layer on the separation are discussed. As a result, it is shown that the pattern separation can be improved by controlling the firing rate of the second layer to a small value, and the patterns with larger firing rates are better separated.
Avoiding peaking phenomenon of the quadratic discriminant function
Authors: Kimura Fumitaka , Takashina Kenji , Tsuruoka Shinji , Miyake Yasuji 
Published: July 2007

AbstractThe performance of the discriminant function is degraded if the parameters used contain estimation errors. A peaking phenomenon is known in which the classification rate reaches the maximum for a certain feature dimension, but decreases with the further increase of the feature dimension. This paper reports the result of experimental examination of the relations of the classification rates of the Euclid distance, the quadratic discriminant function [1] to the feature dimension. It is shown that the modified quadratic discriminant function corresponds to the discriminant function where the maximum‐likelihood estimation for the covariance matrix of the quadratic discriminant function is replaced by a kind of pseudo‐Bayes estimation, and suppresses the peaking phenomenon.