Video summarization can provide a fine representation of the content of video stream and reduce a large amount of data involved in video indexing, browsing, and retrieval. Moreover, Key frame selection is an important step in the research of content-based video analysis and retrieval. Although there exist a variety of methods for key frame selection, they are heuristic and closed systems, which cannot dynamically generate video summary with user’s preference. In this paper, an M-estimator and epipolar line distance constraint camera motion estimation algorithm is introduced as camera parameters is an important motion feature for key frame selection, and Broyden-Fletcher-Goldfarb-Shanno (BFGS) method is applied to optimize estimated parameters. Moreover, since Interactive Computing is a novel-computing model that represents the transition of algorithm to interaction, an interactive model of key frame selection (IKFS) is presented as a result of improving the model of key frame selection (KFS). The model of KFS and IKFS are proved to satisfy the criterion of induction and coinduction, respectively. Experimental results show that the processing scheme generates flexible and desirable summarizations whose distortion rate is lower than current method. Above all, IKFS is an extension to KFS. 相似文献
This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.
A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system. 相似文献
Even with attractive computational advantages, mobile agent technology has not developed its full potential due to various security issues. This paper proposes a method called Private Key Consignment to solve the problem of how to protect the data carried by mobile agents. It exploits new functionalities and mechanism provided by the trusted computing technology, and adopts both public key and symmetric key cryptographic means for data and key protection. The most notable feature of this method is that it protects the private key of the agent by consigning it to a tamper proof hardware, thus, enabling convenient and secure use of the private key. It provides a new scheme of mobile agents' data protection. 相似文献
The efficiency characteristics of multicast key distribution schemes based on (v, b, r, λ)-designs are investigated. The stability
and connectivity of such designs are estimated. These estimates generalize and enhance the well-known estimates for the efficiency
characteristics of multicast key distribution schemes based on incomplete block designs.
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 100–111, May–June 2007. 相似文献
This article is concerned with various arithmetic operations inGF(2m). In particular we discuss techniques for computing multiplicative inverses and doing exponentiation. The method used for
exponentiation is highly suited to parallel computation. All methods achieve much of their efficiency from exploiting a normal
basis representation in the field. 相似文献