摘要:

AbstractThis paper proposes the database model for the motion picture database, together with the query processing. The existing motion picture database is not convenient in describing the change of the scene attribute in the query condition to specify the subsequence of the motion picture database. Another more serious problem of the existing data model is that the desired sequence can never be retrieved from the scene sequence where the scene which does not satisfy the query condition is mixed or a scene is missing.To cope with the former problem, the regular expression which enables users to represent the iteration of the condition is introduced into the MeSOD model. Thus, the change of the scene attribute can be described by the regular expression for the condition. To cope with the latter problem, a query processing is defined formally (incomplete query processing), where the condition containing the regular expression is tolerated according to the database.As an actual example of the proposed approach, the broadcast of a Sumo program is considered, where the broadcast pattern changes during the course of a Sumo match. An adequate scene sequence is required to be extracted according to the condition representing a typical match. It is verified that an adequate scene sequence can be extracted by the incomplete query processing as a Sumo match from an actual Sumo broadcast program. The validity of the result of experiment is verified theoretically, and the effectiveness of the proposed approach is demonstrated.

ISSN:0882-1666    

DOI:10.1002/scj.4690250701

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

年代:1994

数据来源: WILEY

ISSN:0882-1666    

DOI:10.1002/scj.4690250702

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

年代:1994

数据来源: WILEY

摘要:

AbstractThis paper aims at: 1 improvement of the specification verification capability of SDL without losing its advantages, i.e., transparency and descriptive power; and 2 realization of translation between specifications described by SDL and LOTOS. A method is proposed which gives a LOTOS interpretation of the specification by SDL.First, the mapping of the object system structure indicated by SDL specification to the LOTOS description is discussed. Then the description of the processing definition of SDL specification is described. Using the method proposed in this paper, a LOTOS interpretation is presented as an example for the SDL specification for the switching service. The result of interpretation is evaluated and the flexibility of the verification process is discussed.

ISSN:0882-1666    

DOI:10.1002/scj.4690250703

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

年代:1994

数据来源: WILEY

摘要:

AbstractMain memory databases are a promising approach to the realization of high‐performance systems since they do not require low‐speed secondary storages. One of the critical problems of such systems is the volatile nature of main memory. Hence, nonvolatile secondary storage cannot be removed for back‐up and recovery. The authors have developed continuous back‐up systems which realize low‐overhead back‐up procedures and quick recovery.A recent development has been flash memory, which can maintain its contents without electric power supply. It is expected that flash memory will realize high‐speed nonvolatile storage. There are, however, some characteristics which are different from disk storages. For example, in flash memory, the block size of a sequential access is very small, e.g., 256 bytes. Thus we cannot use sequential access to retrieve large amounts of data, although optimization to utilize sequential access need not be considered.Although flash memory seems to be a good choice for secondary storages, the number of rewrites to a memory cell determines its lifetime. Current flash memory cannot be used as conventional secondary storage. Therefore, this paper discusses system architectures which utilize flash memory as back‐up storage. Special consideration is given to reducing the number of rewrite operations. It is expected that in the proposed systems, flash memory storage can survive over 10 years. Performance evaluation is

ISSN:0882-1666    

DOI:10.1002/scj.4690250704

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

年代:1994

数据来源: WILEY

摘要:

AbstractMost research in 3‐D object recognition has concentrated on feature extraction and paid much less attention to the computation and evaluation of matching metric for feature comparison. Many existing algorithms for object recognition have problems with noisy data and incomplete (partial) input data.This paper proposes a similarity metric based on extensive exploitation of 3‐D features and characteristics of objects to solve the shortcomings of existing algorithms. Simulation and experimental results indicate that the proposed matching metric ranks the similarities among objects consistent with human intuition. It also is robust to noise and can even predict the outcome for a given noise level. Furthermore, in occlusion cases, the proposed algorithm is capable of recognizing objects using partial (incomplete) input data. It can also be used to evaluate the reliability and the contribution of a subset of the data relative to the overall object recognition t

ISSN:0882-1666    

DOI:10.1002/scj.4690250705

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

年代:1994

数据来源: WILEY

摘要:

AbstractThis paper considers the case where the geometrical model for a 3‐D object is given, and discusses the solution of the problem to cover the rotation of the object from a single (monocular) view image. The rigid body is represented by a set of vectors and the joint is represented by a unit vector corresponding to the rotational axis. For each rigid object, the connecting joint is included. The inner product between unit vectors as well as the scalar triple product are assumed as known. Using such a model, not only the rigid body which has widely been discussed, but also the object composed of rigid bodies and joints with the rotational degree of freedom can be handled by the same framework.In the previous paper, it was shown that such a problem to determine the rotational posture of the object can be represented by a graph, and the solvability of the problem is discussed. The basic problem represented by the tree structure is formulated.This paper defines anew the concept of connection index, and classifies the tree‐structured basic problems. For the basic problem with the connection index being 0 and 1, an algorithm is proposed which can estimate the rotations of the rigid subobject. The algorithms have the common structure for each connection index, and can be easily be constructed by defining the geometrical inference inherent to each basic problem. The usefulness of the algorithm is demonstrated through the individual experime

ISSN:0882-1666    

DOI:10.1002/scj.4690250706

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

年代:1994

数据来源: WILEY

摘要:

AbstractThis paper considers word recognition based on the existence of the transition between phonemes and characters with complete segmentation between phonemes and characters. A method is proposed which estimates theoretically the relation between the phoneme/character recognition score and the word recognition score. The word recognition score can be estimated by the evaluation formula based on the number of short‐distance words in the dictionary for the case where the word dictionary is used. The traditional evaluation formula for the word recognition score, however, has a problem in that the accuracy of estimation is deteriorated rapidly with the decrease of the phoneme/character recognition score and the increase of the short‐distance words.From such a viewpoint, this paper proposes a new evaluation formula with a higher estimation accuracy. In this paper, the sequence that can be generated based on the transition information is used as the item in the word dictionary. Then the number of items increases exponentially with the length, making it difficult to estimate the number of short‐distance words. For this problem, this paper proposes an algorithm that calculates the number of short‐distance words in a polynomial time. For approximately 5000 important words in Japanese, the estimated word recognition score for the phoneme recognition score of 90 percent is given approximately 72 percent by the proposed method and approximately 66 percent by the traditional method. It is approximately 78 percent by simulation. Thus, it is shown that the proposed method gives a better approximation than the traditional

ISSN:0882-1666    

DOI:10.1002/scj.4690250707

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

年代:1994

数据来源: WILEY

摘要:

AbstractHumans can easily discriminate not only simple figures but also similar complex textures. At present, a large information processing capability is required for a machine to process such texture image information in a short time on the CRT screen or medical images. It is important to analyze the visual information mechanism for those images.In recent studies of visual search, the texton is considered as apop‐outdiscrimination element. There remain a number of problems in the recognition of the texture composed of complex patterns such that the texton in not clear. On the other hand, fractal can be a measure for the complexity, and is related closely to the visual system.This paper presents a recognition experiment and an attention allocation model by simultaneous presentation of multiple images, where a set of textures with known fractal dimensions are used as the image information. The relations are examined quantitatively. As a result, it is shown that a relation can be assumed between the fractal dimension (Dp,DH) of the texture and the allocation of attentionfito the texture. For the set (A) of textures, a multiple regression expressionf(A)= 97.6 + 20.1Dp− 55.3DHcan be applied with a high correlation coefficient. Thus, it is verified that the fractal information can be used as the pop‐out discrimination element in the recognition of the te

ISSN:0882-1666    

DOI:10.1002/scj.4690250708

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

年代:1994

数据来源: WILEY

摘要:

AbstractTo implement a human interface for efficiently modeling 3‐D shapes on a computer, a virtual works space enabling direct manipulation of a shape model on a computer similar to manipulating a real 3‐D object must be constructed. In this virtual work space, the tactile and force sensations arising while the object is manipulated must be fed back to the person. We previously proposed the space interface device SPIDAR capable of force feedback to the person's fingertips. However, only one finger could be used in SPIDAR, so operations where the object is held were not possible. In this paper, we extend SPIDAR and propose the space interface device SPIDAR II to implement a virtual work space where operations involving holding and moving objects are possible. This device measures the position of the minimum of the two fingers needed to manipulate objects and can provide tactile feedback to the fingertips while an object is being held. A prototype device is built and a virtual work space is constructed where holding and moving objects is possible. Further, an experiment is conducted to investigate the effect of tactile feedback to work operability in this virtual work space, and its effectiveness is confir

ISSN:0882-1666    

DOI:10.1002/scj.4690250709

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

年代:1994

数据来源: WILEY

摘要:

AbstractThis paper proposes an A* search algorithm for continuous speech recognition using phoneme HMM and Context‐Free (LR) parser. This best‐first search evaluates each sentence hypothesis with the matching score plus the heuristic score of the unsearched part. Heuristics computation is based on word‐pair constraint that is common to all the hypotheses. Word‐pair constraint, which is not computationally expensive, satisfies A*‐admissibility and provides powerful heuristics.The algorithm is guaranteed to obtain the optimal hypothesis and does not expand vain hypotheses very much. Compared with various kinds of beam search, therefore, it achieved better accuracy with less computation. This heuristics proved to be effective for beam search, too. Furthermore, it was implemented on stochastic grammar and some improved was

ISSN:0882-1666    

DOI:10.1002/scj.4690250710

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

年代:1994

数据来源: WILEY