Temporal/spatial simulation of the stratified far wake of a sphere

Far wakes are generally studied on the basis of a temporal development study, i.e. the flow is assumed periodic in streamwise direction and one focuses on its evolution in time. It is then required to set up an appropriate initial condition to start the calculation. Like in some previous works, we study the far wake of a sphere in a stratified fluid, but rather than starting from an ad hoc initial condition, we first carry out a spatial development simulation in order to define a relevant initialization. The control parameters of the flow are the Prandtl, Reynolds and internal Froude numbers, that we take equal to Pr = 7, Re = 10,000 and F = 25. The numerical method is based on a spectral multi-domain Fourier–Chebyshev approximation, stabilized by using a spectral vanishing viscosity technique, that may be interpreted as a spectral large-eddy simulation closure restricted to the high frequencies. Very realistic results are obtained, especially showing the so-called three-dimensional (3D), non-equilibrium (NEQ) and quasi two-dimensional (Q2D) regimes, with satisfactory comparisons with the experiments.     

Indexing through laplacian spectra

With ever growing databases containing multimedia data, indexing has become a necessity to avoid a linear search. We propose a novel technique for indexing multimedia databases in which entries can be represented as graph structures. In our method, the topological structure of a graph as well as that of its subgraphs are represented as vectors whose components correspond to the sorted laplacian eigenvalues of the graph or subgraphs. Given the laplacian spectrum of graph G, we draw from recently developed techniques in the field of spectral integral variation to generate the laplacian spectrum of graph G+e without computing its eigendecomposition, where G+e is a graph obtained by adding edge e to graph G. This process improves the performance of the system for generating the subgraph signatures for 1.8% and 6.5% in datasets of size 420 and 1400, respectively. By doing a nearest neighbor search around the query spectra, similar but not necessarily isomorphic graphs are retrieved. Given a query graph, a voting schema ranks database graphs into an indexing hypothesis to which a final matching process can be applied. The novelties of the proposed method come from the powerful representation of the graph topology and successfully adopting the concept of spectral integral variation in an indexing algorithm. To examine the fitness of the new indexing framework, we have performed a number of experiments using an extensive set of recognition trials in the domain of 2D and 3D object recognition. The experiments, including a comparison with a competing indexing method using two different graph-based object representations, demonstrate both the robustness and efficacy of the overall approach.     

基于Bhattacharyya距离的典型地物波谱特征差异性分析

地物波谱数据主要应用于定量遥感与影像分类等相关基础研究,对各条光谱曲线之间进行定量化的光谱差异性分析具有重要意义。从USGS及JHU地物波谱库中挑选了在土地覆盖分类层次具有意义的植被(73条)、人工材料(100条)与土壤(30条)3种类型共203条地物波谱数据,以分层分类体系在4.2~2.5 μm的波长范围内分析比较各类典型地物材料的光谱特征,以B距离(Bhattacharyya Distance)作为指标定量计算不同类别地物波谱间的光谱差异性。结果表明:波谱库中金属、砖石和混凝土3类人工材料光谱对于植被、土壤等自然材料光谱具有较大的光谱差异性,而塑料与自然地物间的光谱差异度最小,在此基础上统计了最能反映这些地物光谱特征差异的最优波段。该方法能够量化多种光谱曲线间的差异性并得到最佳的区分波段,从而为地物材料光谱及高光谱数据分类提供参考。     

Optimal shape and position of the actuators for the stabilization of a string

The energy in a string subject to constant viscous damping k on a subset ω of length l>0 decays exponentially in time; we consider the problem of optimizing the decay rate for the ω which are the unions of at most N intervals. This rate is given by the spectral abscissa of the linear operator associated to the wave equation. We are interested in small values of k; therefore, we consider the derivative of the spectral abscissa at k=0. We prove that, except for the case , when the number of intervals is not fixed a priori an optimal domain does not exist. We study numerically the case of one or two intervals using a genetic algorithm. These numerical results are not intuitive. In particular, the optimal position of one interval is never at the middle of the string.     

Asymptotic analysis of spectral methods

A detailed asymptotic analysis of spectral methods for prototype problems is presented. Asymptotic error behavior throughout the solution regime is given. A number of surprising results are presented, including theO(N) boundedness of the eigenvalues of collocation on Legendre points.     

那曲典型草地植被光谱特征分析

遥感是大尺度生态研究的重要工具之一,而地面植物群落特征与其光谱特征之间的关系是解译遥感影像的关键。地面实测数据由于其高空间分辨率和高光谱分辨率,能够准确反映地物光谱信息,可以用来指导卫星遥感解译工作,同时为遥感监测草地退化、草地模型建立等提供数据支持。选取西藏那曲地区的优势植被类型作为研究对象,利用ASD FieldSpec 3便携式光谱仪测定优势种的冠层光谱并进行比较,并取其中一种优势种测量其在不同覆盖度和不同生长期的光谱反射特点。研究结果表明:①不同植被群落冠层光谱具有特殊的光谱曲线,可见光波段光谱反射率依次是紫花针茅、小嵩草和藏北嵩草,近红外波段光谱反射率则依次是小嵩草、藏北嵩草和紫花针茅;红边位置可以识别藏北嵩草,但是不能区分小嵩草和紫花针茅;②不同覆盖度的小嵩草红边、“绿峰”位置不随覆盖度的变化而发生变化;连续统去除后得到吸收深度随覆盖度的增加而变大,吸收峰面积随覆盖度的增加而增加;③小嵩草衰退期内,在可见光波段和红边波段,冠层光谱反射率随着叶绿素含量的减少而下降,出现“红边蓝移,绿峰下降”的现象。     

Spectral clustering with fuzzy similarity measure

Spectral clustering algorithms have been successfully used in the field of pattern recognition and computer vision. The widely used similarity measure for spectral clustering is Gaussian kernel function which measures the similarity between data points. However, it is difficult for spectral clustering to choose the suitable scaling parameter in Gaussian kernel similarity measure. In this paper, utilizing the prototypes and partition matrix obtained by fuzzy c-means clustering algorithm, we develop a fuzzy similarity measure for spectral clustering (FSSC). Furthermore, we introduce the K-nearest neighbor sparse strategy into FSSC and apply the sparse FSSC to texture image segmentation. In our experiments, we firstly perform some experiments on artificial data to verify the efficiency of the proposed fuzzy similarity measure. Then we analyze the parameters sensitivity of our method. Finally, we take self-tuning spectral clustering and Nyström methods for baseline comparisons, and apply these three methods to the synthetic texture and remote sensing image segmentation. The experimental results show that the proposed method is significantly effective and stable.     

基于光谱角和光谱距离评价指标的遥感影像融合方法比较研究——以QuickBird数据为例

遥感数据融合是一种得到具有较高空间分辨率和光谱分辨率数据的有效方法,而如何保持地物光谱特性是遥感数据融合的关键问题。QuickBird卫星数据是高空间分辨率遥感数据的典型代表,探讨QuickBird数据的融合方法对于促进该数据的广泛应用具有重要意义,同时也能为其他高分辨率数据的处理提供借鉴。以QuickBird高分辨遥感数据为例,比较研究了目前针对高分辨率遥感数据常用的高通滤波、小波变换、Gram\|Schmidt和Pan\|sharpening 4种融合方法,以反映光谱曲线变化程度的光谱角和光谱距离为指标,评价了4种融合方法对多光谱影像地物光谱信息的保持能力。结果表明:小波变换在显著提高空间分辨率的同时最大程度地保持了原始多光谱影像的光谱信息,是4种方法中最适合QuickBird遥感数据的融合方法。