共查询到20条相似文献，搜索用时 62 毫秒
1.
2.
双通道SAR振动目标快速检测 总被引：1，自引：1，他引：0
目标的振动会对雷达回波产生特殊的相位调制，称为微多普勒效应，能够提供对微动目标检测的有利信息，因此对提高SAR(Synthetic Aperture Radar)系统性能具有重要意义。然而，已有的检测算法存在运算量大、抗杂波噪声能力弱和无法适应多振动目标等问题。针对这些问题，本文提出一种对振动目标检测的新算法。该算法利用相位中心天线偏置DPCA(Displaced Phase Center Antenna )对消技术消除杂波，并沿方位向累加DPCA信号来提高算法的抗噪声能力。由于振动目标SAR方位回波的频谱与脉冲序列具有高度相似性，本文算法选择了检测重复脉冲序列的脉冲重复频率PRI(Pulse Repetition Interval )变换法来实现振动目标的检测。仿真实验表明，本文算法能够在强杂波噪声条件下检测振动目标，同时具有准确振动频率估计性能，甚至当同一个单元存在多个振动目标时，本文算法依然适用。仿真中振动目标检测的计算机运行总时间不超过0.6 s，说明本文算法适用于实时检测，通过与GLRT算法和Hough变换算法运算量的比较，证明了本文算法相比于经典算法具有运算量小，检测速度快的优点。 相似文献
3.
Maged Marghany 《Journal of the Indian Society of Remote Sensing》2017,45(3):503-511
In this work, the genetic algorithm is utilised for automatic detection of oil spills under wind speed conditions larger than 20 ms?1. The procedure is implemented using sequences of RADARSAT-2 SAR ScanSAR Narrow single beam data acquired in the Gulf of Mexico. The study demonstrates that implementing crossover allows for generation of accurate oil spills pattern. This conclusion is confirmed by the receiver–operating characteristic (ROC) curve. The ROC curve indicates that the existence of oil slick footprints can be identified with the area under the ROC curve and the no-discrimination line of 85 %, which is greater than that of other surrounding environmental features. In conclusion, the genetic algorithm can be used as a tool for the automatic detection of oil spills and the ScanSAR Narrow single beam mode serves as an excellent sensor for oil spill detection and surveying under wind speed larger than 20 ms?1. 相似文献
4.
5.
为实现从低频轨迹数据中提取城市道路交叉口,本文设计了一种基于数据预处理与聚类算法的道路交叉口精准识别方法。首先结合轨迹数据的特征,采用启发式滤波算法对原始数据进行清洗,剔除冗余点与异常点;然后依据车辆的运行规律,提出了一种分步式道路交叉口的提取算法,由此计算出疑似道路交叉口的特征点;最后利用层次密度聚类算法(HDBSCAN)对筛选过后的轨迹点进行聚类并提取质心,得到道路的交叉口,最终以成都市某日的出租车行驶轨迹为数据源,进行试验分析。结果表明,使用该算法提取交叉口,精确率达95.33%、召回率达82.11%、F值达88.46%,能有效且准确识别城市道路交叉口信息,在城市管理与交通规划中具有一定的应用价值。 相似文献
6.
针对步频检测中容易出现步数过计、错计等问题影响行人航迹推算(PDR)室内定位精度,提出一种自适应步频检测算法. 由于智能手机内置加速度传感器直接采集得到的数据存在大量干扰噪声,提出一种组合滤波去噪方法,即将加速度数据依次通过赫尔指数移动平均法、卡尔曼滤波(KF)和低通滤波的预处理滤波组合去除噪声. 然后在不同场景下,如上下楼、水平地面和不限制步速,经过峰谷值去异、自适应动态阈值、峰谷值成对的检测算法后获取峰谷值个数,实现在多场景和多步态下的准确计步. 实验结果表明:相比峰值检测和动态阈值算法,该方法能有效剔除伪真步数且适应于上下楼场景,综合场景下的实验平均精度达到99.44%. 相似文献
7.
8.
Polygonal object is a fundamental type of geometric data in vector GIS. The key step cleaning topological relationship after data collection of polygonal layer is to build polygonal objects from digital arcs. The raw digital arcs may intersect with each other. The algorithm for building polygonal objects after the raw arcs have been split at all intersections is presented. The build-up of polygonal objects in this paper is designed to be implemented by two steps. The first step is to extract all the polygons needed for build-up of polygonal objects from arcs. The second step is to organize polygonal objects from these polygons. For the first step, a tracing algorithm is proposed. The algorithm merely extracts the polygons needed for the build-up of polygonal objects, which is a subset of all the possible polygons that can be induced from the arcs. For the second step, an algorithm based on a specially designed order of polygons is advanced. All the topological relationships among the polygons are shown in a single scan. Experiments show that the two algorithms together offer a robust and efficient solution for building polygonal objects from intersected arcs. 相似文献
9.
WU HuayiWANG YandongGONG Jianya WU Huayi Associate Professor National Laooratory for momation tngineering in Surveying Mapping Remote Sensing Luoyu Road 《地球空间信息科学学报》1999,2(1):63-67
Polygonal object is a fundamental type of geometric data in vector GIS. The key step of cleaning topological relationship after data collection of polygonal layer is to build polygonal objects from digital arcs. The raw digital arcs may intersect with each other. The algorithm for building polygonal objects after the raw arcs have been split at all intersections is presented. The build-up of polygonal objects in this paper is designed to be implemented by two steps. The first step is to extract all the polygons needed for build-up of polygonal objects from arcs. The second step is to organize polygonal objects from these polygons. For the first step, a tracing algorithm is proposed. The algorithm merely extracts the polygons needed for the build-up of polygonal objects, which is a subset of all the possible polygons that can be induced from the arcs. For the second step, an algorithm based on a specially designed order of polygons is advanced. All the topological relationships among the polygons are sho 相似文献
10.
Dimitri Bulatov Peter WernerusChristian Heipke 《ISPRS Journal of Photogrammetry and Remote Sensing》2011,66(6):907-918
We present a new procedure to compute dense 3D point clouds from a sequential set of images. This procedure is considered as a second step of a three-step algorithm for 3D reconstruction from image sequences, whose first step consists of image orientation and the last step is shape reconstruction. We assume that the camera matrices as well as a sparse set of 3D points are available and we strive for obtaining a dense and reliable 3D point cloud. Three novel ideas are presented: (1) for sparse tracking and triangulation, the search space for correspondences is reduced to a line segment by means of known camera matrices and disparity ranges are provided by triangular meshes from the already available points; (2) triangular meshes from extended sets of points are used for dense matching, because these meshes help to reconstruct points in weakly textured areas and present a natural way to obtain subpixel accuracy; (3) two non-local optimization methods, namely, 1D dynamic programming along horizontal lines and semi-global optimization were employed for refinement of local results obtained from an arbitrary number of images. All methods were extensively tested on a benchmark data set and an infrared video sequence. Both visual and quantitative results demonstrate the effectiveness of our algorithm. 相似文献
11.
A Rapid and Automatic MRF-Based Clustering Method for SAR Images 总被引：2，自引：0，他引：2
This letter presents a precise and rapid clustering method for synthetic aperture radar (SAR) images by embedding a Markov random field (MRF) model in the clustering space and using graph cuts (GCs) to search the optimal clusters for the data. The proposed method is optimal in the sense of maximum a posteriori (MAP). It automatically works in a two-loop way: an outer loop and an inner loop. The outer loop determines the cluster number using a pseudolikelihood information criterion based on MRF modeling, and the inner loop is designed in a ldquohardrdquo membership expectation-maximization (EM) style: in the E step, with fixed parameters, the optimal data clusters are rapidly searched under the criterion of MAP by the GC; and in the M step, the parameters are estimated using current data clusters as ldquohardrdquo membership obtained in the E step. The two steps are iterated until the inner loop converges. Experiments on both simulated and real SAR images test the performance of the algorithm. 相似文献
12.
传统的基于影像灰度的控制点匹配算法,存在着运算量大,识别精度较低,约束条件多等不足。为解决上述问题,本文对传统算法进行了优化,主要思路是:在利用遥感影像先验知识确定搜索子区的基础上,首先采用动态模板进行不等距搜索,然后利用灰度相关系数双阈值和等角变换对目标控制点进行判别,最后结合控制点间的空间位置关系对未识别出的控制点进行定位。本文给出具体的实施流程,并结合ASTER和TM两种成像差异显著的图像数据,对优化前后的匹配算法均进行了试验,给出了试验结果和对比分析。结果表明,采用动态模板结合等角变换的匹配算法,无论在运算效率上,还是在控制点识别精度上,都较之传统匹配算法有明显优势,具有较强的适应性和应用价值。 相似文献
13.
Tsallis熵和改进CV模型的海面溢油SAR图像分割 总被引：2，自引：1，他引：1
为了解决海洋表面溢油监测中合成孔径雷达(SAR)图像分割精度不高的难题,提出一种基于Tsallis熵多阈值分割与改进CV(ChanVese)模型相结合的海面溢油图像分割方法。首先采用基于Tsallis熵的多阈值选取算法对海面溢油图像进行粗分割;然后分别将得到的溢油区域和溢油粗略轮廓作为CV模型的局部区域和初始轮廓,以降低CV模型的场景复杂度及其对初始条件的敏感性。CV模型仅考虑了图像各区域的均值信息而没有考虑图像的局部信息,尽管能够得到渐进型边界图像,但其分割结果存在误差。本文采用了加入移动因子的改进CV模型降低分割误差,提高收敛速度。实验结果表明,提出的海面溢油SAR图像分割方法具有分割边界定位准确、运行高效和无需设置初始条件等优点。 相似文献
14.
在启发式分割算法的基础上，引入z检验和标准正态均一性检验（standard normal homogeneity test，SNHT），提出了一种新的阶跃探测法，并将其应用于20个陆态网（Crustal Movement Observation Network ofChina，CMONOC）和10个国际全球卫星导航系统服务（International Global Navigation Satellite System Ser-vice，IGS）参考站近5 a的坐标时间序列。结果显示，对于IGS站东（east，E）、北（north，N）、垂直（up，U）3个方向分量已知阶跃的平均准确探测率分别为68.5%、71.3%、64.8%，且利用阶跃点前后25 d初始拟合残差的平均值之差得到修复后的坐标时间序列保持了良好的连续性。基于剔除粗差后的坐标时间序列，利用坐标时间序列分析软件（coordinate time series analysis software，CATS）估计出的速度显示:对于由已知阶跃与改进算法探测出的阶跃历元的组合方式，所有测站E、N、U方向的估计速度与CMONOC官网发布的速度的平均偏差分别为2.86 mm/a、1.14 mm/a、2.31 mm/a，明显小于由已知阶跃和肉眼判断明显阶跃历元的组合方式获得的平均速度偏差。上述结果表明，改进的启发式分割算法可应用于坐标时间序列的阶跃探测。 相似文献
15.
一种基于图像边缘特征的SAR斑点滤波算法 总被引：1，自引：1，他引：0
合成孔径雷达图像上的斑点噪声会阻碍图像的校准、检验、解译和应用,因此斑点噪声的去除是雷达图像处理的一个重要环节。通常的去噪方法在抑制噪声的同时也使得图像的边缘模糊,细节特征损失。理论和实践表明去除图像的斑点噪声和保持图像的边缘信息是无法同步实现的。为了在去除噪声和保持边缘特征之间进行折衷,本文基于MROA边缘检测算法以及均值滤波算法,提出了一种基于图像边缘特征的斑点噪声滤波算法。实验结果表明该算法能够在平滑图像的同时有效保持边缘特征信息。 相似文献
16.
鉴于影像灰度控制点匹配算法运算量大、识别精度低以及约束条件多等不足，本文对该算法做了改进。主要思路是： 在进行模板运算时，对目标影像采用动态模板进行不等距搜索； 利用灰度相关系数双阈值和等角变换，对目标控制点进行判别； 结合控制点间的空间位置关系，对未识别出的控制点进行定位。文中给出了具体的实施流程，并采用ASTER和TM两种成像差异显著的图像数据，对优化前后的匹配算法进行对比试验。结果表明，改进算法在运算效率、识别精度以及适应性方面，都比传统算法有明显优势。 相似文献
17.
已有的倾斜刃边法受边缘亚像素定位精度、边缘扩散函数(ESF)样本质量及ESF曲线拟合方法的限制,点扩散函数(PSF)重建的稳定性和精度不高。为此,提出了一种优化的基于倾斜刃边的PSF估计方法,将梯度算子引入刃边直线拟合,对刃边边缘进行了高精度的亚像素位置修正;并采用基于移动窗口的ESF去噪及重采样方法精化ESF样本质量;最后通过高斯函数拟合得到稳健的PSF估计值。实验结果表明,改进算法的边缘直线拟合精度优化效果明显,且PSF重建精度较高,稳定性强。 相似文献
18.
《International Journal of Digital Earth》2013,6(11):1077-1097
ABSTRACTThis paper presents an approach to process raw unmanned aircraft vehicle (UAV) image-derived point clouds for automatically detecting, segmenting and regularizing buildings of complex urban landscapes. For regularizing, we mean the extraction of the building footprints with precise position and details. In the first step, vegetation points were extracted using a support vector machine (SVM) classifier based on vegetation indexes calculated from color information, then the traditional hierarchical stripping classification method was applied to classify and segment individual buildings. In the second step, we first determined the building boundary points with a modified convex hull algorithm. Then, we further segmented these points such that each point was assigned to a fitting line using a line growing algorithm. Then, two mutually perpendicular directions of each individual building were determined through a W-k-means clustering algorithm which used the slop information and principal direction constraints. Eventually, the building edges were regularized to form the final building footprints. Qualitative and quantitative measures were used to evaluate the performance of the proposed approach by comparing the digitized results from ortho images. 相似文献
19.
The nonlinear adjustment of GPS observations of type pseudo-ranges is performed in two steps. In step one a combinatorial
minimal subset of observations is constructed which is rigorously converted into station coordinates by means of Groebner
basis algorithm or the multipolynomial resultant algorithm. The combinatorial solution points in a polyhedron are reduced
to their barycentric in step two by means of their weighted mean. Such a weighted mean of the polyhedron points in ℝ3 is generated via the Error Propagation law/variance-covariance propagation. The Fast Nonlinear Adjustment Algorithm (FNon
Ad Al) has been already proposed by Gauss whose work was published posthumously and Jacobi (1841). The algorithm, here referred
to as the Gauss-Jacobi Combinatorial algorithm, solves the over-determined GPS pseudo-ranging problem without reverting to
iterative or linearization procedure except for the second moment (Variance-Covariance propagation). The results compared
well with the solutions obtained using the linearized least squares approach giving legitimacy to the Gauss-Jacobi combinatorial
procedure. ? 2002 Wiley Periodicals, Inc. 相似文献
20.
星载红外数据应用于大型事故溢油 总被引：1，自引：0，他引：1
使用NOAA卫星数据(AVHRR)同时对“阿提哥”号和“塔斯曼海”号溢油事件做出分析和研究。对出事海域的卫星数据进行了拉伸和彩色合成等图像增强处理,突出了影像上的油污特征;并根据其理化特性,设计算法实现了计算机对油污的自动判别;最后,估算了事故所溢油量,为事故后的调查、取证工作提供了良好依据。 相似文献