基于AdaBoost的弱分类器选择和整合算法

针对传统AdaBoost算法在人脸检测中训练耗时和误检率高的问题,提出一种改进的AdaBoost算法.新算法在基于PSO的AdaBoost算法基础上对弱分类器的选择和整合两个阶段进行改进.弱分类器选择阶段,在使用PSO迭代选择最佳弱分类器之前,剔除部分无用特征,缩小粒子搜索空间;弱分类器整合阶段,在采用基于核函数的非线性感知器算法优化调节弱分类器参数的过程中使用一种新的与正样本分类能力有关的弱分类器初始参数.采用基于MIT数据库的实验结果表明,本文算法比基于PSO的AdaBoost算法在检测性能上有明显提高.     

基于感兴趣区域AdaBoost分类器的视频车辆检测研究

近年来基于视频的车辆自动检测作为城市智能交通系统的一项重要技术一直受到关注.针对AdaBoost分类器目标检测所存在的漏检、误检和计算量过大等问题,提出一种基于混合高斯模型运动区域提取和Haar-like特征的AdaBoost级联分类器的交通视频车辆检测算法,首先通过建立混合高斯模型对运动目标的总体区域进行检测,进而提取基于车辆运动的感兴趣区域,再对其进行基于Haar-like特征的区域AdaBoost级联分类,实现对运动车辆的检测.由于采用了基于运动区域提取和分类相结合的检测模式,通过混合高斯背景模型较准确的提取出ROI作为车辆的候选区域,约束了每帧的搜索区域,使AdaBoost分类器的目标检测更具针对性,提高了检测的准确性,降低了漏检率;同时也减少了分类算法滑动窗口扫描所需要的时间,提高了检测速度.实验结果验证了所提出算法对复杂交通环境车辆检测的适应性和有效性.     

基于改进AdaBoost算法的行人检测方法

基于传统AdaBoost算法的识别率和误报率同时低的原因。提出一种改进AdaBoost算法的行人检测方法,采用类Haar特征作为行人特征,引入误报率来更新样本权重,使得识别率降低得更慢,实现一个级联的行人检测分类器。相比于传统AdaBoost算法,改进算法不仅取得较优的识别率,并且可以降低分类器训练的层数。实验证明了改进算法的有效性。     

一种加入动态权重的AdaBoost算法

【目的】由于AdaBoost算法弱分类器对各待测样本其投票权重是固定不变的,这会导致使用该算法进行分类时准确性不高,于是针对该问题提出了一种结合静态权重与动态权重的学习算法AdaBoost＿DW。【方法】该算法保留了AdaBoost算法训练阶段产生的全部弱分类器,在预测阶段加入了能度量待测样本与各个弱分类器适应性的动态权重,通过双权重共同决定该弱分类器的投票权重。【结果】实验结果表明,AdaBoost＿DW算法的分类精度绝大多数情况下高于原AdaBoost算法。【结论】证明了动态权重的加入能够提高原AdaBoost算法在各数据集上的分类准确率。     

一种基于聚类和AdaBoost的自适应集成算法

为同时保证基分类器的准确性和差异性, 提出一种基于聚类和AdaBoost的自适应集成算法. 首先利用聚类算法将训练样本分成多个类簇; 然后分别在每个类簇上进行AdaBoost训练并得到一组分类器; 最后按加权投票策略进行分类器的集成. 每个分类器的权重是自适应的, 且为基于测试样本与每个类簇的相似性及分类器对此测试样本的分类置信度计算得到. 实验结果表明, 与AdaBoost,Bagging(bootstrap aggregating)和随机森林等代表性集成算法相比, 该算法可取得更高的分类精度.     

基于量子演化理论的行人检测改进算法

对视频中移动摄像头下的行人检测问题进行了研究,在AdaBoost行人分类算法、支持向量机(SVM)理论和多目标优化原理的基础之上,并结合三者的特点,提出了一种基于量子演化算法的行人检测优化算法。首先,使用传统的AdaBoost算法对行人进行粗粒度的分类,然后使用支持向量机(SVM)设计精度更高的行人检测器。针对SVM的分类器参数多、关系复杂,而且无好的调节准则,根据核函数的构建条件,将实值量子演化算法引入到SVM参数的寻优问题中,对于分类性能采用多目标优化的方法,取得了较好的效果;同时从理论上分析了算法的复杂度。经过实例测试,算法与经典多目标优化算法NSGA-II的相比,改进效果明显。最后的实验说明了算法检测的准确性。     

神经网络决策树算法在钢材表面缺陷检测中的应用研究

文中采用BP神经网络决策树算法实现钢材表面缺陷非人工检测和分类,依据缺陷的特征提取数据,采用BP神经网络决策树算法构多类造分类器,输入标准样本分类器训练后,对钢材在实际生产过程中可能出现的氧化色、飞边、辊印、擦伤、孔洞、压痕等缺陷进行检测和分类,通过对检测结果的分析,缺陷分类准确率高,速度快。     

神经网络决策树算法在钢材表面缺陷检测中的应用研究

文中采用BP神经网络决策树算法实现钢材表面缺陷非人工检测和分类,依据缺陷的特征提取数据,采用BP神 经网络决策树算法构多类造分类器,输入标准样本分类器训练后,对钢材在实际生产过程中可能出现的氧化色、飞边、辊印、擦 伤、孔洞、压痕等缺陷进行检测和分类,通过对检测结果的分析,缺陷分类准确率高,速度快。     

一种基于AdaBoost的SVM分类器

针对AdaBoost的分量分类器的分类精度和差异性互为矛盾、以至于该矛盾的存在降低了AdaBoost算法的分类精度和泛化性的问题,提出了一种变σ-AdaBoostRBFSVM算法,通过根据训练样本调整各个分量分类器的核函数参数值,使分量分类器在精度和差异性之间达到一定的平衡,从而提高了集成分类器的分类精度和泛化性。对标准数据集的分类实验结果表明了算法的有效性。     

热轧板带表面缺陷检测系统设计与研究

针对热轧板带生产线相对恶劣的生产环境及表面缺陷检测精度低的问题,设计了一套热轧板带表面缺陷在线检测系统,深入研究了系统构成、图像去噪处理、缺陷的检测和分类、特征提取和缺陷识别。本文首先对图像进行形态滤波去噪处理,提出了一种基于融入熵的BING检测算法,采用P-relief特征检测和多分离器集成识别算法对热轧板带多种缺陷图像进行处理。实验证明本文算法能够有效地实现缺陷图像的检测和精确的分类。     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.