Accelerating BPC-PaCo through Visually Lossless Techniques

Fast image codecs are a current need in applications that deal with large amounts of images. Graphics Processing Units (GPUs) are suitable processors to speed up most kinds of algorithms, especially when they allow fine-grain parallelism. Bitplane Coding with Parallel Coefficient processing (BPC-PaCo) is a recently proposed algorithm for the core stage of wavelet-based image codecs tailored for the highly parallel architectures of GPUs. This algorithm provides complexity scalability to allow faster execution at the expense of coding efficiency. Its main drawback is that the speedup and loss in image quality is controlled only roughly, resulting in visible distortion at low and medium rates. This paper addresses this issue by integrating techniques of visually lossless coding into BPC-PaCo. The resulting method minimizes the visual distortion introduced in the compressed file, obtaining higher-quality images to a human observer. Experimental results also indicate 12% speedups with respect to BPC-PaCo.     

基于机器视觉的轮胎表面缺陷检测系统的研究与应用

在传统的轮胎表面缺陷依靠人工检测,存在劳动强度高、受人的主观影响大以及效率低下的问题。针对这一现象,研究了一种基于机器视觉的轮胎表面缺陷3D检测系统。该系统依靠机器视觉系统获取检测轮胎的表面图像,然后创建3D模型、判定缺陷类型,最终实现实时自动预警,为轮胎生产商提供一种自动化检测方案。系统集成了先进的技术、软件和工具,配套的信息管控系统可以对轮胎型号和生产数据进行采集、存储、分析,以便在生产过程中实现更高效、更可靠的质量控制,具有较高的实际应用推广价值。     

印刷电路板缺陷检测的实际应用

电路板在我们的日常生活中非常常见,这就使得印刷电路板的缺陷检测显得尤为重要。AOI作为新兴的检测PCB板缺陷的系统,在生产实际中正在被大家熟知并且应用。相较于传统的检测方式,AOI系统比较灵活,无论是在检测时间还是系统运算上,或者是对相关技术人员的要求相较于传统方式都比较有优势,本文就AOI系统在实际中的应用展开讨论,分析并且介绍了在实际应用中的具体细则。     

A novel fusion paradigm for multi-channel image denoising

Multi-channel and single-channel image denoising are on two important development fronts. Integrating multi-channel and single-channel image denoisers for further improvement is a valuable research direction. A natural assumption is that using more useful information is helpful to the output results. In this paper, a novel multi-channel and single-channel fusion paradigm (MSF) is proposed. The proposed MSF works by fusing the estimates of a multi-channel image denoiser and a single-channel image denoiser. The performance of recent multi-channel image denoising methods involved in the proposed MSF can be further improved at low additional time-consuming cost. Specifically, the validity principle of the proposed MSF is that the fused single-channel image denoiser can produce auxiliary estimate for the involved multi-channel image denoiser in a designed underdetermined transform domain. Based on the underdetermined transformation, we create a corresponding orthogonal transformation for fusion and better restore the multi-channel images. The quantitative and visual comparison results demonstrate that the proposed MSF can be effectively applied to several state-of-the-art multi-channel image denoising methods.     

Inverse identification of constitutive parameters from heat source fields: A local approach applied to hyperelasticity

In this paper, a new inverse identification method of constitutive parameters is developed from full kinematic and thermal field measurements. It consists in reconstructing the heat source field from two different approaches by using the heat diffusion equation. The first one requires the temperature field measurement and the value of the thermophysical parameters. The second one is based on the kinematic field measurement and the choice of a thermo-hyperelastic model that contains the parameters to be identified. The identification is carried out at the local scale, ie, at any point of the heat source field, without using the boundary conditions. In the present work, the method is applied to the challenging case of hyperelasticity from a heterogeneous test. Due to large deformations undergone by the rubber specimen tested, a motion compensation technique is developed to plot the kinematic and the thermal fields at the same points before reconstructing the heterogeneous heat source field. In the present case, the constitutive parameter of the Neo-Hookean model has been identified, and its distribution has been characterized with respect to the strain state at the surface of a cross-shaped specimen.     

基于深度学习的秀丽隐杆线虫显微图像分割方法

利用计算机实现自动、准确的秀丽隐杆线虫(C.elegans)的各项形态学参数分析,至关重要的是从显微图像上分割出线虫体态,但由于显微镜下的图像噪声较多,线虫边缘像素与周围环境相似,而且线虫的体态具有鞭毛和其他附着物需要分离,多方面因素导致设计一个鲁棒性的C.elegans分割算法仍然面临着挑战。针对这些问题,提出了一种基于深度学习的线虫分割方法,通过训练掩模区域卷积神经网络(Mask R-CNN)学习线虫形态特征实现自动分割。首先,通过改进多级特征池化将高级语义特征与低级边缘特征融合,结合大幅度软最大损失(LMSL)损失算法改进损失计算;然后,改进非极大值抑制;最后,引入全连接融合分支等方法对分割结果进行进一步优化。实验结果表明,相比原始的Mask R-CNN,该方法平均精确率(AP)提升了4.3个百分点,平均交并比(mIOU)提升了4个百分点。表明所提出的深度学习分割方法能够有效提高分割准确率,在显微图像中更加精确地分割出线虫体。     

Modelling of chromatic contrast for retrieval of wallpaper images

Colour remains one of the key factors in presenting an object and, consequently, has been widely applied in retrieval of images based on their visual contents. However, a colour appearance changes with the change of viewing surroundings, the phenomenon that has not been paid attention yet while performing colour‐based image retrieval. To comprehend this effect, in this article, a chromatic contrast model, CAMcc, is developed for the application of retrieval of colour intensive images, cementing the gap that most of existing colour models lack to fill by taking simultaneous colour contrast into account. Subsequently, the model is applied to the retrieval task on a collection of museum wallpapers of colour‐rich images. In comparison with current popular colour models including CIECAM02, HSI and RGB, with respect to both foreground and background colours, CAMcc appears to outperform the others with retrieved results being closer to query images. In addition, CAMcc focuses more on foreground colours, especially by maintaining the balance between both foreground and background colours, while the rest of existing models take on dominant colours that are perceived the most, usually background tones. Significantly, the contribution of the investigation lies in not only the improvement of the accuracy of colour‐based image retrieval but also the development of colour contrast model that warrants an important place in colour and computer vision theory, leading to deciphering the insight of this age‐old topic of chromatic contrast in colour science. © 2014 Wiley Periodicals, Inc. Col Res Appl, 40, 361–373, 2015     

道在山林，周弥六合——浙东天台山“洞天福地”的山岳景观流变及文化意象研究

道教洞天福地作为中国名山风景的经典类型之一，在宗教山岳景观中占据独特地位。浙东天台山水神秀，历代高道以入山隐修为主要目的，形成了道教在区域山林的景观文化基础。从天台山“神仙之乡”的文化背景出发，从“想象与实践”的视角切入，梳理了天台山洞天福地的景观流变：分析其“不死之福庭”地域性景观的形成经历了“赤城→桐柏”的信仰转移过程；以天台山为坐标，洞天福地格局打破了区域“层级”分布特征，而呈现大范围“州郡”空间格局。作为“联结点”的天台山，洞天世界沟通了宇宙、山、人3个基本场域，由此衍生出“洞宫”式和“周回”式山岳空间营建典范。旨在挖掘洞天福地中典型案例的价值，为中国洞天福地体系的构建提供理论依据。     

A new reverse reduce-error ensemble pruning algorithm

Although greedy algorithms possess high efficiency, they often receive suboptimal solutions of the ensemble pruning problem, since their exploration areas are limited in large extent. And another marked defect of almost all the currently existing ensemble pruning algorithms, including greedy ones, consists in: they simply abandon all of the classifiers which fail in the competition of ensemble selection, causing a considerable waste of useful resources and information. Inspired by these observations, an interesting greedy Reverse Reduce-Error (RRE) pruning algorithm incorporated with the operation of subtraction is proposed in this work. The RRE algorithm makes the best of the defeated candidate networks in a way that, the Worst Single Model (WSM) is chosen, and then, its votes are subtracted from the votes made by those selected components within the pruned ensemble. The reason is because, for most cases, the WSM might make mistakes in its estimation for the test samples. And, different from the classical RE, the near-optimal solution is produced based on the pruned error of all the available sequential subensembles. Besides, the backfitting step of RE algorithm is replaced with the selection step of a WSM in RRE. Moreover, the problem of ties might be solved more naturally with RRE. Finally, soft voting approach is employed in the testing to RRE algorithm. The performances of RE and RRE algorithms, and two baseline methods, i.e., the method which selects the Best Single Model (BSM) in the initial ensemble, and the method which retains all member networks of the initial ensemble (ALL), are evaluated on seven benchmark classification tasks under different initial ensemble setups. The results of the empirical investigation show the superiority of RRE over the other three ensemble pruning algorithms.