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.     

A self-adaptive synthetic over-sampling technique for imbalanced classification

Traditionally, in supervised machine learning, (a significant) part of the available data (usually 50%-80%) is used for training and the rest—for validation. In many problems, however, the data are highly imbalanced in regard to different classes or does not have good coverage of the feasible data space which, in turn, creates problems in validation and usage phase. In this paper, we propose a technique for synthesizing feasible and likely data to help balance the classes as well as to boost the performance in terms of confusion matrix as well as overall. The idea, in a nutshell, is to synthesize data samples in close vicinity to the actual data samples specifically for the less represented (minority) classes. This has also implications to the so-called fairness of machine learning. In this paper, we propose a specific method for synthesizing data in a way to balance the classes and boost the performance, especially of the minority classes. It is generic and can be applied to different base algorithms, for example, support vector machines, k-nearest neighbour classifiers deep neural, rule-based classifiers, decision trees, and so forth. The results demonstrated that (a) a significantly more balanced (and fair) classification results can be achieved and (b) that the overall performance as well as the performance per class measured by confusion matrix can be boosted. In addition, this approach can be very valuable for the cases when the number of actual available labelled data is small which itself is one of the problems of the contemporary machine learning.     

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.     

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

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

TCBR-HMM: An HMM-based text classifier with a CBR system

This paper presents an innovative solution to model distributed adaptive systems in biomedical environments. We present an original TCBR-HMM (Text Case Based Reasoning-Hidden Markov Model) for biomedical text classification based on document content. The main goal is to propose a more effective classifier than current methods in this environment where the model needs to be adapted to new documents in an iterative learning frame. To demonstrate its achievement, we include a set of experiments, which have been performed on OSHUMED corpus. Our classifier is compared with Naive Bayes and SVM techniques, commonly used in text classification tasks. The results suggest that the TCBR-HMM Model is indeed more suitable for document classification. The model is empirically and statistically comparable to the SVM classifier and outperforms it in terms of time efficiency.     

A Student's t-based density peaks clustering with superpixel segmentation (tDPCSS) method for image color clustering

Image color clustering is a basic technique in image processing and computer vision, which is often applied in image segmentation, color transfer, contrast enhancement, object detection, skin color capture, and so forth. Various clustering algorithms have been employed for image color clustering in recent years. However, most of the algorithms require a large amount of memory or a predetermined number of clusters. In addition, some of the existing algorithms are sensitive to the parameter configurations. In order to tackle the above problems, we propose an image color clustering method named Student's t-based density peaks clustering with superpixel segmentation (tDPCSS), which can automatically obtain clustering results, without requiring a large amount of memory, and is not dependent on the parameters of the algorithm or the number of clusters. In tDPCSS, superpixels are obtained based on automatic and constrained simple non-iterative clustering, to automatically decrease the image data volume. A Student's t kernel function and a cluster center selection method are adopted to eliminate the dependence of the density peak clustering on parameters and the number of clusters, respectively. The experiments undertaken in this study confirmed that the proposed approach outperforms k-means, fuzzy c-means, mean-shift clustering, and density peak clustering with superpixel segmentation in the accuracy of the cluster centers and the validity of the clustering results.