火焰图像特征在火灾数字图像识别中的运用

火焰尖角数目和圆形度是早期火灾火焰的主要特征,本文主要论述了如何在数学形态学基础上,利用火灾火焰的两个特点判断和识别早期火情。实验中,对火焰的二值图像进行开运算,即先腐蚀,再膨胀,目的是为了对火焰图像进行形态学滤波,去噪。从实验结果可以看出,该算法可以很好的识别火焰和干扰源。     

腐蚀算法在重建一类特殊管道中的应用

针对一类特殊而不能直接对其观察的管道（如动物的血管），为了准确了解其内部特征和形态，借助计算机给出了一种用腐蚀算法来重建管道原形的方法。这种方法简单易行，而且精确度高。     

Suppression of photo-induced dilation in cyanide treated hydrogenated amorphous silicon films

Effects of cyanide (CN) treatment with hydrogenated amorphous silicon (a-Si:H) films have been investigated. The decrease of ΔV/V was observed in cyanide treated a-Si:H films and the successive thermal annealing at 200°C after CN treatment induced the further reduction of the ΔV/V. XPS spectra show the indirect evidence that the cyanide species is present within 10 nm from the hydrogenated amorphous silicon surface. The results of CN treatment with a-Si:H solar cells are demonstrated.     

关于狭义相对论中时空问题的讨论

狭义相对论明确指出同时性、时间和空间的测量是相对的,与物体的运动状态或与参考系的选取密切相关,并以此建立了相对论时空观.基于狭义相对论中时空概念的关联分析,讨论了解决时空问题的思路和方法,指出了＂同时性的相对性＂是理解和认识相对论时空观的基础,有利于解决大学物理教学的重难点问题.     

狭义相对论与钟慢效应关系再认识--纪念狭义相对论创立110周年

从爱因斯坦建立狭义相对论的科学方法与狭义相对论理论的逻辑构成入手,综合运用A· P·弗伦奇在国际著名的改革教材“美国麻州理工学院物理学导论丛书”第二卷《狭义相对论》中的研究观点和闵可夫斯基的四维时空理论,阐明狭义相对论与钟慢效应之间的正确关系。     

交换超立方体网络的网络嵌入研究

本文主要研究超立方网和星型网嵌入交换超立方体网络的问题。首先,利用图形嵌入的方法,设计了超立方网到交换超立方体网络的嵌入映射,分析并证明了该嵌入映射所具有的评价性能。其次,给出了星型网到交换超立方体网络两种嵌入策略,也就是所谓的优化嵌入映射和奇偶嵌入映射,进而给出了具有更小的扩张率的星型网到另一种交换超立方体网络的嵌入方法。     

基于MultiResUNet-SMIS的皮肤黑色素瘤图像分割

针对现有的皮肤黑色素瘤病灶分割精度不高的问题,结合现有卷积神经网络方法提出皮肤黑色素瘤图像分割方法 MultiResUNet-SMIS.首先,依据皮肤黑色素瘤成像特点,引入不同空洞率的空洞卷积替换普通卷积,在参数量相同的前提下扩大感受野,使网络模型能够适用于多尺度病灶分割任务;其次加入空间和通道注意力机制以重新分配特征权重,扩大感兴趣特征影响,抑制无关特征;最后融合Focal loss与Dice loss提出一种新的loss函数FD loss用于计算回归损失,解决前景背景像素不均衡问题,进一步提高网络模型的分割精度.实验结果表明,MultiResUNet-SMIS在ISIC-2018数据集上的Dice指数、IoU指数以及Acc准确率分别达到了89.47%、82.67%、96.13%,与原MultiResUNet以及UNet、UNet++、DeepLab V3+等主流方法相比, MultiResUNet-SMIS在皮肤黑色素瘤图像分割中具有更好的效果.     

重叠细胞图像分离算法的设计

在实际的细胞图像中,经常会遇到重叠现象（又称为聚堆）,即多个细胞聚一起的情形,这给后续的分析处理带来了困难,因此需要设计一个有效的算法,能够将这些重叠在一起的细胞群分离为单个的细胞,文中针对二值化的图像,提出了一个基于形态学的算法,该方法首先利用腐蚀操作,以确定聚堆细胞最终分离为单个细胞的个数,然后再根据腐蚀后的结果,在原妈的二值图像上找到了分离点,从而最终有效地将重叠细胞分离为单个细胞,文中主要     

Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems

In this paper we investigate data structures obtained by a recursive partitioning of the multi- dimensional input domain into regions of equal size. One of the best known examples of such a structure is the quadtree . It is used here as a basis for more complex data structures. We also provide multidimensional versions of the stratified tree by van Emde Boas [vEB]. We show that under the assumption that the input points have limited precision (i.e., are drawn from the integer grid of size u ) these data structures yield efficient solutions to many important problems. In particular, they allow us to achieve O(log log u) time per operation for dynamic approximate nearest neighbor (under insertions and deletions) and exact on-line closest pair (under insertions only) in any constant number of dimensions. They allow O(log log u) point location in a given planar shape or in its expansion (dilation by a ball of a given radius). Finally, we provide a linear time (optimal) algorithm for computing the expansion of a shape represented by a region quadtree. This result shows that the spatial order imposed by this regular data structure is sufficient to optimize the operation of dilation by a ball. Received January 19, 1999; revised November 4, 1999.     

Interrupt me: External interruptions are less disruptive than self-interruptions

Interruptions are part of everyday life and are known to be disruptive. With the current study we investigated which kind of interruption is more disruptive: external interruptions or self-interruptions. We conducted two experiments, one behavioral experiment (28 participants) and one in which pupil dilation was measured (21 participants). In both experiments, self-interruptions made participants complete the main task slower than external interruptions (occurring at similar moments in the task as the self-interruptions). However, there was no difference between the two kinds of interruptions in the time needed to resume the main task (resumption lag). Instead, the pupil dilation data revealed that the decision to self-interrupt takes about 1 s, resulting in slower performance overall.