摘要:

AbstractFor retrieval of image databases there is a method in which image retrieval is based on similarity image input. This retrieval method uses the contents (features) of the input exhibition image as the key for retrieval. However, since much calculation time is required to process the images and to extract features from them, the increase in overall retrieval time poses a problem. Thus, a method is proposed which represents the process of image searching as a decision tree and executes retrieval on the tree. This is an efficient method for reducing the retrieval time since the number of features used for classification therein is small on the average. It also has the merit of decreasing retrieval errors by deleting nodes on which there are many retrieval errors with new nodes with fewer errors. In this paper we consider decision trees for similarity image retrieval, attempt to construct an appropriate decision tree which has a shorter retrieval time and which produces fewer retrieval errors from two given inputs [(1) a set of similarity errors used for retrieval and (2) the retrieval object set of an image database] and perform classification (retrieval) experiments.

ISSN:0882-1666    

DOI:10.1002/scj.4690170801

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

年代:1986

数据来源: WILEY

摘要:

AbstractVideo pictures and voice information play an important role in the present‐day social life. Captioned video tapes are one of the most important sources of information for hearing‐impaired people. In Japan, however, the usual method of captioning uses telop cards because of the complexity of the Japanese language. Moreover, this method requires considerable time and money. We developed a video information processor that superimposes the printout of a Japanese word processor on the images of video devices. As a result, anyone (not necessarily a professional operator) can make captioned video tapes easier, faster, and cheaper than by the usual method. In particular, the captioning process speeds up the usual method by about ten times. This enables captioning on video pictures faithful to speech and hence is effective for enriching information in video pictu

ISSN:0882-1666    

DOI:10.1002/scj.4690170802

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

年代:1986

数据来源: WILEY

摘要:

AbstractAs suitable topology for interconnection networks of multiprocessors, De Bruijn graphs have been proposed and a number of investigations have been conducted on their fault tolerance. A De Bruijn graph is a directed graph with maximum degreed(the maximum number of links that can be connected to one processor), diameterk(maximum number of repeaters between two processors) and number of nodesdk(number of processors). A Kautz graph is a directed graph with maximum degreed, diameterkand number of nodesdk+dk‐1. Both have the smallest diameter among the graphs with maximum degreed.This paper proves the following: (1) Ifd‐2 nodes in a De Bruijn graph are removed (ifd‐2 processors are faulty), its diameter becomesd+ 1, which is only 1 larger than the original diameter. (2) Ifd‐3 nodes in a Kautz graph are removed, its diameter becomesk+ 1 and ifd‐1 nodes are removed, the diameter isk+ 2 or less, which is at most 2 larger than the original diameter. (3) The values of (1) and (2) are at most 1 larger than the lower bound under the limitation of degreed, (4) A fault‐tolerant routing algorithm can be realized easily. This algorithm is better than any existing algorithm because of its s

ISSN:0882-1666    

DOI:10.1002/scj.4690170803

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

年代:1986

数据来源: WILEY

摘要:

AbstractLarge‐scale programs (i.e., LSI‐DA) and simulation programs require a working set size of several Mbytes and a long execution time. When executed in parallel with interactive jobs, large‐scale jobs exert a degrading effect on the processing of interactive jobs. In addition, the turn‐around time for large‐scale jobs is degraded. It is therefore necessary to limit the amount of real memory which is made available for large‐scale jobs. However, a sound method for determining the limit has not yet been established.This paper proposes a method for improving the turn‐around time of large‐scale jobs without affecting the processing of interactive jobs executed in parallel. Turnaround time is improved by avoiding the swapping of large‐scale jobs. Furthermore, a look‐ahead push method is employed to ensure some given mean response time for interactive jobs when the memory load suddenly increases. Another feature of the method is that the limitation on real memory is adjusted automatically, thus eliminating the need for the user to set the limit. Simulation results indicate that the adverse effect on interactive jobs is minimized and that CPU utilization by large‐scale jobs is improved by a factor of two or more in systems in which a large number of te

ISSN:0882-1666    

DOI:10.1002/scj.4690170804

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

年代:1986

数据来源: WILEY

摘要:

AbstractA geographic information overlay method is defined whereby the intersection of figures caused by overlaid maps is detected and socio‐economic information about the detected region is restructured. By this method map information compiled with the different social attributes can be compared and their consistency can be checked for regional analysis. This method can be used as an alternative simulation model in generating indices for certain problems. For given map data geometric figure intersections are treated by intersection calculus theory in computational geometry. For socio‐economic information, integration and distribution of numerical data and representation of attributes are implemented from the practical point of view. As a case study, this method is applied to the overlay of geological and administrative maps in earthquake disaster prevention. It is found that the method is effective in achieving consistency between maps with different attributes and can be an alternative method to calculation of risk factors by complex algorit

ISSN:0882-1666    

DOI:10.1002/scj.4690170805

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

年代:1986

数据来源: WILEY

摘要:

AbstractThis paper discusses the application of two‐dimensional dynamic programming (DP) matching to ultrasonic kidney images. By introducing the model‐matching technique, feature extraction of the object organ is achieved. It is also possible to reconstruct the three‐dimensional structure of the organ. The proposed technique has the following features. (1) Unlike the monotone continuous condition employed in speech recognition, the two‐dimensional DP method has no time‐sequence constraints. (2) The recognition performance is improved by utilizing the edge information. (3) Hierarchical construction of DP from coarse to fine grids improves the processing speed. (4) The method allows man‐machine interaction by fixing a point on the contour of the object. (5) The method can be applied to time‐series and/or three‐dimensional consecutive images and the speed is improved by using the object from the

ISSN:0882-1666    

DOI:10.1002/scj.4690170806

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

年代:1986

数据来源: WILEY

摘要:

AbstractWhen humans observe two‐dimensional projected images of a moving object, they can recognize its three‐dimensional structure and its motion. This paper presents a method which can recover the three‐dimensional structure from the orthogonally projected image of a jointed object. First, a method is presented for a rigid rod, when the direction of the angular velocity is spatially fixed. Then, the three‐dimensional structure and motion can be recovered by observing the positions and velocities of both ends on the image. The method is extended to the case of two moving jointed rigid rods, where the direction of the angular velocity vector of the rotational motion of one rod is spatially fixed, and that of the other rod is fixed relative to the former. The method can recover the three‐dimensional structure and motion by observing the positions and velocities of the ends and the joint. By a computer simulation, a satisfactory result was

ISSN:0882-1666    

DOI:10.1002/scj.4690170807

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

年代:1986

数据来源: WILEY

摘要:

AbstractThis paper proposes a method which extracts the three‐dimensional information from the single‐view image obtained by projecting a texture on the surface to be measured. In the proposed method, the texture is generated by projecting a number of cone‐shaped beams of light from point sources on the object surface. Based on the generated texture, the three‐dimensional measurement is performed. Since it is difficult to obtain explicit information on the shape of the surface from a single image, more than one light source is used. In other words, two images are obtained by a single camera by varying the location of the point source. By combining the processings of those two images, a simultaneous estimation is made on the normal vector and the three‐dimensional coordinate of each point on the image. Compared with the method by two‐eye stereo‐taxic vision, no processing is needed for determination of correspondence. Compared with the method using slit‐light, less time is required for the delta acquisition. Compared with the method utilizing texture, the extraction can be performed withouta prioriknowledge about textures on the surface. The extraction can be performed only by the local process of the object surface. These are the features of the method. The result of applying the proposed method to the computer‐simulated images and real image are presented, together with the discussions of th

ISSN:0882-1666    

DOI:10.1002/scj.4690170808

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

年代:1986

数据来源: WILEY

摘要:

AbstractA modified Ethernet designated “Acknowledging Ethernet,” which essentially provides higher reliability, was proposed by Tokoro et al. They evaluated its performance by means of simulation. In this paper, the performance of the Acknowledging Ethernet is analyzed theoretically. The average throughput, the average number of times of retransmission, and the average data packet transmission delay are approximately obtained. The accuracy of the approximation analysis is examined by comparison with the simulation results. It was found also that the performance of the Ethernet is only slightly degraded with the introduction of the acknowledging mechanism in the Acknowledging Ether

ISSN:0882-1666    

DOI:10.1002/scj.4690170809

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

年代:1986

数据来源: WILEY

摘要:

AbstractThis paper considers a symbolic representation of images which is adequate for interactive image processing, and reports an actual system constructed on a minicomputer. The system is closely associated with an LISP. Some attributes of image data and procedures are represented by a frame structure often used in studies of AI or knowledge engineering. Both image data and image processing procedures are managed by frames. Meanwhile, image processing routines can be developed in both low‐and high‐level languages such as ASSEMBLER, FORTRAN or C, and they can easily be linked to the system by specific functions. Consequently, flexible and high‐speed processing can be realized. If some knowledge of image processing is given, this system will be available for fundamental studies of image description and image understa

ISSN:0882-1666    

DOI:10.1002/scj.4690170810

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

年代:1986

数据来源: WILEY