bluuebunny/crossref_metadata_2025_split huggingface dataset:
Character recognition in cursive handwriting with the mechanism of selective attention
Authors: Imagawa Taro , Fukushima Kunihiko 
Published: July 2007

AbstractThe recognition of connected characters in cursive handwriting is a difficult task with ordinary pattern‐matching techniques, since the shape of the individual character is affected by its preceding and succeeding characters. One of the authors has proposed a neural network model called the selective attention model, which has the ability to recognize and extract individual patterns from a composite of a number of elementary patterns. However, when a large number of patterns are presented concurrently, this model doe not always work correctly. In this paper, we extend the idea of this model and construct a new system, which has the ability to recognize the connected characters in cursive handwriting. it has been verified by computer simulation that this system can be used to correctly recognize connected characters.
Structure from motion by voting algorithm
Authors: Hamano Teruo , Ishii Kenichiro , Yasuno Takayuki 
Published: July 2007

AbstractIn methods for extracting three‐dimensional structure by conventional spatiotemporal image analysis, camera motion was restricted to constant velocity linear motion in order to use epipolar constraints. In this paper, we are proposing a method for extracting three‐dimensional structure that permits arbitrary camera motion by introducing weighted voting of the lines of sight in the spatiotemporal image analysis and does not track the paths of feature points in the image space. Since there is absolutely no matching among images in this method, it is very robust when gaps occur in the feature point paths as a result of occlusion and noise. Tests were performed using a real image and the effectiveness of this method for a complex image with occlusions was verified.
A system for building interactive visual simulator of digital hardware
Authors: Kojima Taizo , Sugimoto Akira 
Published: July 2007

AbstractA digital system software simulator can provide high level support for testing and debugging of firmware using graphical user interfaces which perform visualization of the hardware model. Since sufficient knowledge of the target hardware is required for the development of a simulator, a simulator is usually developed by a hardware engineer, even though the hardware engineer may not have enough knowledge for building interactive graphical user interfaces. Therefore, it is not easy for a hardware engineer to develop a visual simulator using graphical user interfaces. In this paper, a new system for building interactive visual simulators and an example of its application are presented. In this system, an object‐oriented simulator kernel is introduced for separation of hardware description and user interface implementation. This kernel is built based on an object‐oriented method, and it provides common functions for hardware modeling and user interfaces, such, as an event driven mechanism. Layered on this kernel, an object‐oriented hardware description language and a user interface description language are implemented. By this approach, both hardware descriptions and user interfaces have a high level software reusability. Therefore, a hardware engineer can develop an interactive visual simulator by describing only the hardware model. Furthermore, by using user interface description language, a hardware engineer can customize a graphical user interface according to the purpose of simulation.
Acquisition of local maps by fixation
Authors: Ishiguro Hirushi , Stelmaszyk Patrick , Tsuji Saburo 
Published: July 2007

AbstractThe vision sensor of a conventional mobile robot is attached to the body of the robot. For more flexible environment recognition, it is necessary to allow the vision sensor to controlling visual attention mechanism of a mobile robot, and examine a method for obtaining a local map. A set of equations which produces the local map from continuous observational data is described. Advantages of the controlling visual attention are presented, based on an error analysis. The advantages are that the environment can be obtained from a coordinate system based on the object under attention, and that errors in the determined position of the object are smaller than with other methods which do not include a controlling visual attention. Experimental results using a Kalman filter for a set of continuous observational data show that an accurate local map is produced.
Use of a linear predictive analysis method to detect gas bubbles generated in the bloodstream during decompression
Authors: Nakai Tokayoshi , Watanabe Masahiro , Suzuki Hisayoshi 
Published: July 2007

AbstractThis paper discusses an algorithm for detecting bubbles in a diver's bloodstream during decompression from submergence. A widely employed method at present for detecting bubbles is the ultrasonic Doppler method, which is based on aural sensation. However, a problem here is that the Doppler signal contains various kinds of noises such as cardiac motion signals. Thus, the observer is required to concentrate to detect the bubble sound from the noise when the number of bubbles are few, and to count the number when there are many. This is not an easy task, even for an expert.The authors discovered the features of the typical bubble sound with respect to the time waveform and the frequency spectrum, and developed a new bubble‐detection algorithm based on linear predictive signal processing. An experiment for bubble detection is executed, using a material to demonstrate the bubble‐detection Doppler method and data recorded in the simulated 300‐m manned submergence. It is verified that the proposed method has nearly the same performance as that of an expert.Finally, this paper discusses the phenomenon where the frequency of the bubble decreases with the increase in bubble generation.
A neural algorithm incorporating winner‐take‐all subnets for combinatorial optimization
Authors: Urahama Kiichi 
Published: July 2007

AbstractUsing a neural net composed of subnets with a winner‐take‐all (WTA) mode of operations, the constraint that the variables must form a probability vector or a probability matrix can automatically be satisfied. Taking advantage of this property, this paper proposes a neural algorithm than can derive the approximate solution for a combinatorial optimization problem such as set partitioning. As a simple example, the 3‐partition maximum‐cut problem is considered.The worst‐case error is evaluated theoretically, and it is shown that the proposed method is one‐third (relative) approximate algorithm. For comparison, the performance of the conventional method also is evaluated theoretically. The performances also are compared by experiment. Both the theoretical and experimental results confirm that the proposed method can achieve better performance than the conventional method.
Invertible affine transformations on integer coordinate system — general theory in n ‐ dimensional space
Authors: Shizawa Masahiko 
Published: July 2007

AbstractThis paper considers a lattice represented by integer coordinates in n‐dimensional space (digital lattice). On the digital lattice, an automorphism is constructed by a newly proposed theory and algorithm, to enable the approximation of the arbitrarily given equivolume affine transformation. The equivolume affine transformation is a general affine transformation that satisfies the condition of volume invariance, and is characterized by the determinant of the representation matrix having an absolute value of 1. An equivolume affine transformation in n‐dimensional space can represent any combination of reflection, rotation, equivolume expansion/contraction and skew deformation. These transformations often are employed as fundamental transformations in the handling of geometrical information in computers.This paper discusses first the geometrical characters of equivolume affine transformations. It then defines the fundamental reflection, skew and translations. It is shown that the equivolume affine transformation in n‐dimensional space can be decomposed into the product of (n2‐1) fundamental skew transformations, n fundamental translations and a finite number of fundamental reflections.For the fundamental transformation, one‐to‐one integer approximation is defined, and a systematic method is proposed to evaluate the upper bound of the approximation error. With the proposed error estimation method, an algorithm is proposed to determine the decomposition suppressing the error in the overall system. One advantage of this theory is that it is no longer necessary to preserve the geometrical information before transformation in the computer, which has been commonplace up to now in computer programming.
Load‐sharing algorithms for parallel database processing on shared‐everything multiprocessors
Authors: Hirano Yasuhiro , Satoh Tetsuji , Inoue Ushio , Teranaka Katsumi 
Published: July 2007

AbstractThis paper describes new load‐sharing algorithms for parallel database processing. There is a trade‐off between overhead and load unbalance in ordinary algorithms. The proposed algorithms solve the tradeoff by varying the number of tasks allocated at one time, which is fixed in ordinary algorithms. Performance evaluations show that the proposed algorithms achieve fair load sharing with low overhead, independent of database size, the number of processors and data distribution.
Architecture of highly parallel ap1000 computer
Authors: Ishihata Hiroaki , Shimizu Toshiyuki , Ikesaka Morio , Inano Satoshi , Ikesaka Morio 
Published: July 2007

AbstractThis paper describes the architectural features of the AP1000 message‐passing computer. The architecture is designed to speed up barrier synchronization, data distribution and collection, broadcasting, and message handling. In recent message‐passing computers, the most significant communication overhead is that associated with interrupt processing and message assembly/disassembly, because the adoption of new routing schemes has reduced the network latency.It is important for a fast message‐passing computer to reduce not only network latency but also message handling latency. Although broadcasting, data distribution and collection, and barrier synchronization are necessary functions in many applications, these functions were slow in prior message‐passing computers because each of these functions were simulated by many one‐to‐one communications. The AP1000 has three independent communication networks and message handling hardwares, fast barrier synchronization capabilities, and data distribution and collection hardware to speed up those functions.
Scene retrieval method using temporal condition changes
Authors: Abe Shinji , Tonomura Yoshinobu 
Published: July 2007

AbstractThis paper proposes a method that retrieves a required scene with such dynamic changes as the motion of the object in the scene as the key from the dynamic images stored as the database. In the traditional database, scenes are retrieved using the keyword for each scene, for example. By contrast, in the proposed system the object of retrieval is an arbitrary interval represented by the dynamic images, and the images are retrieved based on the content represented by the dynamic images. The retrieval request from the user is transformed into the functional format, which describes the time‐course of changes of the object in the image. The retrieval is based on the primitive characteristic data (PCD) as the management data for the video images, and the condition description factor (CDF) obtained by the transformation of the retrieval request from the user.An experiment is attempted where the two‐dimensional position coordinate of the object on the scene is used as PCD, and the motion of the object in the scene or the relative motion of more than one object is used as the key to retrieve the desired scene. The effectiveness of the method is verified.
Syntactic analysis and letter‐to‐phoneme conversion using neural networks — an application of neural networks to an english text‐to‐speech system
Authors: Yamaguchi Yukiko , Matsumoto Tatsuro 
Published: July 2007

AbstractThis paper presents a speech synthesis system using the neural network. While there have been a large number of speech synthesis systems developed, most of them are rule‐based systems for a restricted range of languages, describing the expert knowledges for the language in the form of rules. Thus problems arise in that a large amount of effort is required in developing the system, and the extension of other languages is not easy.In the area of natural language processing, on the other hand, there are practical applications of machine translation, and it is desired that speech synthesis systems for various languages be developed in the future. From such a viewpoint, the authors developed the English speech synthesis system, aiming at the easy extension to multiple languages without requiring expert knowledge.In this paper, the neural networks is applied to the part‐of‐speech detection function, the syntactic boundary detection function and the letter‐to‐phoneme conversion function, all of which have stronger language dependencies among the components of the speech synthesis system.
Evaluation of parallel execution performance by highly parallel computer EM‐4
Authors: Kodama Yuetsu , Sakai Shuichi , Yamaguchi Yoshinori 
Published: July 2007

AbstractThe EM‐4 is a highly parallel computer which achieves high performance in data communication as well as instruction execution. An EM‐4 prototype which consists of 80 processing elements (PEs) has been fully operational since April 1990.This paper evaluates the basic parallel execution performance of the EM‐4 prototype, considering the performance of instruction execution, network data transfer, and data synchronization. First, an attempt is made to achieve maximum performance by executing artificial programs and comparing them to the theoretical maximum performance. Next, the average performance is evaluated by executing simple programs. The results show that the instruction execution performance is 630 MIPS, the network data transfer is 400 Mpacket/s, and the data synchronization is 35 Msync/s.
Acceleration by prediction for error back‐propagation algorithm of neural network
Authors: Kanda Arihiro , Fujita Satoshi , Ae Tadashi 
Published: July 2007

AbstractThis paper proposes a speed improvement of the error back propagation algorithm, which is employed widely in the multilayered neural network, by introducing the prediction. The idea is to realize a larger acceleration by introducing the differential factor for the moment terms in the error back‐propagation algorithm.
Identification of front‐view facial images based on isodensity maps
Authors: Ueno Kunikazu , Kato Masahiro , Nakamura Osamu , Minami Toshi 
Published: July 2007

AbstractIn this paper, we describe a method for identifying facial images based on isodensity maps. An isodensity map reflects the 3D shape of the face in sets of closed loops that represent the connectivity of pixels with the same gray level and is a useful feature in facial descriptions. Identification begins by extracting the face region from the source image, then is followed by matching. The extraction of the face region is easily implemented using isodensity lines that represent facial contours. Two‐stage matching composed of template matching of isodensity maps (global matching) and local density matching of isodensity lines (fine matching) was adopted. Matching tests were performed on images of faces which included people wearing eyeglasses, women wearing makeup, and unshaven men. A total of 3, 481 pairs (59 pairs of the same person and 3,422 pairs of different people) were used and 3,479 (99.9%, 57 pairs of the same person and 3,422 pairs of different people) were correctly identified. The experimental results demonstrated that this is an extremely effective method for personal identification and is sufficiently robust in practical use.
Extraction of road segments by spatial filters
Authors: Kim Wookhyun , Hirai Yuzo , Furukawa Takashi , Arita Hidenobu 
Published: July 2007

AbstractThis paper proposes a new approach for extracting segments from map data. In general, it is difficult to construct a system that can completely extract all road data noise free. On the other hand, it will be easy to construct a system that can extract all road data although noises are included. Such a system extracts all road information at least, and in this paper is called the sufficient feature extraction network. It will also be easy to construct a system that is noise free, although not all of the road information is extracted. Such a system extracts at least only road data, and is called the necessary feature extraction network.This paper shows that the road segments on a map can be extracted completely noise‐free by combining those sufficient features and the necessary features. Experiments were conducted for various map areas, and the effectiveness of the proposed method is verified.
Computer design system of compensating filter for radiography treatment
Authors: Tsuruno Reiji , Isobe Yoshihide , Ozaki Shin , Kosako Hideo , Bamba Eiichi 
Published: July 2007

AbstractThe following problem sometimes arises in the radiation treatment of a pathological area in the human body. Due to the nonuniformity of thickness and the difference of density of the tissue passed by the radiation energy, the radiation dose in the target area may not be uniform.To avoid such a situation, this paper considers a method in which the attenuation configuration of the radiation in passing through the body is estimated in detail. A three‐dimensional block is placed between the radiation source and the target area to realize the radiation treatment with the dose correction.The design method for the three‐dimensional block, i.e., the compensation filter for the correction, is discussed. First, the CT value for each density voxel obtained by the continuous tomography of X‐ray CT image is converted into the absorption coefficient of the high‐energy X‐ray for treatment. Then the values of the voxels passed from the radiation generator to the pathological area are summed up, and the radiation dose in the target areas is calculated.The three‐dimensional shape of the compensation filter, which can correct adequately the dose distribution, is determined based on the tissue‐air dose ratio obtained from the actual measurement. The block is constructed based on the shape data. By the experiment using a phantom, the nonuniformity of the dose is reduced approximately from 10 percent to 3 percent. In the simulation for the application to the biological object, the area of high dose distribution fits the target area, indicating the effectiveness of the dose correction.
A still image coding method in which AR model estimation is applied to dct coefficients of edge blocks
Authors: Fukuda Koichi , Mizuguchi Tomohiko , Kawanaka Akira 
Published: July 2007

AbstractImage coding technology has been developed for various purposes with the progress of large‐scale communication networks and recording technology. Notably, a method using a discrete cosine transform (DCT) and a variable‐length code (VLC) has been popular for still image coding. Although this method is excellent for general purposes, some images such as the edges of letters become blurred unless the code compression rate is sufficiently high.This paper proposes a method of estimating high‐frequency components from low‐frequency components and auto‐regressive (AR) coefficients by applying an AR model to the DCT coefficient of an image block (or “block edge”) containing sharp edges. The method produces AR coefficients for each block and preserves the AR coefficients, DCT coefficients and the estimated errors of high‐frequency components as data to reconstruct images. The newly introduced AR coefficients are quantized uniformly and added to the head of the components in the standard method. The estimated errors are added to the data instead of the high‐frequency components. Examples of images containing sharp edges such as letters were processed by the proposed method, and the results confirm the usefulness of the method.
Interpretation of SDL specification in LOTOS
Authors: Ando Tsuyoshi , Ohta Masataka , Takahashi Kaoru 
Published: July 2007

AbstractThis paper aims at: 1 improvement of the specification verification capability of SDL without losing its advantages, i.e., transparency and descriptive power; and 2 realization of translation between specifications described by SDL and LOTOS. A method is proposed which gives a LOTOS interpretation of the specification by SDL.First, the mapping of the object system structure indicated by SDL specification to the LOTOS description is discussed. Then the description of the processing definition of SDL specification is described. Using the method proposed in this paper, a LOTOS interpretation is presented as an example for the SDL specification for the switching service. The result of interpretation is evaluated and the flexibility of the verification process is discussed.
Combinatorial optimization by using a neural network operating in block‐sequential mode
Authors: Shiratani Fumiyuki , Yamamoto Kimiaki 
Published: July 2007

AbstractIn a laterally connected neural network which has continuous output functions and has its state updated in block‐sequential mode at discrete times, a condition inequality is derived for the slope of the output function and the stepwidth of the updating rule which ensures that the network energy decreases monotonically with the state variation. This makes it possible to update in block‐sequential mode, which is more general than synchronous updating or asynchronous updating, application to an arbitrary optimization problem in which the evaluation function is given in a quadratic form. As one example, the method is applied to the traveling salesman problem. The advantages of applying this method as opposed to synchronous and asynchronous updating are discussed, and its effectiveness is confirmed.
Bitonic sort on a network computer with a node failure
Authors: Kobayashi Hiromi , Funaki Hidetake , Yamamaoto Hiroaki , Yamaura Hiroo 
Published: July 2007

AbstractMassively parallel computers are being realized for aiming at high performance. Bitonic sort is an efficient algorithm for network computers. But generally, it is impossible to use a bitonic sort algorithm on a network computer with a node failure.This paper presents a fault‐tolerant scheme of bitonic sort algorithm for a network computer that makes it possible to tolerate a node failure without an additional hardware cost. The method does not have hardware redundancy but has software redundancy. The method does not depend on the network topology. However, the method takes about two times as many steps as that of original bitonic sort.This paper also shows that the method is applicable to a chordal ring connected computer as an example.