Reviewerly/exHarmony huggingface dataset:
A Temporal Learning Approach to Inpainting Endoscopic Specularities and Its effect on Image Correspondence

Computer vision has been utilized to analyze mini- mally invasive surgery videos and aid with polyp detec- tion, tool localization, and organ 3D modelling tasks. However, irregular light patterns such as saturation, specular highlights, or extreme contrasts occlude texture and hinder these tasks. In this work, specular highlights were removed and the occluded data was reconstructed. To do that, an unsupervised temporal generative ad- versarial network (GAN) was used to inpaint specular highlights spatially and temporally. Due to the absence of a dataset with ground truth occluded textures, the network was trained on the in-vivo gastric endoscopy dataset (Hyper-Kvasir [1]) with specular highlight masks that were automatically created and processed to act as pseudo ground truths. Ablation studies and direct comparison with other methods were used to show the improved results of our system. In addition, the results on various datasets show the generalizability of our net- work on different environments and procedures as shown in Fig. 1. Finally, experiments also show the positive effect of inpainting on other computer vision tasks under the umbrella of 3D reconstruction and localization in endoscopy including feature matching as well as optical flow and disparity estimation.
A Secure Image Encryption and Embedding Approach using MRSA and RC6 with DCT Transformation

The growing potentialities of recent communications necessitate information security on the computer network.The various fields such as banking, E-commerce, education, and health sectors depend on the online network to communicate.Information security is becoming more significant.Hackers can get the data if it is sent as it is in an unsafe network.Therefore, security challenges like confidentiality, integrity & undetectability are essential to safeguard sensitive data from unauthorized users.To secure communicated information from a third party, it is necessary to convert the information into a scrambled form.Researchers have used various cryptographic and steganographic algorithms.The public key and private key cryptographic algorithms are suitable to scramble the input secret data.Using private key algorithms, key exchange is a challenge.Always two-level of scrambling of data is safe.After scrambling, embed it in cover media by using suitable transform domain techniques to provide higher security.In the proposed method, two-level scrambling of input secret images is carried out by applying faster processing symmetric algorithms such as Rivest Cipher 6 (RC6) & One Time Pad (OTP) to enhance the security of images.As these algorithms use the key on their own, it becomes difficult for any intruder to extract and identify the keys.Also, there is a necessity to safely send keys to the recipient.These two keys are scrambled using a public key cryptographic algorithm such as Modified Rivest-Shamir-Adleman (MRSA) algorithm.This reduces the chances of stealing the keys.Another level of security for the scrambled image is provided by embedding it in cover media using DC coefficients resulting in the stego image.Send the stego image and scrambled keys to the receiver.Simulation outcomes and analysis show that the proposed method provides two-level security for color image mediation and key authentication.
Aspect-Based Sentiment Analysis of KAI Access Reviews Using NBC and SVM

The existence of KAI Access from PT. KAI prove their sincerity in serving consumers in this modern era. However, many negative reviews found in Google Play Store. There has been research on the review, but the analysis stage still at document level so the aspect related to the application is not known clearly and structured. So it is necessary to do an aspect-based sentiment analysis to extract the aspects and the sentiment. This study aims to do an aspect-based sentiment analysis on user reviews of KAI Access using Naive Bayes Classifier (NBC) and Support Vector Machine (SVM), with 3 scenarios. Scenario 1 uses NBC with Multinomial Naive Bayes, scenario 2 uses SVM with default Sklearn library parameter, and scenario 3, uses SVM with hyperparameter tunning, while the data scrapped from Google Play Store. The results show the majority of user sentiment is negative for each aspect, with most discussed errors aspect shows the high system errors. The test results gives the best model from scenario 3 with an average accuracy 91.63%, f1-score 75.55%, precision 77.60%, and recall 74.47%.
Comparative Analysis of Skew-Join Strategies for Large-Scale Datasets with MapReduce and Spark

In the era of data deluge, Big Data gradually offers numerous opportunities, but also poses significant challenges to conventional data processing and analysis methods. MapReduce has become a prominent parallel and distributed programming model for efficiently handling such massive datasets. One of the most elementary and extensive operations in MapReduce is the join operation. These joins have become ever more complex and expensive in the context of skewed data, in which some common join keys appear with a greater frequency than others. Some of the reduction tasks processing these join keys will finish later than others; thus, the benefits of parallel computation become meaningless. Some studies on the problem of skew joins have been conducted, but an adequate and systematic comparison in the Spark environment has not been presented. They have only provided experimental tests, so there is still a shortage of representations of mathematical models on which skew-join algorithms can be compared. This study is, therefore, designed to provide the theoretical and practical basics for evaluating skew-join strategies for large-scale datasets with MapReduce and Spark—both analytically with cost models and practically with experiments. The objectives of the study are, first, to present the implementation of prominent skew-join algorithms in Spark, second, to evaluate the algorithms by using cost models and experiments, and third, to show the advantages and disadvantages of each one and to recommend strategies for the better use of skew joins in Spark.
An Efficient Anchor-Free Face Detector with Attention Mechanisms

Enormous progress has been made in face detection tasks due to the rapid development of deep learning techniques. Meanwhile, debates arise on whether face detection should be treated as a generic object detection task or considered differently. In this paper, we design an efficient anchor-free face detector that focuses on a low flops regime and combines recent advances in generic object detection with the methods for detecting tiny faces. Specifically, we adopt the anchor-free Fully Convolutional One-Stage (FCOS) method with a recently developed Visual Attention Network (VAN) as the base detector. In accordance with the characteristics of the face dataset, we reallocate the computation across the network components by adjusting the network configurations of the base detector. Then we redesign the criteria for marking positive samples to realize a balanced distribution in pixel maps, and we also adopt the quadruple pixel prediction, which enables more positive samples matched with the model outputs. Under VGA resolution, our face detector achieves 70.5% in AP on the hard subset of the WIDER FACE dataset, while the computational cost is only 1.05 Gflops. This accuracy efficiency trade-off is comparable to state-of-the-art results.
Church after Sunday

Community + Culture features practitioner perspectives on designing technologies for and with communities. We highlight compelling projects and provocative points of view that speak to both community technology practice and the interaction design field as a whole. --- Sheena Erete, Editor
Towards the Adoption of Novel Visualizations in Public Health

Visualizations form an important part of public health informatics (PHI) communications. Visualizing data facilitates discussion, aids understanding, makes patterns apparent, promotes analysis, and fosters recall. How rare are novel visualizations in the PHI literature? In Phase 1, we used a rapid review methodology to test the commonness of the Sankey diagram in the PHI theory literature via an automated text search for key terms. In Phase 2, we prototype an uncommon chart type. A total of 27 relvant papers were searched and a computer-generated Sankey diagram was prototyped. PHI professionals have access to visualization tools emerging from social media and niche systems. PHI literature underutilizes uncommon visualizations requiring programming expertise. The authors advocate for: multi-disciplinary teamwork, technical education, the use of open visualization tools, and further adoption of visualization for public health professionals.
A text data mining approach to the study of emotions triggered by new advertising formats during the COVID-19 pandemic

Under the influence of the health emergency triggered by the COVID-19 pandemic, many brands changed their communication strategy and included more or less explicit references to the principles of solidarity and fraternity in their TV commercials to boost the confidence and hope of Italian families during the lockdown. The traditional attitudes of the advertising format, which focused on product characteristics, were relegated to the background in order to reinforce the "brand image" through words, signs, hashtags and music that spread empathetic messages to all those who needed to regain hope and trust in a time of extreme emotional fragility. The objective of this paper is to identify the emotions and brand awareness during the lockdown using text mining techniques by measuring customer sentiment expressed on the Twitter social network. Our proposal starts from an unstructured corpus of 20,982 tweets processed with text data mining techniques to identify patterns and trends in people's posts related to specific hashtags and TV ads produced during the COVID-19 pandemic. The innovations in the brand's advertising among consumers seem to have triggered some sense of appreciation and gratitude, as well as a strong sense of belonging that was not present before, as the TV ads were perceived as a disruptive element in consumers' tweets. Although this effect is clearly documented, in this paper we demonstrate its transitory nature, in the sense that the frequency of occurrence of terms associated with an emotional dimension peaks during the weeks of lockdown, and then gradually decreases.
Meta-Optimization of Dimension Adaptive Parameter Schema for Nelder–Mead Algorithm in High-Dimensional Problems

Although proposed more than half a century ago, the Nelder–Mead simplex search algorithm is still widely used. Four numeric constants define the operations and behavior of the algorithm. The algorithm with the original constant values performs fine on most low-dimensional, but poorly on high-dimensional, problems. Therefore, to improve its behavior in high dimensions, several adaptive schemas setting the constants according to the problem dimension were proposed in the past. In this work, we present a novel adaptive schema obtained by a meta-optimization procedure. We describe a schema candidate with eight parameters subject to meta-optimization and define an objective function evaluating the candidate’s performance. The schema is optimized on up to 100-dimensional problems using the Parallel Simulated Annealing with Differential Evolution global method. The obtained global minimum represents the proposed schema. We compare the performance of the optimized schema with the existing adaptive schemas. The data profiles on the Gao–Han modified quadratic, Moré–Garbow–Hilstrom, and CUTEr (Constrained and Unconstrained Testing Environment, revisited) benchmark problem sets show that the obtained schema outperforms the existing adaptive schemas in terms of accuracy and convergence speed.
Domain-Lifted Sampling for Universal Two-Variable Logic and Extensions

Given a first-order sentence ? and a domain size n, how can one sample a model of ? on the domain {1, . . . , n} efficiently as n scales? We consider two variants of this problem: the uniform sampling regime, in which the goal is to sample a model uniformly at random, and the symmetric weighted sampling regime, in which models are weighted according to the number of groundings of each predicate appearing in them. Solutions to this problem have applications to the scalable generation of combinatorial structures, as well as sampling in several statistical-relational models such as Markov logic networks and probabilistic logic programs. In this paper, we identify certain classes of sentences that are domain-liftable under sampling, in the sense that they admit a sampling algorithm that runs in time polynomial in n. In particular, we prove that every sentence of the form ∀x∀y: ?(x, y) for some quantifier-free formula ?(x,y) is domain-liftable under sampling. We then further show that this result continues to hold in the presence of one or more cardinality constraints as well as a single tree axiom constraint.
Identifiability of Linear AMP Chain Graph Models

We study identifiability of linear Andersson-Madigan-Perlman (AMP) chain graph models, which are a common generalization of linear structural equation models and Gaussian graphical models. AMP models are described by DAGs on chain components which themselves are undirected graphs. For a known chain component decomposition, we show that the DAG on the chain components is identifiable if the determinants of the residual covariance matrices of the chain components are equal (or more generally, monotone non-decreasing in topological order). This condition extends the equal variance identifiability criterion for Bayes nets, and it can be generalized from determinants to any super-additive function on positive semidefinite matrices. When the component decomposition is unknown, we describe conditions that allow recovery of the full structure using a polynomial time algorithm based on submodular function minimization. We also conduct experiments comparing our algorithm's performance against existing baselines.
Clustering Approach to Solve Hierarchical Classification Problem Complexity

In a large domain of classification problems for real applications, like human activity recognition, separable spaces between groups of concepts are easier to learn than each concept alone. This is because the search space biases required to separate groups of classes (or concepts) are more relevant than the ones needed to separate classes individually. For example, it is easier to learn the activities related to the body movements group (running, walking) versus "on-wheels" activities group (bicycling, driving a car), before learning more specific classes inside each of these groups. Despite the obvious interest of this approach, our theoretical analysis shows a high complexity for finding an exact solution. We propose in this paper an original approach based on the association of clustering and classification approaches to overcome this limitation. We propose a better approach to learn the concepts by grouping classes recursively rather than learning them class by class. We introduce an effective greedy algorithm and two theoretical measures, namely cohesion and dispersion, to evaluate the connection between the clusters and the classes. Extensive experiments on the SHL dataset show that our approach improves classification performances while reducing the number of instances used to learn each concept.
PrivateMail: Supervised Manifold Learning of Deep Features with Privacy for Image Retrieval

Differential Privacy offers strong guarantees such as immutable privacy under any post-processing. In this work, we propose a differentially private mechanism called PrivateMail for performing supervised manifold learning. We then apply it to the use case of private image retrieval to obtain nearest matches to a client’s target image from a server’s database. PrivateMail releases the target image as part of a differentially private manifold embedding. We give bounds on the global sensitivity of the manifold learning map in order to obfuscate and release embeddings with differential privacy inducing noise. We show that PrivateMail obtains a substantially better performance in terms of the privacy-utility trade off in comparison to several baselines on various datasets. We share code for applying PrivateMail at http://tiny.cc/PrivateMail.
Flexible Instance-Specific Rationalization of NLP Models

Recent research on model interpretability in natural language processing extensively uses feature scoring methods for identifying which parts of the input are the most important for a model to make a prediction (i.e. explanation or rationale). However, previous research has shown that there is no clear best scoring method across various text classification tasks while practitioners typically have to make several other ad-hoc choices regarding the length and the type of the rationale (e.g. short or long, contiguous or not). Inspired by this, we propose a simple yet effective and flexible method that allows selecting optimally for each data instance: (1) a feature scoring method; (2) the length; and (3) the type of the rationale. Our method is inspired by input erasure approaches to interpretability which assume that the most faithful rationale for a prediction should be the one with the highest difference between the model's output distribution using the full text and the text after removing the rationale as input respectively. Evaluation on four standard text classification datasets shows that our proposed method provides more faithful, comprehensive and highly sufficient explanations compared to using a fixed feature scoring method, rationale length and type. More importantly, we demonstrate that a practitioner is not required to make any ad-hoc choices in order to extract faithful rationales using our approach.
Optimize What You Evaluate With: Search Result Diversification Based on Metric Optimization

Most of the existing methods for search result diversification (SRD) appeal to the greedy strategy for generating diversified results, which is formulated as a sequential process of selecting documents one-by-one, and the locally optimal choice is made at each round. Unfortunately, this strategy suffers from the following shortcomings: (1) Such a one-by-one selection process is rather time-consuming for both training and inference. (2) It works well on the premise that the preceding choices are optimal or close to the optimal solution. (3) The mismatch between the objective function used in training and the final evaluation measure used in testing has not been taken into account. We propose a novel framework through direct metric optimization for SRD (referred to as MO4SRD) based on the score-and-sort strategy. Specifically, we represent the diversity score of each document that determines its rank position based on a probability distribution. These distributions over scores naturally give rise to expectations over rank positions. Armed with this advantage, we can get the differentiable variants of the widely used diversity metrics. Thanks to this, we are able to directly optimize the evaluation measure used in testing. Moreover, we have devised a novel probabilistic neural scoring function. It jointly scores candidate documents by taking into account both cross-document interaction and permutation equivariance, which makes it possible to generate a diversified ranking via a simple sorting. The experimental results on benchmark collections show that the proposed method achieves significantly improved performance over the state-of-the-art results.
DeepType 2: Superhuman Entity Linking, All You Need Is Type Interactions

Across multiple domains from computer vision to speech recognition, machine learning models have been shown to match or outperform human experts at recognition tasks. We lack such a comparison point for Entity Linking. We construct a human benchmark on two standard datasets (TAC KBP 2010 and AIDA (YAGO)) to measure human accuracy. We find that current systems still fall short of human performance. We present DeepType 2, a novel entity linking system that closes the gap. Our proposed approach overcomes shortcomings of previous type-based entity linking systems, and does not use pre-trained language models to reach this level. Three key innovations are responsible for DeepType 2's performance: 1) an abstracted representation of entities that favors shared learning and greater sample efficiency, 2) autoregressive entity features indicating type interactions (e.g. list type homogeneity, shared employers, geographical co-occurrence) with previous predictions that enable globally coherent document-wide predictions, 3) the entire model is trained end to end using a single entity-level maximum likelihood objective function. This is made possible by associating a context-specific score to each of the entity's abstract representation's sub-components (types), and summing these scores to form a candidate entity logit. In this paper, we explain how this factorization focuses the learning on the salient types of the candidate entities. Furthermore, we show how the scores can serve as a rationale for predictions. The key contributions of this work are twofold: 1) we create the first human performance benchmark on standard benchmarks in entity linking (TAC KBP 2010 and AIDA (YAGO)) which will be made publicly available to support further analyses, 2) we obtain a new state of the art on these datasets and are the first to outperform humans on our benchmark. We perform model ablations to measure the contribution of the different facets of our system. We also include an analysis of human and algorithmic errors to provide insights into the causes, notably originating from journalistic style and historical context.
Dual Decoupling Training for Semi-supervised Object Detection with Noise-Bypass Head

Pseudo bounding boxes from the self-training paradigm are inevitably noisy for semi-supervised object detection. To cope with that, a dual decoupling training framework is proposed in the present study, i.e. clean and noisy data decoupling, and classification and localization task decoupling. In the first decoupling, two-level thresholds are used to categorize pseudo boxes into three groups, i.e. clean backgrounds, noisy foregrounds and clean foregrounds. With a specially designed noise-bypass head focusing on noisy data, backbone networks can extract coarse but diverse information; and meanwhile, an original head learns from clean samples for more precise predictions. In the second decoupling, we take advantage of the two-head structure for better evaluation of localization quality, thus the category label and location of a pseudo box can remain independent of each other during training. The approach of two-level thresholds is also applied to group pseudo boxes into three sections of different location accuracy. We outperform existing works by a large margin on VOC datasets, reaching 54.8 mAP(+1.8), and even up to 55.9 mAP(+1.5) by leveraging MS-COCO train2017 as extra unlabeled data. On MS-COCO benchmark, our method also achieves about 1.0 mAP improvements averaging across protocols compared with the prior state-of-the-art.