801 resultados para Video similarity
Resumo:
Fractal image compression is a relatively recent image compression method, which is simple to use and often leads to a high compression ratio. These advantages make it suitable for the situation of a single encoding and many decoding, as required in video on demand, archive compression, etc. There are two fundamental fractal compression methods, namely, the cube-based and the frame-based methods, being commonly studied. However, there are advantages and disadvantages in both methods. This paper gives an extension of the fundamental compression methods based on the concept of adaptive partition. Experimental results show that the algorithms based on adaptive partition may obtain a much higher compression ratio compared to algorithms based on fixed partition while maintaining the quality of decompressed images.
Resumo:
The intrinsic independent features of the optimal codebook cubes searching process in fractal video compression systems are examined and exploited. The design of a suitable parallel algorithm reflecting the concept is presented. The Message Passing Interface (MPI) is chosen to be the communication tool for the implementation of the parallel algorithm on distributed memory parallel computers. Experimental results show that the parallel algorithm is able to reduce the compression time and achieve a high speed-up without changing the compression ratio and the quality of the decompressed image. A scalability test was also performed, and the results show that this parallel algorithm is scalable.
Resumo:
The authors' experience in the treatment of grey video compression using fractals is summarized and compared with other research in the same field. Experience with parallel and distributed computing is also discussed.
Resumo:
In this paper, we shall critically examine a special class of graph matching algorithms that follow the approach of node-similarity measurement. A high-level algorithm framework, namely node-similarity graph matching framework (NSGM framework), is proposed, from which, many existing graph matching algorithms can be subsumed, including the eigen-decomposition method of Umeyama, the polynomial-transformation method of Almohamad, the hubs and authorities method of Kleinberg, and the kronecker product successive projection methods of Wyk, etc. In addition, improved algorithms can be developed from the NSGM framework with respects to the corresponding results in graph theory. As the observation, it is pointed out that, in general, any algorithm which can be subsumed from NSGM framework fails to work well for graphs with non-trivial auto-isomorphism structure.
Resumo:
This paper examines different ways of measuring similarity between software design models for Case Based Reasoning (CBR) to facilitate reuse of software design and code. The paper considers structural and behavioural aspects of similarity between software design models. Similarity metrics for comparing static class structures are defined and discussed. A Graph representation of UML class diagrams and corresponding similarity measures for UML class diagrams are defined. A full search graph matching algorithm for measuring structural similarity diagrams based on the identification of the Maximum Common Sub-graph (MCS) is presented. Finally, a simple evaluation of the approach is presented and discussed.
Resumo:
In terms of a general time theory which addresses time-elements as typed point-based intervals, a formal characterization of time-series and state-sequences is introduced. Based on this framework, the subsequence matching problem is specially tackled by means of being transferred into bipartite graph matching problem. Then a hybrid similarity model with high tolerance of inversion, crossover and noise is proposed for matching the corresponding bipartite graphs involving both temporal and non-temporal measurements. Experimental results on reconstructed time-series data from UCI KDD Archive demonstrate that such an approach is more effective comparing with the traditional similarity model based algorithms, promising robust techniques for lager time-series databases and real-life applications such as Content-based Video Retrieval (CBVR), etc.
Resumo:
A video annotation system includes clips organization, feature description and pattern determination. This paper aims to present a system for basketball zone-defence detection. Particularly, a character-angle based descriptor for feature description is proposed. The well-performed experimental results in basketball zone-defence detection demonstrate that it is robust for both simulations and real-life cases, with less sensitivity to the distribution caused by local translation of subprime defenders. Such a framework can be easily applied to other team-work sports.
Resumo:
Temporal representation and reasoning plays an important role in Data Mining and Knowledge Discovery, particularly, in mining and recognizing patterns with rich temporal information. Based on a formal characterization of time-series and state-sequences, this paper presents the computational technique and algorithm for matching state-based temporal patterns. As a case study of real-life applications, zone-defense pattern recognition in basketball games is specially examined as an illustrating example. Experimental results demonstrate that it provides a formal and comprehensive temporal ontology for research and applications in video events detection.
Resumo:
A project within a computing department at the University of Greenwich, has been carried out to identify whether podcasting can be used to help understanding and learning of a subject (3D Animation). We know that the benefits of podcasting in education (HE) can be justified, [1]; [2]; [3]; [4]; [5]; [6] and that some success has been proven, but this paper aims to report the results of a term-long project that provided podcast materials for students to help support their learning using Xserve and Podcast Producer technology. Findings in a previous study [6] identified podcasting as a way to diversify learning and provde a more personalised learning experience for students, as well as being able to provide access to a greater mix of learning styles [7]. Finally this paper aims to present the method of capture and distribution, the methodologies of the study, analysis of results, and conclusions that relate to podcasting and enhanced supported learning.
Resumo:
Seabirds are effective samplers of the marine environment, and can be used to measure resource partitioning among species and sites via food loads destined for chicks. We examined the composition, overlap, and relationships to changing climate and oceanography of 3,216 food loads from Least, Crested, and Whiskered Auklets (Aethia pusilla, A. cristatella, A. pygmaea) breeding in Alaska during 1994–2006. Meals comprised calanoid copepods (Neocalanus spp.) and euphausiids (Thysanoessa spp.) that reflect secondary marine productivity, with no difference among Buldir, Kiska, and Kasatochi islands across 585 km of the Aleutian Islands. Meals were very similar among species (mean Least–Crested Auklet overlap C = 0.68; Least–Whiskered Auklet overlap C = 0.96) and among sites, indicating limited partitioning of prey resources for auklets feeding chicks. The biomass of copepods and euphausiids in Least and Crested Auklet food loads was related negatively to the summer (June–July–August) North Pacific Gyre Oscillation, while in Whiskered Auklet food loads, this was negatively related to the winter (December–January–February) Pacific Decadal Oscillation, both of which track basin-wide sea-surface temperature (SST) anomalies. We found a significant quadratic relationship between the biomass of calanoid copepods in Least Auklet food loads at all three study sites and summer (June–July) SST, with maximal copepod biomass between 3–6°C (r 2 = 0.71). Outside this temperature range, zooplankton becomes less available to auklets through delayed development. Overall, our results suggest that auklets are able to buffer climate-mediated bottom-up forcing of demographic parameters like productivity, as the composition of chick meals has remained constant over the course of our study.
Resumo:
Sublittoral macrobenthic communities in the Skomer Marine Nature Reserve (SMNR), Pembrokeshire, Wales, were sampled at 10 stations in 1993, 1996, 1998, 2003, 2007 and 2009 using a Day grab and a 0.5 mm mesh. The time series is analysed using Similarities Profiles (SIMPROF) tests and associated methods. Q-mode analysis using clustering with Type 1 SIMPROF addresses multivariate structure among samples, showing that there is clear structure associated with differences among years. Inverse (r-mode) analysis using Type 2 SIMPROF decisively rejects a hypothesis that species are not associated with each other. Clustering of the variables (species) with Type 3 SIMPROF identifies groups of species which covary coherently through the time-series. The time-series is characterised by a dramatic decline in abundances and diversity between the 1993 and 1996 surveys. By 1998 there had been a shift in community composition from the 1993 situation, with different species dominating. Communities had recovered in terms of abundance and species richness, but different species dominated the community. No single factor could be identified which unequivocally explained the dramatic changes observed in the SMNR. Possible causes were the effects of dispersed oil and dispersants from the Sea Empress oil spill in February 1996 and the cessation of dredge-spoil disposal off St Anne’s Head in 1995, but the most likely cause was severe weather. With many species, and a demonstrable recovery from an impact, communities within the SMNR appear to be diverse and resilient. If attributable to natural storms, the changes observed here indicate that natural variability may be much more important than is generally taken into account in the design of monitoring programmes.