bluuebunny/crossref_metadata_2025_split huggingface dataset:
Monochromatic X‐Ray CT Using Synchrotron Radiation
Authors: Kohno Hideki , Shiono Hidemi , Nonmember Katsuhisa Usami, , Nonmember Yoshio Suzuki, 
Published: July 2007

AbstractThis paper describes a prototype monochromatic X‐ray CT using synchrotron radiation and evaluates its spatial resolutions, noise in reconstructed images, and quantitatively. A monochromatized X‐ray using a crystal spectrometer is passed through a slit (width 25 mm, variable height 25 μm to 2.5 mm), and then irradiated on a rotating sample. The X‐ray passed through the sample is converted into an electrical signal by using an X‐ray detector with 1024 channels, and then fed into a computer input. This monochromatic X‐ray CT has a view field 25 mm in diameter. The CT has an X‐ray spectroscopy function and a direct magnifying function of projection using an asymmetrical Bragg reflection, as well as a function for conventional cross‐sectional images. This paper describes theoretical analyses of the spatial resolution and noise in reconstructed images which determine the capability of an X‐ray CT, and the experimental evaluation of the prototype CT. Theoretically, the spatial resolution is expected to be greater than 25 μm at a magnification of 5, and this agreed with experimental results, as well as the theoretically determined noise in reconstructed images. The prototype apparatus has an energy resolution of 0.1 percent (full width of half maximum) in an energy range of 7 to 40 keV. This makes an absolute‐value measurement of the X‐ray absorption coefficient possible, and this has been confirmed experimentally. By using this apparatus, it is possible to produce an image quantitatively indicating the distribution of a particular chemical element.
A method for designing neural networks using nonlinear multivariate analysis—application to speaker‐independent vowel recognition
Authors: Irino Toshio , Kawahara Hideki 
Published: July 2007

AbstractThis paper proposes a method of constructing a multilayered neural network, using the multiple logistic model (MLM). The model is a nonlinear multivariate analysis considering the output logistic function of each unit, which is used in the back‐propagation method (BP). The idea can be applied directly to the determination of the multilayered neural network structure. The model can also be utilized as a systematic method to introduce such information as pattern distribution into the neural network structure. Considering the speaker‐independent vowel recognition as the problem, this paper compares the results by the proposed method (MLM), the construction by the linear multiple regression analysis (MRA), the learning by BP with the weight being defined at random as the initial value, and the learning by BP with the initial weight determined by MLM or MRA. It is seen as a result that the recognition rate is the best when BP is applied after introducing the speaker distribution information by the proposed method. It is seen also that the computation time is reduced compared with the BP, with the initial weight being defined at random.
A Speech Modification Method by Signal Reconstruction Using Short‐Term Fourier Transform
Authors: Abe Masanobu , Tamura Shin‐Ichi , Kuwabara Hisao 
Published: July 2007

AbstractThe short‐term Fourier transform analysis‐synthesis technique is promising as a means to obtain high‐quality synthetic speech, since the original speech can be reconstructed from the parameters of analysis. This paper proposes a speech modification method using this synthesis system, especially the pitch frequency modification. Among various methods of the short‐term Fourier spectrum synthesis, the proposed method employs the minimization of squared error between the spectrum of the reconstructed speech and that of the target speech. The proposed method features the following two points: [1] In the pitch frequency modification, only the parameters exclusively related to the pitch frequency are modified; [2] the phase spectrum is not manipulated directly but is estimated by the speech reconstruction algorithm. As a result of evaluation of the proposed method by a hearing test, it was verified that a high‐quality modified speech is obtained for both the uniform pitch modification over the whole word and the nonuniform pitch modification to change the accent position of the word.
Variable bit rate modulo‐pcm using adaptive predictor
Authors: Nonmember Kiyoshi Mizui, , Hagiwara Masafumi , Nakagawa Masao 
Published: July 2007

AbstractRecently, Modulo‐PCM (MPCM) was proposed as one of the waveform speech coding schemes. The MPCM is considered to be a possible alternative to the DPCM. This is because the MPCM has only granular noise without overload although it has the “anomaly errors” instead of the overload noise. The variable bit rate modulo‐PCM (VBR‐MPCM) has been proposed which applies the variable rate coding method to the Modulo‐PCM. This paper proposes the improved variable bit rate modulo‐PCM (improved VBR‐MPCM) whose performance is the same and whose complexity is about half compared with that of the conventional VBR‐MPCM. Moreover, the variable bit rate modulo‐PCM using adaptive predictor (VBR‐MPCM‐AP) also is proposed which uses second‐order pole and sixth‐order zero adaptive predictors instead of the fixed ones used in the improved VBR‐MPCM. From the computer simulation results, it is confirmed that the VBR‐MPCM‐AP is about 0 to 8 dB in segmental SQNR (SQNRseg), which is better than the conventional VBR‐MPCM, MPCM‐AQF and ADPCMs. From the listening test results, it is also confirmed that the proposed VBR‐MPCM‐AP is able to obtain good reconstructed speech.
Algorithm for extracting ellipses using weighted center points map
Authors: Yamato Junji , Ishii Ikuo , Makino Hideo , Irisawa Kazuyoshi 
Published: July 2007

AbstractWhen a group of parallel lines pass through an ellipse, the center point between two intersecting points of each straight line is on another straight line passing through the center of the ellipse. Furthermore, a graphical plot of the distance between the two intersecting points vs. a coordinate value (either x or y) of the center point will form an elliptical shape. These two characteristics of the ellipse are exploited by an algorithm for ellipse extraction. Given an input image of ellipses, a center point map is constructed. Then a Hough transform is used to detect the center line that represents the ellipse. Next, the center line so detected is used to estimate the parameters and to obtain sample pixels of the ellipse. This is followed by a least‐square fitting and high precision parameter value computation. Numerous experiments were conducted which demonstrated the effectiveness of our algorithm.
Speaker Adaptation Algorithms Based on Piecewise‐Moving Adaptive Segment Quantization Method
Authors: Shiraki Yoshinao , Honda Masaaki 
Published: July 2007

AbstractThis paper aims at the speaker‐independent very‐low bit rate speed coding and proposes the speaker adaptation algorithm based on the piecewise movement in the speech spectrum space. In the proposed method, the universal codebook, which is constructed beforehand based on the features of the spectral distribution of an unknown speaker, is adapted to the speaker. The adaptation is based on the process which moves the center of gravity of the universal codebook for several clusters. Two algorithms are proposed for the adaptation. One is a simplified method and the other is a minimum distortion method. The minimum distortion method ensures theoretically that the quantization distortion does not increase for the speech data for adaptive training. A coding experiment was made for the spectral segments of the actual speech. It was shown that the proposed adaptation method has a higher adaptation speed compared with the traditional LBG method. It was shown also that the minimum distortion method converges to the same distortion as the LBG method.
Effectiveness of Metaphor in Mailing Procedure on Electronic Mail System
Authors: Matsuo Naoki , Matsui Hiroyuki , Tokunaga Yukio 
Published: July 2007

AbstractOne of the goals of studies on human interface is to make operating procedures of various systems easier to acquire. From past studies it is known that construction of appropriate mental models in the user's mind is effective in acquiring operating procedures. Furthermore, as a technique to construct easily and quickly appropriate mental models, metaphor and direct manipulation are being studied. However, it has not been clarified how effective these techniques are in acquiring operating procedures. For electronic mailing systems that enable key operations and drawing figures by touching the screen by a magnetic pen, experiments were conducted to clarify the effect on acquiring the operating procedures, regarding the procedure for sending electronic mails as “the one for sending letters by mail.” Subjects are grouped into threes and are taught the procedures for sending mails in different ways for the groups. They operate experimental systems on the first day, the third day, and three months later. Then the time required for each operation is measured and the percentage of those who performed misoperations is calculated. As the result, it is found that if users are taught that the procedure for sending mails is regarded as the one for sending letters, they acquire it easily and remember it well. Thus, it is shown that utilization of metaphor is effective. Also, from the results of the operating time, it is found that the percentage of acquisition of operating procedures can be estimated roughly.
Automated visual inspection for lsi water multilayer patterns by cascade pattern matching algorithm
Authors: Maeda Shunji , Kubota Hitoshi , Makihira Hiroshi , Ninomiya Takanori , Nonmember Yasuo Nakagawa, , Nonmember Yuzo Taniguchi, 
Published: July 2007

AbstractThis paper reports on the defect detection algorithm for the LSI wafer multilayer patterns, together with the result of evaluation. The multilayer patterns are constructed by the exposure after alignment between the wafer pattern and the reticle pattern for each chip. Consequently, the position relation between layers is different even for adjacent chips (interlayer registration error). The developed algorithm compares the gray‐level images of adjacent chips on the wafer and extracts the defect without being affected by the inter‐layer registration error. First, the pattern edge is extracted from the gray‐level image, and the position alignment is executed using the edges. Then, by eliminating the region where gray levels are equal, the regions are extracted for which the position alignment is unsatisfactory. The position alignment is attempted again for that region. This procedure is iterated. When the unmatched region of the pattern edge is sufficiently small, it is decided that the interlayer registration error is absorbed, and the unmatched region is extracted as the defect. An automatic visual inspection system was constructed and evaluated experimentally. As a result, it was verified that the whole chip area can be inspected, and the defect of 0.5 μm or more can be detected in a stable way.
Theories and error analysis of pencil tracing
Authors: Shinya Mikio , Takahashi Tokiichiro 
Published: July 2007

AbstractTo efficiently produce a more realistic image, the paraxial theory is introduced into computer graphics. The paraxial theory is a linear approximation theory established in other fields such as lens designing. The paraxial theory is formulated by a 4 × 4 matrix called “system matrix,” and this provides theoretical bases for various rendering methods such as pencil tracing, beam tracing, and cone tracing.This paper outlines the paraxial theory, analyzes errors from the viewpoint of its application to an image generation, and proposes a compact error‐estimation function. The efficiency of the function is demonstrated experimentally. Basic data to develop an image‐generation technology based on the paraxial theory are presented.
Tomographic image reconstruction from incomplete projection data by the method of convex projections
Authors: Kudo Hiroyuki , Saito Tsuneo 
Published: July 2007

AbstractThis paper proposes a method based on estimation principles for reconstructing images from their incomplete projection data. The problem of estimating missing line integrals is formulated. This method can treat general problems of reconstruction of images from incomplete projection data. It is possible to take into account a priori knowledge of an object which is represented by a nonlinear constraint. This method has lesser possibility of being affected by errors due to the digital processing and requires a lesser amount of computation since the calculation is simpler than conventional methods.This paper also proposed the use of a priori knowledge of the external shape and internal structure of an object so that the performance of the method is improved. Simulation experiments were carried out taking some cases where the projection angle is limited and an object contains an opaque part within it. The results show that the proposed method is superior to conventional methods in the quality of reconstructed images and the amount of computation required.
Effects of main magnetic field time‐variation upon mr images in permanent magnet mri system
Authors: Nozokido Tatsuo , Onodera Takashi , Yamamoto Etsuji 
Published: July 2007

AbstractThe effect of the time‐variation of the static magnetic field in the permanent magnet MRI system on the image quality is studied, together with the method to eliminate the effect. The permanent magnet MRI system has a larger‐time‐variation of the static magnetic field than the superconducting magnet MRI system due to the temperature variation of the permanent magnet used to produce the static field. Thus, one of the important problems inherent to the permanent magnet MRI system is to examine the time‐variation of the static magnetic field intensity within the imaging time on the image quality. However, no detailed report has been made on this effect.This paper shows that the effect of such variation on the image can be represented by the point‐spread function. Through the analysis of this point‐spread function, it is shown that the effect of the time‐variation of the static magnetic field is negligible in the ordinary imaging condition. Furthermore, a method is presented to cope with a time‐variation of the static magnetic field, which is produced by a sudden change of the hardware environment and is much larger than the variation in the usual imaging condition.The variation of the static magnetic field in this method is measured during the imaging, and the effect of the variation is eliminated. The effectiveness of the method is verified based on the signal data obtained from the actual system.
An approach to the generalization problem in the backpropagation method
Authors: Matsuoka Kiyotoshi 
Published: July 2007

AbstractBackpropagation is one of the most widely used methods in artificial neural networks. The method determines the weights of connections between units in a layered network by an iterative computation so that the network produces desired outputs for given inputs. However, the resultant network does not necessarily provide reasonable outputs for patterns not given.This paper proposes a modified back‐propagation learning that produces a reasonable input‐output relation for every possible input in which not only the error function between the actual output and the desired output but also the sensitivity of the output to the input variation are evaluated. It is shown also, using simple examples, that the method gives smooth mappings in the whole input space.
A method to detect distinctive features from boundary data
Authors: Yamagishi Kentarou 
Published: July 2007

AbstractRecently, attempts have been made regarding automatic learning of models of objects with two‐dimensional shapes from their multiple number of images and recognizing objects using pregiven models by partial features of shapes. Both are based on a principle of extracting the local features of a figure and using them as distinctive features for both learning and recognition.This paper proposes a method of feature extraction from a boundary pattern intended to be applied for such purpose. A hinge articulation is considered as a basic component of two‐dimensionally shaped objects, and for each one of the hinge representative shapes—a circle, linked bars and crossed bars—a simple but robust detection method is presented. Since extraction of line segments is necessary as a preprocess for detecting linked and crossed bars, a line‐segment detection method applying Hough transformation is developed for boundary patterns.
A model‐based approach to localizing stable polyhedra using geometric constraints
Authors: Yamamoto Hiroyuki , Tamura Hideyuki 
Published: July 2007

AbstractThis paper presents a method for localizing polyhedra using CAD data of object and range images. It is assumed that the type of object is known and that it lies in a stable position on a stand without any overlap. Before image processing geometric/local constraints and stable attitude/global constraints of objects are extracted from CAD data. From the input image a shape map and jump and roof‐edge maps based on curvature are extracted. These maps are used for object decomposition under the assumption of: (1) edges partition faces, and (2) shape boundaries partition faces.From partitioned faces a description of an object based on its attributes and connectivity relations with other faces is given. Matching is performed between this description and a set of models. Constraints obtained from CAD data limit considerably candidates for correspondence thus making efficient matching possible.Finally, we verify the realizability of obtained matching results and determine the attitude. To determine the attitude of an object, it suffices to determine three degrees of freedom. This paper describes not only the construction and methodology of the system but also shows experimental results based on real data.
Speaker‐independent vowel recognition combining voice features and mouth shape image with neural network
Authors: Wu Jian‐Tong , Tamura Shinichi , Mitsumoto Hiroshi , Kawai Hideo , Kurosu Kenji , Okazaki Kozo 
Published: July 2007

AbstractThis paper describes a neural approach intended to improve the performance of a voice recognition system for unrestricted speakers using not only voice sound features but also image features of the mouth shape. The FFT power spectrum of acoustic speech was used as the voice feature. In addition, the gray‐level image, binary image, and geometrical shape features of the mouth were used as the compensatory information and a comparison made of which kinds of image features are effective for voice recognition by a neural network.For unrestricted speakers, a vowel recognition rate of about 80 percent was obtained using only voice features. However, this increased to some 92 percent when voice features plus binary images were used. This method can be applied not only to the improvement of voice recognition, but also to aid the communication of hearing‐impaired people.
Performance evaluation of a multivalued rsa encryption vlsi
Authors: Wei Shugang , Kameyama Michitaka , Members Tatsuo Higuchi, 
Published: July 2007

AbstractThis paper discusses performance evaluation of a multiple‐valued RSA encryption VLSI based on radix‐4 signed‐digit (SD) number arithmetic that is very useful for long word length arithmetic. In the arithmetic unit of the encryption VLSI, a signed‐digit adder (SD adder) is used, which is constructed with bidirectional current‐mode circuits. Also, the input/output interface circuit of the radix‐4 adder is considered for construction of a high‐speed SD full adder. A layout of the encryption VLSI including this multiple‐valued SD full adder is designed by the 2‐m̈m CMOS rule and the chip size is 9.1 7.4 mm2 for 512‐bit word length encryption. By performance evaluation with extracting SPICE parameters from the layout, an encryption rate of 85 bit/s can be obtained which is a factor of eight times faster than that of the corresponding binary one.
Access methods of a two‐dimensional access memory by two‐dimensional inverse omega network
Authors: Kumagai Takeshi , Sugai Naoto , Takakuwa Masayuki 
Published: July 2007

AbstractThis paper discusses an organization of a parallel memory, in which any local area of a two‐dimensional (2‐D) array can be accessed. The proposed memory system is composed of a memory array, which is a 2‐D array composed of memory modules and a 2‐D interconnection network with a 2‐D array of input/output terminals. It is used with a 2‐D processor array for local parallel processing, realizing a parallel access to sub‐arrays of the 2‐D array stored in the memory array.This paper describes a method to store the 2‐D array in the memory system, a method of address generation for the memory array to perform parallel access, and a control method for the interconnection network. It is shown that those ideas can be realized by a simple hardware, and the proposed memory system is useful in the computer executing the local parallel processing of 2‐D arrays.
Fault detection of ttl combinational circuits based on supply current
Authors: Hashizume Masaki , Tamesada Takeorai 
Published: July 2007

AbstractThis paper considers a method of detecting a fault in the TTL combinational circuit based on the supply current flowing into the circuit. The authors have proposed a fault detection method for the combinational circuit based on the supply current and indicated the feasibility of fault detection. However, the method proposed in the past is based only on the supply current waveform, and it is required to determine the feature vectors for all the measured supply currents. Consequently, to apply the method to the practical fault detection of logic circuits, the computational complexity as well as the computation time in determining the feature vector should be reduced.From such a viewpoint, this paper proposes the following method of fault detection. Whether or not a fault exists is determined first by the average, the maximum and the minimum of the supply current. Only for the supply current waveform, which cannot be decided as the nonfaulty circuit, is the feature vector employed to make a further decision using the pattern recognition technique. The effectiveness of the method is demonstrated experimentally for the TTL logic circuit. Also, an algorithm is presented which can determine, from the set of faults, the fault for the reference pattern of the supply current.