Search

In the tourism industry, the sales of local specialties is an important part, and the package design and integrity of the specialties are very important. This paper first introduced the support vector machine (SVM) algorithm that was used for detecting defects on the surface of paper packages. Then, the design of red wind packages was briefly described, and the simulation experiment was carried out on SVM algorithm using red wine packages with different degrees of surface defects. Proper parameters were tested using the k-fold cross-validation method. The results demonstrated that the properties of paper improved the value of packages and the SVM algorithm had better accuracy than artificial recognition in recognizing different degrees of defects on the surface of packages. In conclusion, this paper describes the application of paper in packages and provides an effective method for the defection of defects on the surface of packages. This study provides an effective references to the improvement of package values and the enhancement of package integrity.

International audience; This paper focuses on the problem of the hierarchical multi‐label classification of research papers, which is the task of assigning the set of relevant labels for a paper from a hierarchy, using reduced amounts of labelled training data. Specifically, we study leveraging unlabelled data, which are usually plentiful and easy to collect, in addition to the few available labelled ones in a semi‐supervised learning framework for achieving better performance results. Thus, in this paper, we propose a semi‐supervised approach for the hierarchical multi‐label classification task of research papers based on the well‐known Co‐training algorithm, which exploit content and bibliographic coupling information as two distinct papers' views. In our approach, two hierarchical multi‐label classifiers, are learnt on different views of the labelled data, and iteratively select their most confident unlabelled samples, which are further added to the labelled set. The success of our suggested Co‐training‐based approach lies in two main components. The first is the use of two suggested selection criteria (i.e., Maximum Agreement and Labels Cardinality Consistency) that enforce selecting confident unlabelled samples. The second is the appliance of an oversampling method that rebalances the labels distribution of the initial labelled set, which reduces the reinforcement of the label imbalance issue during the Co‐training learning. The proposed approach is evaluated using a collection of scientific papers extracted from the ACM digital library. Performed experiments show the effectiveness of our approach with regards to several baseline methods.

In this paper, we analyze the intelligent subdesign of the simulated marking system through an in-depth study of it. This paper proposes a correlation analysis-based quantification of N-element sense values and a rationality enhancement-based scoring fitting algorithm for English essays. This paper also extracts word features, sentence features, and chapter structure features in essays to fit English composition scores. Since not all students can complete the essays according to the topic requirements, a triage scoring model is used to separate the normal essays from the low-scoring essays. Statistically, it was found that the essay scores also showed a certain normal distribution. The standard support vector regression algorithm is prone to data skewing problems, so this paper addresses this problem by using a rationality enhancement method that gives a corresponding penalty factor according to the distribution of the dataset. The results show that the English essay scoring fitting algorithm proposed in this paper can well improve the prediction accuracy of some data and solve the problem of skewed data where the scores show a normal distribution. This paper designs and implements an online mock examination system that incorporates an intelligent scoring system for essays, enabling it to meet the needs of teachers and students for online examinations and intelligent scoring.

With the arrival of the Internet and social media, at the same time as masses of humans have benefitted from the full-size reassets of records available, there was an full-size boom with inside the upward push of cyber-crimes, mainly targeted closer to women. According to a 2019 file with inside the Economics Times, India has witnessed a 457% upward push in cybercrime with inside the 5 years span among 2011 and 2016. Most speculate that that is because of effect of social media inclusive of Facebook, Instagram and Twitter on our day by day lives. While those simply assist in growing a legitimate social network, advent of consumer debts in those websites normally desires simply an email-id. A actual lifestyles man or woman can create more than one fake IDs and for this reason impostors can effortlessly be made. Unlike the actual international state of affairs in which more than one policies and guidelines are imposed to become aware of oneself in a completely unique manner (as an instance at the same time as issuing one’s passport or driver’s license), with inside the digital international of social media, admission does now no longer require this kind of checks. In this paper, we study the one-of-a-kind debts of Instagram, specifically and try and verify an account as fake or actual the use of Machine Learning strategies specifically Logistic Regression and Random Forest Algorithm.

Educational evaluation helps to improve the learning and teaching process. The learning process can be assessed by the examination system. In the examination system, the learners have to answer a set of questions. The learning assessment ensures improved performance in the educational system. The success of the learning assessment is highly dependent on the listening and understanding ability of each student. The assessment of the question paper can be at two levels—cognitive level assessment and difficulty level. The cognitive level assessment is purely based on Bloom’s Taxonomy and the difficulty level assessment is purely based on the examination marks of each student. This article presents a technical method called Question Paper’s Difficulty Level (QPDL) that helps to identify the difficulty level of each question in the question paper. The QPDL method is incorporate in the implementation of ‘QAUDIT’ web application to assess the difficulty level of the question paper systematically. The systematic analysis to identify the difficulty level of the question paper is made for 239 question papers. Each question paper can be recognized based on three difficulty levels such as High, Moderate and Low.

Paper-based digital microfluidic biochips (or P-DMFBs) are becoming highly impelling due to its low-cost and in-place fabrication of electrodes and control wiring on a single piece of paper having an inkjet printer and conductive ink. Despite enormous advantages, several complex design rules also subsist, such as avoidance of induced control interference, minimum separation among the control lines, and congestion-free wiring on a single layer, which is to be correlated leading toward overall feasibility of the design. Several cost raising issues, such as schedule length, control pin count, and wire length, must be considered for attaining a successful fluid-control codesign. Moreover, design gaps exist among the subtasks of the fluid level, control level, and fluid-control design as a whole, which undeniably impose expensive design cycles increasing overall cost. This article builds a machine learning-based model for the pin-constrained P-DMFBs to predict violation in control design beforehand and accordingly guides the fluid-control codesign to tackle important cost-driving issues while attaining congestion- and conflict-free wiring. This model effectively eliminates the design cycles producing a low-cost platform. The predictive model has been evaluated over a balanced data set. Several benchmarks for assessing the performance are studied.

Exam paper generation is an indispensable part of teaching. Existing methods focus on the use of question extraction algorithms with labels for each question provided. Obviously, manual labeling is inefficient and cannot avoid label bias. Furthermore, the quality of the exam papers generated by the existing methods is not guaranteed. To address these problems, we propose a novel approach to generating exam papers based on prediction of exam performance. As such, we update the quality of the initially generated questions one by using dynamic programming, as well as in batches by using genetic algorithms. We performed the prediction task by using Deep Knowledge Tracing. Our approach considered the skill weight, difficulty, and distribution of exam scores. By comparisons, experimental results indicate that our approach performed better than the two baselines. Furthermore, it can generate exam papers with adaptive difficulties closely to the expected levels, and the related student exam scores will be guaranteed to be relatively reasonable distribution. In addition, our approach was evaluated in a real learning scenarios and shows advantages.

Back within the 1950s, Minsky and McCarthy described AI as any task performed by a program or a machine that, if a person administered an equivalent activity, we can say that he had to use his intelligence to accomplish the task. Neural networks help us to train and process Machines. These are brain-inspired networks of interconnected layers, called neurons, that feed data into one another. During the training of those neural networks, the weights attached to different inputs will still be varied until the output from the neural network is extremely on the brink of what is desired, at which point the network will have 'learned' the way to perform a specific task. A subset of machine learning is deep learning, where neural networks are expanded into sprawling networks with an enormous number of layers that are trained using massive amounts of knowledge. It is these deep neural networks that have fuelled the present breakthrough within the ability of computers to hold out tasks like speech recognition and computer vision.

Due to the increasing size of s (s), their design and optimization phases (i.e., ) grow increasingly complex. At design time, a large design space needs to be explored to find an implementation that fulfills all specifications and then optimizes metrics like energy, area, delay, reliability, etc. At run time, a large configuration space needs to be searched to find the best set of parameters (e.g., voltage/frequency) to further optimize the system. Both spaces are infeasible for exhaustive search typically leading to heuristic optimization algorithms that find some trade-off between design quality and computational overhead. ML can build powerful models that have successfully been employed in related domains. In this survey, we categorize how () may be used and is used for design-time and run-time optimization and exploration strategies of s. A meta-study of published techniques unveils areas in that are well-explored and underexplored with, as well as trends in the employed algorithms. We present a comprehensive categorization and summary of the state of the art on for. Finally, we summarize remaining challenges and promising open research directions.

Proportional–Integral–Derivative controller technique continues to provide the easiest and effective solutions to most of the industrial applications in recent years. However PID controller is poorly tuned in practice compared to most other tuning methods and is complicated with poor performance. This research presents a multi objective optimization approach involving Genetic Algorithm, Evolutionary Programming, Particle Swarm Optimization and Bacterial foraging optimization. The proposed multi objective optimization algorithm is used to tune the PID controller parameters and their performances have been compared with the conventional methodologies like Ziegler Nichols method. The results proved that the use of multi objective optimization approach based controller tuning improves the performance of process in terms of time domain specifications and performance index, set point tracking and regulatory changes and also provides stability. This paper describes the various multi objective optimization algorithms and its implementation to tune the PID Controller used in paper machine DCS as real time processing of a Pulp and paper industry processes.

Photographs are taken as valid evidences in various scenarios of our day to day life. Because of the developments in the field of Image Processing, altering images according to ones need is not a difficult task. Techniques of Image Forensics play its crucial role at this juncture. One of the mostly found types of image tampering is Copy-Move forgery. A copy-move forgery is performed by copying a region in an image and pasting it on another region in the same image, mostly after some form of post-processing like rotation, scaling, blurring, noise addition, JPEG compression etc. Two types of copy-move forgery detection techniques exist in literature. They are the Block based methods and Key-point based methods. Both the methods have their own advantages and limitations. This paper presents a survey on the recent developments in block based methods. As forgeries have become popular, the importance of forgery detection is much increased. Copy-move forgery, one of the most commonly used methods, copies a part of the image and pastes it into another part of the image. In this paper, we propose a detection method of copy-move forgery that localizes duplicated regions using Zernike moments. Since the magnitude of Zernike moments is algebraically invariant against rotation, the proposed method can detect a forged region even though it is rotated. Our scheme is also resilient to the intentional distortions such as additive white Gaussian noise, JPEG compression, and blurring. Experimental results demonstrate that the proposed scheme is appropriate to identify the forged region by copy-rotate-move forgery.

Function-as-a-Service (FaaS) has raised a growing interest in how to "tame" serverless to enable domain-specific use cases such as data-intensive applications and machine learning (ML), to name a few. Recently, several systems have been implemented for training ML models. Certainly, these research articles are significant steps in the correct direction. However, they do not completely answer the nagging question of when serverless ML training can be more cost-effective compared to traditional "serverful" computing. To help in this task, we propose MLLess, a FaaS-based ML training prototype built atop IBM Cloud Functions. To boost cost-efficiency, MLLess implements two key optimizations: a significance filter and a scale-in auto-tuner, and leverages them to specialize model training to the FaaS model. Our results certify that MLLess can be 15X faster than serverful ML systems [24] at a lower cost for ML models (such as sparse logistic regression and matrix factorization) that exhibit fast convergence.

We introduce a comprehensive benchmark for local features and robust estimation algorithms, focusing on the downstream task -- the accuracy of the reconstructed camera pose -- as our primary metric. Our pipeline's modular structure allows easy integration, configuration, and combination of different methods and heuristics. This is demonstrated by embedding dozens of popular algorithms and evaluating them, from seminal works to the cutting edge of machine learning research. We show that with proper settings, classical solutions may still outperform the perceived state of the art. Besides establishing the actual state of the art, the conducted experiments reveal unexpected properties of Structure from Motion (SfM) pipelines that can help improve their performance, for both algorithmic and learned methods. Data and code are online https://github.com/vcg-uvic/image-matching-benchmark, providing an easy-to-use and flexible framework for the benchmarking of local features and robust estimation methods, both alongside and against top-performing methods. This work provides a basis for the Image Matching Challenge https://vision.uvic.ca/image-matching-challenge., Comment: Added: KeyNet-SOSNet, AffNet-HardNet, TFeat, MKD from kornia

Number plate recognition brings a drastic improvement for the city traffic enhancement. It provides the direction in which the steps should be taken for working of an effective intelligent transportation system. ANPR have become necessity for traffic control management due to rapid increment of vehicles. The main aim of ANPR is to monitor traffic and for security purpose. Recognition of number plate uses image processing techniques and latest technology in detecting characters on vehicle license plates automatically. In recent years, there are many technological developments in recognizing license plate area of research. Image processing protocols like OCR technology allow the traffic surveillance to deal with several problems that occurs in criminal investigation, toll collection, monitoring traffic, controlling speed, parking management etc. For efficient management of traffic and mass surveillance in transportation system, an ANPR system is essential. With the aid of image processing algorithms and vehicle images dataset, it becomes possible to monitor traffic at a large scale. Vehicle images are helpful for recognizing characters on license plates by performing image segmentation, feature extraction and character recognition. Data collected through captured images are utilized in the commercial applications, law enforcement, traffic applications etc. The software examines the vehicle picture as an input image that results in displaying the plate numbers. The system with image processing used reliably for traffic detection where modification of the technologies enables an accurate acknowledgement of vehicle number plates. There are several ANPR systems developed, working on character recognition of LP by the help of image processing technique. This paper reviews the performance by researchers in this particular area towards meeting goals of transportation system. It also provides major issues and challenges in this field.

Paper recommendation is a research topic to provide users with personalized papers of interest. However, most existing approaches equally treat title and abstract as the input to learn the representation of a paper, ignoring their semantic relationship. In this paper, we regard the abstract as a sequence of sentences, and propose a two-level attentive neural network to capture: (1) the ability of each word within a sentence to reflect if it is semantically close to the words within the title. (2) the extent of each sentence in the abstract relative to the title, which is often a good summarization of the abstract document. Specifically, we propose a Long-Short Term Memory (LSTM) network with attention to learn the representation of sentences, and integrate a Gated Recurrent Unit (GRU) network with a memory network to learn the long-term sequential sentence patterns of interacted papers for both user and item (paper) modeling. We conduct extensive experiments on two real datasets, and show that our approach outperforms other state-of-the-art approaches in terms of accuracy.

Because of the cost and complexity of implementing an optical paper sorting system, the demand for an intelligent system for waste paper sorting has increased. This research focused on the development of a smart intelligent system (SIS) for recyclable waste paper sorting. The basis for selecting the regions of interests (ROIs) is the margin area of a paper object image because almost all printed documents keep the margin area intact. The paper grade is identified using a proximity search. The SIS with the HSI colour space offered maximum success rates of 99 %, 82 % and 89 %, while with the RGB model, the classification success rates were 94 %, 93 % and 98 % for white paper, old newsprint paper and old corrugated cardboard, respectively. The SIS is clearly superior to other prevailing techniques because of the faster decision making and lower cost of implementation.

In this paper, we propose a novel paper currency defect detection algorithm using quaternion uniform strength. We first build paper currency image preprocessing integration framework which includes intensity balancing, paper currency location, and geometric correction. We then propose a global–local paper currency image registration algorithm by moving key areas within certain range which can eliminate the false difference effectively. Finally, the quaternion uniform strength is calculated by using quaternion convolution edge detector. The defect degree of paper currency is determined by using the quaternion uniform color difference. The proposed algorithm is tested using different datasets from five countries: CNY, USD, EUR, VND, and RUB. The experimental results demonstrate that the proposed algorithm yields better results than the existing state-of-the-art paper currency defect detection techniques. The demo of the proposed paper currency defect detection algorithm will be publicly available.

To improve the accuracy of user implicit rating prediction, we combine the traditional latent factor model (LFM) and bidirectional gated recurrent unit neural network (BiGRU) model to propose a hybrid model that deeply mines the latent semantics in the unstructured content of the text and generates a more accurate rating matrix. First, we utilize the user’s historical behavior (favorites records) to build a user rating matrix and decompose the matrix to obtain the latent factor vectors of users and literature. We also apply the BERT model for word embedding of the research papers to obtain the sequence of word vectors. Then, we apply the BiGRU with the user attention mechanism to mine the research paper textual content and to generate the new literature latent feature vectors that are used to replace the original literature latent factor vectors decomposed from the rating matrix. Finally, a new rating matrix is generated to obtain users’ ratings of noninteractive research papers and to generate the recommendation list according to the user latent factor vector. We design experiments on the real datasets and verify that the research paper recommendation model is superior to traditional recommendation models in terms of precision, recall, F1-value, coverage, popularity and diversity.

Automatic data processing represents the future for the development of any system, especially in scientific research. In this paper, we describe one of the automatic classification methods applied to scientific research as a supervised learning task. Throughout the process, we identify the main features that are used as keys to play a significant role in terms of predicting the new rank under the supervised learning setup. First, we propose an overview of the work that has been realized in ranking scientific research papers. Second, we evaluate and compare some of state-of-the-art for the classification by supervised learning, semi-supervised learning and non-supervised learning. During the preliminary tests, we have obtained good results for performance on realistic corpus then we have compared performance metrics, such as NDCG, MAP, GMAP, F-Measure, Precision and Recall in order to define the influential features in our work. Keywords: Scientific research, Ranking scientific research papers, Data mining, Supervised learning, Multilayer perceptron algorithm

Machine learning (ML) has increasingly been adopted in safety-critical systems such as autonomous vehicles (AVs) and industrial robotics. In these domains, reliability and safety are important considerations, and hence it is critical to ensure the resilience of ML systems to faults and errors. On the other hand, soft errors are becoming more frequent in commodity computer systems due to the effects of technology scaling and reduced supply voltages. Further, traditional solutions for masking hardware faults such as Triple-Modular Redundancy (TMR) are prohibitively expensive in terms of their energy and performance overheads. Therefore, there is a compelling need to ensure the resilience of ML applications to soft errors on commodity hardware platforms.We first experimentally assess the resilience of safety-critical ML applications to soft errors. We demonstrate through fault injection experiments that even a single bit flip due to a soft error can lead to misclassification in Deep Neural Network (DNN) applications deployed in AVs, leading to safety violations. However, not all the errors in an DNN will result in serve consequences such as safety violations, and hence it is sufficient to protect the DNN from the ones that do. Unfortunately, finding all possible errors that result in safety violations is a very compute intensive task. We propose BinFI, a fault injection approach that efficiently injects critical faults that are highly likely to result in safety violations, based on the unique properties of DNNs. Finally, we propose Ranger, an approach to protect DNNs from critical faults with minimal performance overheads and no accuracy loss. We will conclude by presenting some of our ongoing work, and the future challenges in this area.

The aim of this study was to examine the effects that reading on screens (using digital devices with different screen sizes) and on paper have on reading time and comprehension. The study group was...

Stream reasoning systems are designed for complex decision-making from possibly infinite, dynamic streams of data. Modern approaches to stream reasoning are usually performing their computations using stand-alone solvers, which incrementally update their internal state and return results as the new portions of data streams are pushed. However, the performance of such approaches degrades quickly as the rates of the input data and the complexity of decision problems are growing. This problem was already recognized in the area of stream processing, where systems became distributed in order to allocate vast computing resources provided by clouds. In this paper we propose a distributed approach to stream reasoning that can efficiently split computations among different solvers communicating their results over data streams. Moreover, in order to increase the throughput of the distributed system, we suggest an interval-based semantics for the LARS language, which enables significant reductions of network traffic. Performed evaluations indicate that the distributed stream reasoning significantly outperforms existing stand-alone LARS solvers when the complexity of decision problems and the rate of incoming data are increasing. Under consideration for acceptance in Theory and Practice of Logic Programming., Comment: 16 pages. Under consideration for acceptance in TPLP

Automatically detecting the positions of key-points (e.g., facial key-points or finger key-points) in an image is an essential problem in many applications, such as driver's gaze detection and drowsiness detection in automated driving systems. With the recent advances of Deep Neural Networks (DNNs), Key-Points detection DNNs (KP-DNNs) have been increasingly employed for that purpose. Nevertheless, KP-DNN testing and validation have remained a challenging problem because KP-DNNs predict many independent key-points at the same time -- where each individual key-point may be critical in the targeted application -- and images can vary a great deal according to many factors. In this paper, we present an approach to automatically generate test data for KP-DNNs using many-objective search. In our experiments, focused on facial key-points detection DNNs developed for an industrial automotive application, we show that our approach can generate test suites to severely mispredict, on average, more than 93% of all key-points. In comparison, random search-based test data generation can only severely mispredict 41% of them. Many of these mispredictions, however, are not avoidable and should not therefore be considered failures. We also empirically compare state-of-the-art, many-objective search algorithms and their variants, tailored for test suite generation. Furthermore, we investigate and demonstrate how to learn specific conditions, based on image characteristics (e.g., head posture and skin color), that lead to severe mispredictions. Such conditions serve as a basis for risk analysis or DNN retraining., to appear in ISSTA 2021

Intrusion Detection System (IDS) has been an effective way to achieve higher security in detecting malicious activities for the past couple of years. Anomaly detection is an intrusion detection system. Current anomaly detection is often associated with high false alarm rates and only moderate accuracy and detection rates because it’s unable to detect all types of attacks correctly. An experiment is carried out to evaluate the performance of the different machine learning algorithms using KDD-99 Cup and NSL-KDD datasets. Results show which approach has performed better in term of accuracy, detection rate with reasonable false alarm rate.

In modern academic social network, it is very difficult for scholars to find academic papers consistent with their research direction. Time is a critical factor in paper recommendation. As time goes on, the impact of an academic paper would gradually fade. Likewise, the research interests of users may also change. Therefore, we propose a temporal perceptual neural collaborative filtering model that integrates the multi-dimensional features of papers. We conducted our experiments on the dataset from CiteULike, comparing the recommended results by using four time-decay functions and evaluating our model with multiple evaluation indicators. The satisfactory results show that our model is effective in filtering out the expired papers by considering the characteristics of papers and the changes of scholars' interests.

This paper is review on image fusion for different technique i.e. Non-subsampled Contourlet Transform (NSCT) and Neural Network (NN). NSCT is the pyramid structure and gives the multiscale feature of the image. NSCT used to directional filtering structure and used to filter bank. Neural network is a progression of calculations that tries to perceive fundamental connections in a bunch of information through an interaction that impersonates the manner in which the human mind works. The implemented algorithm will applied to MRI image and with the help of NN to calculated accuracy. The previous algorithm was work of different technique i.e. principal component analysis, discrete wavelet transorm and curvelet transform. The implemented algorithm will implement MATLAB software and calculate mean square error and peak signal to noise ratio.

Using machine learning (ML) services, both service customers and providers need to monitor complex contractual constraints of ML service that are strongly related to ML models and data. Therefore, establishing and monitoring comprehensive ML contracts are crucial in ML serving. This paper demonstrates a set of features and utilities of the QoA4ML framework for ML contracts.

In this invited paper, applications for Machine Learning (ML) in several areas of semiconductor manufacturing and test are reviewed and potential opportunities are discussed.

Flying insect detection, identification, and counting are the key components of agricultural pest management. Insect identification is also one of the most challenging tasks in agricultural image processing. With the aid of machine vision and machine learning, traditional (manual) identification and counting can be automated. To achieve this goal, a particular data acquisition device and an accurate insect recognition algorithm (model) is necessary. In this work, we propose a new embedded system-based insect trap with an OpenMV Cam H7 microcontroller board, which can be used anywhere in the field without any restrictions (AC power supply, WIFI coverage, human interaction, etc.). In addition, we also propose a deep learning-based insect-counting method where we offer solutions for problems such as the “lack of data” and “false insect detection”. By means of the proposed trap and insect-counting method, spraying (pest swarming) could then be accurately scheduled.

Color 3D printing allows for 3D-printed parts to represent 3D objects more realistically, but its surface color quality evaluation lacks comprehensive objective verification considering printing materials. In this study, a unique test model was designed and printed using eco-friendly and vivid paper-based full-color 3D printing as an example. By measuring the chromaticity, roughness, glossiness, and whiteness properties of 3D-printed surfaces and by acquiring images of their main viewing surfaces, this work skillfully explores the correlation between the color representation of a paper-based 3D-printed coloring layer and its attached underneath blank layer. Quantitative analysis was performed using ΔE*ab, feature similarity index measure of color image (FSIMc), and improved color-image-difference (iCID) values. The experimental results show that a color difference on color-printed surfaces exhibits a high linear correlation trend with its FSIMc metric and iCID metric. The qualitative analysis of microscopic imaging and the quantitative analysis of the above three surface properties corroborate the prediction of the linear correlation between color difference and image-based metrics. This study can provide inspiration for the development of computational coloring materials for additive manufacturing.

As Machine Learning (ML) becomes pervasive in the era of artificial intelligence, ML specific tools and frameworks are required for architectural research. This paper introduces NeuroMeter, an integrated power, area, and timing modeling framework for ML accelerators. NeuroMeter models the detailed architecture of ML accelerators and generates a fast and accurate estimation on power, area, and chip timing. Meanwhile, it also enables the runtime analysis of system-level performance and efficiency when the runtime activity factors are provided. NeuroMeter’s micro-architecture model includes fundamental components of ML accelerators, including systolic array based tensor units (TU), reduction trees (RT), and 1D vector units (VU). NeuroMeter has accurate modeling results, with the average power and area estimation errors below 10% and 17% respectively when validated against TPU-v1, TPU-v2, and Eyeriss.Leveraging the NeuroMeter’s new capabilities on architecting manycore ML accelerators, this paper presents the first in-depth study on the design space and tradeoffs of “Brawny and Wimpy” inference accelerators in datacenter scenarios with the insights that are otherwise difficult to discover without NeuroMeter. Our study shows that brawny designs with 64x64 systolic arrays are the most performant and efficient for inference tasks in the 28nm datacenter architectural space with a 500mm2 die area budget. Our study also reveals important tradeoffs between performance and efficiency. For datacenter accelerators with low batch inference, a small $(\sim 16$%) sacrifice of system performance (in achieved Tera OPerations per Second, aka TOPS) can lead to more than a 2x efficiency improvement (in achieved TOPS/TCO). To showcase NeuroMeter’s capability to model a wide range of diverse ML accelerator architectures, we also conduct a followon mini-case study on implications of sparsity on different ML accelerators, demonstrating wimpier accelerator architectures benefit more readily from sparsity processing despite their lower achievable raw energy efficiency.

This paper shows the automatic classification of research papers published in Scopus. Our classification is based on the research lines of the university. We apply the K-nearest neighbor classifier and linear discriminant analysis (LDA). Various stages were used from information gathering, creating the vocabulary, pre-processing and data training, and supervised classification in this work. The experiment involved 596 research articles published in SCOPUS from 2003–2017. The results show an overall accuracy of 88.44%.

Coreference resolution is essential for automatic text understanding to facilitate high-level information retrieval tasks such as text summarisation or question answering. Previous work indicates that the performance of state-of-the-art approaches (e.g. based on BERT) noticeably declines when applied to scientific papers. In this paper, we investigate the task of coreference resolution in research papers and subsequent knowledge graph population. We present the following contributions: (1) We annotate a corpus for coreference resolution that comprises 10 different scientific disciplines from Science, Technology, and Medicine (STM); (2) We propose transfer learning for automatic coreference resolution in research papers; (3) We analyse the impact of coreference resolution on knowledge graph (KG) population; (4) We release a research KG that is automatically populated from 55,485 papers in 10 STM domains. Comprehensive experiments show the usefulness of the proposed approach. Our transfer learning approach considerably outperforms state-of-the-art baselines on our corpus with an F1 score of 61.4 (+11.0), while the evaluation against a gold standard KG shows that coreference resolution improves the quality of the populated KG significantly with an F1 score of 63.5 (+21.8).

We explored the paper augmentation technique where a tablet computer is placed under the paper to modify its content appearance and create the illusion of a static object appearing perceptually dynamic. Our approach is based on the Deformation Lamps (DL) technique commonly used with front projection. However, we applied it to rear projection, which removes the need for a fixed hardware setup or handling and wearing dedicated hardware. The key challenge was to ensure the appropriate mixing of light reflecting from the paper (to see what is printed on the paper) and the light passing though the paper (to see what the tablet screen is projecting) since (i) a tablet screen is a relatively weak light source when being used in rear projection and (ii) commonly, paper has high opacity so the content from one side is not visible on the other side. In order to achieve the appropriate mixing of light, we reduced the opacity of the paper by perforating it (thus allowing more light to pass through), and modified the algorithm for generating dynamic luminance animation by adding gamma and brightness correction. The outcomes provide a guide on how to modify the paper and the algorithm in order to achieve the DL effect with rear projection using a tablet computer.

Successful problem solving relies on the availability of suitable mental representations of the task domain. Especially for more complex problems, there might be a wide variety of possible problem representations, and it might even be beneficial to change them during problem solving. In a first part, we argue that investigating the dynamics of understanding in terms of dynamically changing problem representations is an underexplored aspect of problem solving research, and that most classic tasks even preclude the opportunity of such dynamics to occur. Continuing this theoretical discussion, as an illustrative example of a task designed for the exploration of such representational dynamics, the second part of the paper discusses a novel, complex spatial transformation and problem solving task. In this task, one is asked to repeatedly mentally cross-fold a sheet of paper, and to predict the resulting sheet geometry without the use of external aids. Through its deliberate openness and difficulty, this task requires finding new and more efficient representations – ranging from kinaesthetic and visuospatial imagery to symbolic notions. We present an overview of the task domain and discuss various ways of representing the domain as well as potential dynamics between them.

Literature reviews are essential for any researcher trying to keep up to date with the burgeoning software engineering literature. FAST$^2$ is a novel tool for reducing the effort required for conducting literature reviews by assisting the researchers to find the next promising paper to read (among a set of unread papers). This paper describes FAST$^2$ and tests it on four large software engineering literature reviews conducted by Wahono (2015), Hall (2012), Radjenovi\'c (2013) and Kitchenham (2017). We find that FAST$^2$ is a faster and robust tool to assist researcher finding relevant SE papers which can compensate for the errors made by humans during the review process. The effectiveness of FAST$^2$ can be attributed to three key innovations: (1) a novel way of applying external domain knowledge (a simple two or three keyword search) to guide the initial selection of papers---which helps to find relevant research papers faster with less variances; (2) an estimator of the number of remaining relevant papers yet to be found---which in practical settings can be used to decide if the reviewing process needs to be terminated; (3) a novel self-correcting classification algorithm---automatically corrects itself, in cases where the researcher wrongly classifies a paper., Comment: 20+3 pages, 6 figures, 5 tables, and 4 algorithms. Accepted by Journal of Expert Systems with Applications

Most existing studies and public datasets for handwritten Chinese text recognition are based on the regular documents with clean and blank background, lacking research reports for handwritten text recognition on challenging areas such as educational documents and financial bills. In this paper, we focus on examination paper text recognition and construct a challenging dataset named examination paper text (SCUT-EPT) dataset, which contains 50 000 text line images (40 000 for training and 10 000 for testing) selected from the examination papers of 2 986 volunteers. The proposed SCUT-EPT dataset presents numerous novel challenges, including character erasure, text line supplement, character/phrase switching, noised background, nonuniform word size, and unbalanced text length. In our experiments, the current advanced text recognition methods, such as convolutional recurrent neural network (CRNN) exhibits poor performance on the proposed SCUT-EPT dataset, proving the challenge and significance of the dataset. Nevertheless, through visualizing and error analysis, we observe that humans can avoid vast majority of the error predictions, which reveal the limitations and drawbacks of the current methods for handwritten Chinese text recognition (HCTR). Finally, three popular sequence transcription methods, connectionist temporal classification (CTC), attention mechanism, and cascaded attention-CTC are investigated for HCTR problem. It is interesting to observe that although the attention mechanism has been proved to be very effective in English scene text recognition, its performance is far inferior to the CTC method in the case of HCTR with large-scale character set.

Electrocardiogram (ECG) represents the electrical activity of the heart which is used for the diagnosis purpose by the doctors. This paper proposed a method of converting printed ECG data into digital electrocardiogram (ECG) signals. We have developed a system that converts scanned ECG stripped taken from MIT-BIH Normal Sinus Rhythm/ Arrhythmia Database and also data from real patients’ records taken from hospitals into samples as text using digital image processing techniques. Digital data obtained using our proposed model retains all the ECG information of the raw data with precision. The proposed method is reliable for diagnosing ECG based analysis and different cardiac diseases.

The quality of the final prints in electronic-shaft paper-folding machinesseriously influenced by the mechanical periodic disturbance. This paper takes the periodic shock-disturbance and sinusoidal disturbance in the electronic-shaft paper-folding machineas as the research objects. Disturbance observer is designed based on Propotional Integral Diffrential (PID) control algorithm. Firstly this paper establishes a model of the system with MTALAB system identification tools in the process of establishing the control system. Secondly,the paper inverses this established model. In order to approximate the mode and guarantee the stability of the inversed model, zero-phase error-tracking controller (ZPETC) has been designed to remove the instable zero-point of the original model. Finally, the paper constructs the disturbance observer of the established reversed model based on PID control algorithm. The simulation on experimental platform shows that the resistivity of paper-folding machine to the external disturbance has been improved impressively and the proposed PID algorithm disturbance observer has been proved can be used in periodic disturbance suppression in the electronic-shaft paper-folding machine.

Introduction: The electrocardiogram (ECG) plays an important role in the diagnosis of heart diseases. However, most patterns of diseases are based on old datasets and stepwise algorithms that provide limited accuracy. Improving diagnostic accuracy of the ECG can be done by applying machine learning algorithms. This requires taking existing scanned or printed ECGs of old cohorts and transforming the ECG signal to the raw digital (time (milliseconds), voltage (millivolts)) form. Objectives: We present a MATLAB-based tool and algorithm that converts a printed or scanned format of the ECG into a digitized ECG signal. Methods: 30 ECG scanned curves are utilized in our study. An image processing method is first implemented for detecting the ECG regions of interest and extracting the ECG signals. It is followed by serial steps that digitize and validate the results. Results: The validation demonstrates very high correlation values of several standard ECG parameters: PR interval 0.984 +/−0.021 (p-value < 0.001), QRS interval 1+/− SD (p-value < 0.001), QT interval 0.981 +/− 0.023 p-value < 0.001, and RR interval 1 +/− 0.001 p-value < 0.001. Conclusion: Digitized ECG signals from existing paper or scanned ECGs can be obtained with more than 95% of precision. This makes it possible to utilize historic ECG signals in machine learning algorithms to identify patterns of heart diseases and aid in the diagnostic and prognostic evaluation of patients with cardiovascular disease., We present a MATLAB-based tool and algorithm that converts a printed or scanned ECG into a digitized ECG signal. Validation on 30 ECG scanned curves more than 95% precision. This makes it possible to utilize historic ECG signals in machine learning algorithms to identify patterns of heart diseases and aid in the diagnosis and evaluation of patients with cardiovascular disease.

Nowadays, there is a rapidly increasing number of conferences and journals in computer science that make a lot of challenges for researchers to find an appropriate venue to submit their scientific work. There is a need for a recommendation system that can support researchers for a better process of paper submission. In this paper, we present an efficient approach for building such a recommendation model by using embedding methods, Global Vector (GloVe) 1 created by Pennington et al. [1] and FastText 2 proposed by Facebook [2], Convolutional Neural Network (CNN) [3], and LSTM. The experimental results show that the combination of CNNs and FastText, CNN + FastText, can achieve the best performance in terms of the Top 1 Accuracy compared with other techniques, including the S2RSCS model, as presented in [4]. Moreover, the performance by using GloVe or FastText is much better, faster, and more stable than S2RSCS in most cases.

1 The aim of the present work is to assess similarities between papers used in a collection of 215 lithographs by Henri Matisse. It combines the use of an anisotropic multiscale analysis built upon the hyperbolic wavelet transform to compute distances between textures, with the fact that four textures of the same print were digitized, corresponding to four different (recto/verso and top/side) views. A permutation algorithm is devised showing the importance of reordering the four views to achieve a meaningful comparison across the papers, thus suggesting possibly different artistic intentions in some prints.

In the context of papers used in the graphic arts, including silver gelatin, inkjet, and wove papers, prior work has studied measures of texture similarity for purposes of classifying such papers. The majority of prior work has been based on classical image processing approaches such as Fourier, wavelet, and fractal analysis. In this work, recent advances in deep learning are used to develop a texture similarity approach for measuring paper texture similarity. Since the available datasets generally lack labels, the convolutional neural network is trained using triplet loss to minimize the feature distance of tiles from the same image while simultaneously maximizing the feature distance of tiles drawn from different images. The approach is tested on three paper texture image databases considered in prior works and the results suggest the proposed approach achieves state-of-the-art performance.

This companion paper supports the experimental replication of paper "Outfit Compatibility Prediction and Diagnosis with Multi-Layered Comparison Network", which is presented at ACM Multimedia 2019. We provide the software package for replicating the implementation of Multi-Layered Comparison Network (MCN), as well as the Polyvore-T dataset and baseline methods compared in the original paper. This paper contains the guides to reproduce the experiment results including outfit compatibility prediction, outfit diagnosis and automatic outfit revision.

Which are the segmentation algorithms proposed during 2018-2019 in CVPR that have CNN architecture?’ Answering this question involves identifying and analyzing the deep learning architecture diagrams from several research papers. Retrieving such information poses significant challenge as most of the existing academic search engines are primarily based on only the text content. In this paper, we introduce Diag2Graph, an end-to-end framework for parsing deep learning diagram-figures, that enables powerful search and retrieval of architectural details in research papers. Our proposed approach automatically localizes figures from research papers, classifies them, and analyses the content of the diagram-figures. The key steps in analyzing the Figure content is the extraction of the different components data and finding their structural relation. Finally, the extracted components and their relations are represented in the form of a deep knowledge graph. A thorough evaluation on a real-word annotated dataset has been done to demonstrate the efficacy of our approach.

This paper describes a work on transfer learning in neural networks carried out in 1970s and early 1980s, which produced its first publication in 1976. In the contemporary research on transfer learning there is a belief that pioneering work on transfer learning took place in early 1990s, and this paper updates that knowledge, pointing out that the transfer learning research started more than a decade earlier. This paper reviews that 1970s research and addresses important issues relevant for the current transfer learning research. It gives a mathematical model and geometric interpretation of transfer learning, and a measure of transfer learning indicating positive, negative, and no transfer learning. It presents experimental investigation in the mentioned types of transfer learning. And it gives an application of transfer learning in pattern recognition using datasets of images.

Deep Neural Networks (DNNs) are the algorithm of choice for image processing applications. DNNs present highly parallel workloads that lead to the emergence of custom hardware accelerators. Deep Learning (DL) models specialized in different tasks require a programmable custom hardware and a compiler/mapper to efficiently translate different DNNs into an efficient dataflow in the accelerator. The goal of this paper is to present a compiler for running DNNs on Snowflake, which is a programmable hardware accelerator that targets DNNs. The compiler correctly generates instructions for various DL models: AlexNet, VGG, ResNet and LightCNN9. Snowflake, with a varying number of processing units, was implemented on FPGA to measure the compiler and Snowflake performance properties upon scaling up. The system achieves 70 frames/s and 4.5 GB/s of off-chip memory bandwidth for AlexNet without linear layers on Xilinx’s Zynq-SoC XC7Z045 FPGA.

The confluence of significant computational power and inexpensive sensors provides the opportunity to reliably collect large volumes of information from the world and extract humanly useful information resources. This paper reviews a coherent body of work over the last 20+ years focused on development of advanced bio-inspired computing techniques, and their applications primarily for human related data in behaviour and human centered computing. We close with a synthesis proposing an experiment analysis methodology combining these tools.

Technology is shaping our lives in a multitude of ways. This is fuelled by a technology infrastructure, both legacy and state of the art, composed of a heterogeneous group of hardware, software, services, and organisations. Such infrastructure faces a diverse range of challenges to its operations that include security, privacy, resilience, and quality of services. Among these, cybersecurity and privacy are taking the centre-stage, especially since the General Data Protection Regulation (GDPR) came into effect. Traditional security and privacy techniques are overstretched and adversarial actors have evolved to design exploitation techniques that circumvent protection. With the ever-increasing complexity of technology infrastructure, security and privacy-preservation specialists have started to look for adaptable and flexible protection methods that can evolve (potentially autonomously) as the adversarial actor changes its techniques. For this, Artificial Intelligence (AI), Machine Learning (ML), and Deep Learning (DL) were put forward as saviours. In this paper, we look at the promises of AI, ML, and DL stated in academic and industrial literature and evaluate how realistic they are. We also put forward potential challenges a DL based security and privacy protection system has to overcome. Finally, we conclude the paper with a discussion on what steps the DL and the security and privacy-preservation community have to take to ensure that DL is not just going to be hype, but an opportunity to build a secure, reliable, and trusted technology infrastructure on which we can rely on for so much in our lives.

In order to improve the security of medical data, this paper uses a robust and secure dual watermarking technique in RDWT-SVD domain. Dual watermarking is achieved by embedding text watermark in medical watermark image using DWT, generating the final watermark. Before embedding, turbo code is used to encode the text watermark. Further, trade-off between imperceptibility and robustness is controlled in our scheme through firefly optimization. Experimental results indicate the proposed method offers high imperceptibility and robustness, and have superior overall performance.

In this paper, we propose an end-to-end approach to addressing QRS complex detection and measurement of Electrocardiograph (ECG) paper using convolutional neural networks (CNNs). Unlike conventional detection solutions that convert images to digital data, our method can directly detect QRS complex in images using Faster-RCNN, then the R-peak can be located and measured through a CNN. Validated by clinical ECG data in the St.-Petersburg Institute of Cardiological Technics 12-lead Arrhythmia Database and real ECG paper from Peking University People’s Hospital, the proposed method can achieve the recall of 98.32%, the precision of 99.01% in detecting and 0.012 mv of mean absolute error in measuring. Experimental results demonstrate the superior performance of our method over conventional solutions, which would pave the way to detect and measure ECG paper using CNNs.

Laser-induced breakdown spectroscopy (LIBS) is an important analysis technique with applications in many industrial branches and fields of scientific research. Nowadays, the advantages of LIBS are impaired by the main drawback in the interpretation of obtained spectra and identification of observed spectral lines. This procedure is highly time-consuming since it is essentially based on the comparison of lines present in the spectrum with the literature database. This paper proposes the use of various computational intelligence methods to develop a reliable and fast classification of quasi-destructively acquired LIBS spectra into a set of predefined classes. We focus on a specific problem of classification of paper-ink samples into 30 separate, predefined classes. For each of 30 classes (10 pens of each of 5 ink types combined with 10 sheets of 5 paper types plus empty pages), 100 LIBS spectra are collected. Four variants of preprocessing, seven classifiers (decision trees, random forest, k-nearest neighbor, support vector machine, probabilistic neural network, multi-layer perceptron, and generalized regression neural network), 5-fold stratified cross-validation, and a test on an independent set (for methods evaluation) scenarios are employed. Our developed system yielded an accuracy of 99.08%, obtained using the random forest classifier. Our results clearly demonstrates that machine learning methods can be used to identify the paper-ink samples based on LIBS reliably at a faster rate.

The clustering coefficient has been widely used for identifying the local structure of networks. In this paper, the weighted spectral distribution with 3-cycle (WSD3) that is similar (but not equal) to the clustering coefficient is studied on evolving social networks. It is demonstrated that the ratio of the WSD3 to the network size (i.e., the node number) provides a more sensitive discrimination for the size-independent local structure of social networks in contrast to the clustering coefficient. Moreover, the difference of the WSD3’s performances on social networks and communication networks is investigated, and it is found that the difference is induced by the different symmetrical features of the normalized Laplacian spectral densities on these networks.

Co-citation analysis can be exploited as a bibliometric technique used for mining information on the relationships between scientific papers. Proposed methods rely, however, on co-citation counting techniques that slightly take the semantic aspect into consideration. The present study proposes a new technique based on the measure of Semantic Similarity (SS) between the titles of co-cited papers. Several computational measures rely on knowledge resources to quantify the semantic similarity, such as the WordNet «is a» taxonomy. Our proposal analyzes the SS between the titles of co-cited papers using word-based SS measures. Two major analytical experiments are performed: the first includes the benchmarks designed for testing word-based SS measures; the second exploits the dataset DBLP (DBLP: Digital Bibliography & Library Project.) citation network. As a result, we found the SS measures behave the same as human judgement for the lexical similarity and can be consequently used for the automatic assessment of similarity between co-cited papers. The analysis of highly repeated co-citations demonstrates that the different SS measures display almost similar behaviours, with slight differences due to the distribution of the provided SS values. Furthermore, we note a low percentage of similar referred papers into the co-citations.

Biological systems exhibit extraordinary levels of diversity. Embodied behaviours are the emergent property of many loosely-coupled parallel processes, from the microscopic level, e.g. materials, to more abstracted levels, e.g. organs and limbs. We summarise our investigations into using a synthetic methodology, i.e. an understanding-by-building approach, for designing the complex interactions of falling paper shapes. By studying how simple systems such as a falling paper shape behave, we can analyse the specific characteristics of the interaction between morphology and the environment, and how this leads to programmable non-trivial behaviours. We present current results and discuss the implications on the future of design in robotics.

Nowadays, recommendation systems play an indispensable role in many fields, including e-commerce, finance, economy, and gaming. There is emerging research on publication venue recommendation systems to support researchers when submitting their scientific work. Several publishers such as IEEE, Springer, and Elsevier have implemented their submission recommendation systems only to help researchers choose appropriate conferences or journals for submission. In this work, we present a demo framework to construct an effective recommendation system for paper submission. With the input data (the title, the abstract, and the list of possible keywords) of a given manuscript, the system recommends the list of top relevant journals or conferences to authors. By using state-of-the-art techniques in natural language understanding, we combine the features extracted with other useful handcrafted features. We utilize deep learning models to build an efficient recommendation engine for the proposed system. Finally, we present the User Interface (UI) and the architecture of our paper submission recommendation system for later usage by researchers.

Machine learning (ML) components are increasingly adopted in many automated systems. Their ability to learn and work with novel input/incomplete knowledge and their generalization capabilities make them highly desirable solutions for complex problems. This has motivated the inclusion of ML techniques/components in products for many industrial domains including automotive systems. Such systems are safety-critical systems since their failure may cause death or injury to humans. Therefore, their safety must be ensured before they are used in their operational environment. However, existing safety standards and Verification and Validation (V&V) techniques do not properly address the special characteristics of ML-based components such as non-determinism, non-transparency, instability. This position paper presents the authors' view on the safety of automotive systems incorporating ML-based components, and it is intended to motivate and sketch a research agenda for extending a safety standard, namely ISO 26262, to address challenges posed by incorporating ML-based components in automotive systems.

Botnets continue to be a threat to organizations, thus various machine learning-based botnet detectors have been proposed. However, the capability of such systems in detecting new or unseen botnets is crucial to ensure its robustness against the rapid evolution of botnets. Moreover, it prolongs the effectiveness of the system in detecting bots, avoiding frequent and time-consuming classifier re-training. We present BOTection, a privacy-preserving bot detection system that models the bot network flow behavior as a Markov Chain. The Markov Chain state transitions capture the bots' network behavior using high-level flow features as states, producing content-agnostic and encryption resilient behavioral features. These features are used to train a classifier to first detect flows produced by bots, and then identify their bot families. We evaluate our system on a dataset of over 7M malicious flows from 12 botnet families, showing its capability of detecting bots' network traffic with 99.78% F-measure and classifying it to a malware family with a 99.09% F-measure. Notably, due to the modeling of general bot network behavior by the Markov Chains, BOTection can detect traffic belonging to unseen bot families with an F-measure of 93.03% making it robust against malware evolution.

A secure medical image watermarking framework using SVD, DE, step space filling curve and IntDCT is proposed. The proposed algorithm starts with partition of the host medical image into 8×8 blocks and then IntDCT is applied in each block. By collecting integer DC coefficients, a feeble resolution medical image is obtained. SVD is applied on this feeble resolution image. For maintaining a strong relationship between imperceptibility and robustness, the popular differential evolution (DE) technique is chosen to examine the most suitable scaling factors. The singular values of the host image are modified with the singular values of the watermark to insert the watermark in the host image. Here, DE is playing a very important role to determine the most suitable scaling factors to the embedded process for maintaining the dilemma between robustness and imperceptibility without degrading the nobility of medical images. To increase the security of the watermark image, first it is scuffled with the help of step space filling curve before the embedding process. The experimental observations and results proved the efficiency of the proposed framework. It maintains the quality of the watermarked images and the watermark can be extracted from the seriously malformed images.

Steganography is the art of hiding a secret message inside a publicly visible carrier message. Ideally, it is done without modifying the carrier, and with minimal loss of information in the secret message. Recently, various deep learning based approaches to steganography have been applied to different message types. We propose a deep learning based technique to hide a source RGB image message inside finite length speech segments without perceptual loss. To achieve this, we train three neural networks; an encoding network to hide the message in the carrier, a decoding network to reconstruct the message from the carrier and an additional image enhancer network to further improve the reconstructed message. We also discuss future improvements to the algorithm proposed.

In recent times, Generative Adversarial Networks (GANs) have created a lot of buzz in the research community. GANs are formulated on the zero-sum game theory, where two neural nets compete against each other. The resultant deep model is capable of generating data similar to any data distribution provided. It utilizes the adversarial learning approach and is far more capable in learning features than the traditional machine learning models. This review focusses on the origin and evolution of GANs. Firstly, the traditional GAN is explored in terms of its structure and loss functions. Then come the common challenges of training GANs. Thirdly, the review dives into numerous GAN variants and explains their improvements. The review then lists the wide variety of applications and ends with the conclusion.

Patent terminology relation extraction is of great significance to the construction of patent Knowledge graph. In order to solve the problem of long-distance dependency in traditional depth learning, a new method of patent terminology relation extraction is proposed, which combines attention mechanism and bi-directional LSTM model and with keyword strategy. Category keyword features in each sentence obtained by the improved TextRank with the patent text information vectorization added. BiLSTM neural work and attention mechanism are employed to extract the temporal information and sentence-level global feature information. Moreover, pooling layer is added to obtain the local features of the text. Finally, we fuse the global features and local features, and output the final classification results through the softmax classifier. The addition of category keywords improves the distinction of categories. Substantial experimental results demonstrate that the proposed model outperform the state-of-art neural model in patent terminology relation extraction.

While there are several frameworks for CNN inference on mobile GPUs, they do not achieve real-time processing for the most of the CNNs that aim at reasonable accuracy since they all employ kernel-by-kernel execution model and do not effectively support INT8 quantization yet. In this paper, we reveal that mobile GPUs suffer from large kernel launch overhead unlike server GPUs, and then propose an on-device deep learning inference framework that can achieve real-time inference of CNNs on mobile GPUs by removing kernel launch overhead and by effectively exploiting INT8 quantization. We have evaluated the proposed framework with a state-of-the-art CNN based face detector (RetinaFace), and observed up to 2.01X of speedup compared to ARM Compute Library (ACL) on a commodity smartphone.

The main interest of this paper is concept of Compressive Sensing and its application in 1D biomedical signals. The accent is on analyzing several types of biomedical signals and finding domain in which they are sparse. Therefore, we use gradient-based algorithm to reconstruct these biomedical signals with different number of samples. By working with gradient-based algorithm, we presented reconstruction of Electrocardiogram, Electroencephalogram and Electromyogram biomedical signals and drew a conclusion about differences between them. Several sparsifying basis are tested in order to find the most suitable one, for specific signal type, and we verified the whole theory by experimental results.

In many fields, a mass of algorithms with completely different hyperparameters have been developed to address the same type of problems. Choosing the algorithm and hyperparameter setting correctly can promote the overall performance greatly, but users often fail to do so due to the absence of knowledge. How to help users to effectively and quickly select the suitable algorithm and hyperparameter settings for the given task instance is an important research topic nowadays, which is known as the CASH problem. In this paper, we design the Auto-Model approach, which makes full use of known information in the related research paper and introduces hyperparameter optimization techniques, to solve the CASH problem effectively. Auto-Model tremendously reduces the cost of algorithm implementations and hyperparameter configuration space, and thus capable of dealing with the CASH problem efficiently and easily. To demonstrate the benefit of Auto-Model, we compare it with classical Auto-Weka approach. The experimental results show that our proposed approach can provide superior results and achieves better performance in a short time., 12 pages, 3 figures

Tracking progress in machine learning has become increasingly difficult with the recent explosion in the number of papers. In this paper, we present AxCell, an automatic machine learning pipeline for extracting results from papers. AxCell uses several novel components, including a table segmentation subtask, to learn relevant structural knowledge that aids extraction. When compared with existing methods, our approach significantly improves the state of the art for results extraction. We also release a structured, annotated dataset for training models for results extraction, and a dataset for evaluating the performance of models on this task. Lastly, we show the viability of our approach enables it to be used for semi-automated results extraction in production, suggesting our improvements make this task practically viable for the first time. Code is available on GitHub.

Sentiment Analysis is done by gathering the data, analyzing the text and aggregating the words in the text. The main focus of this survey is on the evaluation methods used and their respective core solutions. In this paper we are going to study the aspect based sentiment classification, which is classified into three. Those are Implicit, Explicit and Coreferential aspect based sentiment classification. In this paper we are also going to elaborate the polarity of the reviews into positive and negative sentiments. Aspect Based Classification not only promises to suppress the noisy data but also provides high efficiency in identifying the aspects with an addition of performing classification task with higher accuracy. This accuracy can be achieved by using Neural Network algorithms.

Understanding the current research trends, problems, and their innovative solutions remains a bottleneck due to the ever-increasing volume of scientific articles. In this paper, we propose NLPExplorer, a completely automatic portal for indexing, searching, and visualizing Natural Language Processing (NLP) research volume. NLPExplorer presents interesting insights from papers, authors, venues, and topics. In contrast to previous topic modelling based approaches, we manually curate five course-grained non-exclusive topical categories namely Linguistic Target (Syntax, Discourse, etc.), Tasks (Tagging, Summarization, etc.), Approaches (unsupervised, supervised, etc.), Languages (English, Chinese, etc.) and Dataset types (news, clinical notes, etc.). Some of the novel features include a list of young popular authors, popular URLs and datasets, list of topically diverse papers and recent popular papers. Also, it provides temporal statistics such as yearwise popularity of topics, datasets, and seminal papers. To facilitate future research and system development, we make all the processed dataset accessible through API calls. The current system is available at http://nlpexplorer.org.

Review rating prediction of text reviews is a rapidly growing technology with a wide range of applications in natural language processing. However, most existing methods either use hand-crafted features or learn features using deep learning with simple text corpus as input for review rating prediction, ignoring the hierarchies among data. In this paper, we propose a Hierarchical bi-directional self-attention Network framework (HabNet) for paper review rating prediction and recommendation, which can serve as an effective decision-making tool for the academic paper review process. Specifically, we leverage the hierarchical structure of the paper reviews with three levels of encoders: sentence encoder (level one), intra-review encoder (level two) and inter-review encoder (level three). Each encoder first derives contextual representation of each level, then generates a higher-level representation, and after the learning process, we are able to identify useful predictors to make the final acceptance decision, as well as to help discover the inconsistency between numerical review ratings and text sentiment conveyed by reviewers. Furthermore, we introduce two new metrics to evaluate models in data imbalance situations. Extensive experiments on a publicly available dataset (PeerRead) and our own collected dataset (OpenReview) demonstrate the superiority of the proposed approach compared with state-of-the-art methods., Accepted by COLING 2020

The medical robotics market in the global healthcare industry have spread and extended in these several years. Internet of Medical Robotics Things (IoMRT) is also growing and Internet of Things is extending a new field of healthcare application. Whereas, the previous paper suggested that, in the field of robotics, the cloud platforms for Internet of Robotics Things (IoRT) were gradually developed; therefore, the digital platform and architecture for IoMRT of the healthcare industries should be formulated when necessary. An open healthcare platform for IoMRT is expected to promote and implement the robotics and the IoMRT applications for medical and healthcare communities efficiently. In this paper, we suggest that various medical robotics and the IoMRT-related applications will be designed and verified, while the open platform for medical, healthcare-related Robotics should be proposed and verified by the research initiative named “Open Healthcare Platform 2030–OHP2030.” In addition, the vision for enabling medical robotics and the IoMRT-related applications in the OHP2030 research initiative is explained.

This paper is a plea for developing possibilistic learning methods that would be consistent with if-then rule-based reasoning. The paper first recall the possibility theory-based handling of cascading sets of parallel if-then rules. This is illustrated by an example describing a classification problem. It is shown that the approach is both close to a possibilistic logic handling of the problem and can also be put under the form of a max-min-based matrix calculus describing a function underlying a structure somewhat similar to a max-min neural network. The second part of the paper discusses how possibility distributions can be obtained from precise or imprecise statistical data, and then surveys the few existing works on learning in a possibilistic setting. A final discussion emphasizes the interest of handling learning and reasoning in a consistent way.

Keyphrases in a research paper succinctly capture the primary content of the paper and also assist in indexing the paper at a concept level. Given the huge rate at which scientific papers are published today, it is important to have effective ways of automatically extracting keyphrases from a research paper. In this paper, we present a novel method, Syntax and Semantics Aware Keyphrase Extraction (SaSAKE), to extract keyphrases from research papers. It uses a transformer architecture, stacking up sentence encoders to incorporate sequential information, and graph encoders to incorporate syntactic and semantic dependency graph information. Incorporation of these dependency graphs helps to alleviate long-range dependency problems and identify the boundaries of multi-word keyphrases effectively. Experimental results on three benchmark datasets show that our proposed method SaSAKE achieves state-of-the-art performance in keyphrase extraction from scientific papers.

We present a mathematical technique for using Hermite functions to reconstruct various types of images. Even though the functions are not orthogonal, they can be used in image processing. The functions permit us to get good localization of the signals and it is shown that we get better reconstructed image quality for a larger number of Hermite functions used. Finally, we use a Hermit function frame to decompose and reconstruct a few types of images and compare the results for various number of Hermit functions.

In this study, we analyzed keywords from different academic papers using data from more than 300 papers. Using the concept of quantitative surveys and machine learning, we conducted various analyses on the keywords in different papers. The findings obtained from these surveys and analyses are assumed to lend themselves to the automatic assignment of keywords for papers. In this study, the number of keywords included in a paper is quantitatively expressed using the covering rate and density of keywords. The results confirm that paper titles are likely to include keywords. The performed keyword analyses predict words that can be used as keywords via machine learning. The proposed method has an accuracy range 0.6–0.8. In addition, by analyzing the features used in machine learning, we can obtain the characteristics of the words that are mentioned as keywords in papers.

Keyphrases associated with research papers provide an effective way to find useful information in the large and growing scholarly digital collections. However, keyphrases are not always provided with the papers, but they need to be extracted from their content. In this paper, we explore keyphrase extraction formulated as sequence labeling and utilize the power of Conditional Random Fields in capturing label dependencies through a transition parameter matrix consisting of the transition probabilities from one label to the neighboring label. We aim at identifying the features that, by themselves or in combination with others, perform well in extracting the descriptive keyphrases for a paper. Specifically, we explore word embeddings as features along with traditional, document-specific features for keyphrase extraction. Our results on five datasets of research papers show that the word embeddings combined with document specific features achieve high performance and outperform strong baselines for this task.

Objectives: To analyze the content of publications within the medical Natural Language Processing (NLP) domain in 2018. Methods: Automatic and manual pre-selection of publications to be reviewed, and selection of the best NLP papers of the year. Analysis of the important issues. Results: Two best papers have been selected this year. One dedicated to the generation of multi- documents summaries and another dedicated to the generation of imaging reports. We also proposed an analysis of the content of main research trends of NLP publications in 2018. Conclusions: The year 2018 is very rich with regard to NLP issues and topics addressed. It shows the will of researchers to go towards robust and reproducible results. Researchers also prove to be creative for original issues and approaches.

This paper presents the development of a test paper checker that will recognize a handwritten text using Intelligent Character Recognition (ICR) for Alphanumeric Characters. An examination can be conducted in two ways—digital and manual—and each way has a different approach in checking. In this study, the main objective is to recognize alphanumeric handwritten characters accurately using intelligent character recognition. OpenCV is used in the Python programming language and Support Vector Machine as a tool in machine learning for ICR. Answer sheet was designed with 120 items for MCQ and problem-solving questions. Item analysis and printing of results are included in the device. Experiments were conducted by giving an actual examination from the 131 participants in Technological University of the Philippines for testing the accuracy of the device. The results obtained from comparing manual and machine checking had an accuracy of 93.0769%. Thus, the proposed method is applicable for the development of handwritten character recognition.

In this survey paper, we point out a comparative study on different types of plant leaf diseases and all the techniques of machine learning which had been used to detect plant leaf disease. This was accomplished for two principle reasons: to restrain the length of the paper and in light of the fact that techniques managing roots, seeds and natural products have a few idiosyncrasies that would warrant a particular study. The chose proposition are isolated into three classes as indicated by their goal: recognition, seriousness measurement, and characterization. Every one of those classes, thus, are subdivided by the primary specialized arrangement utilized in the calculation. This paper is required to be helpful to specialists working both on vegetable pathology and example acknowledgment, giving a thorough and open outline of this significant field of research.

We present DeepPaperComposer, a simple solution for preparing highly accurate (100%) training data without manual labeling to extract content from scholarly articles using convolutional neural networks (CNNs). We used our approach to generate data and trained CNNs to extract eight categories of both textual (titles, abstracts, headers, figure and table captions, and other texts) and non-textural content (figures and tables) from 30 years of IEEE VIS conference papers, of which a third were scanned bitmap PDFs. We curated this dataset and named it VISpaper-3K. We then showed our initial benchmark performance using VISpaper-3K over itself and CS-150 using YOLOv3 and Faster-RCNN. We open-source DeepPaperComposer of our training data generation and released the resulting annotation data VISpaper-3K to promote re-producible research.

This paper introduces a context-aware system, named CAPFF, for helping people in filling paper forms, mainly in two contexts: 1) people have no idea of what should be filled in certain form fields; 2) people are not aware of the mistakes they are likely to commit in entering information, which may violate data entry constraints. In the offline phase, CAPFF provides a tool to build the knowledge about a given form, and such knowledge includes instructions, field-level examples, and constraints among form fields. In the online phase, when people set out to fill a paper form, the video camera of the system determines the position of the pen and then provides assistance, based on the user's form filling context. We evaluated CAPFF's performance through 450 paper form filling activities, and the results show that the proposed CAPFF is effective in terms of both accuracy and response time.

Paper cooperation network embodies expert topic similarity in an extent, thus, a novel method is proposed for expert topic analysis and extraction by combining paper cooperation network and topic model. In the method, we extract each paper’ author information and construct an expert cooperation network. At the same time, by means of LDA model, a probabilistic topic model is also built to analyze papers’ latent topics. Then, by making full use of the feature that adjacent nodes in the expert cooperation network share similar themes distribution, we makes a constraint on expert topic distribution in Gibbs sampling process of solving the probabilistic topic model. Experimental results on NIPS dataset show that the proposed method can effectively extract expert topics, and the expert paper cooperation network plays a very good supporting role on the extracting task.

This paper studies the authentication problem of specific pieces of paper using mobile imaging devices. Prior work showing high matching accuracy has used the normal vector field , which serves as a unique, microscopic, physically unclonable feature of paper surfaces, estimated by consumer grade scanners. Industrial cameras were also used to capture the appearance of the surface rendered after the normal vector field based on the laws of optics under a semi-controlled lighting condition. In comparison, past explorations based on mobile cameras were very limited and have not had substantial success in obtaining consistent appearance images due to the uncontrolled nature of the ambient light. We show in this paper that images captured by mobile cameras can be used for authentication when the camera flashlight is exploited for creating a semi-controlled lighting condition. We have proposed new algorithms to demonstrate that the normal vector field of paper surface can be estimated by using multiple camera-captured images of different viewpoints. Perturbation analysis shows that the proposed method is robust to inaccurate estimates of camera locations, and a matching accuracy of $10^{-\textrm {4}}$ in equal error rate can be achieved using 6 to 8 images under a lab-controlled ambient light environment. Our findings can relax the restricted imaging setups and enable paper authentication under a more casual, ubiquitous setting with a mobile imaging device, which may facilitate duplicate detection of paper documents and counterfeit mitigation of merchandise packaging.

Fiber nonlinearities from Kerr effect are considered as major constraints for enhancing the transmission capacity in current optical transmission systems. Digital nonlinearity compensation techniques such as digital backpropagation can perform well but require high computing resources. Machine learning can provide a low complexity capability especially for high-dimensional classification problems. Recently several supervised and unsupervised machine learning techniques have been investigated in the field of fiber nonlinearity mitigation. This paper offers a brief review of the principles, performance and complexity of these machine learning approaches in the application of nonlinearity mitigation.

We propose a method to learn 3D deformable object categories from raw single-view images, without external supervision. The method is based on an autoencoder that factors each input image into depth, albedo, viewpoint and illumination. In order to disentangle these components without supervision, we use the fact that many object categories have, at least in principle, a symmetric structure. We show that reasoning about illumination allows us to exploit the underlying object symmetry even if the appearance is not symmetric due to shading. Furthermore, we model objects that are probably, but not certainly, symmetric by predicting a symmetry probability map, learned end-to-end with the other components of the model. Our experiments show that this method can recover very accurately the 3D shape of human faces, cat faces and cars from single-view images, without any supervision or a prior shape model. On benchmarks, we demonstrate superior accuracy compared to another method that uses supervision at the level of 2D image correspondences., CVPR 2020 Oral. Project page: https://elliottwu.com/projects/unsup3d/

We present Siam R-CNN, a Siamese re-detection architecture which unleashes the full power of two-stage object detection approaches for visual object tracking. We combine this with a novel tracklet-based dynamic programming algorithm, which takes advantage of re-detections of both the first-frame template and previous-frame predictions, to model the full history of both the object to be tracked and potential distractor objects. This enables our approach to make better tracking decisions, as well as to re-detect tracked objects after long occlusion. Finally, we propose a novel hard example mining strategy to improve Siam R-CNN's robustness to similar looking objects. Siam R-CNN achieves the current best performance on ten tracking benchmarks, with especially strong results for long-term tracking. We make our code and models available at www.vision.rwth-aachen.de/page/siamrcnn., Comment: CVPR 2020 camera-ready version

Imprecise composite location references formed using ad hoc spatial expressions in English text makes the geocoding task challenging for both inference and evaluation. Typically such spatial expressions fill in unestablished areas with new toponyms for finer spatial referents. For example, the spatial extent of the ad hoc spatial expression "north of" or "50 minutes away from" in relation to the toponym "Dayton, OH" refers to an ambiguous, imprecise area, requiring translation from this qualitative representation to a quantitative one with precise semantics using systems such as WGS84. Here we highlight the challenges of geocoding such referents and propose a general formal representation that employs background knowledge, semantic approximations and rules, and fuzzy linguistic variables. We also discuss an appropriate evaluation technique for the task that is based on human contextualized and subjective judgment.

Tremendous academic information causes serious information overload problems while supporting scientific research. Scientific paper and citation recommendation systems have been developed to relieve this problem and work as a filter to furnish only relevant papers to researchers. Although previous studies have made comparative progress, this problem is still challenging because current paper recommendation systems rely on heterogeneous and multi-sourced features, thereby requiring a unified learning representation to cover different types and modalities of information. Additionally, the implicit influence of scholars’ previous preferences of writing and citing on his/her new manuscript has not been well considered in the previous studies. Facing the issue from these two aspects, in this paper, a heterogeneous knowledge embedding-based attentive RNN model is proposed to recommend scientific paper citations. First, the preparation of features consists of two parts: (1) building a unified learning representation of structural entities and relations for recommending paper citations; and (2) defining and constructing a bibliographic network comprising five types of entities and five relations. The bibliographic network enables learning a unified representation so that all graphical entities and relations can be vectorized using TransD. To establish textual representations, the PV-DM model is utilized to generate numeric features for the title of each paper. Second, by combining structural and textual representations focusing on the “author-text query” scenario, an attentive bidirectional RNN is constructed to recommend paper and citation based on an user’s identity with a length-limited inquiry to capture the scholars’ previous writing and citing preferences, thereby reducing recommendation error. Through the DBLP dataset, our experiment results show the feasibility and effectiveness of our method, both in terms of the number as well as the quality of the first few recommended items. In specific, compared with existing models, our model has improved MRR and NDCG by approximately 4.8% and 2.4%, respectively.

Industrial archived process data represent a convenient source of information for data-driven models, such as artificial neural network (ANN), that can be used for safety and efficiency improvement like early or even predictive fault detection and diagnosis (FDD). Nonetheless, most of the data used for model generation are representative of the process nominal states and therefore are not enough for classification problems intended to determine abnormal process conditions. This work proposes the use of techniques to augment the original real data standards, dismissing the need for experiments that could jeopardize process safety. It uses the Monte Carlo technique to artificially increase the number of model inputs coupled to the nearest neighbor search (NNS) by geometric distances to consistently classify the generated patterns in normal or faulty statuses. Finally, a radial basis function neural network is trained with the augmented data. The methodology was validated by a study case in which 3381 pulp and paper industrial data points were expanded to monitor the formation of particles in a recovery boiler. Only 5.8% of the original process data were examples of faulty conditions, but the new expanded and balanced data collection leveraged the classification performance of the neural network, allowing its future use for monitoring purpose.

For user-friendliness, many software systems offer progress indicators for long-duration tasks. A typical progress indicator continuously estimates the remaining task execution time as well as the portion of the task that has been finished. Building a machine learning model often takes a long time, but no existing machine learning software supplies a non-trivial progress indicator. Similarly, running a data mining algorithm often takes a long time, but no existing data mining software provides a nontrivial progress indicator. In this article, we consider the problem of offering progress indicators for machine learning model building and data mining algorithm execution. We discuss the goals and challenges intrinsic to this problem. Then we describe an initial framework for implementing such progress indicators and two advanced, potential uses of them, with the goal of inspiring future research on this topic

We propose a typesafe abstraction to tensors (i.e. multidimensional arrays) exploiting the type-level programming capabilities of Scala through heterogeneous lists (HList), and showcase typesafe abstractions of common tensor operations and various neural layers such as convolution or recurrent neural networks. This abstraction could lay the foundation of future typesafe deep learning frameworks that runs on Scala/JVM.

Today, modeling and subsequent digital model representations are essential constituents in collaborative endeavors on organizational change. Once created, models need to be digitized for shared stakeholder understanding and further processing. Whenever paper serves as carrier medium, it is likely to disrupt further processing, elicitation, and modeling. While digital environments support transformation processes in collaborative modeling from its very beginning, the necessary technical infrastructure still might hamper situated capturing of models. Hence, this contribution aims to reduce the need for sophisticated technical components by enabling stakeholders to capture their paper-based models in a situation-sensitive way. We present a system that enables capturing paper-based models with mundane technical means by end users under uncontrolled conditions. We describe the components developed for recognition of these models and embed it in a mixed-modality workflow supported by a tabletop interfacing a web platform for further processing. As our empirical evidence demonstrates, this approach enables both situated and error-tolerant capturing of hand-drawn conceptual models by individual users. Moreover, it can be integrated with more sophisticated IT-based modeling tools for further digital processing.

This research is concerned with the detection of similar academic papers. Given a tested paper from a given corpus of 10,099 peer-reviewed scientific papers, a two-stage process was activated. During the first stage, most of the papers were filtered out using a fast filter method. In the second stage, in order to detect similar papers we applied 23 heuristic variants derived from 3 novel prototype methods using various parameter settings. The three novel prototype methods are: CT-TR Constant Number of randomized T fingerprints, compared to each one-third of R (first/middle/last) fingerprints, CT-AR: Constant Number of randomized T fingerprints, compared to all R fingerprints, and CDT-AR: Constant Number of divided randomized T fingerprints compared, to all R fingerprints. Results achieved by the new methods are superior to those of previous heuristic methods, which were approximations of the Full Fingerprint (FF) method, currently considered the best heuristic method. The order of this new methods' run-time, (n), is far more efficient than the order of the FF method run-time, (n2) (after removing short documents from the corpus).

Academic research is crucial to the development of science and technology and is an important factor that affects national strength. When writing an academic research paper, a rhetorical structure is typically used to present the paper’s ideas, but this task is quite difficult for junior researchers. To solve this problem, some studies have adopted text mining to assist with the writing, but the existing methods still require human intervention to generate sentences. Recently, due to the increasing maturity of deep learning technology and the ability to address the problem of automatic text generation, progress has been made in this area. The highly complex deep learning operations can correctly generate sequences and find correlations between sequences. When a user provides a few keywords and key sentences, the proposed algorithm can generate an introduction section for the user. The results show that the generated introduction is more coherent, clearer, and more fluent than existing summarization methods. In addition, the method proposed in this study improves the accuracy compared with traditional text extraction methods. The manuscript produced by this study has been evaluated to show that the study can produce a comprehensive introduction compared with previous studies.

Researchers face millions of research papers on various digital libraries. Therefore, finding relevant research work that meets the preferences of a researcher is a challenging task. Hence, different paper recommendation models have been proposed to address this issue. However, these models lack in exploiting prominent information factors, namely: papers’ citations proximity, authors’ information, papers’ topical relevance, venues’ information, researchers’ preference dynamics, and labels information to produce quality recommendations. Additionally, these models encounter problems such as cold start papers and data sparsity. To overcome these problems, this paper presents a weighted probabilistic paper recommendation model termed as PR-HNE, which jointly learns researchers’ and papers’ dynamics by encoding information from six information networks into a joint latent space. Specifically, it captures papers’ citation proximity, authors’ collaboration proximity, venues’ information, labeled information, and topical relevance to generate personalized paper recommendations. Compared to state-of-the-art models, the results generated by PR-HNE over publicly available datasets prove 4% and 6% improvement in Mean Average Precision (MAP) and Mean Reciprocal Rank (MRR) metrics, respectively. Further, in the cold-start papers problem, the proposed model produced 8% better recall score than its counterparts.

Paper checks may have complex background features including fine lines and patterns, which make forgery more difficult. Also, halftoning techniques are used to produce continuous tones and to prevent copies with void pantograph features. When these kinds of checks are scanned, Moire patterns may occur. These patterns make it difficult for customers to examine the scanned check images on ATM (Automated Teller Machine) displays. They also can decrease the classification accuracy of check recognition systems. In this paper, we propose an algorithm to enhance the perceptual quality of scanned check images by reducing the Moire patterns. The proposed algorithm consists of foreground extraction, Moire detection and Moire removal. Subjective image quality assessment was performed to evaluate the degree of improvement. Experimental results show that the proposed algorithm improves perceptual quality while maintaining check recognition accuracy.