稀疏阈值的超分辨率图像重建

为了解决基于字典学习的超分辨重构算法耗时过长的问题,提出了基于稀疏阈值模型的图像超分辨率重建方法。首先,将联合字典理论与图像块稀疏阈值方法相结合,训练得到高、低分辨率过完备图像字典对。接着,通过稀疏阈值OMP算法对图像特征块进行稀疏表示。然后,通过高分辨率字典重构出初始的超分辨图像。最后,通过改进迭代反投影算法对初始的超分辨图像进行全局优化,从而进一步提高图像重构质量。实验结果表明,超分辨图像重构平均峰值信噪比(PSNR)为30.1 d B,平均结构自相似度(SSIM)为0.937 9,平均计算时间为10.2 s。有效提高了超分辨重构的速度,改善了重构高分辨图像的质量。     

游客情感计算的文本大数据挖掘方法比较研究

旅游文本大数据以其方便、快捷和低门槛的特点为游客情感计算提供了极大便利,已经成为旅游大数据的主要来源之一。基于大数据理论和情感理论,以文本大数据为数据源,在全面梳理国内外情感计算相关成果的基础上,利用人工智能中的逻辑/算法编程方法、机器学习方法、深度学习方法对旅游文本大数据进行挖掘,探索最佳的基于文本大数据的游客情感计算方法。研究发现：（1）基于情感词典的游客情感计算模型,其核心是构建情感词典和设计情感计算规则,方法简单,容易实现,适用语料范围广。（2）机器学习,用统计学方法抽取文本中的特征项,具有非线性特征,可靠性较线性特征的情感词典方法高。（3）基于深度学习技术的游客情感计算,效果良好,准确率在85%以上。训练多领域的文本语料易于移植,实用性强,且泛化能力好,较适合大数据时代游客情感计算研究。     

A Method of Domain Dictionary Construction for Electric Vehicles Disassembly

Currently, there is no domain dictionary in the field of electric vehicles disassembly and other domain dictionary construction algorithms do not accurately extract terminology from disassembly text, because the terminology is complex and variable. Herein, the construction of a domain dictionary for the disassembly of electric vehicles is a research work that has important research significance. Extracting high-quality keywords from text and categorizing them widely uses information mining, which is the basis of named entity recognition, relation extraction, knowledge questions and answers and other disassembly domain information recognition and extraction. In this paper, we propose a supervised learning dictionary construction algorithm based on multi-dimensional features that combines different features of extraction candidate keywords from the text of each scientific study. Keywords recognition is regarded as a binary classification problem using the LightGBM model to filter each keyword, and then expand the domain dictionary based on the pointwise mutual information value between keywords and its category. Here, we make use of Chinese disassembly manuals, patents and papers in order to establish a general corpus about the disassembly information and then use our model to mine the disassembly parts, disassembly tools, disassembly methods, disassembly process, and other categories of disassembly keywords. The experiment evidenced that our algorithms can significantly improve extraction and category performance better than traditional algorithms in the disassembly domain. We also investigated the performance algorithms and attempts to describe them. Our work sets a benchmark for domain dictionary construction in the field of disassembly of electric vehicles that is based on the newly developed dataset using a multi-class terminology classification.     

用于北京谱仪Ⅱ主漂移室径迹重建的一种新方法

介绍了一种新的主漂移室径迹重建软件DCJULIE,阐述了在径迹重建中模式识别方法的原理和技巧. 经过蒙特卡罗和真实数据的运行和检查,证明了软件的可靠性.     

Adaptive Algorithms of Nonlinear Approximation with Finite Terms

This paper deals with realizable adaptive algorithms of the nonlinear approximation with finite terms based on wavelets. We present a concrete algorithm by which we may find the required index set Am for the greedy algorithm Gm^P（., Ψ）. This makes the greedy algorithm realize the near best approximation in practice. Moreover, we study the efficiency of the finite-term approximation of another Mgorithm introduced by Birge and Massart.     

Economic Cycles of Carnot Type

Originally, the Carnot cycle was a theoretical thermodynamic cycle that provided an upper limit on the efficiency that any classical thermodynamic engine can achieve during the conversion of heat into work, or conversely, the efficiency of a refrigeration system in creating a temperature difference by the application of work to the system. The first aim of this paper is to introduce and study the economic Carnot cycles concerning Roegenian economics, using our thermodynamic–economic dictionary. These cycles are described in both a Q−P diagram and a E−I diagram. An economic Carnot cycle has a maximum efficiency for a reversible economic “engine”. Three problems together with their solutions clarify the meaning of the economic Carnot cycle, in our context. Then we transform the ideal gas theory into the ideal income theory. The second aim is to analyze the economic Van der Waals equation, showing that the diffeomorphic-invariant information about the Van der Waals surface can be obtained by examining a cuspidal potential.     

采用冗余字典稀疏表达的红外与水汽云图融合

卫星云图作为典型的多光谱遥感图像,因各个遥感器成像波段的差异,致使云图间既有一定的相关性,又存在一定的差异,故可认为云图包含2种特征:共性特征和个性特征.一种稀疏表示的云图融合方法,能够把多幅云图在一个过完备字典上进行稀疏表示,使用稀疏系数作为云图的特征,然后对不同图像的个性特征根据稀疏系数向量的1范数决定权重因子,融合云图可以由共性特征和融合后的个性特征联合表示.实验表明,该方法的融合云图无论在客观指标还是视觉效果上都优于传统方法,蕴藏了更为丰富的天气信息.     

面向有限带宽信道的字典学习图像超分辨率重建

固定邻域回归(ANR)算法采用K层奇异值分解(K-SVD)算法进行字典训练, 在字典学习过程中存在稀疏表示系数不准确的问题, 导致重建的结果不理想. 因此, 引入一种改进的K-SVD算法对字典进行训练, 该算法对字典训练改变了传统K-SVD算法更新稀疏表示系数的方式, 使得稀疏表示系数更加准确, 而且加快了字典的收敛速度, 使得训练得到的字典具有更好的稀疏表达能力. 同时, 针对ANR算法的不足, 提出一种面向有限带宽信道基于字典学习的图像超分辨率方法, 该方法采用改进的K-SVD算法训练字典对 , 并将其应用到ANR算法中, 实现图像的超分辨率重建. 实验结果表明, 本文提出的方法不仅能够保持ANR算法快速重建的优势, 而且提高了图像的重建质量, 具有更高的峰值信噪比和结构相似度.     

基于局部约束群稀疏的红外图像超分辨率重建

针对红外图像分辨率低、视觉质量差等问题,提出基于局部约束群稀疏模型的红外图像超分辨率重建方法.考虑到红外图像的纹理自相似性和原子系数的群结构稀疏性,首先建立了基于局部约束的群稀疏表示模型.然后,在假定低分辨率图像空间和高分辨率图像空间具有相似流形的前提下,联合局部约束群稀疏表示模型和K-SVD(K奇异值分解)方法,训练得到高低分辨率图像对应的群结构字典对.最后,通过高分辨字典和对应的红外图像群稀疏表示系数重建得到高分辨率的红外图像.实验结果表明,本文方法具有更好的超分辨率效果,无论是在客观评价指标还是主观视觉效果方面都有明显的提高.     

Multivariate Time Series Imputation: An Approach Based on Dictionary Learning

The problem addressed by dictionary learning (DL) is the representation of data as a sparse linear combination of columns of a matrix called dictionary. Both the dictionary and the sparse representations are learned from the data. We show how DL can be employed in the imputation of multivariate time series. We use a structured dictionary, which is comprised of one block for each time series and a common block for all the time series. The size of each block and the sparsity level of the representation are selected by using information theoretic criteria. The objective function used in learning is designed to minimize either the sum of the squared errors or the sum of the magnitudes of the errors. We propose dimensionality reduction techniques for the case of high-dimensional time series. For demonstrating how the new algorithms can be used in practical applications, we conduct a large set of experiments on five real-life data sets. The missing data (MD) are simulated according to various scenarios where both the percentage of MD and the length of the sequences of MD are considered. This allows us to identify the situations in which the novel DL-based methods are superior to the existing methods.