SoroushVahidi/scidocs huggingface dataset:
Modified image segmentation method based on region growing and region merging
(2016)

Image segmentation is one of the basic concepts widely used in each and every fields of image processing. The entire process of the proposed work for image segmentation comprises of 3 phases: Threshold generation with dynamic Modified Region Growing phase (DMRG), texture feature generation phase and region merging phase. by dynamically changing two thresholds, the given input image can be performed as DMRG, in which the cuckoo search optimization algorithm helps to optimize the two thresholds in modified region growing. after obtaining the region growth segmented image, the edges are detected with edge detection algorithm. In the second phase, the texture feature is extracted using entropy based operation from the input image. In region merging phase, the results obtained from the texture feature generation phase is combined with the results of DMRG phase and similar regions are merged by using a distance comparison between regions. The proposed work is implemented using Mat lab platform with several medical images. the performance of the proposed work is evaluated using the metrics sensitivity, specificity and accuracy. the results show that this proposed work provides very good accuracy for the segmentation process in images.
Style Augmentation: Data Augmentation via Style Randomization
(2018)

We introduce style augmentation, a new form of data augmentation based on random style transfer, for improving the robustness of convolutional neural networks (CNN) over both classification and regression based tasks. During training, our style augmentation randomizes texture, contrast and color, while preserving shape and semantic content. This is accomplished by adapting an arbitrary style transfer network to perform style randomization, by sampling input style embeddings from a multivariate normal distribution instead of inferring them from a style image. In addition to standard classification experiments, we investigate the effect of style augmentation (and data augmentation generally) on domain transfer tasks. We find that data augmentation significantly improves robustness to domain shift, and can be used as a simple, domain agnostic alternative to domain adaptation. Comparing style augmentation against a mix of seven traditional augmentation techniques, we find that it can be readily combined with them to improve network performance. We validate the efficacy of our technique with domain transfer experiments in classification and monocular depth estimation, illustrating consistent improvements in generalization.
Globally optimal toon tracking
(2016)

The ability to identify objects or region correspondences between consecutive frames of a given hand-drawn animation sequence is an indispensable tool for automating animation modification tasks such as sequence-wide recoloring or shape-editing of a specific animated character. Existing correspondence identification methods heavily rely on appearance features, but these features alone are insufficient to reliably identify region correspondences when there exist occlusions or when two or more objects share similar appearances. To resolve the above problems, manual assistance is often required. In this paper, we propose a new correspondence identification method which considers both appearance features and motions of regions in a global manner. We formulate correspondence likelihoods between temporal region pairs as a network flow graph problem which can be solved by a well-established optimization algorithm. We have evaluated our method with various animation sequences and results show that our method consistently outperforms the state-of-the-art methods without any user guidance.
Aesthetic quality classification of photographs based on color harmony
(2011)

Aesthetic quality classification plays an important role in how people organize large photo collections. In particular, color harmony is a key factor in the various aspects that determine the perceived quality of a photo, and it should be taken into account to improve the performance of automatic aesthetic quality classification. However, the existing models of color harmony take only simple color patterns into consideration–e.g., patches consisting of a few colors–and thus cannot be used to assess photos with complicated color arrangements. In this work, we tackle the challenging problem of evaluating the color harmony of photos with a particular focus on aesthetic quality classification. A key point is that a photograph can be seen as a collection of local regions with color variations that are relatively simple. This led us to develop a method for assessing the aesthetic quality of a photo based on the photo's color harmony. We term the method ‘bags-of-color-patterns.’ Results of experiments on a large photo collection with user-provided aesthetic quality scores show that our aesthetic quality classification method, which explicitly takes into account the color harmony of a photo, outperforms the existing methods. Results also show that the classification performance is improved by combining our color harmony feature with blur, edges, and saliency features that reflect the aesthetics of the photos.
Estimation of IMU and MARG orientation using a gradient descent algorithm
(2011)

This paper presents a novel orientation algorithm designed to support a computationally efficient, wearable inertial human motion tracking system for rehabilitation applications. It is applicable to inertial measurement units (IMUs) consisting of tri-axis gyroscopes and accelerometers, and magnetic angular rate and gravity (MARG) sensor arrays that also include tri-axis magnetometers. The MARG implementation incorporates magnetic distortion compensation. The algorithm uses a quaternion representation, allowing accelerometer and magnetometer data to be used in an analytically derived and optimised gradient descent algorithm to compute the direction of the gyroscope measurement error as a quaternion derivative. Performance has been evaluated empirically using a commercially available orientation sensor and reference measurements of orientation obtained using an optical measurement system. Performance was also benchmarked against the propriety Kalman-based algorithm of orientation sensor. Results indicate the algorithm achieves levels of accuracy matching that of the Kalman based algorithm; < 0.8° static RMS error, < 1.7° dynamic RMS error. The implications of the low computational load and ability to operate at small sampling rates significantly reduces the hardware and power necessary for wearable inertial movement tracking, enabling the creation of lightweight, inexpensive systems capable of functioning for extended periods of time.
Mori-Zwanzig formalism as a practical computational tool.
(2010)

An operational procedure is presented to compute explicitly the different terms in the generalized Langevin equation (GLE) for a few relevant variables obtained within Mori-Zwanzig formalism. The procedure amounts to introducing an artificial controlled parameter which can be tuned in such a way that the so-called projected dynamics becomes explicit and the GLE reduces to a Markovian equation. The projected dynamics can be realised in practice by introducing constraints, and it is shown that the Green-Kubo formulae computed with these dynamics do not suffer from the plateau problem. The methodology is illustrated in the example of star polymer molecules in a melt using their center of mass as relevant variables. Through this example, we show that not only the effective potentials, but also the friction forces and the noise play a very important role in the dynamics.
Revisiting Random Binning Features: Fast Convergence and Strong Parallelizability
(2016)

Kernel method has been developed as one of the standard approaches for nonlinear learning, which however, does not scale to large data set due to its quadratic complexity in the number of samples. A number of kernel approximation methods have thus been proposed in the recent years, among which the random features method gains much popularity due to its simplicity and direct reduction of nonlinear problem to a linear one. Different random feature functions have since been proposed to approximate a variety of kernel functions. Among them the Random Binning (RB) feature, proposed in the first random-feature paper [21], has drawn much less attention than the Random Fourier (RF) feature proposed also in [21]. In this work, we observe that the RB features, with right choice of optimization solver, could be orders-of-magnitude more efficient than other random features and kernel approximation methods under the same requirement of accuracy. We thus propose the first analysis of RB from the perspective of optimization, which by interpreting RB as a Randomized Block Coordinate Descent in the infinite-dimensional space, gives a faster convergence rate compared to that of other random features. In particular, we show that by drawing R random grids with at least κ number of non-empty bins per grid in expectation, RB method achieves a convergence rate of O(1/κ R)), which not only sharpens its O(1/√R) rate from Monte Carlo analysis, but also shows a κ times speedup over other random features under the same analysis framework. In addition, we demonstrate another advantage of RB in the L1-regularized setting, where unlike other random features, a RB-based Coordinate Descent solver can be parallelized with guaranteed speedup proportional to κ. Our extensive experiments demonstrate the superior performance of the RB features over other random features and kernel approximation methods.
HHCART: An Oblique Decision Tree
(2016)

Decision trees are a popular technique in statistical data classification. They recursively partition the feature space into disjoint sub-regions until each sub-region becomes homogeneous with respect to a particular class. The basic Classification and Regression Tree (CART) algorithm partitions the feature space using axis parallel splits. When the true decision boundaries are not aligned with the feature axes, this approach can produce a complicated boundary structure. Oblique decision trees use oblique decision boundaries to potentially simplify the boundary structure. The major limitation of this approach is that the tree induction algorithm is computationally expensive. In this article we present a new decision tree algorithm, called HHCART. The method utilizes a series of Householder matrices to reflect the training data at each node during the tree construction. Each reflection is based on the directions of the eigenvectors from each classes’ covariance matrix. Considering axis parallel splits in the reflected training data provides an efficient way of finding oblique splits in the unreflected training data. Experimental results show that the accuracy and size of the HHCART trees are comparable with some benchmark methods in the literature. The appealing feature of HHCART is that it can handle both qualitative and quantitative features in the same oblique split.
Stillbirths: economic and psychosocial consequences
(2016)

Despite the frequency of stillbirths, the subsequent implications are overlooked and underappreciated. We present findings from comprehensive, systematic literature reviews, and new analyses of published and unpublished data, to establish the effect of stillbirth on parents, families, health-care providers, and societies worldwide. Data for direct costs of this event are sparse but suggest that a stillbirth needs more resources than a livebirth, both in the perinatal period and in additional surveillance during subsequent pregnancies. Indirect and intangible costs of stillbirth are extensive and are usually met by families alone. This issue is particularly onerous for those with few resources. Negative effects, particularly on parental mental health, might be moderated by empathic attitudes of care providers and tailored interventions. The value of the baby, as well as the associated costs for parents, families, care providers, communities, and society, should be considered to prevent stillbirths and reduce associated morbidity.
Improved Text Extraction from PDF Documents for Large-Scale Natural Language Processing
(2014)

The inability of reliable text extraction from arbitrary documents is often an obstacle for large scale NLP based on resources crawled from the Web. One of the largest problems in the conversion of PDF documents is the detection of the boundaries of common textual units such as paragraphs, sentences and words. PDF is a file format optimized for printing and encapsulates a complete description of the layout of a document including text, fonts, graphics and so on. This paper describes a tool for extracting texts from arbitrary PDF files for the support of largescale data-driven natural language processing. Our approach combines the benefits of several existing solutions for the conversion of PDF documents to plain text and adds a language-independent post-processing procedure that cleans the output for further linguistic processing. In particular, we use the PDF-rendering libraries pdfXtk, Apache Tika and Poppler in various configurations. From the output of these tools we recover proper boundaries using on-the-fly language models and languageindependent extraction heuristics. In our research, we looked especially at publications from the European Union, which constitute a valuable multilingual resource, for example, for training statistical machine translation models. We use our tool for the conversion of a large multilingual database crawled from the EU bookshop with the aim of building parallel corpora. Our experiments show that our conversion software is capable of fixing various common issues leading to cleaner data sets in the end.
Depeche Mood: a Lexicon for Emotion Analysis from Crowd Annotated News
(2014)

While many lexica annotated with words polarity are available for sentiment analysis, very few tackle the harder task of emotion analysis and are usually quite limited in coverage. In this paper, we present a novel approach for extracting – in a totally automated way – a highcoverage and high-precision lexicon of roughly 37 thousand terms annotated with emotion scores, called DepecheMood. Our approach exploits in an original way ‘crowd-sourced’ affective annotation implicitly provided by readers of news articles from rappler.com. By providing new state-of-the-art performances in unsupervised settings for regression and classification tasks, even using a naı̈ve approach, our experiments show the beneficial impact of harvesting social media data for affective lexicon building.
Response and Habituation of the Human Amygdala during Visual Processing of Facial Expression
(1996)

We measured amygdala activity in human volunteers during rapid visual presentations of fearful, happy, and neutral faces using functional magnetic resonance imaging (fMRI). The first experiment involved a fixed order of conditions both within and across runs, while the second one used a fully counterbalanced order in addition to a low level baseline of simple visual stimuli. In both experiments, the amygdala was preferentially activated in response to fearful versus neutral faces. In the counterbalanced experiment, the amygdala also responded preferentially to happy versus neutral faces, suggesting a possible generalized response to emotionally valenced stimuli. Rapid habituation effects were prominent in both experiments. Thus, the human amygdala responds preferentially to emotionally valenced faces and rapidly habituates to them.
Deception through telling the truth ? ! : Experimental evidence from individuals and teams
(2007)

Informational asymmetries abound in economic decision making and often provide an incentive for deception through telling a lie or misrepresenting information. In this paper I use a cheap-talk sender-receiver experiment to show that telling the truth should be classified as deception too if the sender chooses the true message with the expectation that the receiver will not follow the sender’s (true) message. The experimental data reveal a large degree of ‘sophisticated’ deception through telling the truth. The robustness of my broader definition of deception is confirmed in an experimental treatment where teams make decisions. JEL-classification: C72, C91, D82
Metacognitive Beliefs About Procrastination : Development and Concurrent Validity of a Self-Report Questionnaire
(2009)

This article describes the development of a questionnaire on metacognitive beliefs about procrastination. In Study 1 we performed a principal axis factor analysis that suggested a twofactor solution for the data obtained from the preliminary questionnaire. The factors identified were named positive and negative metacognitive beliefs about procrastination. The factor analysis reduced the questionnaire from 22 to 16 items, with each factor consisting of 8 items. In Study 2 we performed a confirmatory factor analysis that provided support for the twofactor solution suggested by the exploratory factor analysis. Both factors had adequate internal consistency. Concurrent validity was partially established through correlation analyses. These showed that positive metacognitive beliefs about procrastination were positively correlated with decisional procrastination, and that negative metacognitive beliefs about procrastination were positively correlated with both decisional and behavioral procrastination. The Metacognitive Beliefs About Procrastination Questionnaire may aid future research into procrastination and facilitate clinical assessment and case formulation.
One-Class Kernel Spectral Regression for Outlier Detection
(2018)

The paper introduces a new efficient nonlinear oneclass classifier formulated as the Rayleigh quotient criterion optimisation. The method, operating in a reproducing kernel Hilbert subspace, minimises the scatter of target distribution along an optimal projection direction while at the same time keeping projections of positive observations distant from the mean of the negative class. We provide a graph embedding view of the problem which can then be solved efficiently using the spectral regression approach. In this sense, unlike previous similar methods which often require costly eigen-computations of dense matrices, the proposed approach casts the problem under consideration into a regression framework which is computationally more efficient. In particular, it is shown that the dominant complexity of the proposed method is the complexity of computing the kernel matrix. Additional appealing characteristics of the proposed one-class classifier are: 1-the ability to be trained in an incremental fashion (allowing for application in streaming data scenarios while also reducing the computational complexity in a non-streaming operation mode); 2-being unsupervised, but providing the option for refining the solution using negative training examples, when available; Last but not least, 3-the use of the kernel trick which facilitates a nonlinear mapping of the data into a high-dimensional feature space to seek better solutions. Extensive experiments conducted on several datasets verify the merits of the proposed approach in comparison with other alternatives.
Very greedy crossover in a genetic algorithm for the traveling salesman problem
(1995)

In the traveling salesman problem, we are given a set of cities and the distances between them, and we seek a shortest tour that visits each city exactly once and returns to the starting city. Many researchers have described genetic algorithms for this problem, and they have often focused on the crossover operator, which builds offspring tours by combining two parental tours. Very greedy crossover extends several of these operators; as it builds a tour, it always appends the shortest parental edge to a city not yet visited, if there is such an edge. A steady-state genetic algorithm using this operator, mutation by inversion, and rank-based probabilities for both selection and deletion shows good results on a suite of flve test problems.
Phishing detection based Associative Classification data mining
(2014)

Website phishing is considered one of the crucial security challenges for the online community due to the massive numbers of online transactions performed on a daily basis. Website phishing can be described as mimicking a trusted website to obtain sensitive information from online users such as usernames and passwords. Black lists, white lists and the utilisation of search methods are examples of solutions to minimise the risk of this problem. One intelligent approach based on data mining called Associative Classification (AC) seems a potential solution that may effectively detect phishing websites with high accuracy. According to experimental studies, AC often extracts classifiers containing simple ‘‘If-Then’’ rules with a high degree of predictive accuracy. In this paper, we investigate the problem of website phishing using a developed AC method called Multi-label Classifier based Associative Classification (MCAC) to seek its applicability to the phishing problem. We also want to identify features that distinguish phishing websites from legitimate ones. In addition, we survey intelligent approaches used to handle the phishing problem. Experimental results using real data collected from different sources show that AC particularly MCAC detects phishing websites with higher accuracy than other intelligent algorithms. Further, MCAC generates new hidden knowledge (rules) that other algorithms are unable to find and this has improved its classifiers predictive performance. 2014 Elsevier Ltd. All rights reserved.
Why phishing works
(2006)

To build systems shielding users from fraudulent (or phishing) websites, designers need to know which attack strategies work and why. This paper provides the first empirical evidence about which malicious strategies are successful at deceiving general users. We first analyzed a large set of captured phishing attacks and developed a set of hypotheses about why these strategies might work. We then assessed these hypotheses with a usability study in which 22 participants were shown 20 web sites and asked to determine which ones were fraudulent. We found that 23% of the participants did not look at browser-based cues such as the address bar, status bar and the security indicators, leading to incorrect choices 40% of the time. We also found that some visual deception attacks can fool even the most sophisticated users. These results illustrate that standard security indicators are not effective for a substantial fraction of users, and suggest that alternative approaches are needed.
Decision strategies and susceptibility to phishing
(2006)

Phishing emails are semantic attacks that con people into divulging sensitive information using techniques to make the user believe that information is being requested by a legitimate source. In order to develop tools that will be effective in combating these schemes, we first must know how and why people fall for them. This study reports preliminary analysis of interviews with 20 non-expert computer users to reveal their strategies and understand their decisions when encountering possibly suspicious emails. One of the reasons that people may be vulnerable to phishing schemes is that awareness of the risks is not linked to perceived vulnerability or to useful strategies in identifying phishing emails. Rather, our data suggest that people can manage the risks that they are most familiar with, but don't appear to extrapolate to be wary of unfamiliar risks. We explore several strategies that people use, with varying degrees of success, in evaluating emails and in making sense of warnings offered by browsers attempting to help users navigate the web.