bluuebunny/crossref_metadata_2025_split huggingface dataset:
High‐speed transformation of drawing images based on structure description
Authors: Ariki Yasuo , Wakimoto Kouji , Shieh Hui , Sakai Tosiyuki 
Published: July 2007

AbstractThis paper assumes the situation where the existing drawing is to be re‐utilized after a partial modification, and discusses a system, which can easily improve or modify with a high speed the characters and figures at the image level. First, the input drawing is segmented automatically and described in terms of the composing elements of the drawing, such as the character, the segment, the connecting point and the frame surrounding characters. Since the description is the structure description of the drawing, and no particular drawing is assumed, the method can be applied to various kinds of drawings. Then based on the description, the desired transformation is planned. Finally, based on the transformed description, the image is transformed. The proposed system features the following: (1) A versatile structure description is available; (2) two‐stage transformation, i.e., the transformation at the description level and the transformation at the image level, is employed. This two‐stage transformation makes possible the global transformation of the drawings, such that the frame surrounding the characters can be transformed according to the change of the character string length; and (3) the real‐time image processing, such as extraction of the composing elements and image generation is realized by the data‐flow processor.
Relation of binary image complexity to gray‐scaled image thresholding
Authors: Taniguchi Rin‐Ichiro , Kawaguchi Eiji 
Published: July 2007

AbstractConventional gray‐scaled image thresholding consists in finding the threshold according to the bimodality of a gray‐level histogram of an input image. However, few discussions have been made on the thresholding problem from the viewpoint of the optimality of the results. As far as image perception (human perception) is concerned, we naturally see the image as simply as possible. Taking such situation into account, the threshold for image thresholding operation should be determined on the same basis. This paper presents a principle in which the optimality of the thresholding process is evaluated according to the complexity change of the binarized picture against the change of the threshold value. Specifically, we show that the complexity curves are categorized into either unimodal or multimodal. For the multimodal case, we show that a good thresholding can be obtained by choosing a minimal point on the curve as the threshold. For a unimodal case we introduce another strategy which depends on the local multimodality of the complexity curve.
High‐accuracy distance and inclination measurement using slit‐ray projection method
Authors: Naruse Hiroshi , Nomura Yoshihiko , Yamamoto Toshio 
Published: July 2007

AbstractThe slit‐ray projection has been used widely as a method of meauring the distance and the inclination of the TV camera in regard to the object. In this method, the image is sampled and quantized into several hundreds pixels square, and the center position of the slit‐ray projection is determined by the data processing to determine the distance and the inclination. In earlier methods, however, the unit in the measurement of the center position has been one pixel, and the measurement accuracy is restricted to the same order as the range of measurement divided by the number of pixels. Consequently, the method has been difficult to apply to the case where a higher accuracy is required. This paper presents a slit‐ray projection method where the center position can be determined with accuracy of less than one pixel, leading to the highly accurate measurement of the distance and the inclination. In the proposed method, the positions of more than three pixels in the slit‐ray projection as well as the gray level of the pixels are analyzed by the regression to the normal distribution using the least‐square method. It is shown that the center position can be determined with a high accuracy of 0.05 pixel. A correction method is also presented, where the slit‐ray is shifted vertically by a specified distance, and the center position is determined accurately. By this scheme, the image plane length and the image distortion can be determined. By combining those ideas, it is shown by an experiment that the proposed measurement for the distance and the inclination can realize approximately 10 times higher accuracy, compared with the traditional methods.
An object‐oriented approach for interactive microprogram simulator
Authors: Sugimoto Akira , Abe Shigeru , Kuroda Masahiro , Katou Sachio 
Published: July 2007

AbstractEfficiency and reliability are essential to microprograms, and it is important to perform debugging and evaluation through interaction with the simulator. The simulator is also indispensable in the development of the microprogram in parallel to the hardware. However, if a dedicated simulator is to be developed for each target computer, constraints are imposed on time and cost, making it difficult to realize a high‐level interactive interface. On the other hand, if a general‐purpose simulator is to be employed, it is difficult to provide an interface suited to the target computer, such as visual simulation. This paper proposes an object‐oriented system aiming at the realization of both the detailed function of the dedicated simulator and the versatility of the software. Although the object‐oriented language has a high modularity, adequate modeling must be provided for the whole system including the interfaces, to ensure the machine‐independence of the microprogram simulator, where the object of the description itself depends on the target computer. In this paper, an interactive interface is proposed, which is suited to the debugging of the microprogram. Then a realization by the object‐oriented scheme is described which has a high flexibility against the modification of hardware specification and permits an easy reuse of the software for other computers. As a practical example, the development of μP simulator by the authors is outlined, together with the description of the user interface.
A new speckle pattern measurement method for in‐plane displacement analysis
Authors: Kawakami Takashi , Takagi Mikio 
Published: July 2007

AbstractLaser speckle photography is employed as a noncontact technique for measurement of minute in‐plane displacement of objects. With this technique, the direction and magnitude of displacement in a tiny portion of an object are expressed as the angle and spacing of Young's fringes. There has been a need for an image data processing procedure which can quantify and calculate displacement values. This paper describes a new algorithm, developed for this purpose, which employs projected profiles of the original image density and also the maximum entropy method (MEM). Specifically, the fringe angle is found by comparing projected density profiles obtained from various angles. MEM is used to calculate fringe spacing. Results of an experiment carried out to verify the accuracy of this algorithm confirm that it is relatively unaffected by optical noise and provides sufficient measurement accuracy for practical application even when there are few fringes. Accuracy to within ±2% is achieved for a displacement magnitude of 150 μm and to within ±1% for the displacement direction.
Fractal—based analysis of 3D natural shapes and its application to terrain modeling
Authors: Yokoya Naokazu , Yamamoto Kazuhiko , Funakubo Noboru 
Published: July 2007

AbstractThis paper describes the fractal analysis and interpolation of 3D natural surface shapes and their application to terrain modeling in a sensor simulation for an earth resource satellite. After reviewing the concept of fractals, especially the fractional Brownian function and its fundamental characteristics, we present fractal‐based techniques for analyzing and interpolating 3D surface shapes. These techniques are based essentially on the approximation of the surface by the fractional Brownian function. Finally, the application of these techniques to terrain modeling is described. The analysis‐followed‐by‐interpolation method is applied successfully for generating the digital terrain map of high spatial resolution from the existing coarse terrain data.
Program verification system with synthesizer of invariant assertions
Authors: Dan Seiichiro , Yamaguchi Takahira , Kakusho Osamu , Tezuka Yoshikazu 
Published: July 2007

AbstractAutomatic verification system of programs is considered to be an important constituent in software development of the supporting environment. Detailed specifications including the invariant assertion of loops, are necessary for the program verification. Thus since it is very burdensome for humans to prepare them completely, the supporting environment is desired. Thus, we have been working on a theoretical investigation regarding the generation of invariant assertions, and furthermore, the construction of a program verification system with a synthesizer of invariant assertions. The theoretical investigation has already been reported, and this paper describes the implementation of our system and presents the results. Our system is a comprehensive program verification system which includes program input, obtaining specifications (invariant assertion generation), generating verification conditions, and proving the verification conditions. As synthesizers of invariant assertions, execution of difference equation method, tracing of program variables and path conditions by symbolic execution, and proposing invariant assertions by induction from trace information are realized. These functions are explained through executive examples and using computers, it is shown that the generation of invariant assertions and its support are possible. Also, since our system, including the proof system, is realized, it is more realistic and promising than existing program verification systems.
Construction and application of multivalued multithreshold circuit based on threshold control
Authors: Wakui Fumio , Tanaka Masaichi , Sakamoto Hiroyuki 
Published: July 2007

AbstractThe research and development of a 4‐valued integrated circuit, which is compatible to a binary circuit, is now being conducted intensively, aiming at the transfer of the merits of a multivalued system to a digital system. Another merit of the multivalued circuit is that the number of wirings and the wiring length can be reduced, which is useful in reducing the delay of driving due to the interwiring capacitance. On the other hand, the noise margin is a problem in the use of the multivalued circuit. From such a viewpoint, the authors are trying to improve the noise margin, and reported on the threshold control for the multivalued multithreshold circuit. In this circuit, however, the voltage step is reduced in correspondence to the control of the noise margin. This necessitates an increase of the supply voltage. As a result, when the binary ECL device is used as the circuit element, the number of levels that can be discriminated in the integrated circuit is restricted to 3 (two thresholds). This paper aims at the realization of up to a 5‐valued 12‐threshold control circuit by the binary device. For this purpose, a new threshold detector, the fundamental circuit which is obtained as an extension of that circuit, and the complementary circuit, are employed. In the threshold‐setting circuit in the threshold detector, the control value and the voltage step can be set independently, which leads to the low‐voltage supply. By introducing the signal distributor into the threshold detector, the maximum fan‐in and fan‐out, as well as the maximum number of thresholds are improved drastically. As an application, the threshold control 4‐valued decoder was constructed experimentally, and it is shown that the noise margin is improved by 1.95 times or more.
Representation of teaching‐world knowledge and the method of the inference for intelligent cai
Authors: Okamoto Toshio 
Published: July 2007

AbstractThis paper considers the learning world of differential calculus for composite functions, including trigonometric functions, and describes the mechanism of an intelligent CAI system NEUTON. In the design of the system, the teaching world is divided into the meta‐knowledge‐base for dialog management, the text knowledge‐base, the problem‐solving expert knowledge, the rule‐base for tutoring strategy, and the bug knowledge. The modular structure is thus considered for the knowledge‐base. The representation of knowledge and the method of inference are considered, utilizing the characteristics of such knowledge as follows.The text knowledge is based on the semantic network representation, where the procedural knowledge is supplemented. Other knowledge bases are described by the production rules. The knowledge structure is simplified so that the interpretation and the execution are made by a single meta‐inference engine. The response of the student as well as his level of understanding are recognized and diagnosed utilizing those knowledges, and the individual guidance process is developed. In the intelligent CAI, important mechanisms are those for identifying the cause of the error, and the determination of the micro‐ and macroscopic means of remedy from the knowledge‐base. In this paper, a schema is described where the bug generation, diagnosis mechanism, problem‐solving expert mechanism and the student model called MOD are closely interrelated.
MR image reconstruction from half the data using a phase map
Authors: Sano Koichi , Suzuki Kazuo , Yokoyama Tetsuo , Koizumi Hideaki 
Published: July 2007

AbstractThis paper describes a method of image reconstruction from approximately half the data in the measurement space, as a means to reduce the measurement time in magnetic resonance imaging (MRI). In the conventional method, the property of the data where the image is of a real value, is utilized. Consequently, it is not applicable to the case where the image contains a large phase distortion. This paper derives first the theoretical relation among the measured data for the image with arbitrary phase. The condition is shown for the image to be reconstructed using the phase information from the partially measured data. Then a recurrence formula is derived by which the remaining unknown data can be determined by fast‐Fourier transform. By the proposed method, the image can be reconstructed from approximately half the data, including the data needed to estimate the phase. As a result of the simulation and volunteer experiments, it was verified that a satisfactory image can be reconstructed from approximately 53 percent of the data.
Quantification of the heartbeat rhythm using characteristic equation of autoregressive model of R–R intervals in ECG
Authors: Takata Kazuyuki , Watanabe Yosaku , Yokoyama Kiyoko 
Published: July 2007

AbstractThe heartbeat rhythm is affected by various factors such as respiration, blood pressure, body temperature regulation, and arrhythmia. Other external factors also affect the variation of the heart‐rate with various frequency components. The heart‐rate variability (HRV) has been used as an index for the heartbeat variation, but it represents the variation caused by a large number of factors through a single measure, since it is determined from the overall time‐series of heartbeats. Consequently, it does not have a clear interpretation and can represent only macroscopic information. If an arbitrary frequency component can be extracted from the heartbeat rhythm and HRV derived based on that component, a detailed and clear information will be obtained.This paper proposes a method to extract a fluctuation component for an arbitrary frequency. The autoregressive (AR) model is applied to the time‐series of heartbeats, and the power spectrum density function is decomposed based on the characteristic equation of the AR model. HRV for arbitrary frequency component is examined. The time‐series of heartbeat is decomposed into frequency components. A time‐series is generated by simulation with the same statistical property as the decomposed component, and is analyzed to verify the effectiveness. The method is applied to the exercise ECG for analysis. As a result, the usefulness of the method was demonstrated by indicating that the information which cannot be obtained from the overall time‐series can be obtained from the generated series having only a decomposed component.
Paragram: A high‐level programming language for parallel processors
Authors: Yamamoto Fujio , Umetani Yukio , Demoto Manabu 
Published: July 2007

AbstractThis paper presents the design principle of PARAGRAM, which is being developed for the parallel processing description for numerical simulation. The specification for the language is outlined, and the result of applying the language to the description of the actual problem is presented. The proposed language aims primarily at the following. The programmer is asked to indicate the parallelism inherent to the problems in the lumped system such as structural analysis and network analysis, and the particle problems such as neutron transport. This facilitates the mapping to the parallel computer architecture to be employed. The productivity and the maintainability of the program are improved by the simplicity of the description. Usually, different types of parallel processings are required for the lumped system and the particle system. In the former, the array‐oriented parallelism often is observed, for example, the calculation of elements in the sparse matrix and the linear calculation using the sparse matrix. In the latter, the procedure‐oriented parallelism often is observed based on the processing for each particle. The declaration function for the structure of various sparse matrices as well as the operation description based on the logical structure are employed for the former. The definition function for the particle density and probability distribution for the Monte Carlo particle system, as well as the parallel execution control block function for the simulation, are provided for the latter. As a result of applying the proposed language to the parallel processing description of the actual problem, it was verified that the description lines can be reduced by 23 to 62 percent from the traditional serial processing FORTRAN, indicating that the language is useful in the clear description, thereby improving the descriptive power.
Spatial feature detection using a pulse‐type hardware neuron model
Authors: Sekine Yoshifumi , Suyama Masatoshi , Muramatsu Atsushi 
Published: July 2007

AbstractThe feature‐detecting circuits based on the pulse‐type hardware neuron model using a ∧‐shaped transistor to apply neuron information processing in a living body to engineering applications is studied. Previously, the properties of the pulse‐type hardware neuron model were shown using a ∧‐shaped transistor and a temporal feature‐detecting circuit designed with the ON‐response pulse‐type hardware neuron model was presented.This paper discusses spatial feature‐detecting circuits based on the pulse‐type hardware neuron model using a ∧‐shaped transistor. First, the properties of the Neural AND Gate based on the pulse‐type neuron model are shown and the design requirements and the output regions are clarified by operation analysis for local peak, local valley, and slope‐detecting circuits. These circuits are applications for spatial feature detection. Second, the experimental results on the three detecting circuits designed with the pulse‐type hardware neuron model using a ∧‐shaped transistor are shown. Finally, it is concluded that the pulse‐type hardware neuron model using a ∧‐shaped transistor is useful for both spatial feature‐detecting circuits and temporal feature‐detecting circuits.
Extraction and computational estimation of malignant microcalcification on mammography
Authors: Yabashi Seiji , Hata Masayasu , Kubo Kanji , Ishikawa Taro 
Published: July 2007

AbstractMammography is one of the tools in the diagnosis of breast cancer. By a new method of mammography based on the soft X‐ray and the ultrafine X‐ray film, the X‐ray exposure is reduced and the fine internal structure of the breast can be observed. With the increase of the subjects for breast cancer, it is required to improve the accuracy and efficiency of the diagnosis. A diagnosis‐supporting equipment is required which provides an image display to assist in recognition of pathological changes, and provides an objective feature evaluation. This paper considers the microcalcification which is important in the diagnosis of the early breast cancer. The microcalcification appears as opaque points on the mammograph, and when the points are concentrated locally, it is diagnosed as malignant.After the emphasis by Laplacian processing, cell division was applied. The cell with aggregated microcalcification was extracted, and the image display was made so that the feature difference between cancerous and noncancerous lesions can be recognized. To arrive at a numerical representation of the feature difference, the following parameters were considered: (1) effective distance between cells; and (2) rate of change of the number of cells with regard to the change of the threshold.As the result of processing 37 cases, including 14 benign cases and three normal cases, up to 14 of 15 malignant cases were able to be separated from other benign and normal cases, using those two parameters.
Segmentation of continuous speech by HMM and bayesian probability
Authors: Seiichi  , Yasuhide Hashimoto,  
Published: July 2007

AbstractThis paper describes a new statistical method of segmentation using a hidden Markov model (HMM) and a Bayes' classifier. The main characteristics of this method are the use of feature parameters which are independent of each category in vowels or consonants, and the use of only one HMM which represents all syllable patterns in common. The segmentation strategy is to find the optimal HMM sequence. The optimal/best sequence is found by using the O(n) DP matching based on the Viterbi algorithm. The concatenated number and boundaries of the best HMM sequence are regarded as the segmentation result.
A software reliability evaluation tool: Sret
Authors: Shigeru  , Shunji Osaki  , Ryushi Isozaki  
Published: July 2007

AbstractThe evaluation of reliability is very important in developing software efficiently. This paper describes the construction of a software development‐assist tool, which executes the reliability evaluation of the software quantitatively in the testing phase. In this tool, the following models are employed for the analysis of the software error data. The stochastic models based on nonhomogeneous Poisson processes are exponential, delayed S‐shaped and inflection S‐shaped software reliability growth types. The deterministic regression models are logistic and Gomperz curve models. The procedure for evaluating the software reliability is as follows: The data observed in the testing phase are read in. The unknown parameters in each model are estimated, and the goodness‐of‐fit test of the estimated result is examined. The results of the estimation for the reliability evaluation measures as well as the observed data are displayed in the form of curves. The forementioned procedures are implemented in a program package, using BASIC language operating on MS‐DOS. Using the software reliability evaluation tool developed in this study, an executing example is presented based on the actually observed software error data.