基于样块改进的图像修复算法

图像修复是指对图像破损区域进行填充或者将图像中多余物体进行移除。在Criminisi算法的基础上进行改进,在待修复块优先权的计算过程中,由于等照度线的曲率可以反映图像的局部特征,块与块之间的方差值可以反映图像的边缘信息,因此,将二者考虑进来,确保修复过程能够准确有序地进行。在寻找最佳匹配块时,将等照度线的曲率也作为一个因素增加进来,有效地提高了最佳匹配块搜索的精确性。经过仿真实验证明,改进后的算法不仅在PSNR值上比原算法有所提高,而且修复结果也比原算法更加准确可靠。     

一种精确定位篡改攻击位置的混沌数字水印算法

基于混沌变换良好的随机性和初始条件极端敏感性,提出了一种精确定位篡改位置的脆弱混沌数字水印算法．该算法将混沌加权后DCT中低频系数作为图像特征,利用混沌DCT匹配块对生成脆弱水印序列,最后嵌入到图像的DCT中频系数中．实验结果与分析表明,该算法几乎不影响图像的视觉质量,对图像篡改区域具有检测有效性和定位准确性,实现了盲认证．该算法不仅提高了篡改定位的精度,虚检率与漏检率也相应降低．     

基于虹膜特征密钥的军事图像加密技术

对军事图像进行加密是确保军事图像安全常用的方法,但加密算法中的长密钥存在记忆困难、不易保管等问题.针对以上问题,文章提出一种基于虹膜特征密钥与AES结合的军事图像加密算法.在虹膜图像预处理基础上,应用2D Haar小波时虹膜有效区域进行三层分解,提取第三层细节系数并编码生成375位的虹膜特征码;从虹膜特征码中随机选取1...     

玻璃瓶动态图像检测运动模拟平台

动态图像检测中,如何在指定位置快速而准确地捕捉到运动物体的图像是最基本的环节。试验验证图像检测装置的成像特性,成为动态图像检测研究的重要内容之一。以变频器控制电动机为核心,通过变频器内部参数编程和外部简单的辅助控制电路,构建了运动平稳、速度可调、具有自动保护功能的模拟平台。该平台适于动态图像检测中普通运动物体的快速模拟,已成功地用于玻璃瓶动态图像装置中,达到了预期目的。     

一种快速检测纹理斑块的方法

提出一种检测纹理图像中的斑块的快速算法。算法利用图像中每个位置的代表块与纹理原型的K -S距离来进行纹理分类。研究了K -S距离的基本性质 ,给出了纹理原型的估计方法和层次快速搜索技术。对合成图像和自然图像的实验结果表明了该方法的有效性     

激光四光束与 PSD 测量运动物体瞬时位置姿态系统的研究

介绍了一种新的光学非接触测量的方法。采用激光四光束与位敏元件 (PSD)测量物体的位置、角度 ,从而确定运动物体某一瞬时的位置姿态。对系统内部结构与信号处理进行了分析研究。实验证明 ,该测量系统具有测量精度高 ,重复稳定性好 ,系统响应速度快 ,测量范围宽等优点 ,且结构紧凑 ,制造成本低 ,应用前景相当广泛。     

基于特征点匹配的图像拼接算法研究

通过查找待拼接两幅图像的对应特征点以确定两幅图像的缝合点,进而确定两者的匹配位置,通过对图像的重叠区域进行平滑过渡处理,实现了待拼接图像的无缝拼接。实验结果表明,文中所提算法合理,取得了良好的效果。     

光滑物体表面反射光偏振特征分析及反射光分离技术

物体表面反射光由镜面反射光和漫反射光组成,针对光滑物体表面镜面反射光和漫反射光的分离问题,建立了一个结合镜面反射和漫反射共同作用的偏振态表征模型,并使用该模型对混合反射区域偏振特征进行分析。基于镜面反射光和漫反射光的偏振特征,根据镜面反射光和漫反射光在光滑物体表面垂直方向及平行方向上的分布关系,采用偏振正交分解的方法实现了镜面反射成分和漫反射成分的求解。利用镜面反射光图像和漫反射光图像之间的相关性,通过梯度下降算法得到镜面反射成分和漫反射成分归一化互相关最小值及其对应的镜面反射偏振度和漫反射偏振度,从而实现反射光的分离。通过对不同场景中获取的反射光图像进行测试,实验结果表明,该算法具有较好的反射光分离效果。     

上下文感知的深度弱监督图像哈希表示学习方法

针对现有深度监督图像哈希表示学习方法依赖于图像的类别信息,难以在现实中被广泛应用问题,利用与图像相关的标签信息作为监督信息,提出上下文感知的深度弱监督图像哈希表示学习方法。该方法一方面通过自适应捕获图像区域特征的相关上下文来增强它们的表示能力,另一方面通过引入判别损失来提高学习到的哈希码表示的判别性。在现有两个公开数据集上的大量实验结果证明了该方法的有效性。     

基于改进零树小波的图像压缩算法在舰船故障远程诊断中的应用

结合舰船故障远程诊断中图像压缩、传输存在的问题和特点,提出对故障诊断图像实现感兴趣区域无损编码与背景区域高压缩比压缩相结合的思路。比较JPEG和JPEG2000算法的编码过程及缺陷,利用小波变换具有多分辨率分析的特点,提出了基于改进零树小波算法。以离散小波变换为基础,产生嵌入式码流,利用较粗尺度系数来预测较细尺度系数。针对某型燃气轮机的零级动叶部位破损的故障,完成了舰船故障远程诊断中机电设备故障图像的压缩应用研究。研究表明:原始图像压缩后能有效降低数据量;重构图像中的感兴趣区域清晰,说明改进零树小波算法完全能满足远程诊断需求。     

Mixed rules in multi‐issue allocation situations

Multi‐issue allocation situations study problems where an estate must be divided among a group of agents. The claim of each agent is a vector specifying the amount claimed by each agent on each issue. We present a two‐stage rule. First, we divide the estate among the issues following the constrained equal awards rule. Second, the amount assigned to each issue is divided among the agents in proportion to their demands on this issue. We apply the rule to two real‐world problems: the distribution of natural resources between countries and the distribution of budget for education and research between universities.     

A three-echelon,multi-item model for recoverable items

The main objective of this paper is to develop a mathematical model for a particular type of three-echelon inventory system. The proposed model is being used by the Air Force to evaluate inventory investment requirements for alternative logistic structures. The system we will model consists of a group of locations, called bases, and a central depot. The items of concern in our analysis are called recoverable items, that is, items that can be repaired when they fail. Furthermore, each item has a modular or hierarchical design. Briefly, the model is used to determine the stock levels at each location for each item so as to achieve optimum inventory-system performance for a given level of investment. An algorithm for the computation of stock levels for each item and location is developed and illustrated. Some of the ways the model can be used are illustrated with Air Force data.     

AN ALGORITHM FOR THE SEGREGATED STORAGE PROBLEM

The segregated storage problem involves the optimal distribution of products among compartments with the restriction that only one product may be stored in each compartment. The storage capacity of each compartment, the storage demand for each product, and the linear cost of storing one unit of a product in a given compartment are specified. The problem is reformulated as a large set-packing problem, and a column generation scheme is devised to solve the associated linear programming problem. In case of fractional solutions, a branch and bound procedure is utilized. Computational results are presented.     

Scheduling of depalletizing and truck loading operations in a food distribution system

This paper studies a scheduling problem arising in a beef distribution system where pallets of various types of beef products in the warehouse are first depalletized and then individual cases are loaded via conveyors to the trucks which deliver beef products to various customers. Given each customer's demand for each type of beef, the problem is to find a depalletizing and truck loading schedule that fills all the demands at a minimum total cost. We first show that the general problem where there are multiple trucks and each truck covers multiple customers is strongly NP‐hard. Then we propose polynomial‐time algorithms for the case where there are multiple trucks, each covering only one customer, and the case where there is only one truck covering multiple customers. We also develop an optimal dynamic programming algorithm and a heuristic for solving the general problem. By comparing to the optimal solutions generated by the dynamic programming algorithm, the heuristic is shown to be capable of generating near optimal solutions quickly. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

A dynamic nonlinear constrained optimal replacement model

A stochastically constrained optimal replacement model for capital equipment is constructed. Each piece of capital equipment, or machine, is characterized by its age and “utility” or “readiness” class. The readiness of a machine at any age is a stochastic function of its initial utility class and its age. The total discounted replacement cost of several replacement streams, each commencing with an initial machine, is minimized with respect to the replacement age and initial utility class of each machine, subject to a readiness constraint stating the lower bound on the expected number of machines in each utility class at any time. A general solution procedure is outlined and a specific case is solved in detail.     

The truck assignment problem

Let us consider the following problem: A group of cement factories produces several types of cement, but each factory produces only one type. There is also a group of purchasers and each purchaser may need several types of cement. The amounts supplied and the demands are assumed to be known for each cement factory and each purchaser. Each cement factory has several trucks, but there is only one dispatcher for ail of the trucks from all of the factories. It is assumed that the entire lcad of each truck is for one purchaser only. A truck begins its workday by leaving its base depot loaded and ends its day by returning to it empty. During the day it may be required to transport cement from any of the cement factories. The distances from various factories to individual purchasers are known. The problem to be solved is that of finding a truck schedule such that cement in the needed quantities is delivered daily to the individual purchasers and in such a manner that the total truck-kilometers traveled will be as small as possible. This paper presents the method of solution, though the assumption of an 8-hour workday may not be met. On the other hand, there are methods developed for effecting a variety of cyclic routings which can be used to lend considerable flexibility to the schedules.     

Grand Strategy vs. Emergent Strategy in the conduct of foreign policy

Does a great power need to formulate a long-term Grand Strategy to guide its foreign policy actions? While some scholars continue to debate the competing merits of various grand strategies, a growing literature now emphasizes emergent learning and improvisation as the keys to success, as opposed to implementing a long-term design. In this article, I explore these scholarly arguments by framing the debate as one between two schools of thought, Grand Strategy and Emergent Strategy. After presenting the main arguments and the historical examples associated with each school, I evaluate the two approaches across four categories: the type of international security environment each of them is most suited for, the way each approach deals with short-term vs. long-term priorities, the domestic political conditions needed for each approach to be successful, and the type of presidential management qualities each school demands. Lastly, I discuss the implications of these arguments for the scholarship and the practice of foreign policy and national security strategy.     

A theory of ideal linear weights for heterogeneous combat forces

Detailed combat simulations can produce effectiveness tables which measure the effectiveness of each weapon class on one side of an engagement, battle, or campaign to each weapon class on the other. Effectiveness tables may also be constructed in other ways This paper assumes that effectiveness tables are given and shows how to construct from them a system of weapon weights each of which is a weighted average of the effects of a given weapon against each of the enemy's weapons. These weights utilize the Perron- Frobenius theory of eigenvectors of nonnegative matrices. Methods of calculation are discussed and some interpretations are given for both the irreducible and reducible cases.     

Geometric programming with multiplicative slack variables

A posynomial geometric programming problem formulated so that the number of objective function terms is equal to the number of primal variables will have a zero degree of difficulty when augmented by multiplying each constraint term by a slack variable and including a surrogate constraint composed of the product of the slack variables, each raised to an undetermined negative exponent or surrogate multiplier. It is assumed that the original problem is canonical. The exponents in the constraint on the product of the slack variables must be estimated so that the associated solution to the augmented problem, obtained immediately, also solves the original problem. An iterative search procedure for finding the required exponents, thus solving the original problem, is described. The search procedure has proven quite efficient, often requiring only two or three iterations per degree of difficulty of the original problem. At each iteration the well-known procedure for solving a geometric programming problem with a zero degree of difficulty is used and so computations are simple. The solution generated at each iteration is optimal for a problem which differs from the original problem only in the values of some of the constraint coefficients, so intermediate solutions provide useful information.     

The bottleneck transportation problem

The bottleneck transportation problem can be stated as follows: A set of supplies and a set of demands are specified such that the total supply is equal to the total demand. There is a transportation time associated between each supply point and each demand point. It is required to find a feasible distribution (of the supplies) which minimizes the maximum transportaton time associated between a supply point and a demand point such that the distribution between the two points is positive. In addition, one may wish to find from among all optimal solutions to the bottleneck transportation problem, a solution which minimizes the total distribution that requires the maximum time Two algorithms are given for solving the above problems. One of them is a primal approach in the sense that improving fcasible solutions are obtained at each iteration. The other is a “threshold” algorithm which is found to be far superior computationally.