摘要:

AbstractThe approach based on the pyramid structure of an image is used widely in image re‐registration. However, in the traditional pyramid structure, 2×2 pixels are placed in correspondence to a pixel in the immediate upper level, which deprives the flexibility of the image size compression. Hence, this paper presents an extended pyramid structure wherem×npixels are placed in correspondence to a pixel in the immediate upper level. Restricting the correspondence between levels to be geometric, not the similarity correspondence, the upper‐left candidate position and the best upper‐left position are defined for the template image at each level, and the range of search at each level is discussed. Then the image in each level is defined. A method is presented wherein the proposed method is applied to the registration of

ISSN:0882-1666    

DOI:10.1002/scj.4690201201

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1989

数据来源: WILEY

摘要:

AbstractAn SIMD cellular array processor “AAP2” and its programming language AAPL have been developed. This array processor is packed into as little as 0.2 m volume in spite of its massive processor array being composed of 256 × 256 single‐bit processing elements [PEs], each of which has 8‐kbit local memory. The compact size is due to the simple and regular array structure for dense packing and a custom CMOS LSI with 8 × 8 PEs developed for the processor array.The massive processor array offers outstanding operation power together with the following functions: (1) modified SIMD control which is able to select a different operation function or different direction of inter‐PE transfer in each PE; (2) propagation transfer operation capable of propagating data through 15 PEs within one clock cycle (330 ns).The AAPL enables a simple and efficient program to be designed due to its APL‐like scanning statements and its primitive operation statements for unique AAP functions.The high performance of the AAP2 has been shown to be equivalent in simulation capability to the very high‐speed hardware logic simul.ator or routing capability of over 1000 MIPS in the automatic chi

ISSN:0882-1666    

DOI:10.1002/scj.4690201202

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1989

数据来源: WILEY

摘要:

AbstractAssociative memories and associaLive computer systems with high‐speed processing capability have been increasingly required in the real‐time application domains, such as File Maintenance, Pattern Recognition, Translation, Artificial Intelligence, and so on. This paper presents a design of high‐performance multiple‐valued associative memory which can perform ultrahigh‐speed processing at low cost.In the proposed method, the correlation between input pattern and memorized pattern is represented directly as multiple‐valued information, so that associative processing is performed efficiently by multiple‐valued operations. Based on a complete parallel processing architecture with multiple‐valued digit‐cell, each correlation can be calculated in parallel.In hardware implementation of a single digit‐cell, two kinds of new devices are proposed: the SOS transistor and the floating‐gate MOS transistor. By using these devices, multiple‐valued operators and multiple‐valued memories for the associative memory can be realized efficiently at the device level. It is demonstrated that compared with the corresponding binary implementation the proposed associati

ISSN:0882-1666    

DOI:10.1002/scj.4690201203

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1989

数据来源: WILEY

摘要:

AbstractThis paper reports on a spoken‐word recognition method for a large speaker‐dependent and speaker‐independent vocabulary employing a hierarchical matching technique. First, the two‐stage, speaker‐dependent method is discussed. In the first stage, the input pattern and the average standard are matched. Only in the cases where there are many similar words among the resulting high‐scoring candidate words is the second stage employed. The second stage employs a hierarchical matching method to match the high‐scoring candidates with a multipattern.When this method was applied to a large vocabulary containing 1000 words, the first‐stage recognition rate was improved 3 percent, thereby enabling a final recognition rate of 97 percent. Next, we report on the speaker‐independent method. Clustering is applied to standard word patterns derived from 40 speakers.A representative pattern from within the cluster and the multipattern which belongs to it are placed into a hierarchy. During the recognition phase, in the first stage, the input pattern and the representative pattern are matched.In the cases where there are many similar words among the high‐ranking candidates, the K” method is used in the second stage to match the multipattern which belongs to the representative pattern. Furthermore, in the final stage, a post‐processing method which empl.oys ten types of discriminating functions is used to redistinguish by automatically extracting the differing portions of similar words.Applying this hierarchical matching method to spoken‐word recognition for a 250/ 1011 word large speaker‐independent vocabulary, a high recognition rate of 94.

ISSN:0882-1666    

DOI:10.1002/scj.4690201204

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1989

数据来源: WILEY

摘要:

AbstractA tree‐connected processor system (TPS) is a system in whichmprocessors are connected in the form of an in‐tree or out‐tree. Each job arriving at a TPS flows on a directed path, from a processor specified for the job to the root (or on a directed path from the root to a processor specified for the job), and is processed by processors lying on the directed path. This paper discusses the feasibility decision problem on a TPS. It is a problem to decide whether or not each job can be processed within its deadline from its arrival time, and to find a schedule if the processing is feasible which realizes the processing. As a result for general TPS's, it is shown that the problem can be solved inO(mnlogn)time for jobs with unit processing times, wheremis the number of processors andnis the number of jobs. Especially, an algorithm proposed for TPS with an in‐tree structure is on‐line and can be used even when the information concerning jobs is obtained only at their

ISSN:0882-1666    

DOI:10.1002/scj.4690201205

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1989

数据来源: WILEY

摘要:

AbstractThis paper aims at an improvement of the software productivity of the system and proposes a software design method for network Os. In this paper the network Os is defined as a system composed of the following two functions:(1) The function constructed on the existing OS, realizing a uniform access to the distributed resources; and (2) the interface between the forementioned function and In the proposed design, (called network Os kernel) is composed as a set of objects existing in the problem domain related to the network Os. As a result of the design, the actual structure of the system and the actual objects are reflected directly on the software design which improves the understanding and the maintenance of the system.The interface between the network Os kernel and the existing Os is introduced to achieve the portability of network Os kernels. It is expected that by applying the design method based on the forementioned principle, the software productivity of the network Os will be improved. As an application example of the proposed design method, an LAN‐oriented network Os was designed and implemented experimentall

ISSN:0882-1666    

DOI:10.1002/scj.4690201206

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1989

数据来源: WILEY

摘要:

AbstractThe service base system (SBS) has been developed as a framework for efficient utilization of computer resources in the network, including LAN and WAN. SBS is a system which provides a network environment which is easy to use by utilizing the existing network and OS.This paper presents the basic concept, fundamental configuration and prospect of SBS. The major features of this system are as follows: (1) The functions offered by the computer are modeled at the abstract level—i.e. service—and the user can utilize the functions of the computer without considering the detailed differences in the use of the computer; (2) the distributed services are managed by a three‐layered view, and the expansion of functions such as addition and combination of services can easily be performed at each node.Thus, the basic concept of SBS and the construction of each node is presented. To demonstrate the usefulness of the system, a simple experimental system was constructed by combining M680H and VAX. It was verified by the experimental system that distributed services can be utilized in a fairly flexible way. A problem left for further study is the description of the reso

ISSN:0882-1666    

DOI:10.1002/scj.4690201207

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1989

数据来源: WILEY

摘要:

AbstractThe mosaic method and geometric method have been used for coding the multicolored image. This paper proposes a dynamic pattern generation method aiming at a more faithful image representation. In the proposed method, the color boundary is extracted from the original picture. The result is divided into smaller blocks, and the pattern code is generated for each block.A different set of patterns is defined according to the joining state of the color boundary to the adjacent already‐encoded blocks. By this scheme, a variety of patterns can be generated by a limited coding complexity. When patterns with high occurrence frequencies are encoded by 4 bit and those with low frequencies by 8 bit, approximately 9500 kinds of patterns can be provided. Approximately 90 percent of the actually appearing patterns belong to the patterns encoded by 4 bit, and the coding efficiency is improved.The color of the region surrounded by the color boundaries should be specified only for the case where the color cannot be determined from the joining relation from the adjacent blocks. Consequently, the color specification data occupies only 10 percent of the total code. Since a large number of patterns can be prepared, an image faithful to the original picture can be restore

ISSN:0882-1666    

DOI:10.1002/scj.4690201208

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1989

数据来源: WILEY

摘要:

AbstractThis paper presents a one‐version cautious scheduler with version selection control CS1(WRW1±) which is an extension of a recently proposed single‐version cautious scheduler CS(WRW). The set of schedules that our scheduler CS1(WRW1±) accepts without delay properly includes the one that CS(WRW) does without delay. It is shown also that ourCS1(WRW1±) is free from cancellation anomaly and runs in polynomia

ISSN:0882-1666    

DOI:10.1002/scj.4690201209

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1989

数据来源: WILEY