期刊文献+

分级特征提取在中子寿命深度校正中的应用

Hierarchical Feature Extraction in the Application of Neutron Lifetime Depth Correction
下载PDF
导出
摘要 随着油田进入开发中后期,中子寿命测井得到了广泛的应用.针对中子寿命测井曲线存在的深度误差,对两条测量不同地层信息的曲线进行对比校正,利用测井曲线顺序性的特点,对测井曲线进行分级特征提取并进行校正,提出了基于分级特征提取的测井曲线校正的方法.借鉴人工视觉校正的经验,利用曲线段的最大值位置、尖峰数目这两个特征先对曲线段进行分类匹配,然后利用最大值上下厚度比、相对斜率这两个特征进行相似性判断最终实现分级特征提取.实验结果表明该方法能够快速有效的对测井曲线进行校正. Neutron lifetime logging has been widely used, as the oilfield enters the mid and late development. Aiming at the existence of neutron lifetime logging curve depth error, contrast correction curve of two different stratigraphic information, and take advantage of the characteristics of logging curve sequential, for logging curve of hierarchical feature extraction and calibration. Logging curve correction method is presented based on the hierarchical feature extraction. Using the maximum position, spike number to match and categorize, and then using the maximum thickness ratio, and relative slope characteristics of the curve segment to judge similarity, and Finally realize the hierarchical feature extraction, these all based on the experience of the artificial vision correction. The experimental results show that the method can quickly and efficiently correct the logging curves.
出处 《计算机系统应用》 2014年第3期138-141,共4页 Computer Systems & Applications
基金 国家自然科学基金(61170132) 国家重大专项(2011ZX05020-007) 黑龙江省教育厅科学技术研究项目(12521055)
关键词 中子寿命 深度校正 顺序性 分级特征提取 neutron life time depth correction sequential hierarchical feature extraction
  • 相关文献

参考文献8

二级参考文献110

  • 1傅广,陈章明,姜振学.盖层封堵能力评价方法及其应用[J].石油勘探与开发,1995,22(3):46-50. 被引量:53
  • 2万国根,秦志光.改进的AC-BM字符串匹配算法[J].电子科技大学学报,2006,35(4):531-533. 被引量:20
  • 3张建业,潘泉,张鹏,梁建海.基于斜率表示的时间序列相似性度量方法[J].模式识别与人工智能,2007,20(2):271-274. 被引量:36
  • 4CHEN M S, HAN Jia-wei,YU P S. Data mining: an overview from a database perspective [ J]. IEEE Trans on Knowledge and Data Engineering, 1996,8(6) :866-883.
  • 5SIDIROPOULOS N D,BROS R. Mathematical programming algorithms for regression-based non-linear filtering in n-dimensional real space [J]. IEEE Trans on Signal Processing,1999,47(3) :771-782.
  • 6AGRAWAL R,LIN K I,SAWHNEY H S, et al. Fast similarity search in the presence of noise, scaling, and translation in time-series database[ C ]//Proc of the 21st International Conference on Very Large Data Bases. San Francisco:Morgan Kaufmann Publishers, 1995:490- 501.
  • 7BERNDT D J, CLIFFORD J. Using dynamic time warping to find patterns in time series [ C ]//Proc of KDD Workshop. 1994:359- 370.
  • 8FALOUTSOS C, RANGANATHAN M, MANOLOPOULOS Y. Fast subsequence matching in time series databases[ C]//Proc of ACM SIGMOD International Conference on Management of Data. New York: ACM Press, 1994:419-429.
  • 9BAYER K, COLDSTEIN J, RANIAKRISHNAN R, et al. When is “nearest neighbors” meaningful [ C ]//Proc of the 7th International Conference on Database Theory. Berlin:Springer, 1999:217-235.
  • 10KEOGH E J, PAZZANI M J. An indexing scheme for fast similarity search in large time series databases[ C]//Proc of the llth International Conference on Scientific & Statistical Database Management. Washington DC : IEEE Computer Society, 1999:56-67.

共引文献170

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部