8968963
Offense based temporal segmentation for event detection in soccer video
Sports video is regarded as a good testing bed for techniques on content based video analysis and processing. Although partially successful systems have been designed for specific sports domains with limited data, most previous works do not adequately address the problem of temporal segmentation for event detection, nor the event representation problem. In this paper, we present an analysis of soccer video for detecting the semantic notion of <i>offense</i>. It is not only useful as a new semantic concept of sports video analysis, but also provides temporal segmentation for video event detection and representation. We propose a system to detect the offensive unit in soccer video automatically. The offensive unit is then used to calculate new semantics like <i>possession</i>, as well as to detect goal events in video. Experimental results on various sources of soccer video have verified that our approach extracts the new semantic notions successfully and facilitates video event detection and representation
14695418
Generic slow-motion replay detection in sports video
Slow-motion replays highlight important and exciting events in sports videos. Previous works for slow-motion replay detection, however, are usually limited to only some specific production rules such as frame repetition, special video effects and transitions. In this paper, we present a generic method for detecting slow-motion replays in sports video based on the difference of motions between slow-motion replays and normal shots within the same shot class. Experiments on different types of sports videos have verified our approach and achieve reasonable results.
8611890
Relevancy based semantic interoperation of reuse repositories
Software reuse is a promising solution to the software crisis. Reuse repositories are the basic infrastructure for software reuse. During the past decade, various academic, commercial, governmental, and industrial organizations have developed many Internet-enabled reuse repositories to provide access to software components and related resources. It has necessitated semantic interoperation to allow distributed maintenance and management of these repositories while enabling users to efficiently and conveniently access resources from multiple reuse repositories via a single representation view. In this paper, we have proposed an approach to enhancing the semantic interoperability of reuse repositories, called the improved relevancy matching and ranking (IRMR) method, based on analyzing the correlation of terms in representation methods of the repositories. A prototype system, the Virtual Repository supporting Semantic Interoperation (VRSI), is presented to illustrate the application of this approach to support the semantic interoperation of reuse repositories. Experimental results on real world reuse repositories demonstrated significant improvement in terms of searching effectiveness.
5365763
An extended approach to improving the semantic interoperation among reuse epositories
Software reuse is widely believed as a feasible way to improve both the productivity and quality of software development. The developers must be capable to acquire enough desired components before developing with reuse. Many Internet-enabled reuse repositories exist to provide access to reusable resources. It is necessary to eliminate the semantic gaps of the repositories to enable users to access resources from multiple repositories via a single representation view. In some sense, the only usable information to mine the semantics of the terms representing the resources is the mutual components stored in the repositories. In this paper, the extended improved relevancy matching and ranking (EIRMR) method is proposed to enhance the semantic interoperability of reuse repositories, based on our previous work (IRMR) and the mutual components in the third-party repositories. Experimental results on the data sets from the real repositories demonstrated an improvement in terms of searching effectiveness.
17864128
Traffic Localizing Strategy for Peer-to-Peer Systems
Topology mismatching problem between peer-to-peer overlay network and physical underlying network brings great stress to Internet infrastructure. This paper proposes a traffic localizing strategy (TLS), it keeps scalability property of current DHT algorithms and improves system routing performance by partitioning DHT key space associating with local physical information. Experiments based on CAN model show that the traffic localizing strategy can significantly alleviate the backbone link traffic burden. Meanwhile, the average routing hops are reduced.
39747426
Planning and Control of Biped Walking along Curved Paths on Unknown and Uneven Terrain
This paper investigates the planning and control of biped walking along curved paths on unknown and uneven terrain. For widespread use of biped robots, the capability of walking on unknown and uneven terrain is essential. The description of uneven terrain, as the basis of discussion, is presented in terms of the spatial relationship between the world frame and the robot local frames. Then the principle and implementation of walking pattern planning are given phase by phase. Feedback controllers, including the phase switching controller, the stabilizing controller and the foot landing controller, are also designed to guarantee stable and agile walking. The motion planning, path following, and controller design are discussed within the identical framework, such that various walking behaviors can be generated with few walking parameters modified. Some results of simulation and experiments performed on the LOCH robotic platform are given to show the effectiveness of the proposed approach.
15438049
DECF: A Coarse-Grained Data-Parallel Programming Framework for Seismic Processing
In this paper, we present a distributed execution control framework (DECF) for seismic processing. The DECF framework employs a coarse-grained data-parallel execution model within a cluster environment and achieves high throughput. The DECF schedules processing modules written as sequential programs to run simultaneously on multiple computers, or multiple CPU cores. The DECF hides the messy details of scheduling the use of computers and their CPUs, recovering from communication or computer failures, and transporting data between processing modules.We also introduce a parallel implementation of 3D pre-stack kirchhoff time migration algorithm using MPI and share the practical lessons learned from the process of designing, implementing, and maintaining it, which are of great help to the future work of the DECF.
16913320
Continuity Properties of Equilibria in Some Fisher and Arrow-Debreu Market Models
Following up on the work of Megiddo and Vazirani [10], who determined continuity properties of equilibrium prices and allocations for perhaps the simplest market model, Fisher's linear case, we do the same for: 
 
 
Fisher's model with piecewise-linear, concave utilities 
Fisher's model with spending constraint utilities 
Arrow-Debreu's model with linear utilities 
Eisenberg-Gale markets.
16543010
A novel multi-resolution video representation scheme based on kernel PCA
Content-based video analysis calls for efficient and flexible video representation. In this paper, a novel multi-resolution video representation (MRVR) scheme is proposed and realized by performing the kernel principal component analysis (KPCA) on the low-level visual features extracted from a video sequence. By simply changing the kernel parameters or the dimensionality of the subspace, this scheme can represent video content from coarser to finer levels in the subspace, according to its intrinsic structure. An application of keyframe extraction is investigated to show the advantages of this representation scheme. Furthermore, based on this scheme, a two-level video summarization approach is proposed to represent long video sequences. The experimental results of both short and long video sequences have demonstrated the effectiveness and flexibility of the proposed video representation scheme.
14347347
Multilevel video representation with application to keyframe extraction
Content-based video analysis calls for efficient video representation. In this paper, a novel multi-level representation of video is proposed based on the principle components derived from low-level visual features. It can characterize the video content from the coarse level to the fine level according to its intrinsic structure. This representation form provides a flexible scheme for video content analysis such as summarization, classification, and retrieval. A newly proposed subspace method, kernel based PCA, is explored to achieve this conveniently. The application in keyframe extraction is investigated to demonstrate the benefits of this representation.