A systolic algorithm for Euclidean distance transform

The Euclidean distance transform is one of the fundamental operations in image processing. It has been widely used in computer vision, pattern recognition, morphological filtering, and robotics. This paper proposes a systolic algorithm that computes the Euclidean distance map of an N /spl times/ N binary image in 3N clocks on 2N/sup 2/ processing cells. The algorithm is designed so that the hardware resources are reduced; especially no multipliers are used and, thus, it facilitates VLSI implementation.     

快速挖掘频繁项集的并行算法

传统的挖掘频繁项集的并行算法存在数据偏移、通信量大、同步次数较多和扫描数据库次数较多等问题。针对这些问题,提出了一种快速挖掘频繁项集的并行算法(FPMFI)。FPMFI算法让各计算机节点独立地计算局部频繁项集,然后与中心节点交互实现数据汇总,最终获得全局频繁项集。理论分析和实验结果表明FPMFI算法是有效的。     

A unified distance transform algorithm and architecture

The online version of the original article can be found at     

A unified distance transform algorithm and architecture

Standard distance transform algorithms produce approximate results and are unsuitable for real-time implementation since they require massive parallelism. A new unified algorithm that computes distance and related nearest feature transforms concurrently for arbitrary bit maps based on any distance function from a broad class is presented. The algorithm has an efficient implementation on serial processors and a unified transform architecture is proposed for feasible real-time performance based on parallel row followed by parallel column scanning. Its importance lies in that it supports real-time performance and a broader set of machine vision applications than the standard approach.     

一种快速的随机Hough变换圆检测算法

随机Hough变换是检测圆的一种有效方法,但在处理复杂图像时随机采样带来的大量无效积累会导致计算量过大。提出一种快速的随机Hough变换圆检测算法,对证据积累的计算从三方面进行研究,有效地提高了计算速度,具有较好的应用价值。     

距离保持水平集演化模型的快速实现算法

针对梯度下降法收敛性较差、对局部极小值比较敏感的问题，提出一种改进NAG算法，并以此替换距离保持水平集演化（DRLSE）模型中的梯度下降算法，进而得到一个基于NAG的图像快速分割算法。首先，给出初始水平集演化方程；其次，用改进NAG算法计算梯度；最后，对水平集函数进行不断更新，从而避免水平集函数陷入局部极小值。实验结果表明，与DRLSE模型中的原算法相比，所提算法迭代次数减少了约30%，CPU运行时间减少了30%以上。该算法实现简单，能够对实时性要求较高的红外图像、医学图像进行快速、有效的分割。     

距离保持水平集演化模型的快速实现算法

针对梯度下降法收敛性较差、对局部极小值比较敏感的问题,提出一种改进NAG算法,并以此替换距离保持水平集演化（DRLSE）模型中的梯度下降算法,进而得到一个基于NAG的图像快速分割算法。首先,给出初始水平集演化方程;其次,用改进NAG算法计算梯度;最后,对水平集函数进行不断更新,从而避免水平集函数陷入局部极小值。实验结果表明,与DRLSE模型中的原算法相比,所提算法迭代次数减少了约30%,CPU运行时间减少了30%以上。该算法实现简单,能够对实时性要求较高的红外图像、医学图像进行快速、有效的分割。     

Fast and accurate geodesic distance transform by ordered propagation

In this paper, we present a new geodesic distance transform that uses a non-Euclidean metric suitable for non-convex discrete 2D domains. The geodesic metric used is defined as the shortest path length through a set of pixels called Locally Nearest Hidden Pixels, and manages visibility zones using bounding angles. The algorithm is designed using ordered propagation, which makes it extremely efficient and linear in the number of pixels in the domain. We have compared our algorithm with the four most similar geodesic distance transform techniques, and we show that our approach has higher accuracy and lower computational complexity.     

基于链码技术的距离变换改进算法

论述了分水岭算法的原理及距离变换的具体过程。为了提高距离转换算法速度,提出了利用链码技术改进距离变换的算法。该方法利用链码技术能够准确跟踪目标物体边界的特点,按不同层次轮廓点灰度级递增的方式逐层对目标物体进行遍历,完成图像的距离转换,克服了形态学距离变换算法多次腐蚀、扫描图像,时间消耗较大的缺点。经过在木材细胞图像的分割过程中,同现有的距离变换算法比较证明,改进方法提高了距离变换速度,对提高图像分割的效率具有重要意义。     

Fast parallel GPU-sorting using a hybrid algorithm

This paper presents an algorithm for fast sorting of large lists using modern GPUs. The method achieves high speed by efficiently utilizing the parallelism of the GPU throughout the whole algorithm. Initially, GPU-based bucketsort or quicksort splits the list into enough sublists then to be sorted in parallel using merge-sort. The algorithm is of complexity nlogn$nlogn$, and for lists of 8 M elements and using a single Geforce 8800 GTS-512, it is 2.5 times as fast as the bitonic sort algorithms, with standard complexity of n(logn)²$n{(logn)}^2$, which for a long time was considered to be the fastest for GPU sorting. It is 6 times faster than single CPU quicksort, and 10% faster than the recent GPU-based radix sort. Finally, the algorithm is further parallelized to utilize two graphics cards, resulting in yet another 1.8 times speedup.     

Scalable and efficient parallel algorithms for Euclidean distance transform on the LARPBS model

A parallel algorithm for Euclidean distance transform (EDT) on linear array with reconfigurable pipeline bus system (LARPBS) is presented. For an image with n/spl times/n pixels, the algorithm can complete EDT transform in O(n log n/c(n) log d(n)) time using n/spl middot/d(n)/spl middot/c(n) processors, where c(n) and d(n) are parameters satisfying 1/spl les/c(n)/spl les/n, and 1相似文献   

基于多项式变换的二维整型离散余弦变换快速算法

提出了一种基于多项式变换的二维整型离散余弦变换（DCT）快速算法,利用多项式变换将二维DCT变换的计算转化为一系列一维DCT变换及其变换系数的求和运算,减少了乘法和加法的计算量;利用提升矩阵,实现了整型DCT变换,进一步提高了运算效率的同时,使信号可精确重构。     

快速随机Hough变换多圆检测算法

随机Hough变换是检测圆的一种有效方法,但在处理多圆复杂图像时随机采样带来的大量无效累积会导致计算量过大。文中提出一种基于随机Hough变换的快速多圆检测算法,除去三类噪声点,通过随机采样到的一点按照一定规则搜索另外两点来确定候选圆,用原始图像对候选圆进行证据积累以判断是否为真圆。理论分析和实验结果表明：该算法较其他算法能更快地检测出图像中的多个圆,具有较好的应用价值。     

图像Contourlet域快速置乱算法

探讨了Contourlet变换域的图像视觉信息的置乱掩蔽问题,提出了一种基于零树编码结构的快速置乱算法。算法使用高效混沌映射构造置乱矩阵,对Contourlet系数矩阵进行子树间置乱,以减少系数置乱所带来的对编码效率的影响。实验结果表明该置乱算法效率高,并能有效实现对图像视觉内容的掩蔽。     

Fast parallel algorithms for discrete Gabor expansion and transform based on multirate filtering

The Gabor transform has long been recognized as a very useful tool for the joint time and frequency analysis in signal processing.Its real time applications,however,were limited due to the high computational complexity of the Gabor transform algorithms.In this paper,some novel and fast parallel algorithms for the finite discrete Gabor expansion and transform are presented based on multirate filtering.An analysis filter bank is designed for the finite discrete Gabor transform(DGT)and a synthesis filter bank is designed for the finite discrete Gabor expansion(DGE).Each of the parallel channels in the two filter banks has a unified structure and can apply the FFT and the IFFT to reduce its computational load.The computational complexity of each parallel channel does not change as the oversampling rate increases.In fact,it is very low and depends only on the length of the input discrete signal and the number of the Gabor frequency sampling points.The computational complexity of the proposed parallel algorithms is analyzed and compared with that of the major existing parallel algorithms for the finite DGT and DGE.The results indicate that the proposed parallel algorithms for the finite DGT and DGE based on multirate filtering are very attractive for real time signal processing.     

基于多抽样率滤波实现离散Gabor展开与变换的快速并行算法

Gabor变换在信号处理领域一直被认为是一十分有用的时频分析工具,却因Gabor变换算法的高计算复杂性而限制了其实时应用.本文基于多抽样率滤波原理,设计了分析和综合滤波器组分别用于实现离散Gabor变换与展开,从而提出了全新的离散Gabor展开与变换快速并行算法.所设计的分析和综合滤波器组中的每一并行通道具有一致的结构并能够利用快速Fourier变换(FFT)及其逆变换(IFFT)减小计算量.每一并行通道计算复杂性非常小,只取决于输入离散信号的长度及Gabor频率抽样点数,并且每一并行通道计算复杂性不会随Gabor变换过抽样率增加而增大.本文对所提出的并行算法的计算复杂性进行了分析并与目前主要的离散Gabor展开与变换并行算法进行了比较,结果表明所提出基于多抽样率滤波实现离散Gabor展开与变换的并行算法对实时信号处理十分有利.     

一种基于距离变换的不规则区域匹配算法

针对不规则区域难以直接匹配的问题,提出了一种新颖的不规则区域匹配算法,即基于距离变换的不规则区域描述子DTIRD。为了避免椭圆拟合误差和主方向不准确产生的匹配错误,该算法采用区域边界附近纹理和区域内部纹理确定不规则区域的支撑区域;然后给出了一种基于距离变换的子区域划分方法,与传统方法相比,能够减少图像亮度变化带来的匹配错误;最后针对区域存在形状、尺寸大小不一且具有不同像素点数的问题,采用均值标准差MS构造描述算法。实验结果表明,该算法对旋转、光照、模糊以及压缩变化图像具有更好的匹配性能。     

多抽样率Gabor变换并行算法的FPGA仿真和设计

Gabor变换在信号处理领域被公认为十分有效的时频分析方法,然而却因为Gabor变换算法具有较高的计算复杂性而限制了其实时应用,最近提出的基于多抽样率滤波实现离散Gabor变换的并行算法可很好地解决实时应用问题。讨论用FPGA来实现多抽样率Gabor变换并行算法的仿真,并运用Quartus II 9.0和modelsim等软件以及Verilog硬件描述语言来辅助设计。     

形状的圆内距离变换

目的 形状的描述、匹配、相似性判定和检索是计算机视觉和图像识别的基本问题,也是一个开问题。在目前公开的方法中,除了只能应用于简单形状的几何复变换和基于边界的傅里叶描述子外,其他的方法均不能由构建的形状特征描述符重建原形状,因此不能保证所建立的形状特征能客观地描述原形状。本文提出了形状的圆内距离变换,该方法所建立的描述符可用于形状匹配、相似性度量和形状检索。该方法是可逆的,也就是可以从形状描述符重建原形状。方法 形状的圆内距离变换通过在形状的最小外接圆内旋转和切分形状,求出形状相邻切分点之间的距离,并由此构建形状的特征矩阵。对于任意相似的形状,从理论上证明了形状的圆内距离变换具有缩放、旋转和位移不变性。结果 对发生了形变、扭曲和仿射变换的形状,采用圆内距离变换方法进行了形状的相似性度量、检索和重建实验,结果表明,形状的圆内距离变换可以准确地描述形状、度量形状的相似性、检索形状并重建原形状。在形状的相似性度量上,形状的圆内距离变换能给出与人类视觉一致的结果,并且当两个形状相似时,还能计算出它们的尺度缩放和角度旋转。通过与经典的方法,包括形状上下文方法、傅里叶描述子方法、拉东柱状图方法,针对典型的MPEG-7形状库进行对比实验,发现形状的圆内距离变换在形状检索的综合得分上相比这些经典方法提高了近20%。结论 形状的圆内距离变换在形状的描述、相似性判定和检索上是有效和可逆的,具有广泛的可适用性且优于本文比较的其他经典方法。