bluuebunny/crossref_metadata_2025_split huggingface dataset:
Image Restoration Method by Spectral Linear Prediction and Its Application to Artificially Made Images
Authors: Hioki Sakio 
Published: November 2009

AbstractSpectral linear prediction has been used primarily for speech and audio signal analysis, but its application in image restoration has not been exploited sufficiently. This paper proposes an image restoration method using spectral linear prediction and demonstrates its application in the restoration of synthetic (artificially made) images. Boundary conditions are established so that the covariance matrix of an observed image signal can be represented by a lower tri‐diagonal matrix with cyclic‐ordered elements. The determination of prediction coefficients can be treated as an eigenvalue problem which allows the coefficients to be obtained by an iterative process. Spectral distribution of the image signal is estimated using these prediction coefficients.Using the proposed method, test results indicate that synthetic images can be restored successfully regardless of an assumption of uncorrelated pixels in the vertical direction. Even when the covariance matrix of the observed image is unknown, the approximation of the prediction coefficient can be used by the proposed method for restoring the image.
Screening and Moiré Suppression in Printing and Its Analysis by Fourier Transform
Authors: Morimoto Yoshiharu , Seguchi Yasuyuki , Okada Masao 
Published: November 2009

AbstractMoiré patterns are often observed in printing when the image is reproduced as a bilevel image with halftone. A Fourier transform analysis of screening a picture by an optical method or an ordered dither method is presented. Conventional moiré—suppressing techniques are discussed considering the human visual system. The moiré fringes are explained as aliasing and visible moiré fringes are especially due to high‐frequency spectra with high power. From this viewpoint, a screening method is proposed which uses the Fourier transform for moiré suppression. This method has the additional advantage that any pitch and any screen angle may be selected.
A Parsing Method for Context‐Sensitive C‐Plex Grammars Using Logic Programming
Authors: Peng Kejuan , Onda Kunio , Aoki Yoshinao 
Published: November 2009

AbstractThe high‐dimensional grammars, such as Plex grammar and graph grammar, have strong descriptive powers, but have a problem in that the parsing algorithm is difficult. To apply those grammars to the pattern analysis and recognition, it is desirable that the parsing method for those grammars should be established. As a method toward the parsing of Plex grammar, the authors previously have proposed a C‐Plex grammar and a parsing method for the context‐free C‐Plex grammar, based on the logic programming of Prolog. Further, a parsing method is presented for context‐sensitive C‐Plex grammar based on the logic programming.First, a parsing algorithm is proposed which realizes the pseudo‐leftmost derivation in context‐sensitive C‐Plex grammar. Then, to arrive at a Horn clause program executing the parsing algorithm, a general rewriting method from the context‐sensitive C‐plex grammar to Horn clause is presented. Using the circuit pattern as an example, the result of parsing is shown. The description of rules by predicate logic expression and the parsing method based on logic language Prolog characterize the C‐Plex grammar as a kind of logic grammar. C‐Plex grammar can be applied not only to the grammatical pattern analysis and recognition but also to the parsing processing in the intelligent system such as pattern interpretation as a logic grammar.
Optimal Concurrency Control Schedulers in Terms of Secondary Storage Access
Authors: Kakeshita Tetsuro , Kambayashi Yahiko 
Published: November 2009

AbstractConventional concurrency control schedulers are used to increase concurrency to avoid transaction rollbacks, and it is widely accepted that a scheduler is effective if it can provide more concurrency. However, transaction rollbacks seldom occur in a practical transaction processing system. The performance of a scheduler should be evaluated by how efficient a schedule it can generate in such a situation. We select the number of secondary storage accesses to process a given schedule as such an efficient criterion.A schedule is regarded as a page reference string and the memory cost of the schedule is defined by the cost to process the schedule by an optimal paging algorithm. Then we consider the minimum memory cost scheduling problem for a given set of transactions. The problem is shown to be NP hard in the general case. Thus we turn our attention to: (1) a restriction of the transaction model to construct an optimal schedule in a linear time; and (2) a nearly optimal solution to the given problem under a general transaction model. The nearly optimal scheduling problem is shown to be rather difficult.
A Unified Coding Method of Image and Text Data Using Discrete Orthogonal Transform
Authors: Nakamura Yasuhiro , Matsui Kineo 
Published: November 2009

AbstractA unified coding method of image and text data is proposed in this paper. This scheme enables us to embed a text into an image by using some redundant region in the frequency space. Our results show that a text of about 4 k to 8 kbytes can be embedded into the image of 256 × 256 pixels and it retains an S/N ratio of about 30 to 40 dB.
A Support System for Constructing Rule Base for Speech Synthesis by Rule. Automatic Extraction of Synthesis Rules
Authors: Yamashita Yoichi , Mizoguchi Riichiro , Kakusho Osamu , Taniguchi Ken'Ichi , Yanagida Masuzo 
Published: November 2009

AbstractIn speech synthesis by rule, various acoustic parameters are determined by rules from the phonetic transcription and then the speech is synthesized. In the past, the synthesis rules have been constructed by an expert on speech synthesis, iterating trials and errors. To construct sophisticated rules efficiently, as well as to improve and maintain those rules, it will be useful to use a computer to support the expert's effort. For this purpose, several functions are required.Among those, this paper discusses especially the method which automatically extracts the synthesis rules from a large number of speech data by inductive inference. In the method, the acoustic parameters, which are determined by the already prepared synthesis rules, are compared with those of the actual speech uttered by a human subject and the difference is described in the form of a “comparison example.” Then inductive inference is performed. In the comparison example, the phonetic environment for the speech data also is described.The concept hierarchy for the attributes concerning the environment is prespecified as the “expert knowledge of phonology,” and is utilized in the inductive inference. Especially for consonants, more than one hierarchical structure is considered, among which the most favorable is employed. The synthesis rules actually were extracted for the CV syllable duration in the word, indicating the effectiveness of the proposed method.
Binocular Stereograph Based on Structures of Edge‐Arcs
Authors: Tatsumi Eiichi , Fukunaga Kunio , Kasai Tamotsu 
Published: November 2009

AbstractStereography is one of the representative methods to determine the 3‐D position of an object. The determination of the matching feature points in the left and the right images is one of the important problems. As one means to cope with this problem, a method has been presented in which the continuous feature points are approximated by edges, and the matching pair is determined by comparing the edge‐line structures of the two images.
Parallel Computation of the Fast Fourier Transform on a Binary Tree Multiprocessor
Authors: Niki Noboru , Takahashi Yoshizou 
Published: November 2009

AbstractHigh‐speed FFT computation has previously been executed by an array processor using a pipeline processing. However, with advances in VLSI, parallel computation on multiprocessor systems becomes an interesting and challenging problem. In this paper, the parallel FFT computation is performed on a binary tree multiprocessor. The binary tree structure provides a recursive and hierarchical structure, and its processor can be constructed by a simple architecture and embedded efficiently in VLSI array. The binary tree multiprocessor realizes a practical multiprocessor system. First, parallel multidimensional radix 2n FFT algorithms are generalized from the work of Norton and Silberger. Second, to perform efficiently the parallel FFT algorithms, two division and pipeline data communication methods are presented and analyzed. The pipeline method is shown to be powerful.Finally, radix‐2 FFT, radix‐4 FFT, and 2‐D FFT algorithms are implemented on the binary tree machine CORAL68K. High‐performance results are shown. By using various processor capabilities FFT performances are predicted on this machine. Various algorithmic and architectural optimizations on the binary tree machine for the number of data are shown.
Proposal for Cryptographic Key Distribution System Based on Identification Information
Authors: Okamoto Eiji , Tanaka Kazue 
Published: November 2009

AbstractA key distribution system based on identification information is presented. The system is based on the Diffie‐Hellman public key distribution scheme (DH‐PKDS) and has an identity authentication function. It uses identification information on individual users instead of a public file employed in the DH‐PKDS. The system proposed here does not require any services of a center to distribute work keys, not does it require users to maintain directories of information for the generation of keys. This allows key management for cryptosystems to be simplified.In this paper, two kinds of identity‐based key distribution systems are proposed. One uses two‐way (interactive) communication to distribute work keys, and the other uses one‐way communication. They are applied to communication networks, on‐line talk networks and mail networks, for instance. Modular exponentiations of large numbers used in the networks are implemented with digital signal processors.
An Adaptive Signal Processing System for Voiced Speech with Automatic Spectrum Selector
Authors: Hiroshige Makoto , Miyanaga Yoshikazu , Tochinai Koji 
Published: November 2009

AbstractIn this paper, adaptive spectrum analysis algorithms for voiced speech are discussed. A new adaptive signal processing system which uses a modified MIS algorithm and has a spectrum selector using a neural network is proposed. Based on the properties of voiced speech, we first test an identification algorithm which estimates AR parameters from the first moment of the observed signal and investigate its sensitivity to noise. In order to compare the modified MIS for voiced speech analysis with the above first moment analysis, the frequency domain properties of weighting factor A which is used in the modified MIS are presented.This paper shows that we should select only the accurate spectra from among the results given by the modified MIS. The selection of spectra is automatically performed using a neural network. Using above methods, we construct a new analysis system for voiced speech. Experiments on real speech show that the proposed system is effective for speech analysis.
Analysis of Fault Detection Probability of CMOS Combinational Circuits and Its Application to Signature Testing
Authors: Iwasaki Kazuhiko 
Published: November 2009

AbstractThis paper analyzes the rough behavior of aliasing probabilities (missing faults) when the signature testing is applied to CMOS combinational circuits. In the analysis of aliasing probabilities, the fault detection probability for one‐digit test patterns—the fault detection probability—becomes important. However, for general circuits it is difficult to evaluate the fault detection probability.In this paper the circuits are restricted to CMOS combinational circuits, and it is intended for the control circuits for microprocessors. For CMOS logic LSI's, the utilization of combinational gates follows a certain specific frequency and the expected value of the fault detection probability can be calculated.First, the gate usage frequencies are examined for three types of CMOS logic LSI's. Next, the fault detection probabilities of single gates are analyzed. Based on the forementioned results, the fault detection probabilities of simplified κ‐stage combinational circuits are analyzed. As a result, the expected value of the fault detection probability for a CMOS combinational circuit is shown to be 0.4 – 0.5. Using this expected value, the approximate behaviors of the aliasing probabilities for the signature testing are presented for MISR's and single‐input LFSR's applied to CMOS combinational circuits. In particular, for single‐input LFSR's it is shown that within the range of practical use, the aliasing probabilities are not monotonic.
Data Structure for Multilayer N‐Dimensional Data Using Hierarchical Structure
Authors: Nakamura Yasuaki , Abe Shigeru , Ohsawa Yutaka , Sakauchi Masao 
Published: November 2009

AbstractData such as vectors, points and symbols of maps and facilities location maps are classified into layers and managed according to such attributes as roads, houses, and facilities. In editing a diagram, range searchings and neighborhood searching frequently are made, where the objects of search are the data in a number of layers. When such multidimensional data classified into layers (called multilayer data) are managed by the conventional multidimensional data structure, a problem occurs in that the retrieval efficiency varies greatly depending on the number of considered layers. This paper proposes the ML structure (multi‐layered structure), which is a new managing structure for the multilayer data based on a tree structure.In ML structure, the node structure is extended so that data can be stored not only in the terminal node of the tree but also in the internal node. A layer management mechanism is added to each node. It is arranged that the data of the layer with small number of data are placed close to the root of the tree structure. As a result, a satisfactory performance with small variation in the retrieval efficiency is realized, even if a range searching is made for a particular layer, or for a number of layers.This paper describes the construction of ML structure, method of data management, and searching. It is shown by experiment that the data management and searching by ML structure is effective for the multilayer data.
High‐Speed Algorithm for Component Labeling
Authors: Gotoh Toshiyuki , Ohta Yoshiyuki , Yoshida Masumi , Shirai Yoshiaki 
Published: November 2009

AbstractThis paper describes a fast labeling algorithm which separates regions lying all over an image based on a pipeline method. In the previous labeling algorithm of raster‐scan type, a bottleneck for fast processing was the label classification process to classify temporarily assigned labels based on the connectivity. To cope with this problem, consideration was given to how to reduce the number of connectivities input to the labeling process, and how to make the labeling process efficient.For the problem of the number of connectivities, a method was developed for reducing the number of connectivities due to reshaping of a region, and a fast method for reducing the number of duplicate connectivities by introduction of a dividing process. Also, for the problem of label classification, a label classification method was developed using direct search for connectivities. Moreover, the relationship between the number of provisional labels in the labeling process and the number of connectivities was investigated. As a result, it was shown that the label classification process can be implemented in time proportional to the number of provisional labels and the effectiveness of the algorithm presented here was verified by simulation.
3D Recovery of Polyhedra by Parallelism Heuristics
Authors: Tanaka Toshie , Kawashima Takao , Kanatani Ken‐Ichi 
Published: November 2009

AbstractA method is presented which recovers the 3‐D shape of a polyhedron under the assumption of a large number of parallel edges. The method is based on the fact that three or more parallel edges intersect at a point (vanishing point) when extended on the image plane. To determine a pair of two parallel edges, a heuristic method based on the structure of polyhedra is employed. To cope with the error in the image, a threshold processing based on the causes of error is proposed.When parallel edges are found, the 3‐D orientation of each edge can be determined from the vanishing point. However, contradictions may arise in the calculated 3‐D orientations of the edges due to errors. To overcome such a problem, an optimization technique based on the constraint on polyhedra is proposed. Then our method is applied to an actual image.
Relational Matching Using a Neural Network
Authors: Katta Noboru , Takahashi Hideya , Matsushita Kenji , Shimizu Eiji 
Published: November 2009

AbstractThis paper proposes an algorithm for relational matching, which is important in pattern recognition, by using the Hopfield model as one of the neural network models. First, the objective function for relational matching is derived and the computer simulation of the neural networking for relational matching according to this objective function is conducted by use of a simple model. Next, the local minima in connection with the Hopfield model is avoided by using triangular noise and its effectiveness is verified in the network for relational matching. This method differs from the conventional simulated annealing method and, by adding noise to the network, the network will reach only one stationary state for which results will be derived by this method.
Design of an RSA Encryption Processor Based on Signed‐Digit Multivalued Arithmetic Circuits
Authors: Kameyama Michitaka , Wei Shugang , Higuchi Tatsuo 
Published: November 2009

AbstractThis paper proposes an LSI‐oriented multiple‐valued hardware algorithm based on the signed‐digit number (SD number) for highspeed RSA public key encryption processor. A very long word‐length arithmetic is required in RSA encryption processing. The proposed algorithm realizes a high‐speed processing by iterative additions based on the radix‐A SD number system. Microprogram control is adopted in the encryption processor. To verify the basic operation of the proposed processor architecture, a model processor for 16‐bit encryption is implemented using binary TTL logic IC's. A comprehensive evaluation of the 2 μm CMOS encryption LSI is made by a simulation using the electronic circuit analysis program SPICE2. The encryption rate for the message of 512‐bit word length is 60 kbit/s, which is a factor of eight times faster than that of the corresponding binary LSI. The developed processor contains about 100 k transistors and it can be implemented on a single single chip.
Improvement of HDTV‐PAL Standard Converter Using Motion‐Compensation Technique and Detection Probability of Motion Vectors
Authors: Tanaka Yutaka , Nishizawa Taiji , Ohmura Toshiro 
Published: November 2009

AbstractHDTV signal can be converted into the present standard TV signal with a high spatial resolution. However, some problems have been pointed out in the standard conversion with different field frequencies, which are the degradation of resolution and jitter for moving pictures. To avoid such problems, the motion compensation frame conversion method was developed, which realized a practically satisfactory standard conversion. In the development of a practical system for the standard conversion from HDTV to PAL, the quality of the converted picture is improved by improving the detection of motion vector and the processing of motion‐compensated picture. The detection probability for the motion vector is investigated, and the usefulness of the motion compensation based on the detection of the motion vector used in the proposed system is verified.
A Reconstructed Image Analysis and a Practical Algorithm of the Direct 2‐D Fourier Transform
Authors: Niki Noboru 
Published: November 2009

AbstractSignificant research and development have been made on various kinds of CT's such as the X‐ray, the MRI and the positron, which are applied widely in practice. The CT device is divided into the measurement system and the image reconstruction system. Efforts are still being made at present to improve the resolution and speed of those systems. This paper discusses the 2‐D Fourier transform method, which is one of the image reconstruction methods that have been investigated and applied in the image reconstruction in various types of CT's.Traditionally, the 2‐D Fourier transform method has been considered as suffering from low image quality, although the image can be reconstructed with a high speed. The reason for image degradation is the lack of accuracy in the interpolation in the 2‐D Fourier transform domain, which can be remedied by improving the accuracy.A problem then is that the coordinate transformation in the Fourier domain depends on the individual CT. From such a viewpoint, this paper analyzes the relation between the coordinate transformation and the reconstructed image to indicate the reason for the image degradation.A systematic analysis is made of the reconstructed image when the linear interpolation is applied to each coordinate transformation, to indicate the reason for the image degradation and to describe the artifact appearing in the reconstructed image. Based on the result of this analysis, an algorithm is constructed which can eliminate the artifact from the reconstructed image. The algorithm is composed of the normalization algorithm for the interpolation characteristics, the interpolation by the fast‐Fourier transform and the inverse 2‐D Fourier transform enlarging the reconstructed image region. The effectiveness of the method is demonstrated by applying the method to the transformation from the polar to the Cartesian coordinate.
Directional Feature Field and Parallel Operations for Binary Images: Twisting Operation for Arbitrary Directional Propagation by 8‐Neighbors
Authors: Yamada Hiromitsu , Yamamoto Kazuhiko 
Published: November 2009

AbstractThis paper points out the importance of directional propagation with an expression of directional elements at each pixel of a binary image, as an extension of local parallel operations. This paper also proposes “a twisting operation” for an 8‐neighbor operation with an arbitrary direction and an arbitrary directional accuracy. By using this operation and the concept of vibrating operations, such as erosion‐dilatation or dilatation‐erosion, directional local parallel operations are defined to extract linear features. The effectiveness of the ideas is confirmed experimentally.
Establishing Correspondence and Obtaining 3‐D Information in Dynamic Images
Authors: Suzuki Kaoru , Yachida Masahiko 
Published: November 2009

AbstractTo establish correspondences between dynamic images, methods based on their local similarity such as the correlation method have been used widely. If corresponding points are searched over the whole image, however, the computation time and risk of occurrence of false correspondences increase. Therefore, it is important to restrict the search area.This paper proposes a reliable and efficient method of establishing correspondences among the sequences of dynamic images by using geometrical constraint conditions derived from the positional relationship of viewpoints before and after a movement. Also proposed is another method by which the correspondences between images formed by the binocular view of a mobile robot and the correspondences between images formed before and after a movement can be carried out simultaneously. The experimental results show that the correspondences of dynamic stereo images and the range information are obtained successfully.