|
1. |
Proposal on infrared ray emission CT |
|
Systems and Computers in Japan,
Volume 16,
Issue 4,
1985,
Page 1-8
Hiroki Uchiyama,
Takayuki Takezawa,
Keisuke Abe,
Shouken Haku,
Masato Nakajima,
Shinichi Yuta,
Preview
|
PDF (575KB)
|
|
摘要:
AbstractThis paper presents a proposal for infrared ray emission computed tomography (IRECT). This is a method for visualizing the two‐dimensional physical quantum distributions (e.g., temperature, concentration) on an arbitrary transaxial layer of an object by calculating the infrared radiation intensity emitted from the object as the projection data. To verify the usefulness of this method, an experimental system with pyroelectric detector is developed for measuring flame temperature distribution and this system is applied to a Bunsen flame. The experiments yield good images of thermic intensity distribution in the cross section of the flame. In addition, the usefulness of this method in measuring temperature distribution is confirmed by comparing the results with thermocouple probe measuremen
ISSN:0882-1666
DOI:10.1002/scj.4690160401
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1985
数据来源: WILEY
|
2. |
Optimization of functional language ASL/F programs |
|
Systems and Computers in Japan,
Volume 16,
Issue 4,
1985,
Page 9-18
Hiroyuki Seki,
Kenichi Taniguchi,
Tadao Kasami,
Preview
|
PDF (791KB)
|
|
摘要:
AbstractFunctional languages are known to have such advantages as simply defined semantics. However little study has been made regarding compilation or optimization methods for efficient execution on a conventional machine. This paper formulates some optimization methods compiling a functional language ASL/F program into an object program in a procedural language, and further gives some sufficient conditions to perform these optimizations. It introduces “needed‐argument‐first computation” and “globalization of sorts (data types),” which are new optimization methods and have not been discussed before. Sample programs which are compiled and executed by an experimental compiler perform these optimization methods, as well as elimination of duplicated computation for common subterms, elimination of tail recursion, and rewriting in compilation. These experimental results show that execution time and dynamic memory space requirement of the object program are reduced by these optimizations and the program can be executed in almost the same time as an equivalent program written in a procedural language suc
ISSN:0882-1666
DOI:10.1002/scj.4690160402
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1985
数据来源: WILEY
|
3. |
Vulnerability of a communication network with a satellite |
|
Systems and Computers in Japan,
Volume 16,
Issue 4,
1985,
Page 19-28
Ken'Ichi Hagihara,
Toshimltsu Masuzawa,
Nobuki Tokura,
Mitsuji Ikeda,
Preview
|
PDF (685KB)
|
|
摘要:
AbstractThe vulnerability of an integrated communication network composed of a terrestrial network and a satellite network is discussed in a graph‐theoretic manner. A ground switching station (a switch board) is abstracted as a vertex, a wire and an antenna, respectively, for a communication with a satellite as an edge of a graph. As a measure of the vulnerability of a communication network we introduce anew the concept of “S‐connectivity.” Although the concept of S‐connectivity is obtained by generalizing the conventional idea of vertex‐connectivity, since it takes into consideration the difference in the reliability between a satellite as a wireless transistor and a ground station controlled by software, it appears suitable as a means to determine the vulnerability of a communication network consisting of a terrestrial network and a satellite network.This paper discusses: (1) What is the S‐connectivity when antennas that transmit to and receive from a satellite, are used on each ground station? (2) If ground stations exist which cannot communicate through the terrestrial network, at which stations should antennas be installed to enable communications with the minimum number of antennas via satellite? (3) When the number of edges of a terrestrial network is fixed, what kind of terrestrial network maximizes the S‐connectivity? (4) What are the computation times of algorithms for solving the preceding probl
ISSN:0882-1666
DOI:10.1002/scj.4690160403
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1985
数据来源: WILEY
|
4. |
A coding method of gray‐valued pictures using density contour lines |
|
Systems and Computers in Japan,
Volume 16,
Issue 4,
1985,
Page 29-36
Masayuki Nakajima,
Takeshi Agui,
Masahiro Takeda,
Preview
|
PDF (589KB)
|
|
摘要:
AbstractFirst, the concept of density contour lines is introduced for gray‐valued pictures. Its application for pattern recognition has already been reported. However, in this paper it is considered for description and restoration of gray‐valued pictures via the extraction of density contour lines as well as for coding gray‐valued pictures by assigning priority to the density contour lines. Furthermore, a method for sequential restoration of pictures from general information is described.In this paper, sequential restoration from the main contour' lines and experimental restoration of gray‐valued pictures using only a part of the density contour lines are demonstrated. These results illustrate a new coding method of gray‐valued pictures which facilitates the coding of the high information content of original pictures by only about 20% of the contour lines. Finally, the effectivity of the present method is shown for the fast search of
ISSN:0882-1666
DOI:10.1002/scj.4690160404
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1985
数据来源: WILEY
|
5. |
Evaluating the parallelism of the feed‐forward machine and algorithms of the machine |
|
Systems and Computers in Japan,
Volume 16,
Issue 4,
1985,
Page 37-45
Masayuki Tomisawa,
Hidekazu Yamada,
Tadao Nakamura,
Yoshiharu Shigei,
Preview
|
PDF (575KB)
|
|
摘要:
AbstractThe feed‐forward machine (FFM) is an MISD type computer which executes more than one processing for a single‐data stream. Since more than one operational circuit operates at the same time for a set of input data in FFM, a certain degree of parallel computation can be achieved. This paper discusses such parallelism in FFM. As the first step, a data‐flow graph is used to evaluate the parallelism of FFM. Although FFM cannot utilize all parallelism inherent in the program, it can execute the program with far fewer steps than in a Neumann machine. Computation suited to FFM tends to occur with higher probability as the parallelism in the program is decreased. As an example of application to actual computation, exponent calculation and multiplication‐division of complex numbers are considered. An algorithm suited to FFM is constructed at the arithmetic computation level. Then the computational complexity is examined when several kinds of numerical computations are performed using the algorithm and the result is compared with the case of a Neumann machine, indicating the features of the proposed
ISSN:0882-1666
DOI:10.1002/scj.4690160405
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1985
数据来源: WILEY
|
6. |
A connected spoken word recognition algorithm by augmented continuous DP matching |
|
Systems and Computers in Japan,
Volume 16,
Issue 4,
1985,
Page 46-56
Sei‐Ichi Nakagawa,
Preview
|
PDF (729KB)
|
|
摘要:
AbstractBecause utterance duration differs even for the same words spoken by the same person, normalization for time variances is essential in any pattern matching method of speech recognition.Several methods have been proposed to date but there have been some drawbacks. We present herein a word spotting method using endpolnt‐free matching for input pattern with asymmetric DP path. A similar method proposed by Nakatsu et al. [8], is also discusse
ISSN:0882-1666
DOI:10.1002/scj.4690160406
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1985
数据来源: WILEY
|
7. |
A border‐following algorithm of three‐dimensional digitized binary pictures |
|
Systems and Computers in Japan,
Volume 16,
Issue 4,
1985,
Page 57-65
Tetsuya Matsumoto,
Jun‐Ichiro Toriwaki,
Shigeki Yokoi,
Teruo Fukumura,
Preview
|
PDF (658KB)
|
|
摘要:
AbstractThis paper proposes a border‐following method for three‐dimensional digitized pictures. The method is applied to actual data and the results are discussed. Then the proposed algorithm is applied to the analysis of pictures. Up to now, of the few researches and proposals concerning the border‐following algorithms for three‐dimensional binary pictures, that by Herman et al. has as its goal the display of a three‐dimensional picture. Here the pair of 0‐ and 1‐voxels is traced in a way which is an extension of the edge‐tracing in the border‐following for two‐dimensional pictures. However, in their method, the number of voxels to be traced becomes larger, compared with the method which traces only 1‐voxel. The connective relations among voxels are also difficult to extract in a direct way. The method proposed here adopts the procedure corresponding to the pixel‐tracing in the border‐following of two‐dimensional picrures, i.e., tracing of border‐voxels of value 1. The paper includes the border‐following algorithm applicable to any of 6‐, 18‐, and 26‐connected figures, together with the algorithm to reconstruct the original picture from the list of border voxels. These algorithms are compared with the algorithm by Herman et al. A method is also shown which can extract the surrounding relations among three‐dimensional figures dur
ISSN:0882-1666
DOI:10.1002/scj.4690160407
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1985
数据来源: WILEY
|
8. |
A character segmentation algorithm for mixed‐mode communication |
|
Systems and Computers in Japan,
Volume 16,
Issue 4,
1985,
Page 66-75
Osamu Nakamura,
Makoto Ujiie,
Noriyoshi Okamoto,
Toshi Minami,
Preview
|
PDF (733KB)
|
|
摘要:
AbstractIn the realization of a mixed‐mode communication, it is necessary before recognizing individual characters, to separate text and black and white figure regions and to extract efficiently the character region. Problems in such a procedure are the detection and correction of the inclination of a document, separation of contact characters, the merge of disconnected characters, and extraction of a letterhead. This paper describes the results of studies on such problems. The document considered is the English text image, containing binary figures and a letterhead. The basic idea is as follows. Connected regions are obtained by directional propagation and shrinking to merge figures. Then: (1) a thinning process is performed to detect the inclination angle of the input text; (2) the sizes of the connected regions and their relative locations are examined to extract the letterhead. Estimation of pitch is performed and statistical data about individual characters are used to separate contact characters or merge disconnected characters. The experiment was made for 10 and 12 pitch printed characters, and the correct extraction rate was 100 percent for individual characters, and 94.6 percent for a letterhead. Thus it was verified that the proposed method is useful in extracting the character regio
ISSN:0882-1666
DOI:10.1002/scj.4690160408
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1985
数据来源: WILEY
|
9. |
Parallel processing system for communication control |
|
Systems and Computers in Japan,
Volume 16,
Issue 4,
1985,
Page 76-86
Masahide Yamashita,
Preview
|
PDF (792KB)
|
|
摘要:
AbstractThis paper proposes a parallel processing system dedicated to communication control. The proposed parallel‐processing communication‐control system contains seven kinds of parallelisms‐two reflecting the hierarchical and multiple structures of the communication links, and five reflecting the mutual relations among functions realizing the link control processings. The system efficiently realizes high‐performance communication control processings. This paper outlines the system structure, derives the system including the modelling of the communication control processings, and discusses the problems in implementation. By using the communication control device based on the system, it becomes easy to construct economically a large‐scale data‐communication network system. The proposed scheme also realizes a new network service based on high‐speed commun
ISSN:0882-1666
DOI:10.1002/scj.4690160409
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1985
数据来源: WILEY
|
10. |
Redundancy of projection data and its application to improve the quality of a reconstructed image |
|
Systems and Computers in Japan,
Volume 16,
Issue 4,
1985,
Page 87-96
Itsuo Kumazawa,
Taizo Iijima,
Preview
|
PDF (619KB)
|
|
摘要:
AbstractThis paper attempts to apply the actual redundancy involved in X‐ray CT projection data which have been treated as independent data for the improvement of the image quality of a reconstructed image. It is known that the projection data of an X‐ray CT contains random noise, such as photon noise, which has a negative effect on image quality. A simple smoothing filter which generally is used to reduce this effect, causes the degradation of image resolution. Therefore, it is possible to suppress only high‐frequency noise components. However, when the structure of the projection data was analyzed, it became clear that projection data contain a large redundancy in determining the lower‐frequency components of the image. By properly taking advantage of this redundancy for image reconstruction, it is possible to suppress the low‐frequency component. This paper clarifies quantitatively the noise suppression effect using redundancy by comparing the case where redundancy is not used at all with the case where redundancy is used c
ISSN:0882-1666
DOI:10.1002/scj.4690160410
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1985
数据来源: WILEY
|
|