Multiview stereo via volumetric Graph-Cuts and occlusion robust photo-consistency.

This paper presents a volumetric formulation for the multi-view stereo problem which is amenable to a computationally tractable global optimisation using Graph-cuts. Our approach is to seek the optimal partitioning of 3D space into two regions labelled as "object" and "empty" under a cost functional consisting of the following two terms: (1) A term that forces the boundary between the two regions to pass through photo-consistent locations and (2) a ballooning term that inflates the "object" region. To take account of the effect of occlusion on the first term we use an occlusion robust photo-consistency metric based on Normalised Cross Correlation, which does not assume any geometric knowledge about the reconstructed object. The globally optimal 3D partitioning can be obtained as the minimum cut solution of a weighted graph.

Effects of observation time on interpretation of climatic time series - a need for consistency

Much of what we know about the climate of the United States is derived from data gathered under the auspices of the cooperative climate network. Particular aspects of the way observations are taken can have significant influences on the values of climate statistics derived from the data. These influences are briefly reviewed. The purpose of this paper is to examine their effects on climatic time series. Two other items discussed are: (1) a comparison of true (24-hour) means with means derived from maximums and minimums only, and (2) preliminary work on the times of day at which maximums and minimums are set.

Effects of exogenous hormone injections on milt consistency in newly caught, wild milkfish

A study was conducted to determine the effects of single injections of human chorionic gonadotropin (HCG) and Durandron Forte 250 on sperm motility, vitality and density and also on the consistency of milt in newly caught, wild, mature milkfish (Chanos chanos). In contrast to HCG, single injections of Durandron Forte 250 were effective not only in inducing spermiation but also in maintaining newly caught mature males in good running condition for a maximum of 7 days, despite daily handling and collection of approximately 3ml milt.

Image sequence segmentation using mixture-models with uniqueness and spatio-temporal consistency constraints

The use of mixture-model techniques for motion estimation and image sequence segmentation was discussed. The issues such as modeling of occlusion and uncovering, determining the relative depth of the objects in a scene, and estimating the number of objects in a scene were also investigated. The segmentation algorithm was found to be computationally demanding, but the computational requirements were reduced as the motion parameters and segmentation of the frame were initialized. The method provided a stable description, in whichthe addition and removal of objects from the description corresponded to the entry and exit of objects from the scene.

DBHF approach and thermodynamic consistency for nuclear matter calculations

Within the framework of Dirac Brueckner-Hartree-Fock (DBHF) approach, we calculate the energy per nucleon, the pressure, the nucleon self-energy, and the single-nucleon energy in the nuclear matter by adopting two different covariant representations for T-matrix. We mainly investigate the influence of different covariant representations on the satisfiable extent of the Hugenholtz-Van Hove (HVH) theorem in the nuclear medium in the framework of DBHF. By adopting the two different covariant representations of T-matrix, the predicted nucleon self-energy shows a quite different momentum and density dependence. Different covariant representations affect remarkably the satisfiable extent of the HVH theorem. By adopting the complete pseudo-vector representation of the T-matrix, HVH theorem is largely violated, which is in agreement with the result in the non-relativistic Brueckner-Hartree-Fock approach and reflects the importance of ground state correlations for single nucleon properties in nuclear medium, whereas by using the pseudoscalar representation, the ground state correlation cannot be shown. It indicates that the complete pseudo-vector presentation is more feasible than the pseudo-scalar one.

Importance of self-consistency in relativistic continuum random-phase approximation calculations

A fully consistent relativistic continuum random phase approximation (RCRPA) is constructed, where the contribution of the continuum spectrum to nuclear excitations is treated exactly by the single-particle Green's function technique. The full consistency of the calculations is achieved that the same effective Lagrangian is adopted for the ground state and the excited states. The negative energy states in the Dirac sea are also included in the single-particle Green's function in the no-sea approximation. The currents from the vector meson and photon exchanges and the Coulomb interaction in RCRPA are treated exactly. The spin-orbit interaction is included naturally in the relativistic frame. Numerical results of the RCRPA are checked with the constrained relativistic mean-field theory. We study the effects of the inconsistency, particularly the currents and Coulomb interaction in various collective multipole excitations.

模型检测MESIF Cache一致性协议

在处理器从单核向多核演进的过程中,为了获得更好的性能和可扩展性,适用于多核处理器系统的Cache一致性协议变得越来越复杂。Cache一致性协议的验证一直是模型检测在工业界主要应用之一,被工业界和学术界关注。相对传统方法而言,微结构级的模型检测能够描述和验证更多的协议细节。利用NuSMV工具对Intel公司的MESIF Cache一致性协议进行模型检测在微结构层次上进行了建模,并对该协议进行模型检测,试验结果证明了此方法的有效性。

BUILD: A Tool for Maintaining Consistency in Modular Systems

Build is a tool for keeping modular systems in a consistent state by managing the construction tasks (e.g. compilation, linking, etc.) associated with such systems. It employs a user supplied system model and a procedural description of a task to be performed in order to perform the task. This differs from existing tools which do not explicitly separate knowledge about systems from knowledge about how systems are manipulated. BUILD provides a static framework for modeling systems and handling construction requests that makes use of programming environment specific definitions. By altering the set of definitions, BUILD can be extended to work with new programming environments to perform new tasks.

Stochastic Refinement of the Visual Hull to Satisfy Photometric and Silhouette Consistency Constraints

An iterative method for reconstructing a 3D polygonal mesh and color texture map from multiple views of an object is presented. In each iteration, the method first estimates a texture map given the current shape estimate. The texture map and its associated residual error image are obtained via maximum a posteriori estimation and reprojection of the multiple views into texture space. Next, the surface shape is adjusted to minimize residual error in texture space. The surface is deformed towards a photometrically-consistent solution via a series of 1D epipolar searches at randomly selected surface points. The texture space formulation has improved computational complexity over standard image-based error approaches, and allows computation of the reprojection error and uncertainty for any point on the surface. Moreover, shape adjustments can be constrained such that the recovered model's silhouette matches those of the input images. Experiments with real world imagery demonstrate the validity of the approach.

Contour Generator Points for Threshold Selection and a Novel Photo-Consistency Measure for Space Carving

Space carving has emerged as a powerful method for multiview scene reconstruction. Although a wide variety of methods have been proposed, the quality of the reconstruction remains highly-dependent on the photometric consistency measure, and the threshold used to carve away voxels. In this paper, we present a novel photo-consistency measure that is motivated by a multiset variant of the chamfer distance. The new measure is robust to high amounts of within-view color variance and also takes into account the projection angles of back-projected pixels. Another critical issue in space carving is the selection of the photo-consistency threshold used to determine what surface voxels are kept or carved away. In this paper, a reliable threshold selection technique is proposed that examines the photo-consistency values at contour generator points. Contour generators are points that lie on both the surface of the object and the visual hull. To determine the threshold, a percentile ranking of the photo-consistency values of these generator points is used. This improved technique is applicable to a wide variety of photo-consistency measures, including the new measure presented in this paper. Also presented in this paper is a method to choose between photo-consistency measures, and voxel array resolutions prior to carving using receiver operating characteristic (ROC) curves.

On the Fractal Nature of WWW and Its Application to Cache Modeling

The World Wide Web (WWW or Web) is growing rapidly on the Internet. Web users want fast response time and easy access to a enormous variety of information across the world. Thus, performance is becoming a main issue in the Web. Fractals have been used to study fluctuating phenomena in many different disciplines, from the distribution of galaxies in astronomy to complex physiological control systems. The Web is also a complex, irregular, and random system. In this paper, we look at the document reference pattern at Internet Web servers and use fractal-based models to understand aspects (e.g. caching schemes) that affect the Web performance.

Cache-and-Relay Streaming Media Delivery for Asynchronous Clients

We consider the problem of delivering popular streaming media to a large number of asynchronous clients. We propose and evaluate a cache-and-relay end-system multicast approach, whereby a client joining a multicast session caches the stream, and if needed, relays that stream to neighboring clients which may join the multicast session at some later time. This cache-and-relay approach is fully distributed, scalable, and efficient in terms of network link cost. In this paper we analytically derive bounds on the network link cost of our cache-and-relay approach, and we evaluate its performance under assumptions of limited client bandwidth and limited client cache capacity. When client bandwidth is limited, we show that although finding an optimal solution is NP-hard, a simple greedy algorithm performs surprisingly well in that it incurs network link costs that are very close to a theoretical lower bound. When client cache capacity is limited, we show that our cache-and-relay approach can still significantly reduce network link cost. We have evaluated our cache-and-relay approach using simulations over large, synthetic random networks, power-law degree networks, and small-world networks, as well as over large real router-level Internet maps.