Abstract

Universities across the world are increasingly trying to become more entrepreneurial, in order to stay competitive, generate new sources of income through licensing or contract research, and follow policy guidelines from governments. The most powerful resource universities have to stimulate entrepreneurship is their students. However, there is no evaluated theory on how to encourage students to become entrepreneurs. Through three case studies the entrepreneurial encouragement offerings applied at MIT in the United States, IIIT in India, and Utrecht University in the Netherlands are investigated. The offerings provided by these institutes have been surveyed, interviews about these offerings with university staff have been performed, and reflected upon through interviews with entrepreneurs that graduated from these institutes. The three case studies provide insight in how student entrepreneurship encouragement offerings contributed to students choosing a career as an entrepreneur. Several successful examples of student entrepreneurship encouragement offerings are presented, and a model is proposed on how to effectively encourage entrepreneurship among students. The model supports academic institutes in constructing an environment that encourages student entrepreneurship and aims to help universities convince students to continue their careers as entrepreneurs.

Abstract

Various projections or views of a heterogeneous information network can be modeled using the graph OLAP (On-line Analytical Processing) framework for effective decision making. Detecting anomalous projections of the network can help the analysts identify regions of interest from the graph specific to the projection attribute. While most previous studies on outlier detection in graphs deal with outlier nodes, edges or subgraphs, we are the first to propose detection of graph cuboid outliers. Further we perform this detection in a query sensitive way. Given a general subgraph query on a heterogeneous network, we study the problem of finding outlier cuboids from the graph OLAP lattice. A Graph Cuboid Outlier (GCOutlier) is a cuboid with exceptionally high density of matches for the query. The GCOutlier detection task is clearly challenging because: (1) finding matches for the query (subgraph isomorphism) is NP-hard; (2) number of matches for the query can be very high; and (3) number of cuboids can be large. We provide an approximate solution to the problem by computing only a fraction of the total matches originating from a select set of candidate nodes and including a select set of edges, chosen smartly. We perform extensive experiments on synthetic datasets to showcase the execution time versus accuracy trade-off. Experiments on real datasets like Four Area and Delicious containing thousands of nodes reveal interesting GCOutliers.

Abstract

on the path are shown in Figure 6;(a) O1 from a;(b) O1 from b;(c) O1 from c;(d) O1 from d; and (e) O2 from e.(f) O2 from f.

Abstract

Localization in 3D is an important problem with wide ranging applications from autonomous navigation in robotics to location specific services on mobile devices. GPS sensors are a commercially viable option for localization, and are ubiquitous in their use, especially in portable de-vices. With the proliferation of mobile cameras however, maturing localization algorithms based on computer vision are emerging as a viable alternative. Although both vision and GPS based localization algorithms have many limita-tions and inaccuracies, there are some interesting compli-mentarities in their success/failure scenarios that justify an investigation into their joint utilization. Such investigations are further justified considering that many of the modern wearable and mobile computing devices come with sensors for both GPS and vision. In this work, we investigate approaches to reinforce GPS localization with vision algorithms and vice versa. Specif-ically, we show how noisy GPS signals can be rectified by vision based localization of images captured in the vicin-ity. Alternatively, we also show how GPS readouts might be used to disambiguate images when they are visually similar looking but belong to different places. Finally, we empiri-cally validate our solutions to show that fusing both these approaches can result in a more accurate and reliable lo-calization of videos captured with a Contour action camera, over a 600 meter long path, over 10 different days.

Abstract

In this work, we address the problem of cross-modal retrieval in presence of multi-label annotations. In particular, we introduce multi-label Canonical Correlation Analysis (ml-CCA), an extension of CCA, for learning shared subspaces taking into account high level semantic information in the form of multi-label annotations. Unlike CCA, ml-CCA does not rely on explicit pairing between modalities, instead it uses the multi-label information to establish correspondences. This results in a discriminative subspace which is better suited for cross-modal retrieval tasks. We also present Fast ml-CCA, a computationally efficient version of ml-CCA, which is able to handle large scale datasets. We show the efficacy of our approach by conducting extensive cross-modal retrieval experiments on three standard benchmark datasets. The results show that the proposed approach achieves state of the art retrieval performance on the three datasets.

Abstract

Recently, exemplar based approaches have been successfully applied for face detection in the wild. Contrary to traditional approaches that model face variations from a large and diverse set of training examples, exemplar-based approaches use a collection of discriminatively trained exemplars for detection. In this paradigm, each exemplar casts a vote using retrieval framework and generalized Hough voting, to locate the faces in the target image. The advantage of this approach is that by having a large database that covers all possible variations, faces in challenging conditions can be detected without having to learn explicit models for different variations. Current schemes, however, make an assumption of independence between the visual words, ignoring their relations in the process. They also ignore the spatial consistency of the visual words. Consequently, every exemplar word contributes equally during voting regardless of its location. In this paper, we propose a novel approach that incorporates higher order information in the voting process. We discover visual phrases that contain semantically related visual words and exploit them for detection along with the visual words. For spatial consistency, we estimate the spatial distribution of visual words and phrases from the entire database and then weigh their occurrence in exemplars. This ensures that a visual word or a phrase in an exemplar makes a major contribution only if it occurs at its semantic location, thereby suppressing the noise significantly. We perform extensive experiments on standard FDDB, AFW and G-album datasets and show significant improvement over previous exemplar …

Abstract

Social commerce is a field that is growing rapidly with the rise of Web 2.0 technologies. This paper presents a review of existing research on this topic to ensure a comprehensive understanding of social commerce. First, we explore the evolution of social commerce from its marketing origins. Next, we examine various definitions of social commerce and the motivations behind it. We also investigate its advantages and disadvantages for both businesses and customers. Then, we explore two major tools for important for social commerce: Sentiment Analysis, and Social Network Analysis. By delving into well-known research papers in Information Retrieval and Complex Networks, we seek to present a survey of current research in multifarious aspects of social commerce to the scientific research community.

Abstract

Optic nerve head (ONH) segmentation problem is of interest for automated glaucoma assessment. Although various segmentation methods have been proposed in the recent past, it is difficult to evaluate and compare the performance of individual methods due to a lack of a benchmark dataset. The assessment involves segmentation of optic disk and cup region within the ONH. In this paper, we present a comprehensive dataset of retinal images of both normal and glaucomatous eyes with manual segmentations from multiple human experts. The dataset also provides expert opinion on an image representing a normal or glaucomatous eye and on the presence of notching in an image. Several state of the art methods are assessed against this dataset using cup to disc diameter ratio (CDR), area and boundary-based evaluation measures. These are presented to aid benchmarking of new methods. A supervised, notch detection method based on the segmentation results is also proposed and its assessment results are included for benchmarking.

Abstract

Annotated data is critical for the development of many computer assisted diagnostic (CAD) algorithms. The process of manual annotation is very strenuous, time-consuming and an expensive component in CAD development. In this paper,we propose the idea of an interactive Assistive Annotation System (AAS) aimed at helping annotators by automatically marking possible regions of interest for further refinement by an annotator. We propose an unsupervised, biologically inspired method for bright lesion annotation. The performance of the proposed system has been evaluated against region-level ground truth in DiaretDB1 dataset and was found to have a sensitivity of60%at7false positives per image. Preliminary testing was also done on public datasets which do not provide any lesion level annotations. A visual assessment of the obtained results affirm a good agreement with lesions visible in images. The system with a simple modification is shown to have the potential to handle dark lesion annotation,which is a significantly more challenging problem. Thus, the proposed system is a good starting point for exploring the AAS idea for retinal images. Such systems can help extend the use of many existing datasets by enriching the image-level annotations with localised information.

Abstract

Nuclear imaging modalities like Positron emission tomography (PET) are characterized by a low SNR value due to the underlying signal generation mechanism. Given the significant role images play in current-day diagnostics, obtaining noise-free PET images is of great interest. With its higher packing density and larger and symmetrical neighbourhood,the hexagonal lattice offers a natural robustness to degradation in signal. Based on this observation, we propose an alternate solution to denoising, namely by changing the sampling lattice. We use filtered back projection for reconstruction, fol-lowed by a sparse dictionary based denoising and compare noise-free reconstruction on the Square and Hexagonal lattices. Experiments with PET phantoms (NEMA, Hoffman)and the Shepp-Logan phantom show that the improvement indenoising, post reconstruction, is not only at the qualitative but also quantitative level. The improvement in PSNR in the hexagonal lattice is on an average between 2 to 10 dB. These results establish the potential of the hexagonal lattice for re-construction from noisy data, in general.