|
1. |
The Pulse Extension Method for the Variable Neighborhood Distance Transformation of 2‐ and 3‐Dimensional Digitized Pictures |
|
Systems and Computers in Japan,
Volume 21,
Issue 4,
1990,
Page 1-14
Naoki Okabe,
Jun‐Ichiro Toriwaki,
Preview
|
PDF (1097KB)
|
|
摘要:
AbstractThis paper proposes a variable neighborhood distance transformation algorithm for two‐ and three‐dimensional (2‐D and 3‐D) digital binary pictures which is based on a new concept called path extension. The properties and performance of the method are experimentally evaluated. An algorithm was constructed using path extension which calculates the variable neighborhood distance for all one pixels in a 2‐D picture, using a sequence of four and eight neighborhoods composed in an appropriate way.In previous distance transformation algorithms, the distance for the central pixel under consideration is calculated uniquely from the distances of several neighborhood pixels, while the distance transformation in the path extension algorithm is executed by determining the distances of several neighborhood pixels from the distance of the central pixel under consideration.This paper proposes a serial path extension algorithm and two parallel path extension algorithms for both 2‐D and 3‐D pictures. For comparison of performance, one serial and one parallel algorithm, which are modifications of the traditional fixed neighborhood algorithms, are further analyzed. Finally, the results of an experimental evaluation are presented for computation time in the five propos
ISSN:0882-1666
DOI:10.1002/scj.4690210401
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1990
数据来源: WILEY
|
2. |
A Support System for Constructing Rule Base for Speech Synthesis by Rule. Automatic Extraction of Synthesis Rules |
|
Systems and Computers in Japan,
Volume 21,
Issue 4,
1990,
Page 15-24
Yoichi Yamashita,
Riichiro Mizoguchi,
Osamu Kakusho,
Ken'Ichi Taniguchi,
Masuzo Yanagida,
Preview
|
PDF (847KB)
|
|
摘要:
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
ISSN:0882-1666
DOI:10.1002/scj.4690210402
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1990
数据来源: WILEY
|
3. |
A New Recognition Method for Stamped and Painted Alphanumerals |
|
Systems and Computers in Japan,
Volume 21,
Issue 4,
1990,
Page 26-35
Tomoaki Nakano,
Shin Yamamoto,
Norio Takeda,
Preview
|
PDF (732KB)
|
|
摘要:
AbstractIn the automobile production system, the recognition technique for the stamped character stamped on the painted surface is indispensable in part labelling and production control. When a stamped character is painted over, it often happens that undulations and humps are produced on the character contour. This paper discusses a recognition method for such stamped characters. In order to make the method robust toward variations in the character contour, the contour shape data is constructed viewing the character from the circumscribed rectangle of the character. Then, the contour features inherent to the character are extracted after smoothing, to perform the recognition.The method was applied to stamped and painted 1000 samples of ten kinds of alpha‐numerals and the recognition rate was examined. It is seen that the proposed method exhibits a higher recognition rate for all character types than the multiple similarity method. According to the experiment in which the experimental system based on the proposed method was applied to 3000 samples of 15 kinds of alphanumerals, the correct recognition rate was 99.8 percent. Although there were seven samples which were rejected, there were no misclassifications. Thus, the usefulness of the method was verifie
ISSN:0882-1666
DOI:10.1002/scj.4690210403
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1990
数据来源: WILEY
|
4. |
Parallel Processing Description in the Concurrent Object‐Oriented Language ABCL/1 |
|
Systems and Computers in Japan,
Volume 21,
Issue 4,
1990,
Page 36-44
Akinori Yonezawa,
Preview
|
PDF (718KB)
|
|
摘要:
AbstractThis paper outlines the object‐oriented language ABCL/1 and its framework. The results of recent research associated with the language are also presente
ISSN:0882-1666
DOI:10.1002/scj.4690210404
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1990
数据来源: WILEY
|
5. |
Binocular Stereograph Based on Structures of Edge‐Arcs |
|
Systems and Computers in Japan,
Volume 21,
Issue 4,
1990,
Page 45-54
Eiichi Tatsumi,
Kunio Fukunaga,
Tamotsu Kasai,
Preview
|
PDF (718KB)
|
|
摘要:
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 ima
ISSN:0882-1666
DOI:10.1002/scj.4690210405
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1990
数据来源: WILEY
|
6. |
Polyhedra Identification Using the Orthonormal Constraints of Rotation Matrix |
|
Systems and Computers in Japan,
Volume 21,
Issue 4,
1990,
Page 55-64
Hai Hong,
Toshlo Kawashima,
Tsuyoshi Yamamoto,
Yoshinao Aoki,
Preview
|
PDF (662KB)
|
|
摘要:
AbstractA method to identify polyhedric objects from single perspective line drawings is proposed. The method searches correct associations from the model database in four stages: 1) topological matching of vertex and edge connection; 2) the computation of the transformation matrix from the model coordinate system to the camera coordinate system; 3) the validity test of transformation matrix; and 4) the determination of position and orientation of object. Stage 2) computes the optimal solution of the matrix using nonlinear optimization. Thus, if the initial value is improper, the solution does not always converge to a correct solution as pointed out in previous research. Orthonormal constraints of transformation matrix are introduced to improve the convergence property of numerical computation and to reduce computation cost. Experimental results show the validity of the method.
ISSN:0882-1666
DOI:10.1002/scj.4690210406
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1990
数据来源: WILEY
|
7. |
Parallel Computation of the Fast Fourier Transform on a Binary Tree Multiprocessor |
|
Systems and Computers in Japan,
Volume 21,
Issue 4,
1990,
Page 65-75
Noboru Niki,
Yoshizou Takahashi,
Preview
|
PDF (765KB)
|
|
摘要:
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 2nFFT 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
ISSN:0882-1666
DOI:10.1002/scj.4690210407
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1990
数据来源: WILEY
|
8. |
Proposal for Cryptographic Key Distribution System Based on Identification Information |
|
Systems and Computers in Japan,
Volume 21,
Issue 4,
1990,
Page 76-84
Eiji Okamoto,
Kazue Tanaka,
Preview
|
PDF (566KB)
|
|
摘要:
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 sign
ISSN:0882-1666
DOI:10.1002/scj.4690210408
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1990
数据来源: WILEY
|
9. |
An Adaptive Signal Processing System for Voiced Speech with Automatic Spectrum Selector |
|
Systems and Computers in Japan,
Volume 21,
Issue 4,
1990,
Page 85-96
Makoto Hiroshige,
Yoshikazu Miyanaga,
Koji Tochinai,
Preview
|
PDF (985KB)
|
|
摘要:
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.
ISSN:0882-1666
DOI:10.1002/scj.4690210409
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1990
数据来源: WILEY
|
10. |
Optical Flow Analysis Based on Spatio‐Temporal Correlation of Dynamic Image |
|
Systems and Computers in Japan,
Volume 21,
Issue 4,
1990,
Page 97-108
Kazutoshi Koga,
Hidetoshi Miike,
Preview
|
PDF (938KB)
|
|
摘要:
AbstractWe propose several methods for analyzing the velocity of moving particles in dynamic images. The methods are based on the analysis of temporal mutual‐correlation between the time series of gray level changes at a target pixel and that of its neighboring pixels on an image plane. In this paper, we clarify that the temporal mutual‐correlation functions can be understood as the intersections of a kind of spatial autocorrelation of an image irradiance function which is assumed to be rigid. According to this new understanding and assuming a Gaussian‐like decrease in the spatial autocorrelation, we clarify a relation between the correlation‐value and the lag‐time of the mutual‐correlation and velocity of a moving object. This relation results in an improved method for determining the optical flow.Our previous methods are useful only for the analysis of spherical particle motion. However, the improved one can be applied to more general objects. From the analysis of the artificial image sequences, it is suggested that the accuracy of the obtained result is less than 0.01 ±0.01 p/f in speed and 1.0 ±2.0 deg in direction. These results indicate that the improved method has ten times the accuracy of the typical method called the “gradient method.” The improved method is also evaluated by analyzing an actual dynamic scene and confirmed to have the capability to measure the two‐dimensional velocity field (
ISSN:0882-1666
DOI:10.1002/scj.4690210410
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1990
数据来源: WILEY
|
|