期刊文献+
共找到860篇文章
< 1 2 43 >
每页显示 20 50 100
Five modified boundary scan adaptive test generation algorithms 被引量:1
1
作者 Niu Chunping Ren Zheping Yao Zongzhong 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2006年第4期760-763,768,共5页
To study the diagnostic problem of Wire-OR (W-O) interconnect fault of PCB (Printed Circuit Board), five modified boundary scan adaptive algorithms for interconnect test are put forward. These algorithms apply Glo... To study the diagnostic problem of Wire-OR (W-O) interconnect fault of PCB (Printed Circuit Board), five modified boundary scan adaptive algorithms for interconnect test are put forward. These algorithms apply Global-diagnosis sequence algorithm to replace the equal weight algorithm of primary test, and the test time is shortened without changing the fault diagnostic capability. The descriptions of five modified adaptive test algorithms are presented, and the capability comparison between the modified algorithm and the original algorithm is made to prove the validity of these algorithms. 展开更多
关键词 boundary scan adaptive test interconnect test algorithm.
在线阅读 下载PDF
Structural plane recognition from three-dimensional laser scanning points using an improved region-growing algorithm based on the robust randomized Hough transform 被引量:2
2
作者 XU Zhi-hua GUO Ge +3 位作者 SUN Qian-cheng WANG Quan ZHANG Guo-dong YE Run-qing 《Journal of Mountain Science》 SCIE CSCD 2023年第11期3376-3391,共16页
The staggered distribution of joints and fissures in space constitutes the weak part of any rock mass.The identification of rock mass structural planes and the extraction of characteristic parameters are the basis of ... The staggered distribution of joints and fissures in space constitutes the weak part of any rock mass.The identification of rock mass structural planes and the extraction of characteristic parameters are the basis of rock-mass integrity evaluation,which is very important for analysis of slope stability.The laser scanning technique can be used to acquire the coordinate information pertaining to each point of the structural plane,but large amount of point cloud data,uneven density distribution,and noise point interference make the identification efficiency and accuracy of different types of structural planes limited by point cloud data analysis technology.A new point cloud identification and segmentation algorithm for rock mass structural surfaces is proposed.Based on the distribution states of the original point cloud in different neighborhoods in space,the point clouds are characterized by multi-dimensional eigenvalues and calculated by the robust randomized Hough transform(RRHT).The normal vector difference and the final eigenvalue are proposed for characteristic distinction,and the identification of rock mass structural surfaces is completed through regional growth,which strengthens the difference expression of point clouds.In addition,nearest Voxel downsampling is also introduced in the RRHT calculation,which further reduces the number of sources of neighborhood noises,thereby improving the accuracy and stability of the calculation.The advantages of the method have been verified by laboratory models.The results showed that the proposed method can better achieve the segmentation and statistics of structural planes with interfaces and sharp boundaries.The method works well in the identification of joints,fissures,and other structural planes on Mangshezhai slope in the Three Gorges Reservoir area,China.It can provide a stable and effective technique for the identification and segmentation of rock mass structural planes,which is beneficial in engineering practice. 展开更多
关键词 3D laser scanning Rock discontinuity structural plane Intelligent recognition Robust randomized Hough transform Improved region growing algorithm
原文传递
Improvement of Binocular Reconstruction Algorithm for Measuring 3D Pavement Texture Using a Single Laser Line Scanning Constraint 被引量:1
3
作者 Yuanyuan Wang RuiWang +1 位作者 Xiaofeng Ren Junan Lei 《Computer Modeling in Engineering & Sciences》 SCIE EI 2023年第8期1951-1972,共22页
The dense and accurate measurement of 3D texture is helpful in evaluating the pavement function.To form dense mandatory constraints and improve matching accuracy,the traditional binocular reconstruction technology was... The dense and accurate measurement of 3D texture is helpful in evaluating the pavement function.To form dense mandatory constraints and improve matching accuracy,the traditional binocular reconstruction technology was improved threefold.First,a single moving laser line was introduced to carry out global scanning constraints on the target,which would well overcome the difficulty of installing and recognizing excessive laser lines.Second,four kinds of improved algorithms,namely,disparity replacement,superposition synthesis,subregion segmentation,and subregion segmentation centroid enhancement,were established based on different constraint mechanism.Last,the improved binocular reconstruction test device was developed to realize the dual functions of 3D texture measurement and precision self-evaluation.Results show that compared with traditional algorithms,the introduction of a single laser line scanning constraint is helpful in improving the measurement’s accuracy.Among various improved algorithms,the improvement effect of the subregion segmentation centroid enhancement method is the best.It has a good effect on both overall measurement and single pointmeasurement,which can be considered to be used in pavement function evaluation. 展开更多
关键词 3D pavement texture binocular reconstruction algorithm single laser line scanning constraint improved stereo matching
在线阅读 下载PDF
A novel algorithm for transmission image reconstruction of tomographic gamma scaners 被引量:1
4
作者 ZHANG Quanhu HUI Weihua +4 位作者 WANG Dong HE Bin GU Zhongmao LI Ze QIAN Shaojun 《Nuclear Science and Techniques》 SCIE CAS CSCD 2010年第3期177-181,共5页
It is difficult to develop image reconstruction algorithms for tomographic gamma scanning based on drummed radioactive residues or wastes.In this paper,a novel reconstruction algorithm of transmission image for tomogr... It is difficult to develop image reconstruction algorithms for tomographic gamma scanning based on drummed radioactive residues or wastes.In this paper,a novel reconstruction algorithm of transmission image for tomographic gamma scanning is proposed.It is based on the conventional transmission equation and equivalent gamma-ray track length modified by a Monte Carlo method.The algorithm is implemented by simulating the samples on the established platform.For the verification experiments of the algorithm,several cubic voxel samples were designed and manufactured.Experimental tests were conducted.The tomographic gamma scanning of transmission images is compared with the linear attenuation coefficients by the simulated values and experimental data with the algorithm and the reference values.The results show that the absolute relative errors of the reconstructed images are less than 5%. 展开更多
关键词 图像重建算法 层析γ扫描 传输方程 蒙特卡罗方法 线性衰减系数 模拟平台 扫描算法 伽玛射线
在线阅读 下载PDF
A Fourier Reconstruction Algorithm in π-Scheme Short-Scan SPECT 被引量:2
5
作者 SHI Tingting WANG Jinping 《Wuhan University Journal of Natural Sciences》 CAS 2013年第2期97-101,共5页
In this paper, an approximate analytical algorithm in the form of direct Fourier reconstruction is obtained for the recon- struction of data functions arisen from ^-scheme short-scan sin- gle-photon emission computed ... In this paper, an approximate analytical algorithm in the form of direct Fourier reconstruction is obtained for the recon- struction of data functions arisen from ^-scheme short-scan sin- gle-photon emission computed tomography(SPECT) with uniform attenuation, and the modified central slice theorem is developed. Numerical simulations are conducted to demonstrate the effec- tiveness of the developed method. 展开更多
关键词 single-photon emission computed tomography(SPECT) inversion formula Fourier reconstruction algorithm thecentral slice theorem n -scheme short-scan
原文传递
The multi-motion-overlap algorithms for minimizing the time between successive scans of wafer stage
6
作者 潘海鸿 Chen Lin +1 位作者 Li Xiaoqing Zhou Yunfei 《High Technology Letters》 EI CAS 2008年第3期282-288,共7页
In order to optimize the transitional time during the successive exposure scans for a step-and-scan lithography and improve the productivity in a wafer production process, an investigation of the motion trajectory pla... In order to optimize the transitional time during the successive exposure scans for a step-and-scan lithography and improve the productivity in a wafer production process, an investigation of the motion trajectory planning along the scanning direction for wafer stage was carried out. The motions of wafer stage were divided into two respective logical moves (i. e. step-move and scan-move) and the multi-motionoverlap algorithms (MMOA) were presented for optimizing the transitional time between the successive exposure scans. The conventional motion planning method, the Hazelton method and the MMOA were analyzed theoretically and simulated using MATLAB under four different exposure field sizes. The results show that the total time between two successive scans consumed by MMOA is reduced by 4.82%, 2.62%, 3.06% and 3.96%, compared with those of the conventional motion planning method; and reduced by 2.58%, 0.76%, 1.63% and 2.92%, compared with those of the Hazehon method respectively. The theoretical analyses and simulation results illuminate that the MMOA can effectively minimize the transitional step time between successive exposure scans and therefore increase the wafer fabricating productivity. 展开更多
关键词 multi-motion-overlap algorithm minimizing time successive exposure scans wafer stage step-and-scan lithography
在线阅读 下载PDF
Sparse optimization of planar radio antenna arrays using a genetic algorithm
7
作者 Jiarui Di Liang Dong Wei He 《Astronomical Techniques and Instruments》 2025年第2期100-110,共11页
Radio antenna arrays have many advantages for astronomical observations,such as high resolution,high sensitivity,multi-target simultaneous observation,and flexible beam formation.Problems surrounding key indices,such ... Radio antenna arrays have many advantages for astronomical observations,such as high resolution,high sensitivity,multi-target simultaneous observation,and flexible beam formation.Problems surrounding key indices,such as sensitivity enhancement,scanning range extension,and sidelobe level suppression,need to be solved urgently.Here,we propose a sparse optimization scheme based on a genetic algorithm for a 64-array element planar radio antenna array.As optimization targets for the iterative process of the genetic algorithm,we use the maximum sidelobe levels and beamwidth of multiple cross-section patterns that pass through the main beam in three-dimensions,with the maximum sidelobe levels of the patterns at several different scanning angles.Element positions are adjusted for iterations,to select the optimal array configuration.Following sparse layout optimization,the simulated 64-element planar radio antenna array shows that the maximum sidelobe level decreases by 1.79 dB,and the beamwidth narrows by 3°.Within the scan range of±30°,after sparse array optimization,all sidelobe levels decrease,and all beamwidths narrow.This performance improvement can potentially enhance the sensitivity and spatial resolution of radio telescope systems. 展开更多
关键词 Planar antenna array Sparse optimization Genetic algorithm Wide-angle scanning
在线阅读 下载PDF
平面点集凸包Graham算法的改进 被引量:34
8
作者 吴文周 李利番 王结臣 《测绘科学》 CSCD 北大核心 2010年第6期123-125,共3页
本文提出了一种计算平面点集最小凸包的快速算法。该算法首先对平面点集进行扫描,查找到最左、最右、最上、最下4个方向上的极值点,以此构造出一个初始凸包,并删除初始凸包内部的所有点;然后把剩余点集分组,每组运用格雷厄姆(Graham)算... 本文提出了一种计算平面点集最小凸包的快速算法。该算法首先对平面点集进行扫描,查找到最左、最右、最上、最下4个方向上的极值点,以此构造出一个初始凸包,并删除初始凸包内部的所有点;然后把剩余点集分组,每组运用格雷厄姆(Graham)算法生成一个新的凸包;最后将所有子集凸包的顶点看作一个新的点集,再次运用Graham算法生成最终凸包。测试结果表明,改进后的算法可较大幅度地提高执行效率。 展开更多
关键词 最小凸包 graham算法 地理信息系统
原文传递
基于凸包Graham扫描法的多系统融合精密单点定位快速选星算法 被引量:11
9
作者 杨松 张显云 +2 位作者 杜宁 龙新 胡思华 《大地测量与地球动力学》 CSCD 北大核心 2018年第2期181-186,共6页
鉴于传统选星算法不能快速获得理想的卫星空间构型,在讨论定位精度计算模型、多系统融合GDOP值影响因素和分析基于凸包Graham扫描的选星算法原理的基础上,编程实现了基于凸包Graham扫描法的多系统融合精密单点定位快速选星算法,并对该... 鉴于传统选星算法不能快速获得理想的卫星空间构型,在讨论定位精度计算模型、多系统融合GDOP值影响因素和分析基于凸包Graham扫描的选星算法原理的基础上,编程实现了基于凸包Graham扫描法的多系统融合精密单点定位快速选星算法,并对该算法的选星效果及定位效率进行仿真实验。结果表明,该算法的选星数能够稳定在8~10颗,其星座GDOP得到明显优化,空间构型得到明显改善;与传统方法相比,X、Y、H方向收敛时间的优化率分别达到40%、20%和7%,且定位精度更高,对于促进模糊度快速固定和改善定位效率有重要意义。 展开更多
关键词 多系统融合精密单点定位 选星 凸包graham扫描法 收敛速度
在线阅读 下载PDF
一种基于Graham三角剖分生成Delaunay三角网的算法 被引量:2
10
作者 宋晓宇 李东 +1 位作者 王永会 王洪信 《沈阳建筑大学学报(自然科学版)》 EI CAS 2007年第2期328-331,共4页
目的提出一种基于Graham三角剖分生成Delaunay三角网的算法,加快Delaunay三角网的生成速度.方法首先按Graham扫描法对平面散乱点集进行排序,然后将排好序的点通过可见点的判断连接成Graham三角网,最后利用拓扑结构快速进行优化,使其成为... 目的提出一种基于Graham三角剖分生成Delaunay三角网的算法,加快Delaunay三角网的生成速度.方法首先按Graham扫描法对平面散乱点集进行排序,然后将排好序的点通过可见点的判断连接成Graham三角网,最后利用拓扑结构快速进行优化,使其成为Delaunay三角网.结果通过500至10000个点的测试,表明这种基于Graham三角剖分生成Delaunay三角网的生成速度快于传统基于凸包生成Delaunay三角网的生成速度.结论采用可见点表的数据结构以及利用点、边、三角形的有序性的特点构建Delaunay三角网,是提高建网速度的关键. 展开更多
关键词 graham扫描法 graham三角网 DELAUNAY三角网 可见点
在线阅读 下载PDF
结合二叉树和Graham扫描技术的高效Delaunay三角网构建算法 被引量:5
11
作者 李根 邹志文 鞠时光 《计算机应用研究》 CSCD 北大核心 2010年第3期894-896,共3页
为了提高不规则三角网的构建速度,提出了一种高效构建Delaunay三角网算法。首先对平面上的离散点集按一定的阈值进行分块,建立子块索引二叉树,然后利用Graham扫描技术对各子块构建Delaunay三角网,最后自底向上合并具有相同父节点的子块... 为了提高不规则三角网的构建速度,提出了一种高效构建Delaunay三角网算法。首先对平面上的离散点集按一定的阈值进行分块,建立子块索引二叉树,然后利用Graham扫描技术对各子块构建Delaunay三角网,最后自底向上合并具有相同父节点的子块。通过具体实验与其他构网算法比较,该算法在构网速度上具有明显的优越性。 展开更多
关键词 二叉树 DELAUNAY三角网 graham扫描技术 数据分块
在线阅读 下载PDF
Grid-Scan算法定位精度和定位率的改进 被引量:3
12
作者 李牧东 熊伟 梁青 《计算机应用》 CSCD 北大核心 2012年第12期3521-3524,共4页
针对Grid-Scan算法定位率及定位精度较低的问题,提出了一种基于虚拟锚节点的Grid-Scan定位算法。具体做了3个方面的工作:有邻居锚节点的未知节点只利用邻居锚节点进行定位,定位后的节点升级为虚拟锚节点;没有邻居锚节点的未知节点利用... 针对Grid-Scan算法定位率及定位精度较低的问题,提出了一种基于虚拟锚节点的Grid-Scan定位算法。具体做了3个方面的工作:有邻居锚节点的未知节点只利用邻居锚节点进行定位,定位后的节点升级为虚拟锚节点;没有邻居锚节点的未知节点利用虚拟锚节点完成定位;锚节点及虚拟锚节点与未知节点采用不同的通信半径进行扫描并完成定位。仿真结果表明,相比传统算法,改进算法的定位精度和定位率分别平均提高了约6.35%和23.37%。 展开更多
关键词 无线传感器网络 Grid-scan算法 定位率 定位精度
在线阅读 下载PDF
Grid-Scan定位算法的虚拟锚节点策略改进 被引量:3
13
作者 宋海声 朱长驹 +1 位作者 杨鸿武 吴佳欣 《计算机工程与应用》 CSCD 北大核心 2017年第16期84-88,109,共6页
针对无线传感器网络中Grid-Scan算法定位精度较低的问题,提出了一种基于虚拟锚节点策略的Grid-Scan定位算法。具体做了三个方面的工作:对未知节点设置可定位阈值,邻居锚节点数大于可定位阈值的未知节点使用Grid-Scan算法进行定位,定位... 针对无线传感器网络中Grid-Scan算法定位精度较低的问题,提出了一种基于虚拟锚节点策略的Grid-Scan定位算法。具体做了三个方面的工作:对未知节点设置可定位阈值,邻居锚节点数大于可定位阈值的未知节点使用Grid-Scan算法进行定位,定位后的节点升级为虚拟锚节点;邻居锚节点数小于可定位阈值的未知节点利用极大似然法完成定位,定位后的节点升级为虚拟锚节点;锚节点及虚拟锚节点共同参与对剩余未知节点的定位。仿真结果表明,改进算法在不同锚节点密度、不同通信半径和不同栅格大小的网络中以及通过不规则传播模型后都具有较好的定位精度。 展开更多
关键词 无线传感器网络 Grid-scan算法 定位精度 虚拟锚节点 可定位阈值 极大似然法
在线阅读 下载PDF
一种基于Graham扫描算法的空间点云结构化算法研究 被引量:10
14
作者 王凯 支煜 +1 位作者 陈浩 张毅坤 《现代电子技术》 北大核心 2018年第14期139-142,146,共5页
在过度包装检测过程中,针对商品三维重建后的散乱点云无法进行后续空隙率判定的问题,提出一种基于Denaunay三角化和凸包算法的散乱点云结构化方法。首先,因为空间点云结构复杂,所以将空间点云进行切片和投影操作,也就是降维操作;其次,... 在过度包装检测过程中,针对商品三维重建后的散乱点云无法进行后续空隙率判定的问题,提出一种基于Denaunay三角化和凸包算法的散乱点云结构化方法。首先,因为空间点云结构复杂,所以将空间点云进行切片和投影操作,也就是降维操作;其次,对投影数据点进行结构化处理,寻找初始点,依次对投影点按照极角大小进行排序;最后利用所构造的扫描线对数据点进行筛选和结构化。实验表明,基于Denaunay三角化和凸包算法的散乱点云结构化方法处理时间短,稳定性和精度高、适用性强,完全满足过度包装检测系统。与目前方法相比,该方法有更好的适用性,能够满足大多数平台的需求。 展开更多
关键词 过度包装 散乱点云 graham扫描算法 Denaunay三角化 凸包算法 点云结构化
在线阅读 下载PDF
基于GPU的二维凸壳计算并行Graham扫描算法 被引量:1
15
作者 龙沁圆 梅钢 《晓庄学院自然科学学报》 CAS 北大核心 2020年第6期66-73,92,共9页
本文基于图形处理器(GPU)提出了一种用于计算二维散落点凸包的并行Graham扫描算法。提出的基于GPU的并行算法主要包含以下两个步骤:(1)在GPU上进行两轮并行剔除内部点操作。首先将4个极值点构成的四边形内的内部点剔除,并按角度对剩余... 本文基于图形处理器(GPU)提出了一种用于计算二维散落点凸包的并行Graham扫描算法。提出的基于GPU的并行算法主要包含以下两个步骤:(1)在GPU上进行两轮并行剔除内部点操作。首先将4个极值点构成的四边形内的内部点剔除,并按角度对剩余点进行排序,将其分为左右两个区域。对于每个区域,采用所提出的预处理方法进行第二轮过滤以进一步剔除内部点。(2)通过计算剩余点的凸壳得到所需全部散乱点的凸壳。为提高并行算法的效率,采用了CUDA开发组件中Thrust库提供的并行排序、并行规约等高效操作。比较结果表明,所提出的并行算法能在0.5秒内计算出20 M散乱点的凸壳,计算效率比现有的基准算法(即著名的QuickHull算法)提高了6~7倍;且该并行算法过程简单,易于编程实现。 展开更多
关键词 凸壳 格雷厄姆扫描算法 分治算法 并行算法 GPU
在线阅读 下载PDF
改进的Graham扫描三角形化简单多边形算法及其实现
16
作者 孔宪庶 《大连铁道学院学报》 1991年第4期50-54,共5页
Graham 扫描在计算几何中是一种基本的后追踪技术.Graham 扫描三角形化简单多边形算法三角形化一个,1个顶点的简单多边形 P 的时间为 D(kn),k-1是多边形 P 的凹顶点数.在最坏的情况下,此算法为 O(n^2).其数据结构简单,运行速度快、极易... Graham 扫描在计算几何中是一种基本的后追踪技术.Graham 扫描三角形化简单多边形算法三角形化一个,1个顶点的简单多边形 P 的时间为 D(kn),k-1是多边形 P 的凹顶点数.在最坏的情况下,此算法为 O(n^2).其数据结构简单,运行速度快、极易应用.改进后的算法进一步简化了检测“耳朵”的步骤,使之更严谨、简明,并用 C 语言编程实现了改进后的算法. 展开更多
关键词 多边形 graham扫描 对角线 计算机
在线阅读 下载PDF
An assessment of arctic sea ice concentration retrieval based on “HY-2” scanning radiometer data using field observations during CHINARE-2012 and other satellite instruments 被引量:7
17
作者 SHI Lijiang LU Peng +4 位作者 CHENG Bin KARVONEN Juha WANG Qimao LI Zhijun HAN Hongwei 《Acta Oceanologica Sinica》 SCIE CAS CSCD 2015年第3期42-50,共9页
A retrieval algorithm of arctic sea ice concentration (SIC) based on the brightness temperature data of “HY-2” scanning microwave radiometer has been constructed. The tie points of the brightness temperature were ... A retrieval algorithm of arctic sea ice concentration (SIC) based on the brightness temperature data of “HY-2” scanning microwave radiometer has been constructed. The tie points of the brightness temperature were selected based on the statistical analysis of a polarization gradient ratio and a spectral gradient ratio over open water (OW), first-year ice (FYI), and multiyear ice (MYI) in arctic. The thresholds from two weather filters were used to reduce atmospheric effects over the open ocean. SIC retrievals from the “HY-2” radiom-eter data for idealized OW, FYI, and MYI agreed well with theoretical values. The 2012 annual SIC was calcu-lated and compared with two reference operational products from the National Snow and Ice Data Center (NSIDC) and the University of Bremen. The total ice-covered area yielded by the “HY-2” SIC was consistent with the results from the reference products. The assessment of SIC with the aerial photography from the fifth Chinese national arctic research expedition (CHINARE) and six synthetic aperture radar (SAR) images from the National Ice Service was carried out. The “HY-2” SIC product was 16% higher than the values de-rived from the aerial photography in the central arctic. The root-mean-square (RMS) values of SIC between “HY-2” and SAR were comparable with those between the reference products and SAR, varying from 8.57% to 12.34%. The “HY-2” SIC is a promising product that can be used for operational services. 展开更多
关键词 “HY-2” scanning microwave radiometer retrieval algorithm sea ice concentration ARCTIC
在线阅读 下载PDF
Research of Large Field of View Scan Mode for Industrial CT 被引量:4
18
作者 傅健 路宏年 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2003年第1期59-64,共6页
For industrial computed tomography systems, generation II scan mode has a large field of view but time consuming and generation III has a small field of view but fast. In order to realize the rapid ICT test of large ... For industrial computed tomography systems, generation II scan mode has a large field of view but time consuming and generation III has a small field of view but fast. In order to realize the rapid ICT test of large objects, a scan mode based on generation III called large field of view scan was discussed and its reconstruction algorithm based on FBP was deduced. The validity of the algorithm was verified by the results of computer simulation and experiments. Analysis showed that the effective scan field of view could be improved by more than 90% compared with that of generation III. 展开更多
关键词 industrial computed tomography fan beam scan filter back projection algorithm rebin algorithm non destructive testing
在线阅读 下载PDF
Improved Reduced Latency Soft-Cancellation Algorithm for Polar Decoding 被引量:2
19
作者 Xiumin Wang Rui Gu +1 位作者 Jun Li Qiangqiang Ma 《China Communications》 SCIE CSCD 2020年第5期65-77,共13页
Soft-cancellation(SCAN) is a soft output iterative algorithm widely used in polar decoding. This algorithm has better decoding performance than reduced latency soft-cancellation(RLSC) algorithm, which can effectively ... Soft-cancellation(SCAN) is a soft output iterative algorithm widely used in polar decoding. This algorithm has better decoding performance than reduced latency soft-cancellation(RLSC) algorithm, which can effectively reduce the decoding delay of SCAN algorithm by 50% but has obvious performance loss. A modified reduced latency soft-cancellation(MRLSC) algorithm is presented in the paper. Compared with RLSC algorithm, LLR information storage required in MRLSC algorithm can be reduced by about 50%, and better decoding performance can be achieved with only a small increase in decoding delay. The simulation results show that MRLSC algorithm can achieve a maximum block error rate(BLER) performance gain of about 0.4 dB compared with RLSC algorithm when code length is 2048. At the same time, compared with the performance of several other algorithms under(1024, 512) polar codes, the results show that the throughput of proposed MRLSC algorithm has the advantage at the low and medium signal-to-noise ratio(SNR) and better BLER performance at the high SNR. 展开更多
关键词 polar codes belief propagation scan algorithm RLSC algorithm ITERATION
在线阅读 下载PDF
Multiple helical scans and the reconstruction of over FOV-sized objects in cone-beam CT 被引量:1
20
作者 韩玉 闫镔 +3 位作者 李磊 宇超群 李建新 包尚联 《Chinese Physics B》 SCIE EI CAS CSCD 2012年第6期588-594,共7页
In cone-beam computed tomography (CBCT), there are often cases where the size of the specimen is larger than the field of view (FOV) (referred to as over FOV-sized (OFS)). To acquire the complete projection da... In cone-beam computed tomography (CBCT), there are often cases where the size of the specimen is larger than the field of view (FOV) (referred to as over FOV-sized (OFS)). To acquire the complete projection data for OFS objects, some scan modes have been developed for long objects and short but over-wide objects. However, these modes still cannot meet the requirements for both longitudinally long and transversely wide objects. In this paper, we propose a multiple helical scan mode and a corresponding reconstruction algorithm for both longitudinally long and transversely wide objects. The simulation results show that our model can deal with the problem and that the results are acceptable, while the OFS object is twice as long compared with the FOV in the same latitude. 展开更多
关键词 large object multiple helical scans reconstruction algorithm cone-beam computed to-mography
原文传递
上一页 1 2 43 下一页 到第
使用帮助 返回顶部