bluuebunny/crossref_metadata_2025_split huggingface dataset:
Interactive 3‐dimensional segmentation method based on region growing method
Authors: Sekiguchi Hiroyuki , Sano Koichi , Yokoyama Tetsuo 
Published: July 2007

AbstractIt has become easy to obtain three‐dimensional (3D) data of the inside of the human body because of developments in X‐ray computed tomography (CT) and magnetic resonance imaging (MRI). The 3D images of internal organs constructed from these data are useful in understanding the 3D shapes and positional relationships of the organs and are expected to be the diagnostic images of the next generation. However, many problems remain to be solved in making them practical, such as, improving the display speed of 3D images and implementing a 3D interface. For MRI, in particular, the difficulty in segmenting the display image is becoming a major impediment to the practical use of 3D MRI images. In this paper, we propose a practical segmentation method in which interactive corrective operations for 3D images are included in 3D region growing. To implement this method, we developed a 3D monitoring function for the segmentation process and an automatic function for removing the leaks generated during region growing. This method was applied to several 3D MRI data of the head and its effectiveness was confirmed.
Speech synthesis from concept representation in general speech output interface
Authors: Yamashita Yoichi , Mizoguchi Riichiro , Mizutani Naoki , Kakusho Osamu 
Published: July 2007

AbstractThe goal of this paper is to realize natural and high‐quality speech output from various problem‐solvers implemented on a computer. The framework for the general speech output interface is discussed, and the basic architecture is designed for SOCS (Speech Output from Case Structure representation). This is the speech synthesis system based on the concept representation converting the input to the interface into speech. The important issue in such a framework is to define a mechanism to transmit information from the problem‐solver to the speech output interface.From such a viewpoint, the representation based on the case structure and the phrase patterns is defined as the concept representation to describe the inputs to the interface and the speech synthesis system from the standpoint of problem‐solver, speech synthesis, and the dialogue management. The concept inputted to the interface is modified by the dialogue manager and is converted into the speech by SOCS. In SOCS, the prosody as well as the sentence is generated based on the concept representation. The pause markers generated in the sentence generation determine the positions of the pause and the Fϕ resetting. The prosodic patterns also are generated by the prosody modification function described in the custom template.
Performance improvement of jukebox‐type optical disk file system
Authors: Takahashi Naoya 
Published: July 2007

AbstractThis paper proposes an image data prefetch method for improving the performance of client/server optical disk file systems that use a jukebox‐type optical disk equipment. The frequent optical disk replacement of the jukebox has been the cause of the delayed data access of the file server, and an intolerable long response time at workstations.To reduce the frequency of disk replacement, the proposed method prefetches a series of image data from the file server to workstations for possible later displaying or printing. This method is implemented in a commercial system, and its performance is better in comparison with a conventional system. A concurrent processing function also is implemented in the file server. It enabled a waiting time for the disk replacement to be used for the services for other workstations. This also contributed to an additional performance improvement.
A fast motion planning algorithm for a mobile robot using a distance transformation image
Authors: Shin Donguk 
Published: July 2007

AbstractThis paper proposes a new high‐speed motion planning algorithm for the mobile robot functioning on the distance‐transformation image. The method utilizes the property that the value of the distance transformation image represents the distance from the obstacle. By the proposed method, the robot can move by translation to the farthest possible point only by examining a small number of points on the straight‐line of the progress. This makes it possible to realize the fast motion planning. When a deadlock is produced, a new posture of the robot is determined at the position so that the collision with the obstacle does not occur. Then, the part of the motion down to the initial point is regenerated.Finally, the speed of the proposed algorithm is compared to that of the conventional motion planning algorithm, and the fast operation is demonstrated experimentally.
Circuit complexity of slice functions and homogeneous functions
Authors: Hirose Shoichi , Yajima Shuzo 
Published: July 2007

AbstractThis paper discusses the complexity from the viewpoint of the number of circuit elements for the slice functions and the homogeneous function, which belong to the class of monotonic logic functions. The slice function is one of those functions in which the circuit complexity is almost equal to the monotonic circuit complexity.The n‐input k‐homogeneous function is considered as the first step, and it is shown that there exists a function with the k‐slice monotonic circuit complexity Ω(nCk/lognCk)and the monotonic circuit complexity of u(> k) slice is O(nlogn). This property has already been shown by Wegener for the case of the k‐slice with the monotonic circuit complexity Ω(n‐1Ck‐1/logn‐1Ck‐1). The result in this paper is an improvement of his result, and is the optimal when k is a constant.As the next step, a homogeneous function is shown where the monotonic circuit complexity is almost equal to the circuit complexity. As in the case of the slice function, if the lower bound ω(n(logn)2) for the monotonic circuit complexity for the n‐input homogeneous function is shown, the same lower bound is shown for the circuit complexity.
A new element for parallel distributed processing network—learning distance product element
Authors: Murayama Satoshi , Yokoi Hirokazu 
Published: July 2007

AbstractOne of the factors which affect the convergence velocity in the learning by a parallel distributed processing network is the input/output characteristic of its elements. This paper proposes anew a learning distance product element to substitute for the conventional learning threshold elements, and performs the computer simulation of a three‐layered network with two inputs and one output using the learning distance product elements. As a result, it is confirmed that on average, learning is accelerated compared to the use of the learning threshold elements.
Experimental studies of memory surfaces and learning surfaces in recurrent neural networks
Authors: Watanabe Tatsumi , Uchikawa Yoshiki , Gouhara Kazutoshi 
Published: July 2007

AbstractThe following approach is considered to be important for an insight into the “learning” in the layered network. The adjustable parameter vector w satisfying the required input‐output relation of the network also is considered. Then the “memory surface” in w space formed by the set of solutions for the nonlinear equation for w should be investigated. It is shown also that the idea of the “memory surface” can be extended to the learning of the recurrent network (abbreviated as RNN) with a supervisor.This paper shows the following property by an experiment. When the evaluation function E is defined by the square integral of the error, then the behavior of RNN agrees essentially with the results obtained for the case of the layered network in the following four points: (1) there exists the memory surface in RNN in the same way as in the layered network; (2) the supervised learning of RNN amounts geometrically to the search in the intersection region of multiple “memory surfaces” for the global or local minimum of E on the learning surface formed in w‐E space with w as the variable; (3) the feature of the learning surface of RNN is that the space is composed of a long “valley” and a flat “hill” with smaller gradient; and (4) the learning process by the successive search based on the gradient vector of E tends to progress near the memory surface along the valley.
Three‐dimensional blood vessel reconstruction using a high‐speed X‐ray rotational projection system
Authors: Kawata Yoshiki , Niki Noburu , Satoh Hitoshi , Kumazaki Tatsuo 
Published: July 2007

AbstractThe feature X‐ray angiography is that a blood vessel image with a high spatial resolution is obtained. Consequently, it is a decisive diagnostic tool for the pathology of the blood vessel. However, its precision is still sufficient for the diagnosis of blood vessels with delicate aneurysm or stenosis, as well as for planning surgery. Thus, it is desired to develop further an imaging method for the blood vessel configuration with a higher precision.This paper describes a precise observation method for the blood vessel configuration, where a pair of X‐ray source and the image intensifier (II) with a high‐speed rotation is used to scan and derive multidirectional projection images, and the blood vessel configuration is reconstructed in three‐dimensions for high‐precision 3D observation. As a pre‐processing to the reconstruction, the image distortion correction for II as well as the estimation of the camera coordinate are executed.In the 3D reconstruction of the blood vessel, the filtered backprojection method is used with the short‐scan (details are discussed later) cone‐beam projection. The result of 3D reconstruction of the blood vessel can be observed by the 3D display and the 3D model for the blood vessel configuration. The method is applied to the actual projection image of the cerebral blood vessels, and the effectiveness is demonstrated. By this method, a highly precise measurement of the blood vessel shape is realized, which has not been observed by the past technique, and the configuration of the blood vessel can be analyzed in the 3D space. It is expected that the proposed method with those features will be utilized in the quantitative diagnosis of the cerebral blood vessel diseases and treatment planning.
Detection of unfeasible paths with a path‐dependence flow graph
Authors: Naoi Kuniaki , Takahashi Naohisa 
Published: July 2007

AbstractThe problem of finding unfeasible paths (UFP: computation paths that are never executed for any input) is important in test data generation and effect propagation analyses. In this paper a directed graph representation executable in parallel, called path dependence flow graph, is proposed which is suited to problems of finding properties of procedural programs along computation paths such as the UFP detection problem.Also, a method is given that symbolically computes logical expressions necessary for UFP detection by parallel abstract interpretation of this graph. Furthermore a method for detecting UFP is presented that converts an obtained logical expression into a Presburger sentence and that applies a truth value decision method for Presburger sentences to it. By using this method, the computation control is made simple and the removal of computations that are not necessary for UFP detection is made easy. In addition since partial results can be shared, UFPs are detected more efficiently.
Recognition of handwritten character database ETL9B using pattern transformation method
Authors: Guo Jun , Sato Risaburo , Sun Ning , Nemoto Yoshiaki 
Published: July 2007

AbstractTo enhance the recognition rate of handwritten characters, one has to consider the effects of various changed forms in character patterns. In Reference [1], we have proposed a recognition algorithm using pattern transformation, which can deal flexibly with the changed forms in character patterns. In the fine classification, the algorithm makes three types of pattern transformations for the input pattern, and selects the transformed pattern that matches the standard pattern best. This paper improves that algorithm and constructs a recognition system. As the results of testing with ETL9B, a database of handwritten characters that contains 600,000 Japanese characters and a recognition rate of 96.32 percent was achieved, a new record for ETL9B.
Methods for choosing a training set which prevents over‐learning
Authors: Yamasaki Kazutaka , Ogawa Hidemitsu 
Published: July 2007

AbstractA drawback of the error‐backpropagation method for a multilayer feedforward neural network is overlearning. The authors have already discussed this problem, and obtained necessary and sufficient conditions for over‐learning to occur. Using those conditions and the concept of a reproducing kernel, this paper proposes methods for choosing a training set which prevents over‐learning.First, the case is discussed in which pure training data are available. Methods are presented for choosing a training set so that a memorization learning does not cause Wiener over‐learning. Next, the case in which noisy training data are available is discussed and methods for choosing a training set so that a rote‐memorization learning does not cause Wiener overlearning are shown.
A method for generating program specification from source program—analysis by transforming program structure and argument manipulation
Authors: Nagai Takahiro , Imanaka Takeshi , Toyoda Jun'Ichi , Hirashima Tsukasa , Uehara Kuniaki , Nagasawa Yuichi 
Published: July 2007

AbstractThis paper proposes a method of transformation analysis for the automatic generation of program specification from the source program. The system APSG/I (Automatic Program Specification Generator I), on which the proposed method is implemented, is discussed. The transformation analysis notes the similarity to the list‐processing program of Prolog. By utilizing the framework of analogical reasoning, the specification for the given program is generated based on the typical list‐processing programs and its specification.When the program is inputted, the following two aspects are examined and the difference is determined by comparison with the already defined typical program: 1 the structure specified by the existence of the command or the order of the execution; and 2 the combination of arguments specified by the passing of data, etc. Then based on the determined difference, the already defined program specification is transformed, and the specification for the inputted program is generated. The specification generated by the proposed transformation analysis has the following features: 1 the result is the natural language sentence, since the program specification and the transformation rule for the specification are defined by the natural language; and 2 the format is unified and sufficient information to the details is contained.
Artifact cancellation in MRI due to phase encoding axis motion
Authors: Tang Li , Ohya Muneki , Sato Yoshinobu , Tamura Shinichi , Naito Hiroaki , Harada Koushi , Kozuka Takahiro 
Published: July 2007

AbstractThis paper addresses the problem of motion artifact cancellation in the standard 2D‐FFT MRI. Although motion is possible in any direction, in clinical MRI diagnosis, respiration is considered to be the main cause of motion. As a first order of approximation, motion due to respiration is assumed to be only in the phase‐encoding direction (Y‐axis) in this paper. In the previous approach, the region of a target object is assumed to be known and an iterative procedure is required. The problem of the algorithm is the convergence of the iterative (which may take a lot of time) and still has no guarantee of convergence. To avoid an iterative procedure, a new constraint is proposed here, with which the motion component and the true image component can be separated by a simple algebraic operation. After the Fourier transform of MRI signal along the read‐out direction (X‐direction), the phase of the spectrum along Y‐axis is expressed as an algebraic sum of the motion component and the true image component. On the other hand, when density distribution is symmetric along a Y‐direction line, such as a slice line on subcutaneous fat, the phase of the Fourier spectrum along the line is a linear function of Y‐position. Therefore, if the density is symmetric, the departure from the linear function of the phase is just the motion component. With this constraint the motion component can be estimated and the motion artifact in MRI can be canceled. The algorithm is shown to be effective using a phantom with simulated motions in various cases. When the density distribution along the Y‐directional line on subcutaneous fat is not perfectly symmetric, the accuracy of estimated motion will be affected to some extent. However, this method is shown to be still effective in such general case by simulations.
An interactive analysis method for multidimensional images using a Hilbert curve
Authors: Kamata Seiichiro , Kawaguchi Eiji , Niimi Michiharu 
Published: July 2007

AbstractTo analyze multidimensional images we need a mapping of feature vectors from a multidimensional space to a lower dimensional space. In general, these are performed using linear transformation methods, such as principal component analysis, etc. Linear transformation requires many rotations of data from several points of view because the mapping is not one‐to‐one. Here, a new interactive method for classifying multispectral images using a Hilbert curve is presented. The Hilbert curve is a one‐to‐one mapping from N‐dimensional space to one‐dimensional space and preserves the neighborhood as much as possible. Hilbert curve is a kind of space filling curves, and provides a continuous scan. The merit of the system presented is that the user can extract category clusters without computing any distance in N‐dimensional space easily. The method presented here is explained in brief. Clusters are extracted from 1‐D data mapped by a Hilbert curve interactively, i.e., a pixel is classified as a category. The user can analyze multidimensional images hierarchically from gross data distribution to fine data distribution. To realize the real time response from the system, data tables storing the addresses and the occurrences of data are used. Here, the address is defined by using the coordinates in N‐dimensional space, and a part of mapping which cannot preserve the neighborhood is utilized. In the experiments ex‐extracting categories from LANDSAT data, it is confirmed that the user can obtain the real time response from the system after once making the data tables.
Problem‐solving SCRIPT and classification of drawings for explaining human drawing processes
Authors: Ito Takeshi , Ohnishi Noboru , Sugie Noboru 
Published: July 2007

AbstractSeveral of the most recent studies of the recognition model have attempted to describe the mechanism involved in the human drawing process. Any clear‐cut interpretation is at this date still problematic. A recognition model (DIPS) has been constructed that simulates the human drawing process; the goal is a model that includes the drawing process as a part of problem‐solving. To date, the model contains only a single drawing process and has not reached the point at which all drawing processes in various problem‐solving stages can be described.In this study, the drawings made as a part of the problem‐solving procedure are divided into 8 classes according to their appearance. Which of these drawings appears at what stage of the problem‐solving procedure is investigated in detail using psychological experiments. The “problem solving SCRIPT” is proposed as a concept to describe the drawing process. It is shown through psychological experiments that the concept of “problem‐solving SCRIPT” is observed, not only in the theorem‐proving endemic to geometry, but also in mathematical problems written in context and problems in physics. The drawings that are observed in each stage of SCRIPT are examined and then the relation between SCRIPT and the drawing is described according to the purpose in each stage.
A quasi‐competitive network with transition between models
Authors: Kindo Toshiki 
Published: July 2007

AbstractThis paper proposes a quasi‐competitive network in which the mass reaction intensity of the elements in the intermediate layer is kept constant as a model that approximates the continuous nonlinear function. As the loss function, the local loss function is considered. It is composed of the error and the local model loss term reflecting the local model size.The learning algorithm of the quasi‐competitive network including the change of the number of elements is derived from the local loss function. It is shown by numerical experiment that the quasi‐competitive network can form quickly the structure reflecting the target function and has a high generalization power. It is shown also that the high generalization power is due to the constant mass reaction intensity of the elements in the intermediate layer of the quasi‐competitive network.
Construction of structural edge map on chest radiograph using hough transformation and line connection
Authors: Sugahara Tetsuo , Yanagihara Yoshio , Sugimoto Naozo 
Published: July 2007

AbstractFor computer diagnosis of a chest radiograph, we propose a method to make a structural edge map consisting of subclaviculars, heart, diagram, and ribs that have been extracted from a chest radiograph. On processing, the intensity of the edges of an input image was calculated by a derivative filter. Next, the possibility of lines and/or arcs was calculated by Hough transformation. This transformation was applied to 13 small areas for each of the organs in the image. A reconnection of lines and arcs representing the edges of the organs was performed, and a structural edge map was then constructed. As a result detection of subclaviculars, heart, diaphragms, and inferior edge lines of ribs was very good (ge; 79 percent). However, detection on superior edge lines was poor (= 55 percent).
Fault‐tolerant associate memories
Authors: Fujiwara Eiji , Tanaka Tsuyoshi 
Published: July 2007

AbstractBecause of its capability of high‐speed search, the associative memory (CAM) is expected to be used in a variety of information processing systems. In this paper, novel fault‐tolerant techniques which are effective for on‐line use are proposed for TLB which is an example of the application of CAM.First, fault and error models of the TLB consisting of the CAM part and the SRAM part are clarified. Then, the fault‐tolerant techniques for these faults and errors, such as distance separable technique, cod‐ing technique, simplified 1‐out‐of‐n check and graceful degradation, are proposed. The distance separable technique which encodes the data stored in the CAM part is the one which masks the faulty CAM part and prevents errors from propagating to the subsequent circuits. The coding technique checks the one‐to‐one correspondence between the data in the CAM and those in SRAM by using the SEC‐DED code with byte error detection capability, i.e., SEC‐DED‐SbED code, and at the same time it detects and corrects errors in the data stored in SRAM. The simplified 1‐out‐of‐n check processes association errors. The graceful degradation gives a flag in the faulty memory section and prevents it from being used.The methods proposed in this paper are evaluated from area augmentation and error detection capability perspectives. The results show that the fault‐tolerant TLB with 32 virtual address bits, 32 physical address bits and 128 entries gives single fault detection probability of nearly 99 percent with 28 percent area increase.