|
1. |
One‐Dimensional Bounded Cellular Acceptor with Rotated Inputs. A Relationship between ∧ and ∨ Types |
|
Systems and Computers in Japan,
Volume 20,
Issue 3,
1989,
Page 1-12
Hiroshi Taniguchi,
Katsushi Inoue,
Itsuo Takanami,
Preview
|
PDF (855KB)
|
|
摘要:
AbstractThe authors previously introduced the following two‐dimensional automaton, and made several discussions on its accepting power. The input two‐dimensional tape is rotated by 90, 180 or 270 deg in clockwise direction. The rotated results are scanned by one‐dimensional bounded cellular acceptors. The results of scanning are combined by product (∧) or sum (∨), to make the decision regarding the final acceptance. The purpose of this paper is to discuss further details of the accepting power of such an automaton. In the first‐half of this paper, the situation is assumed where the rotated inputs are scanned by the deterministic one‐dimensional bounded cellular acceptors. A discussion is made on the relation between the accepting powers when the results of the scanning are combined only by product or only by sum. It is shown that the families of sets accepted by the product or the sum type are always incomparable. In the second half of the paper, the relation between the accepting powers of the following two automata are described. One is the automaton obtained by combining the one‐dimensional bounded cellular acceptors by sum (or product); the other is the automaton obtained by combining one‐way parallel sequential array acceptors by
ISSN:0882-1666
DOI:10.1002/scj.4690200301
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1989
数据来源: WILEY
|
2. |
Recovery of 3D Shape Based on Generalized Symmetry |
|
Systems and Computers in Japan,
Volume 20,
Issue 3,
1989,
Page 13-21
Toshimitsu Tanaka,
Seiichiro Naito,
Tokiichiro Takahashi,
Isao Masuda,
Preview
|
PDF (645KB)
|
|
摘要:
AbstractWith the widening range of applications of computer graphics, simple methods of feeding graphic information into computers which matches the human senses are demanded. This paper proposes a method of reconstructing a 3D (three‐dimensional) shape from a line drawing by using generalized symmetry. Generalized symmetry is an extended concept of skewed symmetry and represents the synmetrical characteristics of an object in terms of its curvilinear symmetrical axes. First, this paper defines generalized symmetry and describes its property; then it describes an algorithm which reconstructs the 30 shape of an object satisfying the generalized symmetry from an orthographically projected image of the object and such additional information as auxiliary lines. This algorithm produces a description of a 3D shape by using a line drawing and a small amount of additional information. This paper also demonstrates a computer simulation of the reconstruction of a complex 3D shape (such as one described by the generalized cylinder) drawn by using a data table
ISSN:0882-1666
DOI:10.1002/scj.4690200302
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1989
数据来源: WILEY
|
3. |
Feature Extraction and Classification of Cell Morphology in Response to the Cell Cycle |
|
Systems and Computers in Japan,
Volume 20,
Issue 3,
1989,
Page 22-31
Motohisa Tomura,
Yoshinari Kumaki,
Haruyuki Minamitani,
Tsutomu Horikoshi, Nonmember,
Preview
|
PDF (645KB)
|
|
摘要:
AbstractThe cancer cell exhibits a cyclic change in its morphology, and the discussion of the cyclic change in cell morphology is very important in cytology, considering the relation between the cell growth and the distribution of the protein granules. At present, this kind of analysis is made by human observation through a microscope. This paper describes a method which recognizes the cyclic morphological changes of the cancer cell by image processing. First, various feature parameters of the nucleus and the cytoplasm are calculated by computerized image processing. In the extraction of the cell image from the original image, the binarization rather than ternarization is applied separately to the nucleus and the cytoplasm. Based on the calculated feature parameters, three decision criteria are set based on the discriminant analysis to recognize the cell morphology. As a result of experiment, the recognition rate of 93.9 percent was achieved for the training data, indicating that the cell morphology can be recognized by a computer.
ISSN:0882-1666
DOI:10.1002/scj.4690200303
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1989
数据来源: WILEY
|
4. |
An Automatic Recognition System for Piping and Instrument Diagrams |
|
Systems and Computers in Japan,
Volume 20,
Issue 3,
1989,
Page 32-46
Mitsuo Ishii,
Yoshikazu Ito,
Masanari Yamamoto,
Hiroaki Harada,
Michiko Iwasaki,
Preview
|
PDF (959KB)
|
|
摘要:
AbstractThis paper describes an automatic diagram input system which reads the handwritten piping and instrument diagram and recognizes the symbol, character, and line drawn on the diagram. The object is a handwritten diagram which is easily understandable by the knowledge of the designer under a very mild constraint. The symbols which are the object of recognition are of more than 200 kinds of various sizes. In addition, a large symbol with unspecified shape may be drawn, and there can be various kinds of lines. To cope with such complex diagrams containing a large amount of handwriting distortions, various diagram processing techniques are proposed. Examples are vector representation with a high accuracy, shaping of various distortions, and the two‐stage segmentation, where line, symbol and character are separated hierarchically from the vectorized figure. Other examples are the symbol recognition combining a decision tree and pattern matching, and recognition dictionary based on automatic generation of distorted patterns. The developed diagram input system is a flexible system, in which new symbols can be additionally registered, and complex handwritten diagrams can be recognized. A test was made for the system using the actually written design diagrams. The result indicated a practically satisfactory performance, where the processing time is 3 to 8 min for an A3 sized diagram by a large‐scale computer and the recognition rate is above 95 perc
ISSN:0882-1666
DOI:10.1002/scj.4690200304
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1989
数据来源: WILEY
|
5. |
Recovery of Nonrigid Curvilinear Objects Using Optical Flow |
|
Systems and Computers in Japan,
Volume 20,
Issue 3,
1989,
Page 47-57
Akira Kawamura, Nonmember,
Noboru Sugie,
Kokichi Sugihara,
Preview
|
PDF (697KB)
|
|
摘要:
AbstractThe kinetic depth effect which recognizes a 3‐D structure from a 2‐D information is explained from an algorithmic viewpoint among other human vision functions such as binocular vision.This paper proposes an algorithm for reconstructing the structure and motion of a 3‐D nonrigid object using the information of positions and velocities in the time sequence of images. It is assumed that the nonrigid object does not deviate significantly from rigidity. First, the object is analyzed approximately by assuming that it is rigid. Then the first‐order terms of Ct (which is an interval of two adjacent frames) are added to improve the approximation.Models of rigid and nonrigid objects were made, and information of their positions and optical flows were formed. The effectiveness of the proposed algorithm was confirmed by applying this to the data of the
ISSN:0882-1666
DOI:10.1002/scj.4690200305
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1989
数据来源: WILEY
|
6. |
Fabrication of Three—Dimensional Objects Using Laser Lithography |
|
Systems and Computers in Japan,
Volume 20,
Issue 3,
1989,
Page 58-67
Takashi Nakai,
Yoji Marutani,
Preview
|
PDF (698KB)
|
|
摘要:
AbstractThere is no established technique for the 3‐dimensional (3‐D) pattern formation, and many structures cannot be formed using the conventional CAD/CAM technology. We have constructed a simpler economical system for the 3‐D pattern formation by using an ultraviolet laser and light‐sensitive resins. In this technique, the CAD data designed by a computer are sliced horizontally. Using the sliced data, the laser is moved in a 2‐D direction and the light‐sensitive resin is irradiated. Then solidified thin plates are stacked to form a pattern. Using this technique, such complicated patterns as holes, screws and hollow objects, can be formed by one process. Since it is not necessary to maintain the cutting tools and the cutting scraps, a completely automated process can
ISSN:0882-1666
DOI:10.1002/scj.4690200306
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1989
数据来源: WILEY
|
7. |
Dynamics of Stochastic Relaxation Processes |
|
Systems and Computers in Japan,
Volume 20,
Issue 3,
1989,
Page 68-77
Toshiaki Ejima,
Preview
|
PDF (632KB)
|
|
摘要:
AbstractThe consistent labeling problem, which is one of the combinational problems, can be formulated within the framework of the stochastic relaxation process. This paper describes clearly the structure of the stochastic relaxation algorithm obtained from such a formulation. The usefulness of the stochastic relaxation in the consistent labeling problem is demonstrated. The consistent labeling problem belongs to the NP‐complete class, and is one of the “difficult” problems among the combinational problems. The stochastic relaxation method aims at the overall consistency by iterating the adjustment for local consistency. In this sense, in the consistent labeling problem, a consistent label is obtained if the local consistency applies to any part of the system. On the other hand, the stochastic relaxation can be considered as a dynamical system which contains a mutual interaction to adjust the consistency. The steady‐state solution of such a dynamical system corresponds to a solution generated by the stochastic relaxation process. This paper describes clearly the structure of the dynamical system specified by the stochastic relaxation, via a theoretical analysis and a computer simulation. As a result, it was verified that an initial state always exists near the equilibrium point, from which the convergence to the optimal steady‐state solution is ensured. It was verified that by reducing the neighborhood region, the ratio of the initial state region from which the convergence to the optimal steady‐state solution is ensured, i
ISSN:0882-1666
DOI:10.1002/scj.4690200307
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1989
数据来源: WILEY
|
8. |
Image Segmentation Based on Distribution of a Measure of Centrality |
|
Systems and Computers in Japan,
Volume 20,
Issue 3,
1989,
Page 78-84
Weon Geun Oh,
Saburo Tsuji,
Preview
|
PDF (465KB)
|
|
摘要:
AbstractEdge detection can be executed by computer at a high speed and thus lends itself to region extraction. However, the edges detected from most images are imperfect due to noise and broken edges.This paper presented an edge‐based region segmentation algorithm using a global measurement called degree of centrality. Methods of computing the degree of centrality from the input image, analyzing its distribution and detecting gaps between edges will be described. The spatial relationship of disjoint boundaries and pseudoregions will be analyzed to determine region splitting and/or merging. The performance of the proposed algorithm is demonstrated via experiment using images of an indoor scene.Advantages of this algorithm include its simple work‐flow, and its ability to perform feature extraction while performing region segmentat
ISSN:0882-1666
DOI:10.1002/scj.4690200308
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1989
数据来源: WILEY
|
9. |
Analyzing Parallel Executability of Production Systems |
|
Systems and Computers in Japan,
Volume 20,
Issue 3,
1989,
Page 85-97
Toru Ishida,
Preview
|
PDF (987KB)
|
|
摘要:
AbstractThe production system is one in which mutually independent rules communicate with each other through a common database aiming at the solution of a problem. Because of its nature, the production system seems to contain a larger potential parallelism than the procedural program. At present, however, only one rule succeeded in condition matching, is selected and executed, which prevents the full utilization of the parallelism. The aim of this paper is to realize a high‐speed execution of the production system by executing the rules in parallel as far as possible. First, a new execution model is proposed for the production system, where the rules succeeded in condition match are executed in parallel as far as possible. Then the data dependency graph for the production system is introduced, and a method is presented by which more than one rule is analyzed to determine whether or not they can be executed in parallel. A method is presented which applies the result of parallel executability analysis to the parallel execution of the rules on a parallel computer, or the execution scheduling of the rules on a sequential computer. A production system PLANET was constructed which can analyze a program by a parallel execution simulation, and the proposed method was evaluated. It was verified that four to eight rules can be executed in parallel in the range of programs used in the evaluation. By combining the result of this paper with the traditional parallel condition matching, it is expected that a further parallelism can be realize
ISSN:0882-1666
DOI:10.1002/scj.4690200309
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1989
数据来源: WILEY
|
10. |
Self‐Organization of Recognition Cell Groups in Nerve Fields |
|
Systems and Computers in Japan,
Volume 20,
Issue 3,
1989,
Page 98-108
Nobuhiko Ikeda,
Toyoshi Torioka,
Preview
|
PDF (652KB)
|
|
摘要:
AbstractThis paper proposes a basic model for the self‐organization of the recognition cell group in the nerve field. The model is composed of nerve cell layers with mutual lateral inhibition. Also described is the condition for the self‐organization of the recognition cell groups for then‐dimensional input and, based on that condition, the properties of the model are discussed. Then the behavior of the model is verified through computer simulation. As a result, the following observations are made. When a certain condition is satisfied, recognition cells are formed in a group. These cells respond only to the particular set of input patterns. By varying the training parameters, the recognition cell group is formed depending on the similarity between input patterns. For highly similar patterns, the recognition cell groups are formed in nearby locations in the nerve field. The recognition cell group is formed according to the frequency of the input pattern and its
ISSN:0882-1666
DOI:10.1002/scj.4690200310
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1989
数据来源: WILEY
|
|