Linearized proximal alternating minimization algorithm for motion deblurring by nonlocal regularization

Non-blind motion deblurring problems are highly ill-posed and so it is quite difficult to find the original sharp and clean image. To handle ill-posedness of the motion deblurring problem, we use nonlocal total variation (abbreviated as TV) regularization approaches. Nonlocal TV can restore periodic textures and local geometric information better than local TV. But, since nonlocal TV requires weighted difference between pixels in the whole image, it demands much more computational resources than local TV. By using the linearization of the fidelity term and the proximal function, our proposed algorithm does not require any inversion of blurring operator and nonlocal operator. Therefore, the proposed algorithm is very efficient for motion deblurring problems. We compare the numerical performance of our proposed algorithm with that of several state-of-the-art algorithms for deblurring problems. Our numerical results show that the proposed method is faster and more robust than state-of-the-art algorithms on motion deblurring problems.     

Automatic comic page segmentation based on polygon detection

Comic page segmentation aims to automatically decompose scanned comic images into storyboards (frames), which is the key technique to produce digital comic documents that are suitable for reading on mobile devices. In this paper, we propose a novel method for comic page segmentation by finding the quadrilateral enclosing box of each storyboard. We first acquire the edge image of the input comic image, and then extract line segments with a heuristic line segment detection algorithm. We perform line clustering to further merge the overlapped line segments and remove the redundancy line segments. Finally, we perform another round of line clustering and post-processing to compose the obtained line segments into complete quadrilateral enclosing boxes of the storyboards. The proposed method is tested on 2,237 comic images from 12 different printed comic series, and the experimental results demonstrate that our method is effective for comic image segmentation and outperforms the existing methods.     

基础信息保持和细节强化的胸部CT图像增强

目的 清晰的胸部计算机断层扫描(computed tomography, CT)图像有助于医生准确诊断肺部相关疾病,但受成像设备、条件等因素的限制,扫描得到的CT图像质量有时会不尽如人意。因此,本文提出一种简单有效的基于基础信息保持和细节强化的胸部CT图像增强算法。方法 利用多尺度引导滤波器将胸部CT图像分解为一个基础信息层和多个不同尺度的细节层。基于熵的权重将胸部CT图像的多个细节层进行融合,并乘以强化系数进一步增强纹理细节。将强化的细节层和原始的基础信息层重新组合即可生成细节强化的胸部CT图像。通过此种增强方式,本文算法既能显著增强胸部CT图像的纹理细节,又能将大部分原始的基础结构信息保留到增强图像中。结果 为了验证算法的有效性,将本文算法与5种优秀的图像增强算法在由3 209幅胸部CT图像组成的数据集上进行测试评估。定性和定量实验结果表明,本文算法得到的增强图像保持了更多原始胸部CT图像中的基础结构信息,并更显著地强化了其中的纹理细节信息。在定量结果中,本文算法的标准差、结构相似性和峰值信噪比指标值均优于对比的5种方法,相比于性能第2的方法分别提高了4.95、0.16和4.47,...     

A new effective operator for the hybrid algorithm for solving global optimisation problems

Hybrid algorithms have been recently used to solve complex single-objective optimisation problems. The ultimate goal is to find an optimised global solution by using these algorithms. Based on the existing algorithms (HP_CRO, PSO, RCCRO), this study proposes a new hybrid algorithm called MPC (Mean-PSO-CRO), which utilises a new Mean-Search Operator. By employing this new operator, the proposed algorithm improves the search ability on areas of the solution space that the other operators of previous algorithms do not explore. Specifically, the Mean-Search Operator helps find the better solutions in comparison with other algorithms. Moreover, the authors have proposed two parameters for balancing local and global search and between various types of local search, as well. In addition, three versions of this operator, which use different constraints, are introduced. The experimental results on 23 benchmark functions, which are used in previous works, show that our framework can find better optimal or close-to-optimal solutions with faster convergence speed for most of the benchmark functions, especially the high-dimensional functions. Thus, the proposed algorithm is more effective in solving single-objective optimisation problems than the other existing algorithms.     

基于拉普拉斯算子和图像修补的图像去噪算法

通过分析偏微分方程(PDE),设计了基于拉普拉斯算子和图像修补的图像去噪算法用于处理被噪声污染的图像：ROF调和拉普拉斯(RHL)算法和ROF调和修补(RHI)算法。通过分析图像的局部特征,结合ROF模型在处理图像时具有边缘保护能力,调和模型在处理图像平滑区域时能够避免产生“阶梯效应”和拉普拉斯算子具有增强细节信息的特点,设计了RHL算法;在RHL算法的基础上,结合基于PDE的图像修补模型设计了RHI算法。实验结果表明,设计的RHL算法和RHI算法既克服了ROF模型、调和模型在去除图像噪声时的缺点,又结合了两者的优点,与其他基于PDE的算法相比,在去除图像噪声、处理图像平滑区域、保持图像边缘细节信息方面都有较好的性能。     

Visual programming with analogical representations: Inspirations from a semiotic analysis of comics

Analogical representations based on pictures of domain objects can be used in visual programming to provide a close mapping between the program and the resulting runtime display, which can make programming easier for children and other users. The use of graphical rewrite rules with before and after pictures is an example of this approach. Graphical rewrite rules have some similarities with comics strips, which also use picture sequences of graphical objects to describe dynamics in a static form. However, the visual language of comics is not used to its full potential in visual programming. We discuss how a semiotic analysis of comics can be used to address some of the limitations of graphical rewrite rules. We use a visual programming system we have designed to illustrate that comic strips can express more general computations and be more intuitive and flexible than traditional graphical rewrites. Our conclusion is that the visual language of comics has a strong potential for increasing the expressiveness and flexibility of visual programming with analogical representations of domain objects, while maintaining a direct mapping between the program representation and the runtime representation.     

结合四元数与最小核值相似区的边缘检测

目的 针对传统彩色图像边缘检测方法中未充分利用图像色度信息、颜色模型间非线性转换过程中时间和空间的大量耗费、算法实现复杂等问题,将四元数引入最小核值相似区（SUSAN）算法中,提出一种RGB空间下的结合四元数与最小核值相似区的边缘检测算法。方法 该算法首先对彩色图像进行四元数描述,然后用改进的SUSAN算子进行边缘检测。针对其中单一几何阈值g的限制,以及检测出的边缘较粗等问题,本文采用Otsu算法自适应获取双几何阈值,再对弱边缘点集进行边缘生长,最后根据USAN重心及其对称最长轴来确定边缘局部方向,实现对边缘点的局部非极大值抑制,得到最终细化后的边缘图像。结果 实验选取1幅合成彩色图像及3幅标准图像库图像,与彩色Canny算法、SUSAN算法,及采用单阈值的本文算法进行对比,并采用Pratt品质因数衡量边缘定位精度。本文算法能够检测出亮度相近的不同颜色区域之间的边缘,且提取的边缘比较连续、细致,漏检边缘较少。与公认边缘检测效果较好的彩色Canny算法相比,本文算法的品质因数提高了0.012 0,耗时缩短了2.527 9 s。结论 本文提出了一种结合四元数与最小核值相似区的边缘检测算法,实现了四元数与SUSAN算子的有效融合。实验结果表明,该算法能够提高边缘定位精度,对弱噪声具有较好的抑制能力,适用于对实时性要求不高的低层次彩色图像处理。     

Fast connected-component labeling

Labeling of connected components in a binary image is one of the most fundamental operations in pattern recognition: labeling is required whenever a computer needs to recognize objects (connected components) in a binary image. This paper presents a fast two-scan algorithm for labeling of connected components in binary images. We propose an efficient procedure for assigning provisional labels to object pixels and checking label equivalence. Our algorithm is very simple in principle, easy to implement, and suitable for hardware and parallel implementation. We show the correctness of our algorithm, analyze its complexity, and compare it with other labeling algorithms. Experimental results demonstrated that our algorithm is superior to conventional labeling algorithms.     

基于自适应滤波的噪声图像边缘检测方法

研究图像边缘优化检测问题,针对传统边缘检测算法对噪声处理能力欠佳的缺陷,提出一种自适应中值滤波与形态学处理相结合的噪声图像边缘检测AMM算法。首先根据噪声像素点与相邻像素点的关联程度采用自适应中值滤波算法对图像进行去噪处理,保护图像的细节信息;然后运用改进的Canny算子对图像进行边缘检测,提取图像的边缘信息;最后对提取的边缘进行形态学处理,得到清晰的图像边缘。仿真结果对比表明,与目前常用的方法相比,AMM算法具有较强的抗噪鲁棒性,能较清晰地提取出图像的边缘,降低噪声对图像边缘的影响。     

利用演化算法自适应选取正则算子

提出一种新的技术，它自适应地选取正则算子以取得较理想的恢复效果．通过理论分析和实验发现当恢复图像残差的频谱能量分布较均匀时恢复效果较好．这种分布均匀性可以用正则图像残差的各子频段能量偏离平均能量的程度最小来衡量，这个最小化问题以各种各样的正则算子组成的空间为搜索空间．由于一般的优化算法对此优化问题无能为力，演化算法用来求解此问题，从而自适应地选择正则化算子．实验表明新方法选取的正则算子恢复效果较好．     

一种基于核密度估计的图像边缘检测方法

进行图像边缘检测的算法有很多种,其中基于Sobel算子、Laplace算子、Canny算子等的图像边缘检测方法当属经典。但所提方法不同于这些差分算子方法,而是对灰度图像素进行小窗口区域的核密度估计,从而得到一幅核密度图,然后通过核密度图,选择出合适的带宽或阈值来控制图像边缘的检出。实验表明该方法可行且简单快速。     

结合位图切割和区域合并的彩色图像分割

就经典分水岭图像分割算法中存在的过分割问题，提出一种结合位图切割和区域合并的彩色图像分割算法。对原始彩色图像通过空域梯度算子求其梯度图像，并利用位图切割重建梯度图像；对新梯度图像进行分水岭预分割；对预分割图像基于异质性最小原则进行区域合并，并获得最终分割结果。相比于现有的同类方法，该算法引入位图切割，抑制噪声对分割结果的影响，在边缘模糊处分割准确，得到符合人类视觉的较小分割区域数目，同时在运行效率上提高。     

Text-aware balloon extraction from manga

Manga, a Japanese word for comics, is a worldwide popular visual entertainment. Nowadays, electronic devices boost the fast development of motion manga for the purpose of visual richness and manga promotion. To convert static manga images into motion mangas, text balloons are usually animated individually for better story telling. This needs the artists to cut out each text balloon meticulously, and therefore it is quite labor-intensive and time-consuming. In this paper, we propose an automatic approach that can extract text balloons from manga images both accurately and effectively. Our approach starts by extracting white areas that contain texts as text blobs. Different from existing text blob extraction methods that only rely on shape properties, we incorporate text properties in order to differentiate text blobs from texture blobs. Instead of heuristic parameter thresholding, we achieve text blob classification via learning-based classifiers. Along with the novel text blob classification method, we also make the first attempt in trying to tackle the boundary issue in balloon extraction. We apply our method on various styles of mangas and comics with texts in different languages, and convincing results are obtained in all cases.     

浅析漫画的多元化营销与新媒体的应用

网络时代,欧美、日本等国的动漫业都走入了低迷,究其原因是娱乐形式的多样化和信息产业的发展,电子产品、网络比之漫画能够给读者带来更刺激、更直接的感受。在这个大背景下,中国动漫业也越来越赶不上读者的需求。如何应对网络时代的困局?借鉴日本动漫业对营销策略的不断创新与新媒体的应用,为中国漫画的发展提出新的思路。     

Efficient Computation of the Euclidean Distance Transform

We present a simple algorithm for the Euclidean distance transform of a binary image that runs more efficiently than other algorithms in the literature. We show that our algorithm runs in optimal time for many architectures and has optimal cost for the RAM and EREW PRAM.     

Image processing and analysis of the grain constitution in minerals

Methods are presented for the postprocessing and analysis of microscopic and macroscopic images to investigate mineral grain constitution. An algorithm for eliminating indicated objects is described. It is used both in procedures to eliminate marginal and small objects and to fill gaps, and in the organization of grey-level and binary image analysis. Image processing algorithms which work without operator control have been implemented in simple and low-cost 16-bit uniprocessor image systems.     

基于双流网络的多模态多标签漫画情感检测方法

近年来,社交媒体常会以漫画的形式隐喻社会现象并倾述情感,为了解决漫画场景下多模态多标签情感识别存在的标签歧义问题,文中提出基于双流结构的多模态多标签漫画情感检测方法.使用余弦相似度对比模态间信息,并结合自注意力机制,交叉融合图像特征和文本特征.该方法主干为双流结构,使用Transformer模型作为图像的主干网络提取图像特征,利用Roberta预训练模型作为文本的主干网络提取文本特征.基于余弦相似度结合多头自注意力机制(COS-MHSA)提取图像的高层特征,最后融合高层特征和COS-MHSA多模态特征.在EmoRecCom漫画数据集上的实验验证文中方法的有效性,并给出方法对于情感检测的可视化结果.     

光学观测中几种太阳夹角计算方法及精度分析

为从计算太阳夹角的所有简单算子中,找到最接近真实值的可靠算法组合,做此实验。完成对太阳赤纬、太阳时角的常见算法公式的演算,并介绍了天文观测中会涉及到的一些基础的天文概念,完成对太阳高度角和方位角的算法演算,同时考虑蒙气差等干扰因素,加入到计算当中,最后完成对在指定地理位置设备与太阳之间的夹角数值的计算。在本次计算中,采用精度较高的复杂算法SPA算法作为参考值,对上述算法的计算结果进行鉴定,以比较上述算法计算结果的精度误差,并进行统计分析。在实验中,使用C++工具代码实现算法的运算。通过对演算结果的定量比较分析,确定了VSOP87的时角算子与Wang赤纬角算子的组合,其计算结果最为真实可靠。通过实验分析,找到了既简单可行,又具备较高准确度的太阳夹角算法组合,为提高简单算法得到的太阳夹角值的准确性起到了积极作用。     

Extended specifications and test data sets for data levelcomparisons of direct volume rendering algorithms

Direct volume rendering (DVR) algorithms do not generate intermediate geometry to create a visualization, yet they produce countless variations in the resulting images. Therefore, comparative studies are essential for objective interpretation. Even though image and data level comparison metrics are available, it is still difficult to compare results because of the numerous rendering parameters and algorithm specifications involved. Most of the previous comparison methods use information from the final rendered images only. We overcome limitations of image level comparisons with our data level approach using intermediate rendering information. We provide a list of rendering parameters and algorithm specifications to guide comparison studies. We extend Williams and Uselton's rendering parameter list with algorithm specification items and provide guidance on how to compare algorithms. Real data are often too complex to study algorithm variations with confidence. Most of the analytic test data sets reported are often useful only for a limited feature of DVR algorithms. We provide simple and easily reproducible test data sets, a checkerboard and a ramp, that can make clear differences in a wide range of algorithm variations. With data level metrics, our test data sets make it possible to perform detailed comparison studies. A number of examples illustrate how to use these tools