Source-Space Compressive Matched Field Processing for Source Localization

Source localization by matched-field processing(MFP) can be accelerated by building a database of Green's functions which however requires a bulk-storage memory.According to the sparsity of the source locations in the search grids of MFP,compressed sensing inspires an approach to reduce the database by introducing a sensing matrix to compress the database.Compressed sensing is further used to estimate the source locations with higher resolution by solving the l_1-norm optimization problem of the compressed Green's function and the data received by a vertical/horizontal line array.The method is validated by simulation and is verified with the experimental data.     

A high order multivariate approximation scheme for scattered data sets

We present a high order multivariate approximation scheme for scattered data sets. Each data point is represented as a Taylor series, and the high order derivatives in the Taylor series are treated as random variables. The approximation coefficients are then chosen to minimize an objective function at each point by solving an equality constrained least squares. The approximation is an interpolation when the data points are given as exact, or a nonlinear regression function when nonzero measurement errors are associated with the data points. Using this formulation, the gradient information on each data point can be used to significantly reduce the approximation error. All parameters of the approximation scheme can be computed automatically from the data points. An uncertainty bound of the approximation function is also produced by the scheme. Numerical experiments demonstrate that although this method is more computationally intensive than traditional methods, it produces more accurate approximation functions.     

匹配场处理舰船辐射噪声级估计方法

针对水声信道对舰船辐射噪声声传播的影响,进而导致声源级测量结果不准确的问题,提出了基于匹配场处理的舰船辐射噪声级估计方法。在海洋环境噪声为空间均匀高斯白噪声的假设下,当海洋环境参数已知、信噪比满足一定要求时,匹配场处理能有效地给出被测噪声源的位置信息及该位置处的能量响应。从能量估计角度出发,推导了声源位置处匹配场输出响应的能量修正因子计算公式,从理论上证明了匹配场处理在被测声源位置处输出响应与能量修正因子的乘积为真实声源级的最小方差无偏(MVU)估计。该方法首先选择合适的声场计算模型计算拷贝场向量,对接收到的辐射噪声信号进行匹配场处理,得出接收信号级和被测声源位置;其次利用该位置所对应的拷贝场向量替换能量修正因子公式中的真实信道传输函数以计算能量修正因子的估计值;最后由接收信号级与能量修正因子估计值相乘得出舰船辐射噪声声源级的MVU估计。针对典型的浅海水声信道,进行了计算机仿真试验,结果表明:该方法能有效地进行舰船辐射噪声测量,当信噪比满足一定要求时,测量得到的声源级与实际声源级相比,误差小于1 dB。      

Compressed ghost imaging based on differential speckle patterns

We propose a compressed ghost imaging scheme based on differential speckle patterns,named CGI-DSP.In the scheme,a series of bucket detector signals are acquired when a series of random speckle patterns are employed to illuminate an unknown object.Then the differential speckle patterns(differential bucket detector signals) are obtained by taking the difference between present random speckle patterns(present bucket detector signals) and previous random speckle patterns(previous bucket detector signals).Finally,the image of object can be obtained directly by performing the compressed sensing algorithm on the differential speckle patterns and differential bucket detector signals.The experimental and simulated results reveal that CGI-DSP can improve the imaging quality and reduce the number of measurements comparing with the traditional compressed ghost imaging schemes because our scheme can remove the environmental illuminations efficiently.     

一种水平变化波导中匹配场定位的虚拟时反实现方法

在水平变化波导中,匹配场被动定位的计算量非常大,严重阻碍了其工程应用.本文提出了一种水平变化波导中匹配场定位的虚拟时反实现方法,其抛物方程模型计算网格总数远小于匹配场处理,从而大大减小计算代价.与匹配场处理不同,虚拟时反实现方法是一个利用介质互易性和叠加性的后向传输过程.通过在各水听器位置放置虚拟声源,并在搜索区域产生相应的模糊平面,对各个模糊平面进行相应加权求和,获得的定位模糊平面.利用地中海浅海实验数据验证了虚拟时反实现方法的快速性能.     

高斯射线束法在深海声源定位中的应用

在深海匹配场(Matched Field Processing-MFP)声源定位中,拷贝场模型的计算精度和速度对声源的定位效果和定位效率有着直接的影响。针对这一问题,本文数值仿真研究了深海匹配场定位中采用高斯射线束理论作为拷贝场计算模型的可行性。高斯射线束理论具有计算速度快,物理意义清晰,并且适合并行化处理等优点。文中利用不同水文环境、不同频域范围的大量仿真实验来证明该模型的适用性。结果表明,高斯射线束模型在深远海的声源定位中有很好的定位精度,并且在较低频段同样有效,可以作为深远海声源定位的拷贝场计算模型。     

A Bayesian approach to matched field processing in uncertain ocean environments

An approach of Bayesian Matched Field Processing （MFP） was discussed in the uncertain ocean environment. In this approach, uncertainty knowledge is modeled and spatial and temporal data received by the array are fully used. Therefore, a mechanism for MFP is found, which well combines model-based and data-driven methods of uncertain field processing. By theoretical derivation, simulation analysis and the validation of the experimental array data at sea, we find that （1） the basic components of Bayesian matched field processors are the cor- responding sets of Bartlett matched field processor, MVDR （minimum variance distortionless response） matched field processor, etc.; （2） Bayesian MVDR/Bartlett MFP are the weighted sum of the MVDR/Bartlett MFP, where the weighted coefficients are the values of the a posteriori probability; （3） with the uncertain ocean environment, Bayesian MFP can more correctly locate the source than MVDR MFP or Bartlett MFP; （4） Bayesian MFP can better suppress sidelobes of the ambiguity surfaces.     

High temperature and pressure thermodynamics of strontium: A macroscopic approach

Close proximity of d-bands (above) to the Fermi level (E _F) makes the heavy alkaline earth metals (Ca, Sr and Ba) fairly sensitive to external influences like temperature and pressure. Softening of some of the phonon modes at high temperatures and/or pressures implies that anharmonic effects can play an important role in determining lattice dynamics and related properties. In the conventional approach, phonon density of states (p-dos) have to be calculated at each volume to compute free energy and thereby the other thermodynamic properties, which is computationally quite demanding. Using an alternative technique, the mean-field potential (MFP) approach was combined with the relatively soft local pseudopotential to obtain the free energy at different temperatures and pressures. The results for phonon frequency shifts at finite temperatures using the MFP approach and those calculated from p-dos within the quasiharmonic approximation are very similar. This validates the use of the MFP approach coupled with the local pseudopotential to estimate vibrational response of the system at high-temperature and high-pressure environments. The present scheme was used to study various thermophysical properties for elemental strontium at elevated temperatures and pressures, including the high-pressure melting curve and temperature along the shock Hugoniot. Computed results are affirmatively compared and analyzed with other reported data. The present scheme completely bypasses traditional cumbersome calculations, and it is computationally convenient yet accurate.     

Geoacoustic Inversion Based on a Vector Hydrophone Array

We propose a geoacoustic inversion scheme employing a vector hydrophone array based on the fact that vector hydrophone can provide more acoustic field information than traditional pressure hydrophones. Firstly, the transmission loss of particle velocities is discussed. Secondly, the sediment sound speed is acquired by a matchedfield processing （MFP） procedure, which is the optimization in combination of the pressure field and vertical particle velocity field. Finally, the bottom attenuation is estimated from the transmission loss difference between the vertical particle velocity and the pressure. The inversion method based on the vector hydrophone array mainly has two advantages： One is that the MFP method based on vector field can decrease the uncertain estimation of the sediment sound speed. The other is that the objective function based on the transmission loss difference has good sensitivity to the sediment attenuation and the inverted sediment attenuation is independent of source level. The validity of the inverted parameters is examined by comparison of the numerical results with the experimental data.     

基于广义信息域离散轨迹变换的随机数生成器

广义信息域是所有可表示为二进制编码的数字信息构成的空间. 本文提出一种基于广义信息域离散轨迹变换的随机数生成器. 该生成器将广义信息域作为熵源空间, 把用户选择的数字信息作为熵源输出, 在对熵源输出进行重构处理的基础上使用离散轨迹变换方法生成随机数. 本文提出的生成器在平衡度、周期和抗碰撞等性能上均表现优良, 并通过美国国家标准技术研究院 测试证明其具有理想的随机性, 可以供用户快速方便地生成高安全随机数.     

三种降采样成像策略的性能优化以及与传统傅里叶望远镜的比较

为了获得成像质量较好且成像时间较少的新型傅里叶望远镜成像策略,本文比较了三种降采样成像策略(压缩感知方法 (CS)、低频全采样方法 (LF)和变密度随机采样方法 (VD))与传统傅里叶望远镜(FT)在图像质量和成像时间上的差异.分析方法如下:利用传统FT外场实验所获得的目标频谱数据作为基础,三种降采样方法 (LF, VD和CS)分别按照各自的采样模式和重构方法实现目标图像的重构;通过直观观察和Strehl比两种方法比较三种降采样方法与传统FT在图像质量上的差异;通过分析成像时间的组成要素,初步比较三种降采样方法与传统FT在成像时间上的差异.分析表明:1)压缩感知方法的图像质量优于其他两种降采样方法 (LF和VD),但略低于传统成像结果; 2)压缩感知方法在成像质量上略低于传统FT,但在成像时间上却明显小于传统FT; 3)分析中采用的外场数据均含噪声,这说明上述三种降采样重构过程对噪声有较好的鲁棒性.综合上述分析结果可以看出,基于压缩感知的傅里叶望远镜(CS-FT)是在实际含噪情况下可大幅减少成像时间的优良成像策略.     

环境扰动约束下的稀疏贝叶斯定位方法

针对匹配场被动定位技术对海洋环境扰动敏感的问题,提出了一种基于稀疏贝叶斯学习的稳健匹配场处理方法。该方法通过分析环境扰动情况下的声场构成,建立了海洋环境扰动模型,同时结合水下定位问题的稀疏性,将匹配场被动定位问题表述为稀疏信号重构问题。然后,使用稀疏贝叶斯学习方法迭代更新目标位置及模型失配权向量,收敛至最优稀疏解作为目标定位结果。最后使用仿真数据和北厄尔巴岛的海试数据对算法进行了验证,仿真和实验结果表明:该算法在海洋环境模型失配情况下也能够准确定位,且能分辨水平间距为100 m的两个目标。因此,基于稀疏贝叶斯学习的稳健匹配场处理方法能够有效利用海洋环境扰动声场结构和水下定位稀疏特性,以增强匹配场处理的稳健性和定位精度,并且具有应对多源定位问题的能力。      

Matched localization of a horizontal array in shallow sea

I.IntroductionInsha1lowsea,passivesource1ocalizationisadifficu1t,yctinterestingprob1emthathasre-ceivcdagrcatdca1ofattcnti0ninthelastfCwycars.l'-'1Theconventiona1sourccloca1izationistOmatchthercceivcdacousticdatawiththesoundficldprcdictcdbythepropagationmodcl.Thistechniqueiscallcdmatchcd-ficldproccssing(MFP).Itiscommonlyacceptcdthatinshal-low-watercnvironmcnLssoundficldcanbcwclldcscribcdbyanormal-modemodel.Accord-ingtothismodcl,thcacousticprcssurecanbecxprcsscdasalincarcombinationofthenorma…     

Quantum information is incompressible without errors

A classical random variable can be faithfully compressed into a sequence of bits with its expected length lying within one bit of Shannon entropy. We generalize this variable-length and faithful scenario to the general quantum source producing mixed states rho(i) with probability p(i). In contrast to the classical case, the optimal compression rate in the limit of large block length differs from the one in the fixed-length and asymptotically faithful scenario. The amount of this gap is interpreted as the genuinely quantum part being incompressible in the former scenario.     

What is a complex graph?

Many papers published in recent years show that real-world graphs G(n,m) (n nodes, m edges) are more or less “complex” in the sense that different topological features deviate from random graphs. Here we narrow the definition of graph complexity and argue that a complex graph contains many different subgraphs. We present different measures that quantify this complexity, for instance C_1e, the relative number of non-isomorphic one-edge-deleted subgraphs (i.e. DECK size). However, because these different subgraph measures are computationally demanding, we also study simpler complexity measures focussing on slightly different aspects of graph complexity. We consider heuristically defined “product measures”, the products of two quantities which are zero in the extreme cases of a path and clique, and “entropy measures” quantifying the diversity of different topological features. The previously defined network/graph complexity measures Medium Articulation and Offdiagonal complexity (OdC) belong to these two classes. We study OdC measures in some detail and compare it with our new measures. For all measures, the most complex graph has a medium number of edges, between the edge numbers of the minimum and the maximum connected graph . Interestingly, for some measures this number scales exactly with the geometric mean of the extremes: . All graph complexity measures are characterized with the help of different example graphs. For all measures the corresponding time complexity is given.Finally, we discuss the complexity of 33 real-world graphs of different biological, social and economic systems with the six computationally most simple measures (including OdC). The complexities of the real graphs are compared with average complexities of two different random graph versions: complete random graphs (just fixed n,m) and rewired graphs with fixed node degrees.     

Scaling behavior of surface irregularity in the molecular domain: From adsorption studies to fractal catalysts

For an unexpected variety of solids, the surface topography from a few up to as many as a thousand angstroms is very well described by fractal dimension,D. This follows from measurements of the number of molecules in surface monolayers, as function of adsorbate or adsorbent particle size. As an illustration, we present a first case, amorphous silica gel, whereD has been measured independently by each of the two methods. (The agreement, 3.02±0.06 and 3.04±0.05, is excellent, and the result is modeled by a heavy generalized Menger sponge.) The examples as a whole divide into amorphous and crystalline materials, but presumably all of them are to be modeled as random fractal surfaces. The observedD values exhaust the whole range between 2 and 3, suggesting that there are a number of different mechanisms by which such statistically self-similar surfaces form. We show that fractal surface dimension entails interfacial power laws much beyond what is the source of theseD values. Examples are reactive scattering events when neutrons of variable flux pass the surface (this is of interest for locating fractal substrates that may support adlayer phase transitions); the rate of diffusion-controlled chemical reactions at fractal surfaces; and the fractal implementation of the traditional idea that the active sites of a catalyst are edge and apex sites on the surface.     

Localization using Bartlett matched-field processor sidelobes

Ambiguity surface sidelobes generated by the Bartlett matched-field processor (MFP) shift location with frequency. This sidelobe shift can be viewed as a continuous trajectory in a range-frequency plane at a fixed depth, where the trajectories converge to the correct source range for a perfectly matched surface. In isovelocity or bottom-interacting environments the sidelobe trajectories are straight lines that converge to the true range at zero frequency, while environments with upward-refracting sound-speed profiles have trajectories that asymptotically converge as the frequency approaches infinity. This behavior can be explained by the theory of waveguide invariants, which predict the local behavior of interference maxima/minima of acoustic intensity in the frequency-range plane. As the ambiguity surface of the Bartlett matched-field processor has a physical interpretation in terms of a time-reversed acoustic field, with the sidelobes analogous to local interference maxima, these invariant concepts can be reformulated for application to MFP. These interference trajectories are demonstrated to exist in simulations, broadband source tows, and a type A blue whale vocalization. Sidelobe trajectories also exist in the range-depth plane, but they contain no information about the correct source depth. An appendix demonstrates how these sidelobe properties can be exploited when combining ambiguity surfaces through use of gradient and Radon transform information. The resulting range estimators demonstrate better peak-to-sidelobe ratios than a simple incoherent average.     

半经验关系与匹配场联合处理的爆炸声源快速定位

爆炸声源位置的快速准确获取对声源级测量和声传播计算具有重要意义。为了解决利用单一水听器进行爆炸声源定位时难以获得较好的定位效率和精度的问题,提出了一种基于半经验关系与匹配场联合处理的爆炸声源快速定位方法。首先通过爆炸声源满足的半经验关系,对爆炸位置进行预估,缩小匹配参数的搜索范围;同时,在基于多途时延差匹配定位理论的基础上,利用爆炸声源的半经验关系建立联合匹配定位方法,引入气泡脉动周期和冲击波峰值增加匹配物理信息,实现爆炸声源深度和距离精确反演。仿真分析与2013年南海水下爆炸声试验数据分析结果表明,一次气泡脉动周期与多途时延差的联合匹配可提高对爆炸声源深度的估计精度;冲击波峰值与多途时延差的联合匹配可提高对距离的估计精度。额外匹配量的引入减少了估计精度对接收阵元个数的依赖,能够实现用单阵元快速准确地进行爆炸源位置的估计。      

空气中声源的水下匹配场定位

通过水下布放的垂直线列阵采集空中声源在水下激发的测量声场,采用声场波数积分模型(OASES模型)对空中声源激发的水下声场建模,计算出拷贝声场,将二者进行匹配处理从而对空中声源目标定位。首先通过数值仿真验证了匹配场处理技术对空中声源的测距能力,并通过引入宽带匹配场处理器平滑掉距离上的周期性旁瓣。最后分析南海某海域的空气声试验数据,采用常规匹配场方法对700 m以内的32组空中声源目标进行定位,测距结果与GPS计算的收发间实际距离相比,大多数情况下是一致的,在较远距离由于信噪比降低,测量结果容易出现偏差。      

An image compressed sensing algorithm based on adaptive nonlinear network

Traditional compressed sensing algorithm is used to reconstruct images by iteratively optimizing a small number of measured values. The computation is complex and the reconstruction time is long. The deep learning-based compressed sensing algorithm can greatly shorten the reconstruction time, but the algorithm emphasis is placed on reconstructing the network part mostly. The random measurement matrix cannot measure the image features well, which leads the reconstructed image quality to be improved limitedly. Two kinds of networks are proposed for solving this problem. The first one is Recon Net's improved network IRecon Net, which replaces the traditional linear random measurement matrix with an adaptive nonlinear measurement network. The reconstruction quality and anti-noise performance are greatly improved.Because the measured values extracted by the measurement network also retain the characteristics of image spatial information, the image is reconstructed by bilinear interpolation algorithm(Bilinear) and dilate convolution. Therefore a second network USDCNN is proposed. On the BSD500 dataset, the sampling rates are 0.25, 0.10, 0.04, and 0.01, the average peak signal-noise ratio(PSNR) of USDCNN is 1.62 d B, 1.31 d B, 1.47 d B, and 1.95 d B higher than that of MSRNet. Experiments show the average reconstruction time of USDCNN is 0.2705 s, 0.3671 s, 0.3602 s, and 0.3929 s faster than that of Recon Net. Moreover, there is also a great advantage in anti-noise performance.