A method for recovery of a 3d model of a planet-sized cloud-like structure that is in motion anddeforming but approximately governed by magnetic field properties is described. The method allows recovery of the model ...
详细信息
ISBN:
(纸本)9780769528250
A method for recovery of a 3d model of a planet-sized cloud-like structure that is in motion anddeforming but approximately governed by magnetic field properties is described. The method allows recovery of the model from a single intensity image in which the structure's silhouette can be observed. The method exploits envelope theory and a magnetic field model. Given one intensity image and the segmented silhouette in the image, the method proceeds without human intervention to produce the 3d model. In addition to allowing 3d model synthesis, the method's capability to yield a very compact description offers further utility. Application of the method to real-worlddata is also demonstrated.
detection of articulated objects such as humans is an important task in computer vision. We present a system that incorporates a variety of constraints in a unified multiview framework to automatically detect humans i...
详细信息
ISBN:
(纸本)9780769528250
detection of articulated objects such as humans is an important task in computer vision. We present a system that incorporates a variety of constraints in a unified multiview framework to automatically detect humans in possibly crowded scenes. These constraints include the kinematic constraints, the occlusion of one part by another and the high correlation between the appearance of parts such as the two arms. The graphical structure (non-tree) obtained is optimized in a nonparametric belief propagation framework using prior based search.
2d or 3d shapes are the most important visual information that we use to recognize an object. We propose a unified framework "ShapeLab" to search similar 2d or 3d shapes from an existing database. Users can ...
详细信息
ISBN:
(纸本)9780769528250
2d or 3d shapes are the most important visual information that we use to recognize an object. We propose a unified framework "ShapeLab" to search similar 2d or 3d shapes from an existing database. Users can search 3d shapes with a 2d input, and vice versa. ShapeLab is composed of four key components: (1) pose determination for 3d models;(2) 2d orthogonal view generation based on multiple levels of detail;(3) similarity measurement between 2d shapes;and (4) freehand sketch-based user interface. Key algorithms supporting the above components are briefly described. Experiments show ShapeLab can provide a better performance such as high accuracy, flexibility and scalability compared to the available methods.
In this paper, we propose a method for 3d-model retrieval from one or more photos. This method provides an "optimal" selection of 2d views to represent a 3d-model, and a probabilistic Bayesian method for 3d-...
详细信息
ISBN:
(纸本)9780769528250
In this paper, we propose a method for 3d-model retrieval from one or more photos. This method provides an "optimal" selection of 2d views to represent a 3d-model, and a probabilistic Bayesian method for 3d-model retrieval from realistic photos and sketches using these views. The characteristic view selection algorithm is based on an adaptive clustering algorithm and uses statistical model distribution scores to select the optimal number of views. We also introduce a Bayesian approach to score the probability of correspondence between the queries and the 3d-models. We present our results on the Princeton 3d Shape Benchmark database (1814 3d-models) and 50 photos (real photographs, sketches, synthesised images). A practical on-line 3d-model retrieval system based on our approach is available on the web to asset our results [1].
We propose a mathematical approach for quantifying shape complexity of 3d surfaces based on perceptual principles of visual saliency. Our curvature variation measure (CVM), as a 3d feature, combines surface curvature ...
详细信息
ISBN:
(纸本)9780769528250
We propose a mathematical approach for quantifying shape complexity of 3d surfaces based on perceptual principles of visual saliency. Our curvature variation measure (CVM), as a 3d feature, combines surface curvature and information theory by leveraging bandwidth-optimized kernel density estimators. Using a part decomposition algorithm for digitized3d objects, represented as triangle meshes, we apply our shape measure to transform the low level mesh representation into a perceptually informative form. Further, we analyze the effects of noise, sensitivity to digitization, occlusions, anddescriptiveness to demonstrate our shape measure on laser-scanned real world3d objects.
3dtransmission over unreliable networks needs to take into account the possibility of packet loss. In this work we describe a perceptually motivated strategy for joint transmission of texture and mesh over unreliable...
详细信息
ISBN:
(纸本)9780769528250
3dtransmission over unreliable networks needs to take into account the possibility of packet loss. In this work we describe a perceptually motivated strategy for joint transmission of texture and mesh over unreliable networks. The approach is described initially considering regular mesh structure, to show the utility of optimizing the texture-mesh tradeoff. In order to generalize our approach to arbitrary meshes we consider stripification of the mesh, combined with a strategy that does not need texture or vertex packets to be re-transmitted. Only the valence (connectivity) packets need to be re-transimitted;however, storage of valence information requires only 10% space compared to vertices and even less compared to photo-realistic texture. Thus, only less than 5% of the packets may need to be re-transmitted in the worst case to allow our algorithm to successfully reconstruct an acceptable object under severe packet loss. Results showing the implementation of the proposed approach are described.
Medial surfaces are popular representations of 3d objects in vision, graphics and geometric modeling. They capture relevant symmetries and part hierarchies and also allow for detaileddifferential geometric informatio...
详细信息
ISBN:
(纸本)9780769528250
Medial surfaces are popular representations of 3d objects in vision, graphics and geometric modeling. They capture relevant symmetries and part hierarchies and also allow for detaileddifferential geometric information to be recovered. However, exact algorithms for their computation from meshes must solve high-order polynomial equations, while approximation algorithms rarely guarantee soundness and completeness. In this article we develop a technique for computing the medial surface of an object with a polyhedral boundary, which is based on an analysis of the average outward flux of the gradient of its Euclidean distance function. This analysis leads to a coarse-to-fine algorithm implemented on a cubic lattice that reveals at each iteration the salient manifolds of the medial surface. We provide comparative results against a state-of-the-art method in the literature.
Object modeling under consideration of geometric constraints is an important task. In this paper we describe a novel approach to achieving this goal. It has the nice property that all geometric constraints can be abso...
详细信息
ISBN:
(纸本)9780769528250
Object modeling under consideration of geometric constraints is an important task. In this paper we describe a novel approach to achieving this goal. It has the nice property that all geometric constraints can be absolutely satisfied. To our knowledge it seems to be the first one with guaranteed constraint fulfillment. It is realized by integrating these constraints as hard conditions into the fitting process, in contrast to their use as soft optimization criteria in earlier work. We describe the principle behind our approach and give examples to show how it can be applied to practice. Experimental results will be reported on objects with numerous complex constraints. The technique proposed in this paper is expected to have a great impact in reverse engineering applications and manufactured object modeling where the majority of parts are designed with intended feature relationships.
As more and more human motion data are widely used to animate computer graphics figures in many applications, there is an imperative need to compress motion data for compact storage and fast transmission. We propose a...
详细信息
ISBN:
(纸本)9780769528250
As more and more human motion data are widely used to animate computer graphics figures in many applications, there is an imperative need to compress motion data for compact storage and fast transmission. We propose a data-driven method for efficient compression of human motion sequences by exploiting both spatial and temporal coherences of the data. We first segment a motion sequence into subsequences such that the poses within a subsequence lie near a low dimensional linear space. We then compress each segment using the principal component analysis. Further compression is achieved by storing only the key frames' projections to the principal component space and interpolating the other frames in-between the keyframes via spline functions. The experimental results show that our method can achieve significant compression rate with low reconstruction errors.
Multi-view stereo algorithms typically rely on same-exposure images as inputs due to the brightness constancy assumption. While state-of-the-art depth results are excellent, they do not produce high-dynamic range text...
详细信息
ISBN:
(纸本)9780769528250
Multi-view stereo algorithms typically rely on same-exposure images as inputs due to the brightness constancy assumption. While state-of-the-art depth results are excellent, they do not produce high-dynamic range textures required for high-quality view reconstruction. In this paper we propose a technique that adapts multi-view stereo for different exposure inputs to simultaneously recover reliable dense depth and high dynamic range textures. In. our technique, we use an exposure-invariant similarity statistic to establish correspondences, through which we robustly extract the camera radiometric response function and the image exposures. This enables us to then convert all images to radiance space and selectively use the radiance data for dense depth and high dynamic range texture recovery. We show results for synthetic and real scenes.
暂无评论