bluuebunny/crossref_metadata_2025_split huggingface dataset:
Rough classification of handwritten characters by divide‐and‐unify method
Authors: Ejima Toshiaki , Katsuyama Yutaka , Kimura Masayuki 
Published: July 2007

AbstractA new method is proposed in which all the characteristic vectors are classified into subvectors. Then a rough classification of handwritten characters is performed by unifying classification information obtained in each subvector all over again. In rough classification, “soundness” of classification and “quickness” of processing are required. To perform rough classification effectively, it is necessary to store considerable classification information in a dictionary. On the other hand, to implement processing quickly, it is necessary to decrease the amount of computation by condensing the classification information.The method herein not only realizes efficient rough classification through decreased redundancy by condensing classification information independently for each subvector of the characteristic vector, but also realizes a sounder rough classification by unifying classification information obtained in each subvector all over again. In the classification experiments, the amount of processing could be reduced to one‐fourth or one‐fifth that in the previous method to examine all the character classes without reducing a successful classification rate; this demonstrates the effectiveness of the method.
Method of extracting car number plates by image processing
Authors: Agui Takeshi , Choi Hyung Jin , Nakajima Masayuki 
Published: July 2007

AbstractThis paper proposes a method of extracting regions of car number plates using a parameter‐restricted Hough transformation (PRH). The PRH algorithm, in which the range of the parameter plane is restricted, reduces the computation time and the storage capacity more effectively than the usual Hough transformation. In this method, some features of car number plates are used.
Computational complexity of the file allocation problem in distributed database systems
Authors: Yamasaki Hiroshi , Hirata Tomio , Imai Masaharu , Ibaraki Toshihide 
Published: July 2007

AbstractIn most studies of the optimum allocation problem of the data file in the distributed database system, access to individual files is considered independent, ignoring the relation among files. This assumption may not be appropriate in actual cases. In this paper, the expression for the query cost is simplified as long as the essential aspect of the problem is maintained. A formulation is made based on a clear distinction between the part of the file which can be considered as independent in the individual access, and the part which is not. Then for each formulation, the computational complexity in the optimum file allocation is discussed. It is shown that the problem for the former can be answered in a polynomial time, while the latter is NP‐hard.
Speed‐up algorithm of color image quantization
Authors: Agui Takeshi , Shimizu Masatomo , Nakajima Masayuki 
Published: July 2007

AbstractThis paper discusses the speeding‐up of the color image quantization procedure. The color image quantization aims at the most faithful representation of the original image using a limited number of colors. The color image quantization is composed of two processings which are the construction of the color table and the construction of the quantized image. In the construction of the quantized image. a method is usually employed in which the color of each pixel is compared with all colors in the color table. However, this method requires a long processing time, occupying more than 90 percent of the total processing time. From such a viewpoint, this paper aims at the speeding‐up of the color image quantization, by reducing the processing time for construction of the quantized image. A method is proposed for speeding up, where the pixel and the color table are connected indirectly using the look‐up cube composed of 32 × 32 × 32 equipartitioned RGB space. By this method, the number of comparisons between the pixel and the color table is reduced.
Fast direct interpolation for computer graphics applications
Authors: Akamatsu Norio , Sakou Nobuaki , Craigin Robert 
Published: July 2007

AbstractInterpolation by the widely used spline function method requires excessive computation time because floating point arithmetic is used whenever a polynomial coefficient is determined. This paper presents a direct interpolation method (Fast Direct Interpolation) which attains sufficient precision with fixed point arithmetic. The processing speed and accuracy of the FDI method are also investigated. Since the FDI method can easily be implemented in hardware and adapted to parallel processing, it is suitable for the high‐speed processing demands of computer graphics. An optimum FDI interpolation parameter is determined by considering various practical applications. Finally, continuity is proved for results obtained from fast direct interpolation.
A pressure—sensitive graphic tablet enabling detection of input—pen—contact area and its application to electronic blackboard system
Authors: Sato Yuichi 
Published: July 2007

AbstractMany kinds of digitizers for inputting handwritten letters and drawings into a computer have been used in practice. These digitizers cannot detect the size of an input pen contact area, although it can detect its position. This paper offers a new system which can detect both the position and size of a point. The system consists of an input coordinates‐detector and point‐size detector. The former consists of two groups of flat electrodes (top and bottom) for detecting the position of an input point, resistor, a constant‐current source, and operational amplifiers. The latter consists of size‐detection electrodes (buried in either the top or bottom position‐detection flat‐electrodes, with regular intervals), a voltage source, operational amplifiers, and analog switches. The detection of the position or size of an input is carried out by using a time‐division procedure. This paper describes the structure of the input surface, the principle of input detection, and that of input‐point‐size detection. As an example of application, a prototype electronic blackboard is described, and with its characteristics are measured, e.g., its input and display characteristics, size‐discriminated characteristic, and linearity.
Optimization algorithm for parallel demand—driven computation of functional programs
Authors: Ono Satoshi , Takahashi Naohisa 
Published: July 2007

AbstractThis paper proposes a new optimization algorithm for the demand‐driven computation suited to the parallel processing of the functional program. The optimization is performed for three points: the preevaluation of requisite parameters; the efficiency of demand propagation; and the analysis of the partialvalue dependent attribute set. To reduce the computation required in the optimization, a hierarchical approach is employed, which is composed of the interfunctional analysis to process the whole program in parallel, and the intrafunctional analysis for each function definition as a separate phase. Using the proposed method, the successive function in the discrete domain can be calculated efficiently based on the fixed‐point computation rule, by providing a certain extension of the data‐flow machine executing in parallel the data‐driven computation.
A method of license plate extraction using a fast pyramid hierarchical hough transformation
Authors: Agui Takeshi , Choi Hyung Jin , Nakajima Masayuki 
Published: July 2007

AbstractPreviously, the authors proposed a method of extracting the region of a vehicle number‐plate using the Hough transformation with a restricted parameter plane. The method offers a significant reduction of the amounts of memories and their processing time which are required for storing the parameter plane in a conventional Hough transformation.This paper describes a further improvement of the method in its processing speed. In the processing, first, a pyramid hierarchy is applied to the original image; second, some preliminarily selected straight lines are extracted from the image with a pyramid hierarchy; finally, the region of the original image corresponding to each straight line is obtained. This method restricts the computation of the plane‐region‐distracted Hough transformation into the region of the straight lines already obtained so that calculation points and the processing time are reduced. As an example of application of the method, extraction of license plates is described.
A neural network model composed of multioscillators to generate low—frequency biological rhythms
Authors: Endo Shuji , Kinouchi Yohsuke , Ushita Tomiyuki 
Published: July 2007

AbstractThe biological system has low‐frequency rhythms, such as a circadian rhythm. In general, it is considered that the source of the circadian rhythm is mostly the neural system, such as optic lobe and suprachiasmatic nucleus. This paper proposes a neural network model which can generate the low‐frequency biological rhythm, and discusses its characteristics. The model is composed of the set of neural oscillators composed of excitatory‐inhibitory neuron pairs, together with a neuron taking the sum of the oscillator activities. By feeding back the activity of the summing neuron to the oscillators by a suitable magnitude, the proper frequency of the whole model is decreased, realizing the low‐frequency rhythm. The generation condition for the low‐frequency rhythm is derived through the approximate analysis of the model and the computer simulation. The properties of the generated rhythm are discussed.
A method of generating facial expressions using a database‐driven animation system
Authors: Noguchi Norimasa , Agui Takeshi , Nakajima Masayuki 
Published: July 2007

AbstractPreviously, numerous methods of computer animation have been proposed. However, most of those methods are based on the key frame, which requires human specifications, necessitating a certain amount of skill on the part of the operator. This paper proposes a system based on database‐driven animation construction. The system has two databases: one for the figures data, from which the motion is considered; and another for registering the motion data. Since the motion data are stored in the database in a figure independent form, a large amount of animation data can easily be constructed from a small amount of data. This paper describes a system which constructs the human facial expressions by the database‐driven animation construction. The representation of the facial figure and expressions required in the construction, together with its data structure, are described. Finally, the result of experiment is presented.
Transfer movement control of mobile robot using two circular arcs
Authors: Ohuchi Takao , Ohtomo Teruhiko , Satoh Nobuhiro , Yamada Narihide 
Published: July 2007

AbstractThis report describes a method of controlling a robot vehicle to move smoothly on a visually natural path. In this method, discrete points which the robot passes, and directions toward which it moves, are provided on an arbitrary coordinate system given in a movement environment. The continuous curve required for the robot vehicle to move is represented by a total curvature function obtained by accumulating curvatures of curves. Using the function, an algorithm is obtained for generating the robot moving path from interpolation of two circular arcs containing both the lengths and curvatures of the two circular arcs. The position at which the robot is passing and the direction toward which it is moving are measured based on the principle of the triangle survey for three reference patterns set in the movement environment. This is possible by measuring the directions from the current position to the patterns with an ITV camera. This method produces a directional error caused by the roughness of the step angle (0.9) of the stepping motor driving the ITV camera. This paper proposes a method of compensating the directional error by taking into account the number of pixels in pictures taken per step. This system has the averaged position measurement error of 0.8 percent against the coordinate system including the reference patterns. From the result, it is proved that a comparatively simple method enables the moving path of a robot to be controlled accurately.
A geometrization of the discriminal process model on the sensory system with several inputs and a single output
Authors: Takiyama Ryuzo 
Published: July 2007

AbstractThis paper presents a geometrical version of Thurstone's discriminal process model for the multiinput single‐output sensory system. As the first step, the probability density function for the discriminant process is defined. The parameters of the probability density function is the mean and the variance of n stochastic variables. It is assumed that each of the variances is given as a linear function of the mean values. The space spanned by the parameters (n means) is defined and called the discriminal space. The fundamental metric is introduced into the discriminal space using Fisher's information matrix, and the resulting space is regarded as an n‐dimensional Riemannian space. The geometrical structure of the discriminal space is examined, and clear descriptions are made for the essential meaning of the response function, the relation between the discriminal process model and the psychophysical function, and a pertinent analogy between the concept of difference thresholds and the discriminal process model.
Space‐time theory GQOT and its application to concurrent processes
Authors: Tanabe Koichiro , Suzuki Atsuyuki 
Published: July 2007

AbstractThis paper discusses a logical verificational theory GQOT for concurrent processes which communicate and synchronize by asynchronous message passing. In concurrent processes, especially, in distributed systems, each process acts independently, and yet one operation is done as a whole by communicating and synchronizing. Thus, regarding each process as having its own local time, we formalize each by a temporal theory QOT. Then regarding all the concurrent processes as a complete graph with each process as a node, we formalize it as space G. GQOT is the merge of G and QOT. In this paper we define this GQOT and, moreover, to make it more suitable for concurrent processes, introduce a sort of action, concept of interval‐time and an operator “next.” Then, we show the description and verification of the concurrent processes and its properties.
High‐speed addition and subtraction using a minimum redundant p‐ary representation
Authors: Tamesada Takeomi 
Published: July 2007

AbstractIn redundant binary representation, 1, 0 and 1 are used in each digit. It is known that the representation can realize a parallel high‐speed addition where a carry propagation over two or more digits is not produced, which helps to execute various functional computations at a high speed. By further extending the idea of the redundant binary representation, the redundant P‐ary representation can be constructed with P (= 2, 3, 4, …) as the base. In the representation, K negative integers 0, 1, 2, …, P ‐ 1, can be used as the digit, in addition to the usual P positive integers 1, 2, 3, …, K (= ‐K). When K = 1, the redundant P‐ary representation is called the minimum redundant P‐ary representation. This paper considers the minimum redundant P‐ary representation, and shows that an addition algorithm exists where the carry propagation over more than two digits is not produced for arbitrary base P, as in the case of the redundant binary representation. By increasing P in the proposed algorithm, the digits of the data can be reduced which will lead to a high‐speed functional computation device with a simple structure.
A method of generating user‐desired service macro in an icon‐based environment
Authors: Takada Hisayasu , Suzuki Tatsuo , Kato Shuichi 
Published: July 2007

AbstractIt is desirable that office workstations be provided for each office worker with his/her own man‐machine interface and services. This paper describes a service environment in which the user can designate the desired value for each service parameter, and can generate new services by modifying and/or combining the primitive services. The workstation automatically generates the user's own interface and services according to his/her operation sequences on the display screen, where special icons, called item icons, as well as desktop icons are displayed. Item icons are passed among application programs.
Planning support system for craniofacial surgery using CT images
Authors: Yasuda Takami , Hashimoto Yasuhiro , Yokoi Shigeki , Toriwaki Jun‐Ichiro 
Published: July 2007

AbstractThis paper describes the support system NUCSS (Nagoya University Craniofacial Surgical‐Planning System), which supports by computer the planning of craniofacial surgery using CT image. This is a total surgery planning‐assist system which plans the craniofacial surgery made traditionally by the surgeon by cutting and pasting pieces of paper on a two‐dimensional sketch of the skull image. Instead, the system displays the three‐dimensional image using computer graphics, and the planning is made interactively on the image. The major functions of the system are as follows. Generation and display of three‐dimensional image, three‐dimensional distance measurement on the skull, planning and execution of surgery on the side view of the skull, bone removal from arbitrary direction, and prediction of face after surgery. The features of the system are that the bone of arbitrary shape can be cut and shifted, and the face after surgery can roughly be predicted. This had been impossible in the traditional system.
Extended photometric stereo for an object with unknown reflectance property
Authors: Iwahori Yuji , Hiratsuka Noriharu , Kamei Hiroyuki , Yamaguchi Shoichiro 
Published: July 2007

AbstractConventional Photometric Stereo can obtain the surface gradients of an object when its reflectance property is known. This paper proposes a new method of accurately obtaining the surface gradients with three light source directions under the assumption that the reflectance property of the surface is unknown. Assuming that the reflectance property is uniform over the entire surface, surface gradients can be obtained by the following two steps: (1) reflectance property parameters and the gradients of the suitable surface elements that characterize the reflectance property by solving the nonlinear simultaneous equations for them, so that a pseudo‐reflectance map is obtained; and (2) the gradient of each surface element is determined by using parameters obtained by (1). The reliability for the values of the reflectance property parameters (i. e., those for the pseudo‐reflectance map) can be improved by applying the method of selecting the surface elements that are sensitive to the reflectance property; this is called the characterized surface elements selection method. In computer experiment with 8‐bits shading resolution using three parallel light sources, the values of the reflectance property parameters can be obtained in optimum, and the accurate surface gradients for a glossy object can be determined.A mean square error in a depth measurement becomes an order of 10−2, confirming the usefulness of the proposed method.
Transformation rules for automated design of circuits by theorem‐proving techniques. Transformation from recursion equations to circuit descriptions
Authors: Harao Masateru , Iwanuma Kouji 
Published: July 2007

AbstractOne of the important aspects in the design of automation system is to establish some automatic transformation method from the specification by high‐level language, which is suitable for designer to the description at the circuit level. This paper formulates the circuit design as the transformation, from the recursion equation, which is a high‐level description, to the functional network FN, which is a circuit model based on the data‐flow operation. The purpose of this paper is to clarify the transformation rules for the automatic circuit design based on the theorem‐proving techniques. First, the recursion equation is formulated as the specification language, and the circuit description language for FN is designed. The theorem‐proving system for the automatic design of the circuit can be formulated as a logic system in which the axioms are the predicate expressions for the elements, and the inference rules are the transformation rules among elements. The transformation rules from the recursion equation to the circuit representation are constructed using the concept of schema corresponding to the type of the recursion equation. Since the transformation includes heuristic aspects, some transformation techniques from the schema to the circuit description (called schema transformation) as well as the decomposition‐synthesis rules in the circuit representation, are presented. A logic system based on the obtained result is presented, indicating that a theorem‐proving system for the automatic circuit design can be constructed.
Generating cartesian products of two sets on a shuffle‐exchange network
Authors: Kumagai Takeshi , Baba Takanobu , Saito Hideki 
Published: July 2007

AbstractThis paper describes a method which generates all elements of a Cartesian product of two sets, using the shuffle‐exchange network. Often, processing appears which requires all elements of the Cartesian product in various fields in computer science as well as set manipulations in mathematics. Consequently, this operation can be considered to be one of the most fundamental. In this paper, the Cartesian product of two sets with N/2 elements is generated by an N‐input, N/2‐stage shuffle‐exchange network by assigning the switching element to each element of the Cartesian product. The experimental derivation of the realization method and the result of the experiment are described. In the derivation of the realization method, some properties of the shuffle‐exchange network are discussed. In the realization of the Cartesian product by an N/2‐stage shuffle‐exchange network, no redundant switching element is used. Consequently, the method shown in this paper is optimal.
Inter‐layer operators of optically connected three‐dimensional VLSI and their application to image processing
Authors: Fujita Satoshi , Aibara Reiji , Yamashita Masafumi , Ae Tadashi 
Published: July 2007

AbstractThe three‐dimensional (3‐D) integrated circuit has recently been attracting interest as a new structure for device implementation, and numerous studies are being made also from the viewpoint of the system design. This paper considers the 3‐D integrated circuit, where the layers are connected through light transmission (called 3‐D optically connected integrated circuit). It is suggested that operational processings unique to the 3‐D structure can be realized. The function is formulated algebraically as the image processing operation, and an application example to the template matching is presented. The improvement ratio of the matching processing speed by the proposed algorithm is evaluated by simulation. A discussion is made on the pipeline processing utilizing the 3‐D structure.