SoroushVahidi/scidocs huggingface dataset:
Automatic White Balance for Digital Still Cameras
(2006)

In recent years digital cameras have captured the camera market. Although the factors that consumer consider is the quality of the photographs produced. White balance is one of the methods used to improve the quality of the photographs. The basic white balance methods are, however powerless to handle all possible situations in the captured scene. In order to improve the white balance we divide this problem in three steps–white object purification, white point detection, and white point adjustment. The proposed method basically solves the problem of detecting the white point very well. The experimental results show that the proposed method can achieve superior result in both objective and subjective evaluative terms. The complexity of the proposed system is acceptable. The propose method can be easily applied to digital cameras to obtain good results.
Human Visual Search as a Deep Reinforcement Learning Solution to a POMDP
(2017)

When people search for a target in a novel image they often make use of eye movements to bring the relatively high acuity fovea to bear on areas of interest. The strategies that control these eye movements for visual search have been of substantial scientific interest. In the current article we report a new computational model that shows how strategies for visual search are an emergent consequence of perceptual/motor constraints and approximately optimal strategies. The model solves a Partially Observable Markov Decision Process (POMDP) using deep Q-learning to acquire strategies that optimise the tradeoff between speed and accuracy. Results are reported for the Distractor-ratio task.
Learning with Taxonomies: Classifying Documents and Words
(2003)

Automatically extracting semantic information about word meaning and document topic from text typically involves an extensive number of classes. Such classes may represent predefined word senses, topics or document categories and are often organized in a taxonomy. The latter encodes important information, which should be exploited in learning classifiers from labeled training data. To that extent, this paper presents an extension of multiclass Support Vector Machine learning which can incorporate prior knowledge about class relationships. The latter can be encoded in the form of class attributes, similarities between classes or even a kernel function defined over the set of classes. The paper also discusses how to specify and optimize meaningful loss functions based on the relative position of classes in the taxonomy. We include experimental results for text categorization and for word sense classification.
Learning scale-variant and scale-invariant features for deep image classification
(2017)

Convolutional Neural Networks (CNNs) require large image corpora to be trained on classification tasks. The variation in image resolutions, sizes of objects and patterns depicted, and image scales, hampers CNN training and performance, because the task-relevant information varies over spatial scales. Previous work attempting to deal with such scale variations focused on encouraging scale-invariant CNN representations. However, scale-invariant representations are incomplete representations of images, because images contain scale-variant information as well. This paper addresses the combined development of scaleinvariant and scale-variant representations. We propose a multiscale CNN method to encourage the recognition of both types of features and evaluate it on a challenging image classification task involving task-relevant characteristics at multiple scales. The results show that our multi-scale CNN outperforms single-scale CNN. This leads to the conclusion that encouraging the combined development of a scale-invariant and scale-variant representation in CNNs is beneficial to image recognition performance.
Design of new intelligent street light control system
(2010)

In China, the methods of time-control, optical-control and time-optical-control are in common used to control street lamp, particularly in small and medium-sized cities. But due to the backward lighting control and administrative method, the precision is bad, and the result of work is also poor. Through many kinds of sensor combination sense environment's change, the multi-sensor exhibition can combinatory logically control the new intelligent street light controller system. And based on the degree of illumination control fixed time, in the automatic foundation fixed time, according to the multi-sensing exhibition survey data's special combination change, to control the street light nimbly; the system can also realize the automatic timing control, by pre-installing time to control street light switch and ultimately to control the street light time. Simultaneously the system can also realize the automatic sunshine control, which may act according to the actual determination of the sunlight degree of illumination and the degree of illumination control criterion and automatically control street light. On the basis of the merits of the regular control and the optical control, a new street smart controller is designed, with dual functions including timing control and automatic photoelectric control. It allows street lamps automatically lit in the evening, lighting the road for a few hours (adjustable time). After 0:00, when few vehicles or pedestrians go past, it turn off automatically. And terminal controller has wake-up function. After the street light turn out automatically, when the vehicles or pedestrians are going through, street light will be waken up by terminal controller. When the vehicles or pedestrians go past, the lights are off automatically. Design of new intelligent street light control system does not only achieve energy-saving power but also extend the service life of lighting equipment. Moreover, it is controllable, ease of maintenance. At the same time, it is helpful to highlight the festive and other characteristics, and ultimately make street light network, intelligence, humanity and art. An optimal configuration is reported. Finally, the results of experiment are obtained that: when a motor is closed to 15 meters, LED lights are on automatically. While people passed, the distance is proximity 10 meters.
Modelling and analysis of convergence of wireless sensor network and passive optical network using queueing theory
(2011)

Wireless sensor networks (WSNs) are being deployed for an ever-widening range of applications, particularly due to their low power consumption and reliability. In most applications, the sensor data must be sent over the Internet or core network, which results in the WSN backhaul problem. Passive optical networks (PONs), a next-generation access network technology, are well suited form a backhaul which interfaces WSNs to the core network. In this paper a new structure is proposed which converges WSNs and PONs. It is modelled and analyzed through queuing theory by employing two M/M/1 queues in tandem. Numerical results show how the WSN and PON dimensions affect the average queue length, thus serving as a guideline for future resource allocation and scheduling of such a converged network.
A morphologic two-stage approach for automated optic disk detection in color eye fundus images
(2013)

A new adaptive morphological method for the automatic detection of the optic disk in digital color eye fundus images is presented in this paper. This method has been designed to detect the optic disk center and the optic disk rim. In our experiments with the DRIVE and DIARETDB1 databases, the proposed method was able to detect the optic disk center with 100% and 97.75% of accuracy, respectively. We considered correct all automatically detected optic disk location that is within the borders of the optic disk marked manually. Using our proposed method, the rim of the optic disk was detected in all images of the DRIVE database with average sensitivity and specificity of 83.54% and 99.81%, respectively, and on the DIARETDB1 database with average sensitivity and specificity of 92.51% and 99.76%, respectively. 2013 Published by Elsevier B.V.
Relationship between color and emotion : a study of college students
(2006)

Ninety-eight college students were asked to indicate their emotional responses to five principle hues (i.e., red, yellow, green, blue, purple), five intermediate hues (i.e., yellow-red, greenyellow, blue-green, purple-blue, and red-purple), and three achromatic colors (white, gray, and black) and the reasons for their choices. The color stimuli were referenced from the Munsell Color System. The results revealed that the principle hues comprised the highest number of positive emotional responses, followed by the intermediate hues and the achromatic colors. The color green evoked mainly positive emotions such as relaxation and comfort because it reminded most of the respondents of nature. The color green-yellow had the lowest number of positive responses because it was associated with vomit and elicited the feelings of sickness and disgust. For the achromatic colors, white attained a large number of positive responses, followed by the colors black and gray. The reasons for the color-emotion associations are discussed and future research areas are suggested.
A stream function solver for liquid simulations
(2015)

This paper presents a liquid simulation technique that enforces the incompressibility condition using a stream function solve instead of a pressure projection. Previous methods have used stream function techniques for the simulation of detailed single-phase flows, but a formulation for liquid simulation has proved elusive in part due to the free surface boundary conditions. In this paper, we introduce a stream function approach to liquid simulations with novel boundary conditions for free surfaces, solid obstacles, and solid-fluid coupling.
 Although our approach increases the dimension of the linear system necessary to enforce incompressibility, it provides interesting and surprising benefits. First, the resulting flow is guaranteed to be divergence-free regardless of the accuracy of the solve. Second, our free-surface boundary conditions guarantee divergence-free motion even in the un-simulated air phase, which enables two-phase flow simulation by only computing a single phase. We implemented this method using a variant of FLIP simulation which only samples particles within a narrow band of the liquid surface, and we illustrate the effectiveness of our method for detailed two-phase flow simulations with complex boundaries, detailed bubble interactions, and two-way solid-fluid coupling.
Location recommendation for out-of-town users in location-based social networks
(2013)

Most previous research on location recommendation services in location-based social networks (LBSNs) makes recommendations without considering where the targeted user is currently located. Such services may recommend a place near her hometown even if the user is traveling out of town. In this paper, we study the issues in making location recommendations for out-of-town users by taking into account user preference, social influence and geographical proximity. Accordingly, we propose a collaborative recommendation framework, called User Preference, Proximity and Social-Based Collaborative Filtering} (UPS-CF), to make location recommendation for mobile users in LBSNs. We validate our ideas by comprehensive experiments using real datasets collected from Foursquare and Gowalla. By comparing baseline algorithms and conventional collaborative filtering approach (and its variants), we show that UPS-CF exhibits the best performance. Additionally, we find that preference derived from similar users is important for in-town users while social influence becomes more important for out-of-town users.
Unsupervised Pretraining for Sequence to Sequence Learning
(2017)

Sequence to sequence models are successful tools for supervised sequence learning tasks, such as machine translation. Despite their success, these models still require much labeled data and it is unclear how to improve them using unlabeled data, which is much less expensive to obtain. In this paper, we present simple changes that lead to a significant improvement in the accuracy of seq2seq models when the labeled set is small. Our method intializes the encoder and decoder of the seq2seq model with the trained weights of two language models, and then all weights are jointly fine-tuned with labeled data. An additional language modeling loss can be used to regularize the model during fine-tuning. We apply this method to low-resource tasks in machine translation and abstractive summarization and find that it significantly improves the subsequent supervised models. Our main finding is that the pretraining accelerates training and improves generalization of seq2seq models, achieving state-of-the-art results on the WMT English→German task. Our model obtains an improvement of 1.3 BLEU from the previous best models on both WMT’14 and WMT’15 English→German. Our ablation study shows that pretraining helps seq2seq models in different ways depending on the nature of the task: translation benefits from the improved generalization whereas summarization benefits from the improved optimization.
BOINC: a system for public-resource computing and storage
(2004)

BOINC (Berkeley Open Infrastructure for Network Computing) is a software system that makes it easy for scientists to create and operate public-resource computing projects. It supports diverse applications, including those with large storage or communication requirements. PC owners can participate in multiple BOINC projects, and can specify how their resources are allocated among these projects. We describe the goals of BOINC, the design issues that we confronted, and our solutions to these problems.
Controllable Abstractive Summarization
(2018)

Current models for document summarization disregard user preferences such as the desired length, style, the entities that the user might be interested in, or how much of the document the user has already read. We present a neural summarization model with a simple but effective mechanism to enable users to specify these high level attributes in order to control the shape of the final summaries to better suit their needs. With user input, our system can produce high quality summaries that follow user preferences. Without user input, we set the control variables automatically – on the full text CNN-Dailymail dataset, we outperform state of the art abstractive systems (both in terms of F1-ROUGE1 40.38 vs. 39.53 F1-ROUGE and human evaluation).
Neuroergonomics: a review of applications to physical and cognitive work
(2013)

Neuroergonomics is an emerging science that is defined as the study of the human brain in relation to performance at work and in everyday settings. This paper provides a critical review of the neuroergonomic approach to evaluating physical and cognitive work, particularly in mobile settings. Neuroergonomics research employing mobile and immobile brain imaging techniques are discussed in the following areas of physical and cognitive work: (1) physical work parameters; (2) physical fatigue; (3) vigilance and mental fatigue; (4) training and neuroadaptive systems; and (5) assessment of concurrent physical and cognitive work. Finally, the integration of brain and body measurements in investigating workload and fatigue, in the context of mobile brain/body imaging ("MoBI"), is discussed.
Summarizing Contrastive Themes via Hierarchical Non-Parametric Processes
(2015)

Given a topic of interest, a contrastive theme is a group of opposing pairs of viewpoints. We address the task of summarizing contrastive themes: given a set of opinionated documents, select meaningful sentences to represent contrastive themes present in those documents. Several factors make this a challenging problem: unknown numbers of topics, unknown relationships among topics, and the extraction of comparative sentences. Our approach has three core ingredients: contrastive theme modeling, diverse theme extraction, and contrastive theme summarization. Specifically, we present a hierarchical non-parametric model to describe hierarchical relations among topics; this model is used to infer threads of topics as themes from the nested Chinese restaurant process. We enhance the diversity of themes by using structured determinantal point processes for selecting a set of diverse themes with high quality. Finally, we pair contrastive themes and employ an iterative optimization algorithm to select sentences, explicitly considering contrast, relevance, and diversity. Experiments on three datasets demonstrate the effectiveness of our method.
Learning Discriminative and Shareable Features for Scene Classification
(2014)

In this paper, we propose to learn a discriminative and shareable feature transformation filter bank to transform local image patches (represented as raw pixel values) into features for scene image classification. The learned filters are expected to: (1) encode common visual patterns of a flexible number of categories; (2) encode discriminative and class-specific information. For each category, a subset of the filters are activated in a data-adaptive manner, meanwhile sharing of filters among different categories is also allowed. Discriminative power of the filter bank is further enhanced by enforcing the features from the same category to be close to each other in the feature space, while features from different categories to be far away from each other. The experimental results on three challenging scene image classification datasets indicate that our features can achieve very promising performance. Furthermore, our features also show great complementary effect to the state-of-the-art ConvNets feature.
Machine learning in cardiovascular medicine: are we there yet?
(2018)

Artificial intelligence (AI) broadly refers to analytical algorithms that iteratively learn from data, allowing computers to find hidden insights without being explicitly programmed where to look. These include a family of operations encompassing several terms like machine learning, cognitive learning, deep learning and reinforcement learning-based methods that can be used to integrate and interpret complex biomedical and healthcare data in scenarios where traditional statistical methods may not be able to perform. In this review article, we discuss the basics of machine learning algorithms and what potential data sources exist; evaluate the need for machine learning; and examine the potential limitations and challenges of implementing machine in the context of cardiovascular medicine. The most promising avenues for AI in medicine are the development of automated risk prediction algorithms which can be used to guide clinical care; use of unsupervised learning techniques to more precisely phenotype complex disease; and the implementation of reinforcement learning algorithms to intelligently augment healthcare providers. The utility of a machine learning-based predictive model will depend on factors including data heterogeneity, data depth, data breadth, nature of modelling task, choice of machine learning and feature selection algorithms, and orthogonal evidence. A critical understanding of the strength and limitations of various methods and tasks amenable to machine learning is vital. By leveraging the growing corpus of big data in medicine, we detail pathways by which machine learning may facilitate optimal development of patient-specific models for improving diagnoses, intervention and outcome in cardiovascular medicine.
Intrinsic frames of reference and egocentric viewpoints in scene recognition
(2008)

Three experiments investigated the roles of intrinsic directions of a scene and observer's viewing direction in recognizing the scene. Participants learned the locations of seven objects along an intrinsic direction that was different from their viewing direction and then recognized spatial arrangements of three or six of these objects from different viewpoints. The results showed that triplets with two objects along the intrinsic direction (intrinsic triplets) were easier to recognize than triplets with two objects along the study viewing direction (non-intrinsic triplets), even when the intrinsic triplets were presented at a novel test viewpoint and the non-intrinsic triplets were presented at the familiar test viewpoint. The results also showed that configurations with the same three or six objects were easier to recognize at the familiar test viewpoint than other viewpoints. These results support and develop the model of spatial memory and navigation proposed by Mou, McNamara, Valiquette, and Rump [Mou, W., McNamara, T. P., Valiquiette C. M., & Rump, B. (2004). Allocentric and egocentric updating of spatial memories. Journal of Experimental Psychology: Learning, Memory, and Cognition, 30, 142-157].
An exact algorithm for solving the vertex separator problem
(2011)

Given G = (V,E) a connected undirected graph and a positive integer β(|V |), the vertex sperator problem is to find a partition of V into noempty three classes A, B, C such that there is no edge between A and B, max{|A|, |B|} ≤ β(|V |) and |C| is minimum. In this paper we consider the vertex separator problem from a polyhedral point of view. We introduce new classes of valid inequalities for the associated polyhedron. Using a natural lower bound for the optimal solution, we present successful computational experiments.
Detection and Localization of Curbs and Stairways Using Stereo Vision
(2005)

We present algorithms to detect and precisely localize curbs and stairways for autonomous navigation. These algorithms combine brightness information (in the form of edgels) with 3-D data from a commercial stereo system. The overall system (including stereo computation) runs at about 4 Hz on a 1 GHz laptop. We show experimental results and discuss advantages and shortcomings of our approach.
Stereo Processing by Semiglobal Matching and Mutual Information
(2008)

This paper describes the semiglobal matching (SGM) stereo method. It uses a pixelwise, mutual information (Ml)-based matching cost for compensating radiometric differences of input images. Pixelwise matching is supported by a smoothness constraint that is usually expressed as a global cost function. SGM performs a fast approximation by pathwise optimizations from all directions. The discussion also addresses occlusion detection, subpixel refinement, and multibaseline matching. Additionally, postprocessing steps for removing outliers, recovering from specific problems of structured environments, and the interpolation of gaps are presented. Finally, strategies for processing almost arbitrarily large images and fusion of disparity images using orthographic projection are proposed. A comparison on standard stereo images shows that SGM is among the currently top-ranked algorithms and is best, if subpixel accuracy is considered. The complexity is linear to the number of pixels and disparity range, which results in a runtime of just 1-2 seconds on typical test images. An in depth evaluation of the Ml-based matching cost demonstrates a tolerance against a wide range of radiometric transformations. Finally, examples of reconstructions from huge aerial frame and pushbroom images demonstrate that the presented ideas are working well on practical problems.
Adaptive neighborhood selection for real-time surface normal estimation from organized point cloud data using integral images
(2012)

In this paper we present two real-time methods for estimating surface normals from organized point cloud data. The proposed algorithms use integral images to perform highly efficient border- and depth-dependent smoothing and covariance estimation. We show that this approach makes it possible to obtain robust surface normals from large point clouds at high frame rates and therefore, can be used in real-time computer vision algorithms that make use of Kinect-like data.