bluuebunny/crossref_metadata_2025_split huggingface dataset:
Deadlock prevention and avoidance methods using timestamps for locking control in distributed database systems
Authors: Kobayashi Tetsuji 
Published: July 2007

AbstractLocking is used widely for concurrency control in database systems, and locking methods are categorized as static locking or dynamic locking. For distributed database systems, this paper proposes a new deadlock prevention method for static locking and a new deadlock avoidance method for dynamic locking. The common advantages of these methods are as follows: (1) system performance is improved by using time stamps; (2) since transactions are executed without explicitly using time‐stamp ordering, after a transaction lock is permitted, even when another transaction with a smaller time stamp arrives, the rollback of the transaction is unnecessary; and (3) since time stamping is used only for deadlock resolution, the proposed methods can easily be introduced to existing distributed database systems that use locking control.
High‐precision t1 imaging method for magnetic resonance imaging
Authors: Satou Shinichi , Sano Koichi , Yokoyama Tetsuo , Koizumi Hideaki 
Published: July 2007

AbstractIt is expected in magnetic resonance imaging (MRI) that the measurement of the longitudinal relaxation time (T1) will be useful in the diagnosis of cancer and in the tissue characterization. The present problem in this regard is the deterioration of the accuracy due to the various factors such as the rotation angle error of 180 deg pulse and the finite repetition time for imaging.From such a viewpcint, this paper derived an expression for the signal intensity for the inversion recovery image (IR image) considering those factors, and it is shown that a highly accurate T1 image with small error can be constructed by the proposed method from at least three images with different inversion times. Then a simplified method is proposed which can derive analytically the T1 image from three IR images obtained without using the iterative calculation, by controlling the inversion times so that they form an arithmetic progression. It was verified by a computer simulation that the error in the T1 image due to the forementioned factors can be kept below 1 percent by the proposed method. Using the MRI system, the T1 image as well as the proton density (rH) image are obtained from a copper‐sulfate phantom. The error between the object and the reconstructed image, which has been as large as 7 to 15 percent, is now suppressed to approximately 1 percent by the proposed method. Thus, the accuracy improvement in T1 and rH images is verified.
3‐D shape reconstruction of human face from a 2‐d facial image and provision for change of expression
Authors: Komatsu Koji 
Published: July 2007

AbstractVarious studies are presently being made on the facial image (e.g., highly efficient coding and the discrimination of faces) for computer animation and TV conference systems. This paper describes a method in which the three‐dimensional (3‐D) shape of the face is estimated from a single 2‐D facial image, and the expression or the direction of the face can be modified. The original 2‐D facial image need not be taken from the front, and the image from any direction can be used. The curved surface model, not the usual polyhedron model, is employed as the 3‐D shape model.The surface model generates the curved surface passing through the feature points of the face (e.g., the eyes and both ends of the mouth) and produces the 3‐D shape of the face. Compared to the conventional method, in the surface model it suffices to specify only a small number of feature points on the facial image. The 3‐D shape of the face can be estimated with sufficient accuracy for image generation, and the expression can be varied in a flexible way. Using this method, if only a single picture or image of a face is available, dynamic images with varying expressions and directions can be generated. An application, for example, is a broadcast program in which a historical figure changes expression or speaks. Another basic application will be to realize the intelligent image coding, which is of recent concern.
Speaker‐independent consonant recognition by integrating discriminant analysis and hmm
Authors: Kawahara Tatsuya , Doshita Shuji , Kitazawa Shigeyoshi 
Published: July 2007

AbstractA new consonant recognition method is proposed which integrates two stochastic methods: discriminant analysis and HMM. Discriminant analysis is effective in analyzing local patterns but it assumes precise detection of reference points. HMM is able to extract the overall dynamic features and needs no explicit segmentation of speech. However, it lacks the ability to discriminate between similar consonants. The method herein constructs HMM with discriminant analysis front end and recognizes consonants by combining the score obtained by discriminant analysis and that by HMM. For all the Japanese consonants, this integrated method achieved the recognition rate of 92.1 percent, which is higher by 5 to 15 percent than the case using either of the two methods alone.
Automatic identification of human faces by 3‐d shape of surfaces‐using vertices of b‐spline surface
Authors: Abe Toru , Aso Hirotomo , Kimura Masayuki 
Published: July 2007

AbstractThis paper proposes a new method for automatic identification of human faces. This identification method uses a facial three‐dimensional (3‐D) shape that is extracted from an absolute range map. The important issue is to determine what to use as feature vector components for the identification of 3‐D objects. There have been several approaches to identify 3‐D objects, but in the identification of objects that have smooth and complex shape (such as a human face) such approaches did not use the whole feature included in an object, or a long time was required for the identification because of the large number of feature vector components needed.To solve these problems, an approximation of a facial surface with a B‐spline surface was made by least‐square fitting, and the vertices of the B‐spline surface were used as feature vector components for the identification. Since this process condenses the whole feature included in a surface into a small number of points (vertices), features can be used efficiently for the identification. By this method, identification accuracy of 98.8 percent is obtained for 33 persons (5 data/person).
Method of diagnosing multiple stuck‐at‐faults in combinational circuits
Authors: Yamada Teruhiko , Hamada Shuji , Matsumoto Tatsuo , Takahashi Toshihiko , Nakayama Takao 
Published: July 2007

AbstractTo reduce VLSI turnaround time and cost, an efficient fault diagnosis method must be developed. Electron‐beam probing, which allows observation of the signal values within a chip, is one of the promising approaches for fault diagnosis. However, it is strongly desired that the number of probes be reduced; otherwise, a great deal of effort results.The electron‐beam probing, guided by deduction based on implications of internal signal values [6], is considered one of the effective solutions to this problem. Here this idea is built upon by adding preprocessing to further reduce the number of probes and postprocessing to improve the diagnosis resolution. The method proposed efficiently diagnoses multiple stuck‐at faults in combinational circuits. Using computational experiments it is also shown that almost all of the faults are diagnosed by probing about 15 percent of the nets when test patterns for detecting single stuck‐at faults are used.
Optimum contrast enhancement using fuzzy sets
Authors: Saito Atsuhisa , Nakajima Masato , Ogawa Koichi 
Published: July 2007

AbstractThe local histogram equalization employed in the contrast enhancement of the image contains two problems: the long processing time and the distortion of the image quality due to the overenhancement.To reduce the processing time, sampling and hardware implementation are considered. On the other hand, to improve the image quality, the adjustment of the size of the reference region, the weighting in the reference region and clipping are considered.A problem in past efforts for image quality improvement, however, is that the size of the reference region and the clipping value are set as fixed values, which is one of the reasons that a sufficient improvement of the image quality has not been achieved. It is expected that optimum values exist for the size of the reference region and the clipping for each image and for each part of the image to realize the best contrast.This paper proposes a method to ameliorate the image distortion by adjusting the size of the reference region and the clipping value by the fuzzy control for each part of the image. The result of processing is shown, and the usefulness of the proposed method is discussed.
Image matching using structures of edge‐image graphs
Authors: Fukunaga Kunio , Asano Takaeshi , Murata Hideto , Izumi Masao 
Published: July 2007

AbstractThis paper proposes an algorithm for examining similarity and correspondence between a pair of images in which the same object appears in different scaling and with rotation such as stereo images or motion stereo images.As a method for finding correspondence and similarity in an efficient manner, an edge‐line image is found first and then the relationship of connection among edgelines in a graph structure are represented and expressed in an algebraic expression. Using this representation a method is clarified for finding similarity between images and an algorithm is proposed for finding similarity and further correspondence between two images affected by scaling and rotation using the degree of similarity between their line structures. Finally, the algorithm is applied to motion stereo images to examine its effectiveness.
Superquadrics for 3‐D shape indexing language
Authors: Horikoshi Tsutomu , Kasahara Hisashi 
Published: July 2007

AbstractWith the recent development of input, presentation, and processing technologies for three‐dimensional (3‐D) images as the background, the demand for the effective storage and management of 3‐D images is expected to increase. This paper aims at the effective storage and retrieval of the 3‐D images and proposes a 3‐D shape indexing by the superquadrics. The features of super‐quadrics are that the expression is simple and various shapes can be represented using a smaller number of parameters.To examine the applicability of the function, the technique based on superquadrics is compared with conventional 3‐D modeling from the viewpoint of the power for representing the feature and shape as the technical requirement for the indexing.The purpose of the conventional modeling technique is to represent the shape from the visual sensation. However, this resulted in a problem whereby it is difficult to determine the shape from the modeled data structure.By contrast, with superquadrics, the functional parameters are easily related to the shape; thus realizing a sufficient applicability as the indexing. An image retrieval system is constructed using the superquadrics parameters as the indexes, and the usefulness of the proposed indexing technique is demonstrated.
Properties of averaged projection filter for image restoration
Authors: Yamashita Yukihiko , Ogawa Hidemitsu 
Published: July 2007

AbstractThe averaged projection filter (APF) is an optimal restoration filter proposed by the present authors in another paper. Here, properties of the APF are discussed in detail. For example, the image component of the restored image with the APF coincides with the original image if the original image belongs to a subspace. For the original images outside the subspace, the image component becomes the oblique projection onto a subspace of the original image in the mean square sense. A noise suppression mechanism of the APF also is clarified by using the null space of the APF. A simpler expression of the APF is given under some assumption. Finally, relations between the APF and the Wiener filter are discussed.
Evaluation of nonlinear optimization methods for the learning algorithm of artificial neural networks
Authors: Takagi Hideyuki , Sakaue Shigeo , Togawa Hayato 
Published: July 2007

AbstractThis paper describes the implementation of nonlinear optimization methods into the learning of neural networks (NN) and the speed efficiency of four proposed improvements into the backpropagation algorithm. The problems of the backpropagation learning method are pointed out first, and the efficiency of implementing a nonlinear optimization method as a solution to this problems is described.Two nonlinear optimization methods are selected after inspecting several nonlinear methods from the viewpoint of NN learning to avoid the problem of the backpropagation algorithm. These are the linear search method by Davies, Swann, and Campey (DSC), and the conjugate gradient method by Fletcher and Reeves.The NN learning algorithms with these standard methods being implemented are formulated. Moreover, the following four improvements of the nonlinear optimization methods are proposed to shorten the NN learning time: (a) fast forward calculation in linear search by consuming a larger amount of memories; (b) avoiding the trap to local minimum point in an early stage of linear search; (c) applying a linear search method suitable for parallel processing; and (d) switching the gradient direction using the conjugate gradient method. The evaluation results have shown that all methods described here are effective in shortening the learning time.
A shape interpolation method for three‐dimensional digital images
Authors: Jin Xiuyi , Yokoi Shigeki , Toriwaki Jun‐Ichiro 
Published: July 2007

AbstractThis paper proposes a new method to form an image of a three‐dimensional (3‐D) object from a set of slice images such as X‐ray CT and MRI by interpolating them. The 3‐D image is reconstructed by using the union of 2‐D images interpolated between adjacent sectional planes which are perpendicular to the slices. The method has features of: (1) interpolations between slices are carried out fully automatically if the image components in a region of interest are overlapped on adjacent slices, and if the region is extracted; (2) the operation of obtaining this is easy since the interpolated shape is obtained in a voxel form; (3) the method can be applied to an object with branches; and (4) the method also can be applied to an object with holes. After reviewing 3‐D interpolation methods, experiments with some artificially made objects and actual MRI images are shown to confirm the usefulness of the proposed method.
Improving image quality for block coding by image division method
Authors: Zheng Zhong , Nakajima Masayuki , Agui Takeshi 
Published: July 2007

AbstractIn block coding, the original image is divided into square blocks composed of N × N pixels, and the coding is applied to each block. When the image is coded at a low bit‐rate, however, there is often produced a block noise in the reconstructed image. When a block noise is produced in the part of the time where the change of the gray‐level is slow, the noise deteriorates the image quality greatly.To reduce the block noise, this paper proposes three methods of image division. Let the blocks in a horizontal row in the conventional divided image be called a block row. In the first method, the division is executed by moving each block row in the horizontal direction. The amount of translation is determined by a random variable. The second method divides the original image by the rectangular block, and then each block row is moved as in the first method. The third method divides the image using an octagonal block. It is verified by experiment that the block noise can be reduced by the proposed image division.
Development of software system organized by minimal automata realization theorem for gait measuring
Authors: Saito Yoshiyuki , Niinomi Shigeru 
Published: July 2007

AbstractWe describe the software system for improving the efficiency of the gait measuring experiment for the rehabilitation of amputees. This software has the following features: (1) The system consists of independent programs that are connected by a CHAIN statement. So it can easily adjust to the changes or progress in equipment and the measuring method; (2) the flow structure is organized in terms of the algorithm of minimal automata so that redundancy appearing in repeated measurements is eliminated and the load on the amputee is reduced.
Measurement of reaction time in agility using bioelectrical impedance
Authors: Yamamoto Yoshitake , Nakamura Takao , Yamamoto Tatsuma , Tsuji Hiroaki 
Published: July 2007

AbstractThis paper describes a method of reaction time in agility using the bioelectrical impedance, which is not affected by either the measurement items or measurement site that is closer. In this study, the measurement is made for two items, the jumping reaction test and the bar‐gripping reaction test. Reaction time, movement time, and total time are defined based on the waveforms of the lower leg electrical impedance and the forearm electrical impedance. Results are compared to the reaction time and the total time obtained by the traditional method. The results using the proposed method almost agreed with the results of the traditional method, and it is verified that the proposed method can be used to measure the reaction time.It should be noted that reaction time and movement time can be separated from total time for the bar‐gripping test; this has been impossible in the traditional method. The ability to separate types of time is of use in an experiment in alcohol drinking conditions; results of this experiment are presented. It is expected that the proposed method will be applied to various measurements in such fields as measurement of physical fitness, sport training, and rehabilitation.
Modeling and analyzing advance processing control by extended message‐passing
Authors: Kobayashi Shinya , Nakanishi Hikaru , Tezuka Yoshikazu , Watanabe Takashi 
Published: July 2007

AbstractThe job for which processing is determined only in the course of execution is called the unschedulable job. When an unschedulable job is to be executed in a parallel processing system, it is not predetermined when the communication between processors arises, and synchronization among processors is a serious problem.This paper considers the mathematical theory for the existence of interprocessor communication and the transmission time in the execution of the unschedulable job. The message‐passing scheme is extended, considering the message transmission probability and the indeterminate aspects of the transmission time. Then the advance processing control is considered, which helps the synchronization among processors in the execution of the unschedulable job, and the overhead is theoretically analyzed. The condition for the task assignment to the processors is derived so that the deterioration of the processing speed due to the overhead can be minimized.
Lowpass filtering method for heart rate variability analysis
Authors: Noguchi Yasuaki , Hataoka Hiroshi , Sugimoto Suguru 
Published: July 2007

AbstractVarious methods have been proposed for the spectral analysis of heart rate variability (HRV). Such methods always require constant period data in time series. However, since the R‐R interval of HRV is, in general, irregular, somehow the experimental data must be converted to constant period data. Assuming an integral pulse frequency modulation (IPFM) model, constant period data can be obtained by passing the heartbeat impulse train through a digital filter using the alias‐free method proposed by French and Holden.However, the forementioned method has two problems; that is: (1) the frequency characteristics of the lowpass filter are assumed to be ideal, hence the impulse response function of the filter spreads infinitely with respect to time; and (2) only pulses inside the analyzing section are considered while those outside the analyzing section in the convolution integral are ignored.To solve those problems, the method of French and Holden has been modified in the following three points: (1) such a finite impulse response digital filter was used that the sidelobe of the filter decays rapidly in its impulse response function; (2) the analyzing section as well as its impulse response time were lengthened, thus the pulses outside the analyzing section were considered; and (3) an appropriate window was used.With these improvements, the truncation error and the computation time could be reduced. Furthermore, as a result of simulation, a much higher accuracy in the demodulation of the heartbeat signal was obtained.
A method for translating natural language program specifications into algebraic specifications
Authors: Seki Hiroyuki , Kasami Tadao , Nabika Eiji , Matsumura Takashi 
Published: July 2007

AbstractA method for translating program specifications in a natural language into algebraic specifications is presented. The translation rules consist of: (a) syntax rules of the natural language; (b) rules for constructing an intermediate structure similar to “categories” in HPSG; and (c) rules for generating axioms to translate intermediate structures into axioms of the form of logical formula = =True.Based on the concept of type, which is defined by using the derivations of expressions representing the meanings of natural language sentences in a generative grammar, and based on the characteristics of the functions representing the meanings of words, a more rigorous method of solving the problems of elimination of syntax ambiguities anaphoric bindings, and sorts and scopes of quantifiers is proposed.Especially, by introducing attributes having the type information of the functions denoted by natural language phrases in the intermediate structures, ambiguities at the time of the parsing can be reduced. Also, the meaning of phrases such as verb phrases can be rigorously defined by using functions having arguments of different types for singular and plural objects. Arguments which are not explicitly specified in natural language sentences can be represented formally by introducing arguments which have types representing the states of the program.Furthermore, a method is proposed to rigorously deduce the sorts and scopes of the quantifiers by using the dependency relation between the arguments representing the meanings of the words. The results of translating the main part of the OSI session protocol are presented.
3‐D natural interactive interface—using marker tracking from a single view
Authors: Hemmi Kazuo , Inoue Kazuo 
Published: July 2007

AbstractThe proliferation of microcomputers and powerful single‐user minicomputers has created an urgent demand for effective man‐computer interface in three‐dimensional (3‐D) space. This paper presented an interface that is able to recognize finger movement by using an image processing from a single view. Two ring‐shaped markers are attached on the fingertip of an index finger and a thumb. Tracking the positions of two markers, six behaviors of the hand are detected. The detected behaviors to manipulate the object are as follows: catch the object, x translation, y translation, z translation, rotation in the horizontal plane, and rotation in the vertical plane.The image of the current hand and the object presented by wire‐frame is projected on CRT in real time. The operator is able to manipulate the object moving the hand within the view of the TV camera. Because of the foregoing six motions set equivalent to the motions exactly as done in daily life, an operator can maintain a natural interaction with a computer.