|
1. |
Design and implementation of the s&t net software |
|
Systems and Computers in Japan,
Volume 17,
Issue 1,
1986,
Page 1-10
Jun Murai,
Preview
|
PDF (609KB)
|
|
摘要:
AbstractFlexibility, extensibility and reliability of a computer network are efficiently achieved by a design with hierarchical architecture. In an actual network system the network design should be implemented by modules corresponding to the layers of the hierarchical architecture in order to realize its inherent advantages. Generally, in highly modularized software the problem of overhead in transferring data between modules has to be solved. This paper presents a method of network software design which is easily implemented by a highly modularized software structure and describes implementation of the architecture through separate communication control and data processing in an operating system. These presentations are made by introducing the methods employed in constructing a local computer network called the S&T net. The methods presented in this paper can be applied generally to the design and realization of network software.
ISSN:0882-1666
DOI:10.1002/scj.4690170101
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1986
数据来源: WILEY
|
2. |
Matrix representation of programs within an intelligent link |
|
Systems and Computers in Japan,
Volume 17,
Issue 1,
1986,
Page 11-18
Jun Miyajima,
Noboru Endo,
Tadao Nakamura,
Yoshiharu Shigei,
Preview
|
PDF (494KB)
|
|
摘要:
AbstractThis paper presents an outline of a prototype intelligent link system proposed to combine “data transmission” and “data processing” and its software system. The generative program and its processing scheme are reported in detail. The intelligent link is n pairs of a general‐purpose pipeline processing system. It is an n‐stage one‐dimensional line of segments which consists of a transmission line and a processor. Each segment processes received data by the programs which tag along with its data. In order to decrease the system processing time and the processor idle time, fewer bits are employed to represent a program for the information transmission. Here we use a transition matrix method to describe transition of the operations in a program. First, we introduce the matrix properties and discuss applications of the matrix representation for generative programs. Secondly, we study how fewer bits can be used to represent a matrix and, as a result, find that less than 70% of the bits required to represent a matrix directly suffices in the pr
ISSN:0882-1666
DOI:10.1002/scj.4690170102
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1986
数据来源: WILEY
|
3. |
An algorithm to perform the rank filter and its applications |
|
Systems and Computers in Japan,
Volume 17,
Issue 1,
1986,
Page 19-25
Tadayoshi Nakayama,
Shigeki Yokoi,
Jun‐ichiro Toriwaki,
Preview
|
PDF (456KB)
|
|
摘要:
AbstractThe median filter is used frequently in image processing for smoothing while retaining edges. This paper describes an efficient method to calculate the rank filter, which is a generalization of the median filter and includes it as a special case. The presented method is simpler than the method proposed previously by Danielsson. A strict proof is given for its validity. An application to the construction of a logical circuit realizing the algorithm is also described.
ISSN:0882-1666
DOI:10.1002/scj.4690170103
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1986
数据来源: WILEY
|
4. |
3‐D reconstruction of coronary artery from cine‐angiograms based on left ventricular model |
|
Systems and Computers in Japan,
Volume 17,
Issue 1,
1986,
Page 26-34
Shinichi Iwai,
Masahiko Yachida,
Saburo Tsuji,
Preview
|
PDF (675KB)
|
|
摘要:
AbstractThere is an increasing demand for coronary angiography, corresponding to the recent increase of such ischemic cardiac diseases as myocardial infarction. At present, the obtained angiograms must be read by specialized doctors and require a large amount of time. Still it is usually difficult to arrive at a three‐dimensional understanding of the coronary artery. From such a point of view, this paper aims at the automatic analysis of the angiogram and describes a method which can determine the correspondence between vessels in the coronary artery angiograms taken along two directions. In the proposed system the three‐dimensional information is used in establishing the correspondence, which is difficult for human observers to utilize. As the first step, a straight line connecting a branch point of a vessel and the X‐ray source is considered and the projection of that line onto another image (called an epi‐polar line) is determined. Points close to that line are used as candidates for the correspondence. Then, using the vessels with established correspondences, a three‐dimensional model is constructed for determination of the correct candidates. Then a prohibited region in the three‐dimensional model is specified where there cannot exist a vessel. The vessels with established correspondence are represented in three dimensions and evaluation of the left ventricle is performed. From the results of experiment, the validity and the problems of the proposed system are
ISSN:0882-1666
DOI:10.1002/scj.4690170104
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1986
数据来源: WILEY
|
5. |
Structural analysis of line patterns using distance transformation (DTLP) |
|
Systems and Computers in Japan,
Volume 17,
Issue 1,
1986,
Page 35-43
Hidetomo Suzuki,
Jun‐Ichiro Toriwaki,
Hitoshi Shin‐Yashiki,
Preview
|
PDF (685KB)
|
|
摘要:
AbstractThis paper discusses the structural analysis algorithm for line patterns, based on the distance transformation of a line pattern by iterative local parallel processing. Although parallel processors have been applied recently to image processing, the processing of line patterns in the past was based primarily on the transformation of the object pattern into the list structure or symbol strings. Few studies have been made on the parallel processing algorithm for a line pattern. From such a viewpoint, this paper presents parallel‐type algorithms for loop counting, loop extraction and arc decomposition, among the procedures for processing line patterns. Properties of these algorithms also are discussed. The method proposed here is based on the distance transformation (Min. type) for line patterns we developed, and can be performed by iterative local parallel processing, in the same way as the distance transformation itsel
ISSN:0882-1666
DOI:10.1002/scj.4690170105
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1986
数据来源: WILEY
|
6. |
Guessing shape of a complete line drawing of a polyhedron using an heuristic tree search |
|
Systems and Computers in Japan,
Volume 17,
Issue 1,
1986,
Page 44-52
Seiji Ishikawa,
Preview
|
PDF (698KB)
|
|
摘要:
AbstractThis paper describes a technique for guessing a complete line drawing of a polyhedron from an incomplete line drawing by an heuristic tree search. The heuristic tree search employs two indices which represent structural unity of shape: the ratio of the number of parallel sides to the number of all sides on a line drawing of a polyhedron; and the difference between the minimum and the maximum inner angle on a loop (a closed link of sides). A line drawing obtained from preprocessing of a picture usually contains several polyhedra. It is segmented to each line drawing which corresponds to a single polyhedron, and it is generally an incomplete line drawing. The line drawing is expressed by a set of loops, and labelling on each side of the loops refers to the position and gradient of the side. An incomplete junction is searched on the line drawing by referring to the labels. Then a complete line drawing is guessed by adding sides to the incomplete junctions so that the values of the indices increase. One might expect that the present method gives aid to the recognition of an object given by an incomplete line drawing. An experimental result is given and some problems are discussed.
ISSN:0882-1666
DOI:10.1002/scj.4690170106
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1986
数据来源: WILEY
|
7. |
A flexible structured multimicroprocessor using general‐purpose CPU chips |
|
Systems and Computers in Japan,
Volume 17,
Issue 1,
1986,
Page 53-61
Tadakatsu Taniguchi,
Preview
|
PDF (830KB)
|
|
摘要:
AbstractThis paper discusses the design of a simple multimicroprocessor system to be built into the dedicated instrument, and also discusses the design for the system. The 8‐bit processor sometimes makes it difficult to realize the required function or necessitates a sophisticated technique or experience to realize the function. However, this paper demonstrates that there exist techniques that can easily be incorporated into the processor in the system to realize the required function and performance. The hardware discussed in this paper is flexible so that the result of functional analysis can be realized directly as the structure. The problems of parallel processing that will inevitably arise in this kind of approach are then solved by queue and synchronized registers. Hence, the hardware structure (number and connections of processors and memories) is determined according to the result of structured programming, and parallel processing programs are designed to be performed along the lines of the past single‐stream system. The performance of the system can be modified by modifying the number of processors and the hardware structure without completely changing the program, only by reassignment of the memory. From the practical viewpoint, 80‐type CPU (Intel 8085A), most widely used at present, is adopted. The result of experimental set‐up and simple application examples ar
ISSN:0882-1666
DOI:10.1002/scj.4690170107
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1986
数据来源: WILEY
|
8. |
Traffic flow measurement system using image processing |
|
Systems and Computers in Japan,
Volume 17,
Issue 1,
1986,
Page 62-72
Yasuo Kudo,
Preview
|
PDF (755KB)
|
|
摘要:
AbstractThis paper discusses the traffic flow measurement system (TMS) based on the idea of vehicle cluster. TMS is an experimental system which aims at the accurate real‐time measurement of the traffic flow parameters (location of vehicle, speed, congestion, location of the queue tail, etc.) which is spread in space, using the image processing technique. As image processing techniques, the line‐differentiation and the clustering based on the idea of vehicle cluster are used. By this scheme, traffic flow phenomena in the region of measurement can be measured directly. By introducing the idea of vehicle cluster, the measurement can adaptively be performed, observing the individual vehicle in low traffic and a set of vehicles in heavy traffic. As a result of the traffic flow measurement experiment using the proposed system, the following observations are made: (1) the measurement can be performed throughout the day; (2) the real‐time measurement with 200‐ms intervals can be performed; (3) the recognition rate for vehicle cluster is 97 percent or more for the range of measurement 150 m. The accuracy of vehicle speed measurement is ±13 percent (for the range of measurement 40 m); (5) the accuracy of vehicle height measurement is within ±10 percent (for the range of measurement 100 m an when the observation of individual vehicles is possible); and (6) the tail of the queue can be i
ISSN:0882-1666
DOI:10.1002/scj.4690170108
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1986
数据来源: WILEY
|
9. |
Basics of algorithms for processing three‐dimensional digitized pictures |
|
Systems and Computers in Japan,
Volume 17,
Issue 1,
1986,
Page 73-82
Jun‐ichiro Toriwaki,
Shigeki Yokoi,
Preview
|
PDF (777KB)
|
|
摘要:
AbstractThis paper presents basic concepts and fundamental algorithms for processing three‐dimensional digitized images (3D images). A 3D image is a pictorial datum obtained by measuring physical quantities distributed at every point in 3D space and arranging the measurements on a 3D array. First, we present several basic concepts concerning geometrical properties of 3D images, which include connectivity, the connected component, the Euler number, and deletability. Then we explain outlines of basic algorithms derived by using the forementioned concepts based on research results by the authors' group. Procedures referred to here are as follows: calculation of the Euler number, deletability test of 1‐voxels, shrinking, thinning, and border following. Finally, we add 51 references which may aid more detailed research; these references also will supplement the brief explanations and small number of procedures we are limited to in this arti
ISSN:0882-1666
DOI:10.1002/scj.4690170109
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1986
数据来源: WILEY
|
10. |
Pattern Data representation and management in image database systems |
|
Systems and Computers in Japan,
Volume 17,
Issue 1,
1986,
Page 83-91
Masao Sakauchi,
Yutaka Ohsawa,
Preview
|
PDF (1285KB)
|
|
摘要:
AbstractData representation and management in the image database system are discussed. It is pointed out first that both efficiency of representation (amount of data) and the efficiency of processing and retrieval are important in the representation and management of data. From this viewpoint, various kinds of image and graphics representations are discussed, arriving at the viewpoint of “management of M‐dimensional data in N‐dimensional space.” The point data (0 in N data) and the N‐dimensional image data (N in N data) are considered. Various kinds of data structures such as KD tree, KDB tree, 2N partition tree and linear tree, are discussed and analyzed from the viewpoint of the preceding two characteristics. Especially, a tree‐type data structure (called BD tree) is proposed where the N‐dimensional rectangular region is used as the partition key. The structure and the performance are discussed indicating that the performance is better than in other structures. Examples of applications of the proposed data structure in the image database are discussed, as well as the possibilities of future
ISSN:0882-1666
DOI:10.1002/scj.4690170110
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1986
数据来源: WILEY
|
|