利用工业CT实现精密零件内部尺寸的高精度测量已逐渐成为产品质量控制的重要技术手段,而CT图像分割和数据拟合是工业CT图像测量的重要环节和难点问题。基于此,采用联合小波变换和RSF模型的图像分割方法对精密零件CT图像轮廓进行精确分割...利用工业CT实现精密零件内部尺寸的高精度测量已逐渐成为产品质量控制的重要技术手段,而CT图像分割和数据拟合是工业CT图像测量的重要环节和难点问题。基于此,采用联合小波变换和RSF模型的图像分割方法对精密零件CT图像轮廓进行精确分割,得到感兴趣轮廓数据,接着采用最小二乘拟合方法得到圆和直线方程,进而测量得到感兴趣对象的直径和角度;同时,对于零件壁厚的测量,采用最小距离搜索法获取壁厚值。多组精密零件的CT图像测量结果表明,该方法测量精度总体优于通用测量软件VG Studio Max的精度,具有一定工程应用价值。展开更多
The similarity search is one of the fundamental components in time series data mining,e.g.clustering,classification,association rules mining.Many methods have been proposed to measure the similarity between time serie...The similarity search is one of the fundamental components in time series data mining,e.g.clustering,classification,association rules mining.Many methods have been proposed to measure the similarity between time series,including Euclidean distance,Manhattan distance,and dynamic time warping(DTW).In contrast,DTW has been suggested to allow more robust similarity measure and be able to find the optimal alignment in time series.However,due to its quadratic time and space complexity,DTW is not suitable for large time series datasets.Many improving algorithms have been proposed for DTW search in large databases,such as approximate search or exact indexed search.Unlike the previous modified algorithm,this paper presents a novel parallel scheme for fast similarity search based on DTW,which is called MRDTW(MapRedcuebased DTW).The experimental results show that our approach not only retained the original accuracy as DTW,but also greatly improved the efficiency of similarity measure in large time series.展开更多
This paper puts forward adaptive anti collision algorithm based on two fork tree decomposition. New search algorithm built on the basis of binary-tree algorithm, using the uniqueness of the label EPC, to estimate the ...This paper puts forward adaptive anti collision algorithm based on two fork tree decomposition. New search algorithm built on the basis of binary-tree algorithm, using the uniqueness of the label EPC, to estimate the distribution of label by slot allocation, the huge and complicated two fork tree is decomposed into several simple binary-tree by search the collision slots for binary-tree, so, it can simplifies the search process. The algorithm fully considers4 important performance parameters of the reader paging times, transmission delay, energy consumption and throughput label, the simulation results show that, the improved anti-collision algorithm is obviously improved performance than other two fork tree algorithm, it is more suitable for RFID anti-collision protocols.展开更多
文摘利用工业CT实现精密零件内部尺寸的高精度测量已逐渐成为产品质量控制的重要技术手段,而CT图像分割和数据拟合是工业CT图像测量的重要环节和难点问题。基于此,采用联合小波变换和RSF模型的图像分割方法对精密零件CT图像轮廓进行精确分割,得到感兴趣轮廓数据,接着采用最小二乘拟合方法得到圆和直线方程,进而测量得到感兴趣对象的直径和角度;同时,对于零件壁厚的测量,采用最小距离搜索法获取壁厚值。多组精密零件的CT图像测量结果表明,该方法测量精度总体优于通用测量软件VG Studio Max的精度,具有一定工程应用价值。
基金supported in part by National High-tech R&D Program of China under Grants No.2012AA012600,2011AA010702,2012AA01A401,2012AA01A402National Natural Science Foundation of China under Grant No.60933005+1 种基金National Science and Technology Ministry of China under Grant No.2012BAH38B04National 242 Information Security of China under Grant No.2011A010
文摘The similarity search is one of the fundamental components in time series data mining,e.g.clustering,classification,association rules mining.Many methods have been proposed to measure the similarity between time series,including Euclidean distance,Manhattan distance,and dynamic time warping(DTW).In contrast,DTW has been suggested to allow more robust similarity measure and be able to find the optimal alignment in time series.However,due to its quadratic time and space complexity,DTW is not suitable for large time series datasets.Many improving algorithms have been proposed for DTW search in large databases,such as approximate search or exact indexed search.Unlike the previous modified algorithm,this paper presents a novel parallel scheme for fast similarity search based on DTW,which is called MRDTW(MapRedcuebased DTW).The experimental results show that our approach not only retained the original accuracy as DTW,but also greatly improved the efficiency of similarity measure in large time series.
文摘This paper puts forward adaptive anti collision algorithm based on two fork tree decomposition. New search algorithm built on the basis of binary-tree algorithm, using the uniqueness of the label EPC, to estimate the distribution of label by slot allocation, the huge and complicated two fork tree is decomposed into several simple binary-tree by search the collision slots for binary-tree, so, it can simplifies the search process. The algorithm fully considers4 important performance parameters of the reader paging times, transmission delay, energy consumption and throughput label, the simulation results show that, the improved anti-collision algorithm is obviously improved performance than other two fork tree algorithm, it is more suitable for RFID anti-collision protocols.
