bluuebunny/crossref_metadata_2025_split huggingface dataset:
A visual control system using image processing and fuzzy inference
Authors: Kamada Hiroshi , Gotoh Toshiyuki , Yoshida Masumi 
Published: July 2007

AbstractA control system for an unmanned vehicle is constructed by combining dynamic image processing and fuzzy inference. The features of this system are that an object on the road can be recognized with a high speed, and the unmanned vehicle runs according to the result of recognition.First, the object to follow is extracted by the image processor from a tremendous amount of image data containing noises. The result is then transformed, using the improved Hough transform, into the information concerning the position and the orientation, which are needed in the steering of the vehicle.The information is then compared to the expertise of the vehicle steering in the fuzzy controller, and the handle variables are determined. The image processor executes the pipeline processing using the analog color extractor and the logical filtering processor with the local parallel pipeline architecture. Sixty images per second can be processed in real‐time. The fuzzy inference has the fuzzy rulebase with the motion information of the vehicle as the input parameter so that the handle variables can be determined even for a moving vehicle.By an LSI implementation of the image processor, the proposed system is realized as a small‐scale system which can be mounted on the vehicle (A4 size × 10 cm). In the unmanned control experiment using a vehicle with the proposed system, a high‐speed processing of 100 ms on the average from the image input to the handle operation is verified. The follow‐up to the series of objects within the error of 5 cm is verified, indicating the practical usefulness of the proposed system.
Search for the minimum value via the multitransition neural network
Authors: Murashima Sadayuki , Fuchida Takayasu 
Published: July 2007

AbstractWhen a mutually connected neural network (Hopfield net) is applied to the minimization problem, the process may fall in a local minimum and not converge to the global minimum. To remedy this problem, several means have been proposed such as Boltzmann machine; however, this and other proposals take too much time.This paper proposes a neural net that permits multitransition (transition between states with two or more Hamming distances). It is shown that convergence to the global minimum can be realized escaping from the local minimum. It is shown first that the decrement of the energy when more than one element simultaneously changes can be calculated by simple addition‐subtractions of the weight factors for the inputs to the element and the coupling factors among elements. A probabilistic minimum search algorithm is presented based on the multitransition. The optimization problem for 100 elements was solved by a personal computer, and the process converged to the minimum within an hour in 398 trials of 400. The average convergence time is 10 min, and the convergence is achieved in 20 s in the fastest case. The computation time increases with the increase of elements with a much slower rate than in the case of all‐search.
Classification of fingerprint images using a neural network
Authors: Kamijo Masayoshi , Mieno Hiroshi , Kojima Koichi 
Published: July 2007

AbstractFingerprints are an effective means of identifying individuals, and several fingerprint comparison systems have already been developed. However, since it becomes difficult to recognize fingerprints with ease as the number and diversity of fingerprint patterns increases, it becomes desirable to create an efficient database for fingerprint matching with the goal of developing an automatic fingerprint classification system. Here an automatic classification system is imposed for fingerprint images in which the discrimination system is a multilayer neural network composed of five subnetworks to carry out macrofeature extraction on the fingerprint image. A total of 50 training examples, 10 per category, and 500 testing samples were presented to the network. According to the obtained results, the network achieved an 86 percent classification rate for the first candidate and a 99 percent classification rate for the first two candidates. The state of the network was analyzed after training, and the reasons for the system effectiveness and its classification error were studied.
A neural network model of the dynamics of a short‐term memory system in the temporal cortex
Authors: Morita Masahiko 
Published: July 2007

AbstractThe temporal area TE of the monkey contains a group of neurons which seems to act as the short‐term memory by a sustained firing, where the stored information seems to be retained by a certain kind of equilibrium of a dynamical system. The behavior of this group of neurons cannot be accounted for by the traditional dynamical system realized by the existing neural network models.This paper discusses the short‐term memory system in the temporal area, as well as the dynamics of associative memory, and proposes the neural network model which realizes the same dynamical behavior as that of area TE. This model differs essentially from the traditional models in that the composing unit has non‐monotonic input/output characteristics and a significant property in analyzing the behavior and the mechanics of the memory circuit in the brain.
A method of digital figure decomposition based on distance feature
Authors: Okada Minoru , Yokoi Shigeki , Toriwaki Jun‐Ichiro 
Published: July 2007

AbstractThis paper proposes a method of decomposing a D‐figure based on the distance features of the figure. This method, called “breaking where it can be broken,” can be applied to digital figures of arbitrary dimension and is designed to produce the familiar decomposition which corresponds to the physical image when the rigid body has a weakness in its figure.When the information available about the digital picture is black‐and‐white, the decomposition of the figure must be based only on topological properties such as 1‐pixel connectivity, construction of a good figure decomposition is difficult because of the limited information.First, the definition of the decomposition of a D‐figure is given. Then the algorithm which realizes it in the digital space is presented. Finally, the results of experiments with the two‐dimensional (2‐D) D‐figure decomposition of artificial figures are given and the usefulness of this method is illustrated with a practical example, the analysis of a 3‐D D‐figure of a medical picture.
Edge tracing of virtual shape using input device with force feedback
Authors: Fukui Yukio , Shimojo Makoto 
Published: July 2007

AbstractIn manipulating shapes displayed on a screen by means of a keyboard, mouse, or tablet, the operator can only confirm his/her operation visually through the eyes. This process can easily cause eye fatigue, resulting in low work efficiency. To improve this situation, a reaction force to the operator's hands should also be used to provide feedback from the operation. We have devised an input device based on this idea. Its main feature is a two‐dimensional force sensor mounted on the head of an XY recorder connected to a graphics computer. The XY recorder head with mounted sensor can be controlled by the computer to move in the direction in which the finger force is applied. Using this input device, we have done experiments on human sensitivity to virtual shapes through following their contours when force feedback is available. As a result, we have discovered that low or shallow hollows in the shape, which are barely detectable to the eyes only, appeared as feedback signals, such as a change of direction of the reaction force and the speed. This change makes it easier for the operator to recognize the features of the virtual shape. Through this experiment, we were able to confirm the validity of the concept of using an input device with a force feedback mechanism.
A speech labeling system based on knowledge processing
Authors: Arai Kazuhiro , Oniyama Yasuhito , Nomura Yasuo , Yamashita Yoichi , Kitahashi Tadahiro , Mizoguchi Riichiro 
Published: July 2007

AbstractThe segmentation of continuous speech into phonemes, i.e., labeling, is one of the most important procedures in constructing the speech database. At the present stage, the labeling is executed by the inspection of the time‐series of acoustic parameters by the human expert. Because of this procedure, a large amount of time and effort are required in the construction of the speech database.From such a viewpoint, the authors have developed an automatic speech labeling system aiming at the automatic labeling. In the proposed system, a correspondence is established between the phoneme symbol sequence and the characteristic changes in the time‐course of the acoustic parameters, and the rough position of the phonemes are determined. Then the boundaries between the phonemes are adjusted by the detailed observation of the change of acoustic parameters near the phoneme boundaries. Finally, the change of the acoustic parameters in each phoneme interval is examined to verify the match of the label. The system is evaluated by experiment.Eight sentences uttered by seven adult males, who participated in the development of rules, are used for evaluation; 6.7 percent of the phoneme boundaries are rejected. For the remaining phoneme boundaries, 99.1 percent of the boundaries are set within 30 ms of the position decided previously by the human expert. For 10 sentences uttered by four adult males, who did not participate in the rule development, the foregoing scores turned out to be 8.9 and 95.5 percent, respectively. Those results indicate the usefulness of the proposed system.
Segmentation of blood cell image captured by single CCD color TV camera
Authors: Hashizume Akihide , Motoike Jun , Suzuki Ryuichi , Yabe Ryohei 
Published: July 2007

AbstractThis paper discusses the classification of blood cell images. The image input method using the single CCD color TV camera and the special color compensation filter, as well as the method of region segmentation for the blood cell images, are described. The following elaborations are made in the image input stage to separate the red blood cell and the white blood cell images in a stable way using optical means.(1) The bluish green light near 450 ∼ 500 nm is cut off from the white light.(2) The accompanying light imbalance between the blue light and the green/red light is compensated by the special color compensation filter.In the (region) segmentation of the blood cell images, a logical operation is developed in which the region of the red blood cell is extracted based on the binary images obtained by the threshold processing of the subtracted image. Using those methods, 59 blood cell images are processed and a satisfactory segmentation result is obtained.
ASL program written in abstract sequential machine style and its compiler
Authors: Ooashi Masahiro , Taniguchi Kenichi , Sugiyama Yuji 
Published: July 2007

AbstractThe algebraic method as a formal approach in the design and development of the program has earned attention. The authors, in order to examine its usefulness, have defined the algebraic language ASL and constructed the ASL program developing system. But many problems concerning the compiler remain to be solved. The algebraic language ASL contains an abstract sequential machine style of description, and there exists a large number of problems that can be described in a natural way by this style. This paper proposes a method of constructing the compiler for the abstract sequential machine style program in the ASL program development system as well as of improving the execution efficiency of the object code. The usefulness of those methods are examined.
Software reliability measurement and assessment methods during operation phase and their comparisons
Authors: Yamada Shigeru , Osaki Shunji , Tanio Yoshikazu 
Published: July 2007

AbstractThis paper attempts to relate the testing phase, which is the final stage of the software development and the operation phase after the release. It discusses the occurrence of the software failure due to the errors latent in the software. The event of detecting the software error in the testing phase is described by the software reliability growth model based on a nonhomogeneous Poisson process.As to the assessment of the software reliability in the operation phase, i.e., the operational reliability, three assessment techniques are discussed. They are the method to introduce the environment factor considering the number of errors remaining at the end of the testing, the method based on the hazard rate, and the method based on the cumulative failure rate. Finally, the result of the analysis of the software reliability data is presented. Numerical examples of the assessment methods for the operational reliability are discussed and the results are compared.
Disturbance suppression on two joints controller using FES with antagonist muscle stiffness control
Authors: Kubo Kimito , Itakura Naoaki , Iguchi Yasuhiko , Minamitani Haruyuki , Fujita Kinya 
Published: July 2007

AbstractFunctional electrical stimulation (FES) has been studied intensively in recent years. In FES, the muscle or nerve of the tetraplegic patient with damage in the central nervous system is stimulated electrically to contract the muscle, aiming at the restoration of the lost function. When the closed‐loop control is employed in FES to control the two joints of the knee and the ankle simultaneously, the inertia arising from the movement of the upper (knee) joint, operates as an external disturbance to the lower (ankle) joint, and deteriorates its transient response. As a result, it is required to construct a control system with a high suppression ability for the external disturbance.It is noted in this study that the stiffness of the human joint, i.e., the difficulty to move (mechanical impedance), is one of the factors which determines the motion of the joint, and the external disturbance affects the motion less if the difficulty to move is enhanced.Further, it is noted that the mechanical impedance of the joint is increased when the tension of the antagonist muscle is increased. Then a method is devised in which the mechanical impedance of the joint is adjusted by controlling the tension of the antagonist muscle in parallel to the control of the joint angle by the agonist muscle.By increasing the mechanical impedance of the joint using this method, a system can be constructed which suppresses the effect of the external disturbance from the motion of the other joint. The proposed system is applied to the control of the ankle joint, and it is shown that the effect of the knee joint movement is suppressed.
Analysis of neural network energy functions using standard forms
Authors: Izumida Masanori , Murakami Kenji , Aibara Tsunehiro 
Published: July 2007

AbstractIn this paper, we discuss a method for analyzing the energy function of a Hopfield‐type neural network. In order to analyze the energy function which solves the given minimization problem, or simply, the problem, we define the standard form of the energy function. In general, a multidimensional energy function is complex, and it is difficult to investigate the energy functions arising in practice; but when placed in the standard form, it is possible to compare and contrast the forms of the energy functions themselves. Since an orthonormal transformation will not change the form of an energy function, we can stipulate that the standard form represents identically energy functions which have the same form. Further, according to the theory associated with standard forms, it is possible to partition a general energy function according to the eigenvalues of the connection weight matrix; and if we analyze each energy function, we can investigate the properties of the actual energy function. Using this method, we analyze the energy function given by Hopfield for the “travelling salesman problem” and study how the minimization problem is realized in the energy function. Also, we study the mutual effects of a linear combination of energy functions and discuss the results.
Construction of neural networks to select harmonious color combinations
Authors: Hirano Kunihiko , Miyamichi Juichi 
Published: July 2007

AbstractHumans have a sense of color which, when a color is presented, can determine another color that is harmonious to the presented color (called harmonious color combination). This paper considers the two‐color combination problem, which is to decide whether or not the two given colors are harmonious. The three‐layered neural network with the error backpropagation learning is used to realize on a computer the color combination aesthetics of an individual trained in color harmonization.The performance of the realized system is examined. The result obtained by the constructed system is the correct recognition rate of 97 percent for the learned data and approximately 70 percent for the unlearned data. The correct recognition rate for the unlearned data agrees almost with the rate of coincidence when the same subject selected the harmonious color twice. It is observed also that the color selection histogram pattern of the neural network is very similar to that of the subject. It is possible to identify the original subject from the tendency of the color selection tendency of the neural network. Thus, it is verified that the model is constructed reflecting well the color selection aesthetics of the subject.
Incremental recovery of 3‐D rigid and nonrigid structure from image sequences: An approach based on smoothness of motion
Authors: Morikawa Hiroyuki , Harashima Hiroshi 
Published: July 2007

AbstractIf an object is a rigid body, it is possible to estimate its three‐dimensional structure and motion mathematically from motion information. However, the assumption that objects are rigid bodies includes a disadvantage that it is not stable against noise and that the circumstance of application is restricted.When considering application to natural images or modeling of vision, a general‐purpose method for estimating three‐dimensional structure and motion which allows discrepancy from rigid bodies is desired. Thus, in this paper, an algorithm is presented for estimating three‐dimensional structure and motion incrementally from a long image sequence using the condition for “smoothness of motion” instead of the rigid body assumption. That is, as a constraint, a physical property is used whereby an object generally performs a smooth motion due to inertia and elasticity. Formulating this condition, i.e., smoothness of motion as a stabilizing function for regularization, the three‐dimensional information is estimated incrementally so that it is suitable to an input image and motion is smooth. By considering smoothness of motion, three‐dimensional information of each frame can be stored incrementally, and thus a flexible algorithm that is robust and also applies to the motion of a nonrigid body is obtained. Furthermore, by presenting the results when applying this method to the motion of rigid and nonrigid bodies, the robustness of this method against noise and flexibility is shown which also applies to nonrigid bodies.
A speedy voxel‐tracing method for cutting solid display of 3‐D images
Authors: Tayama Norio , Shimizu Noriaki , Chiba Norishige , Otawara Isao 
Published: July 2007

AbstractThis paper describes a high‐speed image‐generation method which arbitrarily cuts out a three‐dimensional (3‐D) digital object (3‐D image) in a 3‐D frame memory and three‐dimensionally displays its internal shape realistically. The idea of ray‐tracing is applied to a 3‐D memory space so that a high‐speed ray‐tracing is carried out in it by using a 3‐D digital differential analyzer (DDA) called the reversible step type. To obtain cross points of a ray (straight line) and an object in a 3‐D frame memory, an algorithm indicating address orders of all the voxels through which the ray passes is shown. A viewpoint of obtaining a realistic 3‐D representation with a smooth surface from an irregular digital surface, calculation method of normal vector is important. A new factor, “existential density,” which can be obtained by a simple calculation around the surface of the digital object, is introduced; and a method to obtain a normal vector from this factor using the distribution of density gradient also is described. Since this calculation requires 3 × 3 × 3 operators, addition/ subtraction of integers and shift operations, the operation is high speed and suitable for hardware. The proposed algorithm is confirmed by a computer simulation which produces 3‐D images with smooth shading.
Recognition of material types and interreflection using color images
Authors: Hashimoto Tadashi , Kato Hirokazu , Sato Kosuke , Inokuchi Seiji , Moriwaki Kosuke 
Published: July 2007

AbstractIn computervision it is expected that the capability of recognizing an object is increased significantly by additional information of material types to conventional geometrical information such as the position, shape, and posture of the object. To materialize this idea, this paper proposes a simple color‐reflection model which classifies colored opaque objects seen under white light according to their gloss into three categories: “metallic;” “matte nonmetallic;” and “glossy nonmetallic.” This model is based on the dichromatic reflection model proposed by Shafer but with an extended capability to include metallic objects. The model can recognize not only apparent material but can also detect interreflection of the object. The effectiveness of the method was confirmed successfully by applying it to actual scenes containing metallic and nonmetallic objects.
Recognition of letters in lateral printed strings using a three‐layered BP model with feedback connections
Authors: Imai Katsuji , Gouhara Kazutoshi , Uchikawa Yoshiki 
Published: July 2007

AbstractAlthough there is a simple and fast method to separate and classify letters in lateral printed strings by regarding a valley of the projection of the original image as a gap of letters, this method cannot be applied to cases where adjacent letters are connected or large clutter is involved [1].This paper proposes a method which separates and recognizes each letter even in such cases as described in the foregoing, using a three‐layered BP model with feedback connections. The recognition experiments using the proposed method were carried out with lateral strings of five printed letters (capital A to E) binarized through a CCD camera. The results show that the method is superior to conventional methods when applied to a letter string recognition system used in the process of factory automation.
Evaluation of a deductive database system for CAD applications
Authors: Takagi Toshihisa , Suzuki Takahiko , Goto Susumu , Ushijima Kazuo 
Published: July 2007

AbstractIn the deductive database, a large number of query processing techniques has been proposed for the efficient processing of a large amount of data. Several deductive databases actually were proposed based on those techniques. There are only few cases among those, however, where such a system is applied to the practical problem. Consequently, it is not clear to what type of actual problems the deductive database can be applied.In the CAD system, the “indirect” and “conditional” connection relations among components must be specified to utilize the design diagram more efficiently. It is proposed that the techniques of the deductive database can effectively be applied to such a problem to determine efficiently the connection relations. A prototype system was constructed to demonstrate the idea. The prototype is applied to a practical problem and the performance is evaluated. It is shown that the deductive database can effectively be applied to the forementioned problem.In the course of this experiment, several observations are made concerning the realization of the query processing method in the deductive database. This paper outlines the constructed prototype system and discusses the result of evaluation. The range of application for the deductive database as well as the practical usefulness are discussed.