5884426
Validation of an optical flow method for tag displacement estimation
Presents a validation study of an optical-flow method for the rapid estimation of myocardial displacement in magnetic resonance tagged cardiac images. This registration and change visualization (RCV) software uses a hierarchical estimation technique to compute the flow field that describes the warping of an image of one cardiac phase into alignment with the next. This method overcomes the requirement of constant pixel intensity in standard optical-flow methods by preprocessing the input images to reduce any intensity bias which results from the reduction in stripe contrast throughout the cardiac cycle. To validate the method, SPAMM-tagged images were acquired of a silicon gel phantom with simulated rotational motion. The pixel displacement was estimated with the RCV method and the error in pixel tracking was <4% 1000 ms after application of the tags, and after 30/spl deg/ of rotation. An additional study was performed using a SPAMM-tagged multiphase slice of a canine left ventricle. The true displacement was determined using a previously validated active contour model (snakes). The error between methods was 6.7% at end systole. The RCV method has the advantage of tracking all pixels in the image in a substantially shorter period than the snakes method.
13502244
Object Tracking with Bayesian Estimation of Dynamic Layer Representations
Decomposing video frames into coherent 2D motion layers is a powerful method for representing videos. Such a representation provides an intermediate description that enables applications such as object tracking, video summarization and visualization, video insertion, and sprite-based video compression. Previous work on motion layer analysis has largely concentrated on two-frame or multi-frame batch formulations. The temporal coherency of motion layers and the domain constraints on shapes have not been exploited. This paper introduces a complete dynamic motion layer representation in which spatial and temporal constraints on shape, motion and layer appearance are modeled and estimated in a maximum a-posteriori (MAP) framework using the generalized expectation-maximization (EM) algorithm. In order to limit the computational complexity of tracking arbitrarily shaped layer ownership, we propose a shape prior that parameterizes the representation of shape and prevents motion layers from evolving into arbitrary shapes. In this work, a Gaussian shape prior is chosen to specifically develop a near-real-time tracker for vehicle tracking in aerial videos. However, the general idea of using a parametric shape representation as part of the state of a tracker is a powerful one that can be extended to other domains as well. Based on the dynamic layer representation, an iterative algorithm is developed for continuous object tracking over time. The proposed method has been successfully applied in an airborne vehicle tracking system. Its performance is compared with that of a correlation-based tracker and a motion change-based tracker to demonstrate the advantages of the new method. Examples of tracking when the backgrounds are cluttered and the vehicles undergo various rigid motions and complex interactions such as passing, turning, and stop-and-go demonstrate the strength of the complete dynamic layer representation.
36631591
Video as an image data source: efficient representations and applications
The two fundamental advantages of video over still imagery are: (i) the ability capture temporal information, and (ii) the ability to acquire a continuously varying set of views of a scene. These advantages are obtained, however, at the cost of vastly increased amount of data. This paper describes an approach to video representation that is based on frame-to-frame alignment, mosaic construction, and 3D parallax recovery. The basic motivation behind our approach is to enable rapid access to the contents, while maintaining the data in a form as close to the source as possible. This representation supports a wide variety of applications that involve transmission, storage, visualization, retrieval, analysis, and manipulation of video sequences.
62589113
Linear model hashing and batch RANSAC for rapid and accurate object recognition
This paper proposes a joint feature-based model indexing and geometric constraint based alignment pipeline for efficient and accurate recognition of 3D objects from a large model database. Traditional approaches either first prune the model database using indexing without geometric alignment or directly perform recognition based alignment. The indexing based pruning methods without geometric constraints can miss the correct models under imperfections such as noise, clutter and obscurations. Alignment based verification methods have to linearly verify each model in the database and hence do not scale up. The proposed techniques use spin images as semi-local shape descriptors and locality-sensitive hashing (LSH) to index into a joint spin image database for all the models. The indexed models represented in the pruned set are further pruned using progressively complex geometric constraints. A simple geometric configuration of multiple spin images, for instance a doublet, is first used to check for geometric consistency. Subsequently, full Euclidean geometric constraints are applied using RANSAC-based techniques on the pruned spin images and the models to verify specific object identity. As a result, the combined indexing and geometric alignment based pipeline is able to focus on matching the most promising models, and generate far less pose hypotheses while maintaining the same level of performance as the sequential alignment based recognition. Furthermore, compared to geometric indexing techniques like geometric hashing, the construction time and storage complexity for the proposed technique remains linear in the number of features rather than higher order polynomial. Experiments on a 56 3D model database show promising results.
8944659
Real-time global localization with a pre-built visual landmark database
In this paper, we study how to build a vision-based system for global localization with accuracies within 10 cm. for robots and humans operating both indoors and outdoors over wide areas covering many square kilometers. In particular, we study the parameters of building a landmark database rapidly and utilizing that database online for real-time accurate global localization. Although the accuracy of traditional short-term motion based visual odometry systems has improved significantly in recent years, these systems alone cannot solve the drift problem over large areas. Landmark based localization combined with visual odometry is a viable solution to the large scale localization problem. However, a systematic study of the specification and use of such a landmark database has not been undertaken. We propose techniques to build and optimize a landmark database systematically and efficiently using visual odometry. First, topology inference is utilized to find overlapping images in the database. Second, bundle adjustment is used to refine the accuracy of each 3D landmark. Finally, the database is optimized to balance the size of the database with achievable accuracy. Once the landmark database is obtained, a new real-time global localization methodology that works both indoors and outdoors is proposed. We present results of our study on both synthetic and real datasets that help us determine critical design parameters for the landmark database and the achievable accuracies of our proposed system.
135903312
Determination of the hardness and elastic modulus of low- k thin films and their barrier layer for microelectronic applications
This paper presents the experimental results and analysis of the elastic modulus and hardness for several thicknesses of dielectric films, namely low-k films and their barrier layer, using the nano-indentation technique. The elastic modulus and hardness of the films were determined by "normal" nano-indentation analysis. The data were then analyzed by rearranging the load-displacement data (P-h) obtained by nano-indentation in such a way that the applied load divided by the corresponding displacement (P/h) versus the displacement (h) was obtained, which effectively differentiates the film-only mechanical properties from those of the substrate. The low-k film, carbon-doped silicon oxide (SiOC), was prepared using a parallel plate PECVD system. The dielectric constant of the low-k film was measured to be 3.09, which is much lower than that of commonly used dielectric materials such as SiO2 (k ∼ 3.9). The hardness and elastic modulus of the film were measured to be approximately 2.23 and 13.98 GPa, respectively. To enhance the mechanical properties of the low-k thin film, a low-k barrier layer (SiCN:H) with better mechanical properties was deposited between the low-k film and the substrate or on top of the low-k film. It was found that the barrier layer improved the mechanical properties of the low-k film and the barrier layer stacked in certain circumstances. The effects of the arrangement of the barrier layer and the low-k film on the mechanical behavior of the bi-layer system were studied in detail.
2171095
Heterogeneous chip multiprocessors
Heterogeneous (or asymmetric) chip multiprocessors present unique opportunities for improving system throughput, reducing processor power, and mitigating Amdahl's law. On-chip heterogeneity allow the processor to better match execution resources to each application's needs and to address a much wider spectrum of system loads - from low to high thread parallelism - with high efficiency.
10455339
Pollution in P2P file sharing systems
One way to combat P2P file sharing of copyrighted content is to deposit into the file sharing systems large volumes of polluted files. Without taking sides in the file sharing debate, in this paper we undertake a measurement study of the nature and magnitude of pollution in the FastTrack P2P network, currently the most popular P2P file sharing system. We develop a crawling platform which crawls the majority of the FastTrack Network's 20,000+ supernodes in less than 60 minutes. From the raw data gathered by the crawler for popular audio content, we obtain statistics on the number of unique versions and copies available in a 24-hour period. We develop an automated procedure to detect whether a given version is polluted or not, and we show that the probabilities of false positives and negatives of the detection procedure are very small. We use the data from the crawler and our pollution detection algorithm to determine the fraction of versions and fraction of copies that are polluted for several recent and old songs. We observe that pollution is pervasive for recent popular songs. We also identify and describe a number of anti-pollution mechanisms.
9616848
Core architecture optimization for heterogeneous chip multiprocessors
Previous studies have demonstrated the advantages of single-ISA heterogeneous multi-core architectures for power and performance. However, none of those studies examined how to design such a processor; instead, they started with an assumed combination of pre-existing cores. This work assumes the flexibility to design a multi-core architecture from the ground up and seeks to address the following question: what should be the characteristics of the cores for a heterogeneous multi-processor for the highest area or power efficiency? The study is done for varying degrees of thread-level parallelism and for different area and power budgets. The most efficient chip multiprocessors are shown to be heterogeneous, with each core customized to a different subset of application characteristics — no single core is necessarily well suited to all applications. The performance ordering of cores on such processors is different for different applications; there is only a partial ordering among cores in terms of resources and complexity. This methodology produces performance gains as high as 40%. The performance improvements come with the added cost of customization.
5063744
Translator Design to Model Cpp Files
The most reliable and accurate description of the actual behavior of a software system is its source code. However, not all questions about the system can be answered directly by resorting to this repository of information. What the reverse engineering methodology aims at is the extraction of abstract, goal-oriented "views" of the system, able to summarize relevant properties of the computation performed by the program. While concentrating on reverse engineering we had modeled the C++ files by designing the translator. E all want to build software that makes things better, avoiding the bad things that lurk in the shadow of failed efforts. To succeed we need discipline when software is designed and built. We need an engineered approach. The usefulness of an abstract system model was already recognized in the 1970s, when structured methods were proposed as software development methods. These methods offered Entity-Relationship diagrams (1) to model the data aspect of a system, and data flow diagrams or functional decomposition techniques to model the functional, behavioral aspect of a system. The main drawbacks of these structured approaches were the often missing horizontal consistency between the data and behavior part within the overall system model, and the vertical mismatch of concepts between the real world domain and the model as well as between the model and the implementation. As a solution to these drawbacks, the concept of an abstract data type, where data and behavior of objects are closely coupled, became popular within the 1980s. This concept then formed the base for the object-oriented paradigm. In particular, object-oriented languages like C++ or Java have become the de facto standard for programming (10). The same holds for the analysis and design phases within a software development process, where object-oriented modeling approaches are becoming more and more the standard ones. The success of object-oriented modeling approaches was hindered in the beginning of the 90s due to the fact that surely more than fifty object-oriented modeling approaches claimed to be the right one. This so-called method war came to an end by an industrial initiative, which pushed the development of the meanwhile standardized object-oriented modeling language UML (Unified Modeling Language) (8). But, despite the fact that it has been standardized, UML is still a moving target.