Dense clinical data like 3D Computed Tomography (CT) scans can be visualized together with real-time imaging for a number of medical intervention applications. However, it is difficult to provide a fused visualization...
详细信息
Background modeling techniques are important for object detection and tracking in video surveillance. Traditional background subtraction approaches are suffered from problems, such as persistent dynamic backgrounds, q...
详细信息
Background modeling techniques are important for object detection and tracking in video surveillance. Traditional background subtraction approaches are suffered from problems, such as persistent dynamic backgrounds, quick illumination changes, occlusions, noise etc. In this paper, we address the problem of detection and localization of moving objects in a video stream without apperception of background statistics. Three major contributions are presented. First, introducing the Monte Carlo importance sampling techniques greatly reduce the computation complexity while compromise the expected accuracy. Second, the robust salient motion is considered when resampling the feature points by removing those who do not move in a relative constant velocity. Finally, the proposed spatial kinetic mixture of Gaussian model (SKMGM) enforced spatial consistency. Promising results demonstrate the potentials of the proposed framework.
作者:
Kerdels, JochenPeters, GabrieleDFKI
German Research Center for Artificial Intelligence Robotics Lab. Robert Hooke Str. 5 D-28359 Bremen Germany University of Dortmund
Department of Computer Science Computer Graphics Otto-Hahn-Str. 16 D-44221 Dortmund Germany
In the field of computer vision feature matching in high dimensional feature spaces is a commonly used technique for object recognition. One major problem is to find an adequate similarity measure for the particular f...
详细信息
Document clustering without any prior knowledge or background information is a challenging problem. In this paper, we propose SS-NMF: a semi-supervised non- negative matrix factorization framework for document cluster...
详细信息
Document clustering without any prior knowledge or background information is a challenging problem. In this paper, we propose SS-NMF: a semi-supervised non- negative matrix factorization framework for document clustering. In SS-NMF, users are able to provide supervision for document clustering in terms of pairwise constraints on a few documents specifying whether they "must" or "cannot" be clustered together. Through an iterative algorithm, we perform symmetric tri-factorization of the document- document similarity matrix to infer the document clusters. Theoretically, we show that SS-NMF provides a general framework for semi-supervised clustering and that existing approaches can be considered as special cases of SS-NMF. Through extensive experiments conducted on publicly available data sets, we demonstrate the superior performance of SS-NMF for clustering documents.
We describe a method for computing an implicit function that represents a surface by its zero level set,given a set of points scattered over the surface and associated with surface normal *** implicit function is defi...
详细信息
We describe a method for computing an implicit function that represents a surface by its zero level set,given a set of points scattered over the surface and associated with surface normal *** implicit function is defined as a linear combination of compactly supported radial basis *** method is suitable for testing whether a given point is interior or exterior to the surface,previously only associated with globally supported or globally regularized radial basis *** use a two-level interpolation *** the coarse scale interpolation,we set basis function centers by a grid that covers the enlarged bounding box of the given point set and compute their signed distances to the underlying surface using local quadratic approximations of the nearest surface *** a fitting to the residual errors on the surface points and additional off-surface points is performed with fine scale basis *** final function is the sum of the two intermediate functions and is a good approximation of the signed distance field to the surface in the bounding *** of surface reconstruction and set operations between shapes are provided.
Based on Catmull-Clark Subdivision scheme, a valid algorithm of offset approximation for Subdivision Surface is proposed. It can overcome the defect that previous approaches treat offset surface only as parametric sur...
详细信息
We describe a method for computing an implicit function that represents a surface by its zero level set, given a set of points scattered over the surface and associated with surface normal vectors. This implicit funct...
详细信息
We describe a method for computing an implicit function that represents a surface by its zero level set, given a set of points scattered over the surface and associated with surface normal vectors. This implicit function is defined as a linear combination of compactly supported radial basis functions. Our method is suitable for testing whether a given point is interior or exterior to the surface, previously only associated with globally supported or globally regularized radial basis functions. We use a two-level interpolation approach. In the coarse scale interpolation, we set basis function centers by a grid that covers the enlarged bounding box of the given point set and compute their signed distances to the underlying surface using local quadratic approximations of the nearest surface points. Then a fitting to the residual errors on the surface points and additional off-surface points is performed with fine scale basis functions. The final function is the sum of the two intermediate functions and is a good approximation of the signed distance field to the surface in the bounding box. Examples of surface reconstruction and set operations between shapes are provided.
Interactive environments such as Matlab and Star-P have made numerical computing tremendously accessible to engineers and scientists. They allow people who are not well-versed in the art of numerical computing to none...
详细信息
Interactive environments such as Matlab and Star-P have made numerical computing tremendously accessible to engineers and scientists. They allow people who are not well-versed in the art of numerical computing to nonetheless reap the benefits of numerical computing. The same is not true in general for combinatorial computing. Often, many interesting problems require a mix of numerical and combinatorial computing. Tools developed for numerical computing - such as sparse matrix algorithms - can also be used to develop a comprehensive infrastructure for graph algorithms. We describe the current status of our effort to build a comprehensive infrastructure for operations on large graphs in an interactive parallel environment such as Star-P.
Using the concept of duality between points and planes in 3D projective space, an explicit and efficient method of computer-aided design for developable surfaces based on Bezier and B-spline basis functions is propose...
详细信息
暂无评论