SUMMARY The SIFT experimentalcomputer system was designed to meet extremely • high reliabilityrequirementsand to facilitatea formal proof of its correctness. These severe design constraintshave impactedthe user-interfacein severalways. The system providesthe user with static, nonpreemptiveschedulingand requiresthat all tasks execute in less than 3 milliseconds. A tedious generationof vote and s...

This paper presents a feature-based method for matching facial sketch images to face photographs. Earlier approaches calculated descriptors over the whole image and used some transformation and matched them by some classifiers. We present an idea, where descriptors are calculated at selected discrete points (eyes, nose, ears...). This allows us to compare only prominent features. We use SIFT (S...

We use extensions to study the semi-simple quotient of the group ring FpAut(P ) of a finite p-group P . For an extension E : N → P → Q, our results involve relations between Aut(N), Aut(P ), Aut(Q) and the extension class [E] ∈ H(Q,ZN). One novel feature is the use of the intersection orbit group Ω([E]), defined as the intersection of the orbits Aut(N) · [E] and Aut(Q) · [E] in H(Q,ZN). This gr...

In this work we present SIFT, a 3-step algorithm for the analysis of the structural information represented by means of a taxonomy. The major advantage of this algorithm is the capability to leverage the information inherent to the hierarchical structures of taxonomies to infer correspondences which can allow to merge them in a later step. This method is particular relevant in scenarios where t...

We present a comprehensive evaluation of shot-based visual and audio features for MediaEval 2013 Violent Scenes Detection Affect Task. To obtain visual features, we use global features, local SIFT features and motion features. For audio features, the popular MFCC is employed. Besides that, we also evaluate the performance of mid-level features which is constructed using visual concepts. We comb...

This paper deals with concealment of motion blur in image sequences. The approach is different from traditional methods, which attempt to deblur the image. Our approach utilizes the information in consecutive frames, replacing blurred areas of the images with corresponding sharp areas from the previous frames. Blurred but otherwise unchanged areas of the images are recognized using blur invaria...

We consider the identification problem for the model of Lee and Carter (1992). The parameters of this model are known only to be identified up to certain transformations. Forecasts from the model may therefore depend on the arbitrarily chosen identification scheme. A condition for invariant forecasts is proposed. A number of standard forecast models are analyzed.

The large-scale video data on the web contain a lot of semantics, which are an important part of semantic web. Video descriptors can usually represent somewhat the semantics. Thus, they play a very important role in web multimedia content analysis, such as Scale-invariant feature transform (SIFT) feature. In this paper, we proposed a new video descriptor, called a temporalcompress and shorter S...

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission ...

This paper proposes a local motion-based approach for recognizing group activities in soccer videos. Given the SIFT keypoint matches on two successive frames, we propose a simple but effective method to group these keypoints into the background point set and the foreground point set. The former one is used to estimate camera motion and the latter one is applied to represent group actions. After...