排序方式: 共有45条查询结果,搜索用时 31 毫秒
1.
非合作目标不提供已知的目标标识器和敏感器件,无疑增加了检测识别的难度.CCD相机能够提供大量包含有非合作目标的尺寸、形状、相对位置和相对姿态等信息的高分辨率图像,用常规方法进行非合作目标图像分割时,由于空间环境的影响,使得目标的轮廓线非常零碎,常掩埋在杂乱的背景分割线中.为了克服这种问题,提出了一种保持边界的整体变分方法和数学形态学相结合的方法.先用整体变分方法对图像进行平滑的同时可以最大限度地保留图像中的轮廓、边缘等特征信息以增强目标的边缘,然后采用数学形态学的方法对其进行膨胀、腐蚀以滤除众多的背景噪声.经大量的实验验证,这种方法可以有效地提取出非合作目标的边缘信息,并可滤除大量噪声,为进一步开展非合作目标识别工作奠定基础. 相似文献
2.
付立柱 《中国人民武装警察部队学院学报》2009,25(9):75-77
近年来,随着国家和地方政府对部队经费投入的不断增长,部队国有资产在数量、质量以及结构上都有了很大的改善。如何建立健全部队国有资产的管理制度,保证部队国有资产的安全完整和有效使用,防止国有资产流失,是当前部队资产管理和使用人员必须思考的现实问题。 相似文献
3.
4.
5.
一幅图像可以分解为匀质结构图和几何纹理图两个分量.基于这种思想,提出了一种使用二代Bandelet和小波对图像进行分层压缩的有效算法.首先,使用全变分方法把原始图像f分解为u和v两部分,其中u代表f中的结构分量,v代表纹理分量;对u进行小波变换,对v进行二代Bandelet变换.采用了自顶向下的四叉树分解算法,优化了二代Bandelet的四叉树建立过程.实验结果表明,该压缩方法的重建图像在视觉效果和客观SSIM值两方面均优于JPEG2000和Bandelets. 相似文献
6.
7.
Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
We study a parallel machine scheduling problem, where a job j can only be processed on a specific subset of machines Mj, and the Mj subsets of the n jobs are nested. We develop a two‐phase heuristic for minimizing the total weighted tardiness subject to the machine eligibility constraints. In the first phase, we compute the factors and statistics that characterize a problem instance. In the second phase, we propose a new composite dispatching rule, the Apparent Tardiness Cost with Flexibility considerations (ATCF) rule, which is governed by several scaling parameters of which the values are determined by the factors obtained in the first phase. The ATCF rule is a generalization of the well‐known ATC rule which is very widely used in practice. We further discuss how to improve the dispatching rule using some simple but powerful properties without requiring additional computation time, and the improvement is quite satisfactory. We apply the Sequential Uniform Design Method to design our experiments and conduct an extensive computational study, and we perform tests on the performance of the ATCF rule using a real data set from a large hospital in China. We further compare its performance with that of the classical ATC rule. We also compare the schedules improved by the ATCF rule with what we believe are Near Optimal schedules generated by a general search procedure. The computational results show that especially with a low due date tightness, the ATCF rule performs significantly better than the well‐known ATC rule generating much improved schedules that are close to the Near Optimal schedules. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 249–267, 2017 相似文献
8.
通过基于级数的粒子编码变换方法,将武器目标分配问题的约束条件进行了化简.对原始类电磁算法,在种群初始化、局部搜索、合力计算以及粒子移动等各步骤对其进行改造,使之适应武器目标分配问题的整数解空间.最后通过数值实验验证了该改造后算法解决武器目标分配问题的有效性. 相似文献
9.
10.
星座自主导航需要对星间可视性规律做定量分析,可为进一步研究星间自主组网策略以及星间网络拓扑设计提供理论依据,同时星上自主建立星间链路需要卫星已知其可视卫星集合,因此有必要研究星间可视性解析算法.建立了基于星上环带天线仰角约束的星间可视性判定模型,结合星座几何特性以及卫星运动规律,以时间为变量,推导了卫星在运动过程中对同... 相似文献