共查询到20条相似文献,搜索用时 156 毫秒
1.
基于连通域标记的目标检测算法设计与实现 总被引:1,自引:0,他引:1
《现代电子技术》2015,(20):71-74
在图像目标识别和跟踪任务中,连通域标记算法的设计优化主要体现在执行速度、存储空间和逻辑判断次数三个方面,因此提出并实现了一种基于一次逐像素扫描连通域标记的单目标检测算法。算法结合包围盒和单目标图像检测的特点,只需单行的图像缓存空间,同时简化复杂的等价标号替换操作,目标的判断准则为目标图像连通区域面积最大化,最终以包围盒形式给出目标位置。FPGA仿真结果表明:该方法资源占用率小,检测一幅图像的总时钟周期数为M×N×4(M,N分别为图像行列数),适用于单目标图像的实时识别与跟踪。 相似文献
2.
基于FPGA的连通域标记设计与实现 总被引:1,自引:0,他引:1
提出了一种基于FPGA的连通域标记电路设计方案.该方案不仅满足了实时、高精度等要求,还特别增加了虚警剔除的功能.该硬件设计方案采用单次逐像素扫描法,该法通过对图像进行一次逐像素扫描,将标记与参数并行处理,最后根据统计出来的连通域及参数信息实现虚警剔除.相比较其它的硬件实现方案,该设计方案具有显著优势,通过优化标记与参数处理,该方案更适合硬件的并行处理特性;去除了第二次逐像素扫描,使得处理时间变短,资源占用率变小.仿真结果表明:若图像大小为M×N,临时标记区域上限为L,则标记完一幅图像总时钟周期为(M×N×2+L×4).该方案已在单片Virtex-Ⅱ系列FPGA中实现,并作为关键电路应用于舰船图像检测系统中. 相似文献
3.
二值图像连通域的分段标记算法及实现 总被引:4,自引:1,他引:3
在基于图像的精确制导中对标记算法的时间性能要求很高,常规的标记算法无法满足高速实时图像处理的需要.在分析现有算法的基础上,引入段的概念,以段为标记单位记录连通区域,在对图像一次扫描的过程中完成连通性传递闭包的计算.在标记的同时记录标记目标的边沿像素坐标值,计算目标的形心、面积、轨迹、灰度等特征.给出了算法的思路和实现步骤.使用该算法标记128×128的二值图像,用TMS320C6414 600 MHz simulator,可以在0.4 ms内完成.将文中算法与其他4种连通区域标记算法进行时间性能对比,明显优于其他算法.软件仿真结果也显示分段标记算法的正确性与稳定性.适用于高速运动目标的实时截获与跟踪. 相似文献
4.
5.
基于自适应预处理的图像分割方法 总被引:1,自引:0,他引:1
为了防止分水岭算法过分割问题,该文提出了一种基于自适应预处理的图像分割算法。该方法在分水岭算法的基础上,首先结合像素点亮度特征和空间分布特性应用自适应方法对梯度图像进行预处理。通过考察各像素点邻域中像素分类后的分布情况,来判断考察点是处于区域中心还是处于边界,并据此对考察点的梯度值进行调节。然后在预处理后的梯度图像上选定标记,将预处理后的梯度图像中大于200个像素的连通区域标定为标记。最后用分水岭分割方法对带标记的参考图像进行分割。试验结果表明,该分割方法具有良好的分割效果。 相似文献
6.
7.
8.
通过对海上红外图像进行分析,提出了一种基于海天线提取的红外小目标检测方法。该算法的基本思路是根据所需提取目标的特点,首先选择感兴趣的灰度区域,然后运用Canny算子进行边缘检测,接着对图像进行Hough变换检测海天线,最后对海天线以下且符合目标特征的连通域进行标记从而来确定目标的位置。实验结果表明,该方法能较好地检测出海上红外小目标。 相似文献
9.
10.
一种基于相对模糊连通度的交互式序列图像快速分割算法 总被引:2,自引:1,他引:2
在基于相对模糊连通度的交互式图像分割方法的基础上提出了一种序列图像分割的快速算法。对于单幅图像,新算法在保持分割精度的同时,运行速度提高了3倍。作为该算法的扩展,一方面将原算法中单目标分割推广到多目标分割,另一方面将单帧图像的分割推广到序列图像的分割,实现了复杂背景下多目标的图像分割和图像序列的批处理分割。并进行了分割结果的后处理,提取出目标的单像素宽度的光滑边缘。用人造图像和实际的医学图像和图像序列所做的测试实验取得了令人满意的分割结果。 相似文献
11.
12.
Object-oriented analysis-synthesis coding of moving images 总被引:10,自引:0,他引:10
Hans Georg Musmann Michael Htter Jrn Ostermann 《Signal Processing: Image Communication》1989,1(2):117-138
An object-oriented analysis-synthesis coder is presented which encodes objects instead of blocks of N × N picture elements. The objects are described by three parameter sets defining the motion, shape and colour of an object. The parameter sets are obtained by image analysis based on source models of either moving 2D-objects or moving 3D-objects. Known coding techniques are used to encode the parameter sets. An object-depending parameter coding allows to introduce geometrical distortions instead of quantization errors. Using the transmitted parameter sets an image can be reconstructed by model-based image synthesis.
Experimental results achieved with a first implementation of the coder are given and are discussed. 相似文献
13.
Jiasong Wu Huazhong Shu Senhadji L. Limin Luo 《IEEE transactions on circuits and systems. I, Regular papers》2009,56(4):784-794
The modified discrete cosine transform (MDCT) and inverse MDCT (IMDCT) are two of the most computationally intensive operations in MPEG audio coding standards. A new mixed-radix algorithm for efficiently computing the MDCT/IMDCT is presented. The proposed mixed-radix MDCT algorithm is composed of two recursive algorithms. The first algorithm, called the radix-2 decimation-in-frequency algorithm, is obtained by decomposing an N-point MDCT into two MDCTs with the length N/2. The second algorithm, called the radix-3 decimation-in-time algorithm, is obtained by decomposing an N -point MDCT into three MDCTs with the length N/3. Since the proposed MDCT algorithm is also expressed in the form of a simple sparse matrix factorization, the corresponding IMDCT algorithm can be easily derived by simply transposing the matrix factorization. Comparison of the proposed algorithm with some existing ones shows that our proposed algorithm is more suitable for parallel implementation and particularly suitable for the layer III of MPEG-1 and MPEG-2 audio encoding and decoding. Moreover, the proposed algorithm can be easily extended to the multidimensional case by using the vector-radix method. 相似文献
14.
Vladeanu C. El Assad S. Carlach J.-C. Quere R. 《Circuits and Systems II: Express Briefs, IEEE Transactions on》2009,56(6):509-513
In this brief, nonlinear digital filters with finite precision are analyzed as recursive systematic convolutional (RSC) encoders. An infinite-impulse-response (IIR) digital filter with finite precision (wordlength of N bits) is a rate-1 RSC encoder over a Galois field GF(2N). The Frey chaotic filter is analyzed for different wordlengths N, and it is demonstrated that the trellis performances can be enhanced by proper filter design. Therefore, a modified definition for the encoding rate is provided, and a trellis design method is proposed for the Frey filter, which consists of reducing the encoding rate from 1 to 1/2. This trellis optimization partially follows Ungerboeck's rules, i.e., increasing the performances of the encoded chaotic transmission in the presence of noise. In fact, it is demonstrated that for the same spectral efficiency, the modified Frey encoder outperforms the original Frey encoder only for N = 2. To show the potential of these nonlinear encoders, it is demonstrated that a particular nonlinear digital filter over GF(4) is equivalent to a GF(2) conventional optimum RSC encoder. The symbol error rate (SER) is estimated for all the proposed schemes, and the results show the expected coding gains as compared to their equivalent nonencoded and linear versions. 相似文献
15.
闪烁体缺陷引起的CT图像伪影修复 总被引:1,自引:1,他引:0
为了修复X射线投影图像中闪烁体缺陷引起的图像伪影,提高X射线投影图像的三维重构质量,结合X射线成像过程中闪烁体缺陷的结构特点,提出了一种改进的BSCB修复算法(IBSCB)。利用Kirsch算子对本底图像进行处理,获得标记出闪烁体缺陷像素的掩膜图像。进而对样品投影图像中相应的缺陷区域按照由外及内的顺序迭代进行修复和扩散,在对外层缺陷区域修复完成后,利用修复后的信息修复内部缺陷区域,并且根据周围缺陷像素的个数确定修复和扩散过程中的迭代系数和迭代次数;对于其中的修复过程,采用log算子滤波,并将滤波后的信息沿等照度线方向扩散实现图像修复。从主观视觉和客观数据两方面对BSCB和IBSCB修复算法进行评价。不同放大倍率下X射线投影图像的修复结果表明:IBSCB不但提高了修复质量,而且其修复速度也比BSCB算法提高了5~6倍。比较修复前后X射线投影图像的三维重构图像,进一步验证了本文算法的有效性。 相似文献
16.
Hillock growth kinetics and size distribution were investigated in Al, Al:Si 1% and Al:Si1%:Cu 0.5% layers. Metallization surface was examined by optical, SEM and TEM microscopy, stylus profiling and an automatic method of hillock recognition from a microscope image. The method allowed for counting hillocks in a desired range of their diameter d. Surface density of hillocks was measured as a function of time of furnace annealing at 400°C and as a function of temperature of RTP annealing. A maximum hillock size was found to increase linearly with metallization layer thickness and with logarithm of annealing time. A total area occupied by hillocks was evaluated. Hillock density decreased versus 1/T with an activation energy of 0.28 eV for Al and 0.31 eV for Al:Si. It was found, that a normalized hillock density N may be expressed by a formula N=N0 exp(−cd). Values for N0 and c are given together with a short discussion. 相似文献
17.
一种基于鱼眼图像的全景展开算法 总被引:1,自引:0,他引:1
针对在全景图像拼接技术中有着广泛应用的鱼眼图像校正问题,这里选择分辨率为800×800大小的鱼眼图片进行实验,利用鱼眼镜头垂直拍摄生成全景图的方法,运用图像像素点矩阵的变换,像素点数量的不变性,拼接其子图像,进而取得了良好的效果,由此得出了一种简单而有效的全景图展开算法。实验证明,算法简单、计算量小、实时性高、获得了良好的校正效果,达到生成全景图像的目的。 相似文献
18.
传统的高光谱图像混合像元分解技术包括端元提取和估计每个端元的混合比例.虽然很多模型都能得到可以接受的解混结果,但是一些未知端元的存在使得结果在包含未知端元的像素点处出现偏差.因此,提出了一种基于支持向量数据描述的高光谱图像混合像元分解算法.首先高光谱图像数据被分成类内和类外两部分,类内是完全由已知端元数据混合的像素点,而类外数据是包含未知端元的像素点.两类数据交界处被认为是已知端元和未知端元混合的数据.然后再对这些像素点进行混合像元分解,分别对仿真数据和真实高光谱图像进行实验.结果表明该算法可以有效地解决因存在未知端元对解混精度的影响,而且能给出未知端元的解混分量.该方法的解混结果几乎不受未知端元的影响,优于直接解混结果 相似文献
19.
针对特殊的全景采集镜头,经拼接及展开运算,得到人眼容易辨识的图像。系统镜头由两片像素阵列为4096×3072的CCD组成,拼接所形成的传感区域包含像素阵列为4096×4096,文中提出一种基于圆心定位的拼接算法,此算法通过采集到的两幅全景图像的圆心,以圆心为基准进行剪切定位,从而实现图像的拼接。并应用改进的分块查表法,将目标图像变为环带块,对拼接后的图像进行展开运算。仿真实验表明,本拼接算法可完成特殊镜头所采集的图像拼接工作、速度快、可靠性能强、符合实际应用要求。 相似文献