二维传感器阵列中最邻近点对求解的预处理算法  被引量:2

Preprocessing Algorithm for Nearest Point Pair in Two-Dimensional Sensor Array

在线阅读下载全文

作  者:李雨晨 

机构地区:[1]大连科技学院,辽宁大连116000

出  处:《工业控制计算机》2021年第3期15-17,共3页Industrial Control Computer

基  金:辽宁省自然科学基金(20180551054);基于气体传感器阵列的混合气体识别神经网络拓扑结构的优化研究。

摘  要:针对大面积温控设备,设计一种二维压力传感器阵列。在设置压力阈值,当压力值超过阈值时,即标记为阵列中的有效活动点。在二维传感器阵列的压力值分析中,二维传感器阵列中的有效活动点的最邻近点对的求解,可分析出阵列传感器设备上压力分布密集区,从而进行区域温控调节。通过递推方程分析和对比蛮力算法和分治算法求解最邻近点对的时间复杂度。提出一种预处理算法,对分治算法求解邻近点对的方法进行改进,通过递推方程分析,对分治算法求解有了新的改进,降低了一个logn的因子。A two-dimensional pressure sensor array is designed for large-area temperature control equipment in this pape.Set the pressure thresholdr,when the pressure value exceeds the threshold,it is marked as the effective active point in the array.In the pressure value analysis of two-dimensional sensor array,the solution of the nearest point pair of the effective active points in the two-dimensional sensor array can analyze the dense area of pressure distribution on the array sensor equipment,so as to adjust the temperature of the area.The time complexity of the nearest point pair is solved by the recursive equation analysis and comparing the brute force algorithm and the divide and conquer algorithm.In this paper,a preprocessing algorithm is proposed to improve the method of solving the adjacent point pairs in the divide and conquer algorithm.Through the analysis of recurrence equation,a new improvement is made in the solution of the divide and conquer algorithm,and a logn factor is reduced.

关 键 词:传感器阵列 邻近点对 递推方程 

分 类 号:TP212[自动化与计算机技术—检测技术与自动化装置]

 

参考文献:

正在载入数据...

 

二级参考文献:

正在载入数据...

 

耦合文献:

正在载入数据...

 

引证文献:

正在载入数据...

 

二级引证文献:

正在载入数据...

 

同被引文献:

正在载入数据...

 

相关期刊文献:

正在载入数据...

相关的主题
相关的作者对象
相关的机构对象