空中目标多波段红外辐射特性描述与仿真分析

针对空中目标在复杂背景下的探测需求,根据实际目标的运动特性,分析目标在飞行高度、飞行姿态角改变时的辐射特点,基于MODTRAN计算得到大气辐射和衰减数据,建立目标的三维模型、热辐射和反射模型,搭建空中目标的红外成像仿真系统.分析和仿真结果表明:在中波波段,目标尾焰的红外辐射比蒙皮强很多,在长波波段,蒙皮的红外辐射比较强,仿真图像的细节比较多,尾焰的红外辐射虽然有所减弱,红外成像效果依旧很好;相同探测条件下,由于位置越高大气越稀薄,探测器的可探测距离会变得比较远.目标红外辐射特性的分析和红外仿真系统的搭建对缩短红外探测器的研制周期和进一步确定探测器波段和系统分辨率等指标提供了参考依据.     

A modification for the mask-filtering approach by superposing anisotropic derivatives in an image

We demonstrate a novel method to modify the mask-filtering approach by enlarging the gray-level difference of any two nearby pixels in an image. Derivatives are calculated in different directions respectively instead of isotropically. Some higher spatial frequencies are then selectively magnified. The final image has better sharpened fine characteristics than that enhanced by the conventional technique.     

用于校准能见度仪的标准散射体定标系统的校准方法

为了实现对用于校准能见度仪的标准散射体的快速准确定标,通过测量标准散射体不同散射角的散射系数,实现对标准散射体不同散射角所模拟的大气能见度进行准确定标并对定标系统进行校准.根据定标系统的组成与工作原理,确定定标系统的校准方法并建立相应的校准链,并设计校准链的各组成部分的校准方法.通过对已知散射系数的标准散射体进行定标,验证校准后定标系统定标结果的准确性,进而验证了定标系统校准方法的正确性.实验结果证明:定标系统对标准散射体的散射系数定标结果的误差为7.93%;经由定标系统定标的标准散射体所模拟的大气能见度的最大误差为8.61%,满足用于校准能见度仪的标准散射体的使用要求.     

用于校准能见度仪的标准散射体定标系统中光学系统的误差分析

为了实现用于校准能见度仪的标准散射体的快速高精度定标,依据标准散射体校准前向散射式能见度仪的校准原理,建立定标系统中光学系统的误差分析方法.分析标准散射体定标系统的工作原理,结合其光学系统、机械结构的加工及装调偏差,建立了标准散射体定标系统的光学系统模型并设计实验证明其正确性.分析影响定标系统中光学系统精度的主要误差,得到标准散射体定标系统中光学系统的误差传递模型.通过对畸变偏差、像面位置偏差、主点位置偏差、像面倾斜偏差和焦距偏差的分析,提出了一种系统综合误差分析的方法并建立了综合偏差模型,对每个偏差单独分析,得出畸变偏差、像面位置偏差、主点位置偏差、像面倾斜偏差和焦距偏差的偏差范围依次为0.024 mm,0.399 mm,0.02 mm,0.28 rad和0.392 mm.该研究为提高用于校准能见度仪的标准散射体定标系统的精度以及校准时误差的来源分析与补偿提供理论依据.     

Non-stretchable pseudo-visibility graphs

We exhibit a family of graphs which can be realized as pseudo-visibility graphs of pseudo-polygons, but not of straight-line polygons. The example is based on the characterization of vertex-edge pseudo-visibility graphs of O'Rourke and Streinu [Proc. ACM Symp. Comput. Geometry, Nice, France, 1997, pp. 119–128] and extends a recent result of the author [Proc. ACM Symp. Comput. Geometry, Miami Beach, 1999, pp. 274–280] on non-stretchable vertex-edge visibility graphs. We construct a pseudo-visibility graph for which there exists a unique compatible vertex-edge visibility graph, which is then shown to be non-stretchable. The construction is then extended to an infinite family.     

A climbing girl's reflections about angles

The main research question in this paper is whether a climbing discourse can be a resource for a school-geometry discourse. The text is based on a 12-year old girl's story from an exciting climbing trip during her summer holiday. The girl uncovers some of her knowledge that had been invisible to her; she is guided to see some relations between her climbing and her understanding of angles. In the beginning, this girl believes her story does not concern angles at all. The tools for uncovering angles in her story are based on different levels of visibility and objects of the climbing discourse combined with different conceptions of space. The girl develops her consciousness about angles as natural elements in her climbing activity and she is guided to see the angle as an object of her climbing discourse.     

Improving the sharpness of an image with non-uniform illumination

We demonstrate a new method to sharpen a non-uniformly illuminated image by use of wavelet transformation employing Harr function. Both the fine characteristics and object edges in the image are well enhanced without degrading the contrast. This method provides some superiority compared to the conventional algorithms.     

On realistic terrains

We study worst-case complexities of visibility and distance structures on terrains under realistic assumptions on edge length ratios and the angles of the triangles, and a more general low-density assumption. We show that the visibility map of a point for a realistic terrain with n triangles has complexity . We also prove that the shortest path between two points p and q on a realistic terrain passes through triangles, and that the bisector of p and q has complexity . We use these results to show that the shortest path map for any point on a realistic terrain has complexity , and that the Voronoi diagram for any set of m points on a realistic terrain has complexity and . Our results immediately imply more efficient algorithms for computing the various structures on realistic terrains.     

On the visibility in well-behaved random sets in Euclidean space

In Calka et al. (2009), the decay of the probability of reaching distance at least r in some direction from a given point without hitting any ball, in the Poisson Boolean model of continuum percolation, was studied. The methods used in Calka et al. (2009) include coverage techniques, and the most precise results were obtained in dimension 2. In this note, we strengthen some of the results obtained in Calka et al. (2009) to dimension 3 and higher and at the same time extend them to more general random sets.