YOLSO: You Only Look Small Object

Small object detection is challenging and far from satisfactory. Most general object detectors suffer from two critical issues with small objects: (1) Feature extractor based on classification network cannot express the characteristics of small objects reasonably due to insufficient appearance information of targets and a large amount of background interference around them. (2) The detector requires a much higher location accuracy for small objects than for general objects. This paper proposes an effective and efficient small object detector YOLSO to address the above problems. For feature representation, we analyze the drawbacks in previous backbones and present a Half-Space Shortcut(HSSC) module to build a background-aware backbone. Furthermore, a coarse-to-fine Feature Pyramid Enhancement(FPE) module is introduced for layer-wise aggregation at a granular level to enhance the semantic discriminability. For loss function, we propose an exponential L1 loss to promote the convergence of regression, and a focal IOU loss to focus on prime samples with high classification confidence and high IOU. Both of them significantly improves the location accuracy of small objects. The proposed YOLSO sets state-of-the-art results on two typical small object datasets, MOCOD and VeDAI, at a speed of over 200 FPS. In the meantime, it also outperforms the baseline YOLOv3 by a wide margin on the common COCO dataset.     

LinkingPark: An automatic semantic table interpretation system

In this paper, we present LinkingPark, an automatic semantic annotation system for tabular data to knowledge graph matching. LinkingPark is designed as a modular framework which can handle Cell-Entity Annotation (CEA), Column-Type Annotation (CTA), and Columns-Property Annotation (CPA) altogether. It is built upon our previous SemTab 2020 system, which won the 2nd prize among 28 different teams after four rounds of evaluations. Moreover, the system is unsupervised, stand-alone, and flexible for multilingual support. Its backend offers an efficient RESTful API for programmatic access, as well as an Excel Add-in for ease of use. Users can interact with LinkingPark in near real-time, further demonstrating its efficiency.     

The International Society for the Study of Vascular Anomalies (ISSVA) ontology

The International Society for the Study of Vascular Anomalies (ISSVA) provides a classification for vascular anomalies that enables specialists to unambiguously classify diagnoses. This classification is only available in PDF format and is not machine-readable, nor does it provide unique identifiers that allow for structured registration. In this paper, we describe the process of transforming the ISSVA classification into an ontology. We also describe the structure of this ontology, as well as two applications of the ontology using examples from the domain of rare disease research. We used the expertise of an ontology expert and clinician during the development process. We semi-automatically added mappings to relevant external ontologies using automated ontology matching systems and manual assessment by experts. The ISSVA ontology should contribute to making data for vascular anomaly research more Findable, Accessible, Interoperable, and Reusable (FAIR). The ontology is available at https://bioportal.bioontology.org/ontologies/ISSVA.     

Enhanced wide-activated residual network for efficient and accurate image deblocking

To save bandwidth and storage space as well as speed up data transmission, people usually perform lossy compression on images. Although the JPEG standard is a simple and effective compression method, it usually introduces various visually unpleasing artifacts, especially the notorious blocking artifacts. In recent years, deep convolutional neural networks (CNNs) have seen remarkable development in compression artifacts reduction. Despite the excellent performance, most deep CNNs suffer from heavy computation due to very deep and wide architectures. In this paper, we propose an enhanced wide-activated residual network (EWARN) for efficient and accurate image deblocking. Specifically, we propose an enhanced wide-activated residual block (EWARB) as basic construction module. Our EWARB gives rise to larger activation width, better use of interdependencies among channels, and more informative and discriminative non-linearity activation features without more parameters than residual block (RB) and wide-activated residual block (WARB). Furthermore, we introduce an overlapping patches extraction and combination (OPEC) strategy into our network in a full convolution way, leading to large receptive field, enforced compatibility among adjacent blocks, and efficient deblocking. Extensive experiments demonstrate that our EWARN outperforms several state-of-the-art methods quantitatively and qualitatively with relatively small model size and less running time, achieving a good trade-off between performance and complexity.     

Feature selection methods for root-cause analysis among top-level product attributes

Manufacturing companies not only strive to deliver flawless products but also monitor product failures in the field to identify potential quality issues. When product failures occur, quality engineers must identify the root cause to improve any affected product and process. This root-cause analysis can be supported by feature selection methods that identify relevant product attributes, such as manufacturing dates with an increased number of product failures. In this paper, we present different methods for feature selection and evaluate their ability to identify relevant product attributes in a root-cause analysis. First, we compile a list of feature selection methods. Then, we summarize the properties of product attributes in warranty case data and discuss these properties regarding the challenges they pose for machine learning algorithms. Next, we simulate datasets of warranty cases, which emulate these product properties. Finally, we compare the feature selection methods based on these simulated datasets. In the end, the univariate filter information gain is determined to be a suitable method for a wide range of applications. The comparison based on simulated data provides a more general result than other publications, which only focus on a single use case. Due to the generic nature of the simulated datasets, the results can be applied to various root-cause analysis processes in different quality management applications and provide a guideline for readers who wish to explore machine learning methods for their analysis of quality data.     

Learning shape and texture progression for young child face aging

Face aging (FA) for young faces refers to rendering the aging faces at target age for an individual, generally under 20s, which is an important topic of facial age analysis. Unlike traditional FA for adults, it is challenging to age children with one deep learning-based FA network, since there are deformations of facial shapes and variations of textural details. To alleviate the deficiency, a unified FA framework for young faces is proposed, which consists of two decoupled networks to apply aging image translation. It explicitly models transformations of geometry and appearance using two components: GD-GAN, which simulates the Geometric Deformation using Generative Adversarial Network; TV-GAN, which simulates the Textural Variations guided by the age-related saliency map. Extensive experiments demonstrate that our method has advantages over the state-of-the-art methods in terms of synthesizing visually plausible images for young faces, as well as preserving the personalized features.     

Secure image encryption scheme using 4D-Hyperchaotic systems based reconfigurable pseudo-random number generator and S-Box

This paper introduces the design of a hardware efficient reconfigurable pseudorandom number generator (PRNG) using two different feedback controllers based four-dimensional (4D) hyperchaotic systems i.e. Hyperchaotic-1 and -2 to provide confidentiality for digital images. The parameter's value of these two hyperchaotic systems is set to be a specific value to get the benefits i.e. all the multiplications (except a few multiplications) are performed using hardwired shifting operations rather than the binary multiplications, which doesn't utilize any hardware resource. The ordinary differential equations (ODEs) of these two systems have been exploited to build a generic architecture that fits in a single architecture. The proposed architecture provides an opportunity to switch between two different 4D hyperchaotic systems depending on the required behavior. To ensure the security strength, that can be also used in the encryption process in which encrypt the input data up to two times successively, each time using a different PRNG configuration. The proposed reconfigurable PRNG has been designed using Verilog HDL, synthesized on the Xilinx tool using the Virtex-5 (XC5VLX50T) and Zynq (XC7Z045) FPGA, its analysis has been done using Matlab tool. It has been found that the proposed architecture of PRNG has the best hardware performance and good statistical properties as it passes all fifteen NIST statistical benchmark tests while it can operate at 79.101-MHz or 1898.424-Mbps and utilize only 0.036 %, 0.23 %, and 1.77 % from the Zynq (XC7Z045) FPGA's slice registers, slice LUTs, and DSP blocks respectively. Utilizing these PRNGs, we design two 16 × 16 substitution boxes (S-boxes). The proposed S-boxes fulfill the following criteria: Bijective, Balanced, Non-linearity, Dynamic Distance, Strict Avalanche Criterion (SAC) and BIC non-linearity criterion. To demonstrate these PRNGs and S-boxes, a new three different scheme of image encryption algorithms have been developed: a) Encryption using S-box-1, b) Encryption using S-box-2 and, c) Two times encryption using S-box-1 and S-box-2. To demonstrate that the proposed cryptosystem is highly secure, we perform the security analysis (in terms of the correlation coefficient, key space, NPCR, UACI, information entropy and image encryption quantitatively in terms of (MSE, PSNR and SSIM)).     

安卓平台上的医用图像信息采集系统的开发设计

为了探讨在安卓平台上构建医用图像采集系统的开发个案,分析通过以智能手机、平板电脑为核心安卓设备通过拍照获得化验单数据后进行文本识别并提交智慧医疗系统的解决方案。本文首先通过二值化算法形成低阈值图像数据,使用卷积神经元网络算法对文本进行逐一识别,使用K-means算法对识别后的单字文本进行字段记录值的整合并形成元数据库服务于其他智慧医疗系统模块。在使用9000组数据对神经元网络进行前期训练的前提下,该系统的识别准确率达到了99.5%以上。本系统具有一定的可行性,对未来智慧医疗的系统开发有实践意义。     

自适应融合层级特征的混合退化图像复原算法

多种退化类型混合的图像比单一类型的退化图像降质更严重,很难建立精确模型对其复原,研究端到端的神经网络算法是复原的关键.现有的基于操作选择注意力网络的算法(operation-wiseattentionnetwork,OWAN)虽然有一定的性能提升,但是其网络过于复杂,运行较慢,复原图像缺乏高频细节,整体效果也有提升的空间.针对这些问题,提出一种基于层级特征融合的自适应复原算法.该算法直接融合不同感受野分支的特征,增强复原图像的结构;用注意力机制对不同层级的特征进行动态融合,增加模型的自适应性,降低了模型冗余;另外,结合L1损失和感知损失,增强了复原图像的视觉感知效果.在DIV2K,BSD500等数据集上的实验结果表明,该算法无论是在峰值信噪比和结构相似性上的定量分析,还是在主观视觉质量方面,均优于OWAN算法,充分证明了该算法的有效性.