增强型IBFV 2维矢量场可视化算法

提出一种基于质点平流的增强型IBFV可视化算法,可显著增加IBFV算法生成图像的对比度。首先通过质点平流获得一系列的矢量纹理;然后将这些矢量纹理作为IBFV算法中的背景图像,代替原来的噪声纹理与帧缓存中的纹理进行图像混合生成新图。通过这种方式不仅可以准确反映流场的动态变化,而且增强了矢量线间的对比,同时还可以获得较高的绘制速度。     

Feature-based adaptive texture visualization for vector field

An adaptive sparse texture rendering method is proposed to solve for occlusion effects when visualizing 3D flows, building on an extensible fuzzy feature extraction approach. First, the flow feature is described by fuzzy theory and rules for some typical features are obtained. The significance value for each voxel is then calculated by a clustering method under the minimum square-sum rule. An adaptive Gaussian noise field is obtained from the significance field by a noise generation process, and is used as the input for the LIC convolution process. We also present two cool/warm-illumination-based approaches to overcome the shortcomings of texture-based visualization methods, which are usually unable to represent the flow direction. The experiments show that our method can effectively extract the typical flow feature region and can be extended to other flow features easily, and the adaptive technique used lessens the occlusion effects significantly. Furthermore, the main disadvantage of the texture-based method, that is, the direction representation problem, can also be solved by the proposed cool/warm illumination methods.     

A new kernel-based fuzzy clustering approach: support vector clustering with cell growing

In this paper, the support vector clustering is extended to an adaptive cell growing model which maps data points to a high dimensional feature space through a desired kernel function. This generalized model is called multiple spheres support vector clustering, which essentially identifies dense regions in the original space by finding their corresponding spheres with minimal radius in the feature space. A multisphere clustering algorithm based on adaptive cluster cell growing method is developed, whereby it is possible to obtain the grade of memberships, as well as cluster prototypes in partition. The effectiveness of the proposed algorithm is demonstrated for the problem of arbitrary cluster shapes and for prototype identification in an actual application to a handwritten digit data set.     

改进的用于三维矢量场可视化的VolumeLIC算法

用于三维矢量场可视化的VolumeLIC算法比较耗时,而且生成的图像无法洞察场的内部信息,场的方向性也不明显。针对以上缺点,对原始VolumeLIC算法做了改进,它不同于以往的算法要计算整个矢量场,而是选取场中的部分点作为种子点,从这些点出发积分生成流线,对这些线上的点用VolumeLIC算法生成最终图像。实验结果表明,改进后的算法大幅提高了运算速度,并且空间方向感明显增强。     

Three-Dimensional Vector Field Visualization Based on Tensor Decomposition

This paper presents a visualization method called the deformed cube for visualizing 3D velocity vector field.Based on the decomposition of the tensor which describes the changes of the velocity,it provides a technique for visualizing local flow.A deformed cube,a cube transformed by a tensor in a local coordinate frame,shows the local stretch,shear and rigid body rotation of the local flow corresponding to the decomposed component of the tensor.Users can interactively view the local deformation or any component of the changes.The animation of the deformed cube moving along a streamline achieves a more global impression of the flow field.This method is intended as a complement to global visualization methods.     

Interpretable clustering: an optimization approach

Machine Learning - State-of-the-art clustering algorithms provide little insight into the rationale for cluster membership, limiting their interpretability. In complex real-world applications, the...     

Comparing 2D vector field visualization methods: a user study

We present results from a user study that compared six visualization methods for two-dimensional vector data. Users performed three simple but representative tasks using visualizations from each method: 1) locating all critical points in an image, 2) identifying critical point types, and 3) advecting a particle. Visualization methods included two that used different spatial distributions of short arrow icons, two that used different distributions of integral curves, one that used wedges located to suggest flow lines, and line-integral convolution (LIC). Results show different strengths and weaknesses for each method. We found that users performed these tasks better with methods that: 1) showed the sign of vectors within the vector field, 2) visually represented integral curves, and 3) visually represented the locations of critical points. Expert user performance was not statistically different from nonexpert user performance. We used several methods to analyze the data including omnibus analysis of variance, pairwise t-tests, and graphical analysis using inferential confidence intervals. We concluded that using the inferential confidence intervals for displaying the overall pattern of results for each task measure and for performing subsequent pairwise comparisons of the condition means was the best method for analyzing the data in this study. These results provide quantitative support for some of the anecdotal evidence concerning visualization methods. The tasks and testing framework also provide a basis for comparing other visualization methods, for creating more effective methods and for defining additional tasks to further understand the tradeoffs among the methods. In the future, we also envision extending this work to more ambitious comparisons, such as evaluating two-dimensional vectors on two-dimensional surfaces embedded in three-dimensional space and defining analogous tasks for three-dimensional visualization methods.     

基于加权矢量场的轨迹层次聚类

传统的轨迹聚类方法存在定义轨迹相似度难度大,聚类过程中容易忽略轨迹细节等问题.基于矢量场的轨迹聚类(VFC)在保持轨迹原始运动特征的基础上,利用矢量场的几何结构可以很好地度量轨迹相似度.引入加权拟合方法,降低噪声对聚类的影响,以解决VFC鲁棒性较差问题.采用层次聚类动态地决定聚类类别数,以解决聚类类别数不能自适应的问题,提高聚类有效性.采用亚特兰大飓风数据作为实验原始轨迹数据,分别使用经典矢量场的轨迹聚类,k-means聚类,k-mediods聚类以及提出的方法进行实验,实验结果证明了加权拟合矢量场的层次聚类算法的有效性.     

Anisotropic diffusion in vector field visualization on Euclideandomains and surfaces

Vector field visualization is an important topic in scientific visualization. Its aim is to graphically represent field data on two and three-dimensional domains and on surfaces in an intuitively understandable way. Here, a new approach based on anisotropic nonlinear diffusion is introduced. It enables an easy perception of vector field data and serves as an appropriate scale space method for the visualization of complicated flow pattern. The approach is closely related to nonlinear diffusion methods in image analysis where images are smoothed while still retaining and enhancing edges. Here, an initial noisy image intensity is smoothed along integral lines, whereas the image is sharpened in the orthogonal direction. The method is based on a continuous model and requires the solution of a parabolic PDE problem. It is discretized only in the final implementational step. Therefore, many important qualitative aspects can already be discussed on a continuous level. Applications are shown for flow fields in 2D and 3D, as well as for principal directions of curvature on general triangulated surfaces. Furthermore, the provisions for flow segmentation are outlined     

Animation of orthogonal texture patterns for vector field visualization

This paper introduces orthogonal vector field visualization on 2D manifolds: a representation by lines that are perpendicular to the input vector field. Line patterns are generated by line integral convolution (LIC). This visualization is combined with animation based on motion along the vector field. This decoupling of the line direction from the direction of animation allows us to choose the spatial frequencies along the direction of motion independently from the length scales along the LIC line patterns. Vision research indicates that local motion detectors are tuned to certain spatial frequencies of textures, and the above decoupling enables us to generate spatial frequencies optimized for motion perception. Furthermore, we introduce a combined visualization that employs orthogonal LIC patterns together with conventional, tangential streamline LIC patterns in order to benefit from the advantages of these two visualization approaches. In addition, a filtering process is described to achieve a consistent and temporally coherent animation of orthogonal vector field visualization. Different filter kernels and filter methods are compared and discussed in terms of visualization quality and speed. We present respective visualization algorithms for 2D planar vector fields and tangential vector fields on curved surfaces, and demonstrate that those algorithms lend themselves to efficient and interactive GPU implementations.     

基于微分的增强型三维矢量场可视化

为提高3D矢量场可视化效果,提出了一种基于微分滤波的流线增强方法。首先对三维纹理进行线性卷积运算,生成具有空间相关性的卷积纹理;其次对卷积纹理进行分数阶微分滤波,增强流线之间强度对比;最后采用纹理映射体绘制技术实现三维矢量场可视化,并通过设计体绘制的传输函数来显示矢量场的内部结构。实验结果表明,该方法有效地增强了流线间的对比,使绘制的流线更加平滑,同时也有效地消除了卷积数据过多引起的紊乱与相互遮挡。     

A new approach for data clustering and visualization using self-organizing maps

A self-organizing map (SOM) is a nonlinear, unsupervised neural network model that could be used for applications of data clustering and visualization. One of the major shortcomings of the SOM algorithm is the difficulty for non-expert users to interpret the information involved in a trained SOM. In this paper, this problem is tackled by introducing an enhanced version of the proposed visualization method which consists of three major steps: (1) calculating single-linkage inter-neuron distance, (2) calculating the number of data points in each neuron, and (3) finding cluster boundary. The experimental results show that the proposed approach has the strong ability to demonstrate the data distribution, inter-neuron distances, and cluster boundary, effectively. The experimental results indicate that the effects of visualization of the proposed algorithm are better than that of other visualization methods. Furthermore, our proposed visualization scheme is not only intuitively easy understanding of the clustering results, but also having good visualization effects on unlabeled data sets.     

飞行器表面矢量场数据动态纹理可视化方法

面向飞行器表面流场数据可视化的应用需求,提出一种基于线性卷积（LIC）及纹理平流（IBFVS）相结合的动态纹理可视化方法。算法通过将IBFVS方法的背景随机噪声替换为LIC纹理方式,结合了LIC纹理结果对比度高及IBFVS方法生成速度快的优势;针对LIC绘制速度慢的不足,利用GPU对曲面矢量场投影并插值,生成规则矢量数据场;用GPU对LIC部分进行并行加速,有效提高了LIC纹理图像产生速度;将LIC结果图像加入到IBFVS进行平流,生成纹理图像,最后加入颜色映射,丰富流场信息。实验结果表明,该方法生成的飞行器表面动态纹理图像对比度高,清晰度强,实时绘制性能好。     

A phase field model for continuous clustering on vector fields

A new method for the simplification of flow fields is presented. It is based on continuous clustering. A well-known physical clustering model, the Cahn-Hilliard (1958) model, which describes phase separation, is modified to reflect the properties of the data to be visualized. Clusters are defined implicitly as connected components of the positivity set of a density function. An evolution equation for this function is obtained as a suitable gradient flow of an underlying anisotropic energy functional, where time serves as the scale parameter. The evolution is characterized by a successive coarsening of patterns, during which the underlying simulation data specifies preferable pattern boundaries. We introduce specific physical quantities in the simulation to control the shape, orientation and distribution of the clusters as a function of the underlying flow field. In addition, the model is expanded, involving elastic effects. In the early stages of the evolution, a shear-layer-type representation of the flow field can thereby be generated, whereas, for later stages, the distribution of clusters can be influenced. Furthermore, we incorporate upwind ideas to give the clusters an oriented drop-shaped appearance. We discuss the applicability of this new type of approach mainly for flow fields, where the cluster energy penalizes cross-streamline boundaries. However, the method also carries provisions for other fields as well. The clusters can be displayed directly as a flow texture. Alternatively, the clusters can be visualized by iconic representations, which are positioned by using a skeletonization algorithm     

Cinema image-based in situ analysis and visualization of MPAS-ocean simulations

Due to power and I/O constraints associated with extreme scale scientific simulations, in situ analysis and visualization will become a critical component to scientific exploration and discovery. Current analysis and visualization options at extreme scale are presented in opposition: write files to disk for interactive, exploratory analysis, or perform in situ analysis to save data products about phenomena that a scientists knows about in advance. In this paper, we demonstrate extreme scale visualization of MPAS-Ocean simulations leveraging a third option based on Cinema, which is a novel framework for highly interactive, image-based in situ analysis and visualization that promotes exploration.     

A vector field approach to cluster analysis

An efficient computer method which uses an extension of the familiar gravitational field to find clusters of multidimensional data is suggested. The manipulation of a single parameter, r, permits one's perspective of the data to range from the locally sensitive (where each datum is a cluster) to the globally sensitive (where the entire sample set is regarded as one cluster). The number of clusters and their locations are determined by a choice of r. The program finds clusters by converging on the nodes of the field in decreasing steps. Once located, the field is modified so that the known nodes are effectively precluded from further consideration.     

An integrated approach to fuzzy learning vector quantization andfuzzy c-means clustering

Derives an interpretation for a family of competitive learning algorithms and investigates their relationship to fuzzy c-means and fuzzy learning vector quantization. These algorithms map a set of feature vectors into a set of prototypes associated with a competitive network that performs unsupervised learning. Derivation of the new algorithms is accomplished by minimizing an average generalized distance between the feature vectors and prototypes using gradient descent. A close relationship between the resulting algorithms and fuzzy c-means is revealed by investigating the functionals involved. It is also shown that the fuzzy c-means and fuzzy learning vector quantization algorithms are related to the proposed algorithms if the learning rate at each iteration is selected to satisfy a certain condition     

Adaptive subspace learning: an iterative approach for document clustering

The performance of clustering in document space can be influenced by the high dimension of the vectors, because there exists a great deal of redundant information in the high-dimensional vectors, which may make the similarity between vectors inaccurate. Hence, it is very considerable to derive a low-dimensional subspace that contains less redundant information, so that document vectors can be grouped more reasonably. In general, learning a subspace and clustering vectors are treated as two independent steps; in this case, we cannot estimate whether the subspace is appropriate for the method of clustering or vice versa. To overcome this drawback, this paper combines subspace learning and clustering into an iterative procedure named adaptive subspace learning (ASL). Firstly, the intracluster similarity and the intercluster separability of vectors can be increased via the initial cluster indicators in the step of subspace learning, and then affinity propagation is adopted to partition the vectors into a specific number of clusters, so as to update the cluster indicators and repeat subspace learning. In ASL, the obtained subspace can become more suitable for the clustering with the iterative optimization. The proposed method is evaluated using NG20, Classic3 and K1b datasets, and the results are shown to be superior to the conventional methods of document clustering.