163 research outputs found

    Zero-Shot Learning by Convex Combination of Semantic Embeddings

    Full text link
    Several recent publications have proposed methods for mapping images into continuous semantic embedding spaces. In some cases the embedding space is trained jointly with the image transformation. In other cases the semantic embedding space is established by an independent natural language processing task, and then the image transformation into that space is learned in a second stage. Proponents of these image embedding systems have stressed their advantages over the traditional \nway{} classification framing of image understanding, particularly in terms of the promise for zero-shot learning -- the ability to correctly annotate images of previously unseen object categories. In this paper, we propose a simple method for constructing an image embedding system from any existing \nway{} image classifier and a semantic word embedding model, which contains the \n class labels in its vocabulary. Our method maps images into the semantic embedding space via convex combination of the class label embedding vectors, and requires no additional training. We show that this simple and direct method confers many of the advantages associated with more complex image embedding schemes, and indeed outperforms state of the art methods on the ImageNet zero-shot learning task

    Learning SO(3) Equivariant Representations with Spherical CNNs

    Full text link
    We address the problem of 3D rotation equivariance in convolutional neural networks. 3D rotations have been a challenging nuisance in 3D classification tasks requiring higher capacity and extended data augmentation in order to tackle it. We model 3D data with multi-valued spherical functions and we propose a novel spherical convolutional network that implements exact convolutions on the sphere by realizing them in the spherical harmonic domain. Resulting filters have local symmetry and are localized by enforcing smooth spectra. We apply a novel pooling on the spectral domain and our operations are independent of the underlying spherical resolution throughout the network. We show that networks with much lower capacity and without requiring data augmentation can exhibit performance comparable to the state of the art in standard retrieval and classification benchmarks.Comment: Camera-ready. Accepted to ECCV'18 as oral presentatio

    Zero-Shot Hashing via Transferring Supervised Knowledge

    Full text link
    Hashing has shown its efficiency and effectiveness in facilitating large-scale multimedia applications. Supervised knowledge e.g. semantic labels or pair-wise relationship) associated to data is capable of significantly improving the quality of hash codes and hash functions. However, confronted with the rapid growth of newly-emerging concepts and multimedia data on the Web, existing supervised hashing approaches may easily suffer from the scarcity and validity of supervised information due to the expensive cost of manual labelling. In this paper, we propose a novel hashing scheme, termed \emph{zero-shot hashing} (ZSH), which compresses images of "unseen" categories to binary codes with hash functions learned from limited training data of "seen" categories. Specifically, we project independent data labels i.e. 0/1-form label vectors) into semantic embedding space, where semantic relationships among all the labels can be precisely characterized and thus seen supervised knowledge can be transferred to unseen classes. Moreover, in order to cope with the semantic shift problem, we rotate the embedded space to more suitably align the embedded semantics with the low-level visual feature space, thereby alleviating the influence of semantic gap. In the meantime, to exert positive effects on learning high-quality hash functions, we further propose to preserve local structural property and discrete nature in binary codes. Besides, we develop an efficient alternating algorithm to solve the ZSH model. Extensive experiments conducted on various real-life datasets show the superior zero-shot image retrieval performance of ZSH as compared to several state-of-the-art hashing methods.Comment: 11 page

    Low-cost, Transportable Hydrogen Fueling Station for Early FCEV Adoption

    Get PDF
    Thousands of public hydrogen fueling stations are needed to support the early Fuel Cell Electric Vehicle (FCEV) market in the U.S.; there are currently 12. The California state government has been the largest investor of the hydrogen fueling infrastructure funding 9 permanent stations currently open to the public with 48 more in development costing anywhere from 1.8M−1.8M-5.5M each. To attract private investors and decrease dependence on government funding, a low-cost, mobile hydrogen dispensing system must be developed. This paper describes a transportable hydrogen fueling station that has been designed for 423,000usingoff−the−shelfcomponents,lessthan23423,000 using off-the-shelf components, less than 23% of the capital cost of current stations. It utilizes liquid hydrogen storage and a novel cryogenic compression system which can be factory built for high volume, rapid production. These stations would be contained in a standard 40’ ISO shipping container to move/expand with demand and dispense hydrogen at a price of 9.62/kg. This paper presents the mechanical design and operation of the fueling station. A complete report including an economic analysis and safety features is available at: http://hydrogencontest.org/pdf/2014/WSU_2014_HEF_CONTEST.pdf

    A reference relative time-scale as an alternative to chronological age for cohorts with long follow-up

    Get PDF
    Background: Epidemiologists have debated the appropriate time-scale for cohort survival studies; chronological age or time-on-study being two such time-scales. Importantly, assessment of risk factors may depend on the choice of time-scale. Recently, chronological or attained age has gained support but a case can be made for a ‘reference relative time-scale’ as an alternative which circumvents difficulties that arise with this and other scales. The reference relative time of an individual participant is the integral of a reference population hazard function between time of entry and time of exit of the individual. The objective here is to describe the reference relative time-scale, illustrate its use, make comparison with attained age by simulation and explain its relationship to modern and traditional epidemiologic methods. Results: A comparison was made between two models; a stratified Cox model with age as the time-scale versus an un-stratified Cox model using the reference relative time-scale. The illustrative comparison used a UK cohort of cotton workers, with differing ages at entry to the study, with accrual over a time period and with long follow-up. Additionally, exponential and Weibull models were fitted since the reference relative time-scale analysis need not be restricted to the Cox model. A simulation study showed that analysis using the reference relative time-scale and analysis using chronological age had very similar power to detect a significant risk factor and both were equally unbiased. Further, the analysis using the reference relative time-scale supported fully-parametric survival modelling and allowed percentile predictions and mortality curves to be constructed. Conclusions: The reference relative time-scale was a viable alternative to chronological age, led to simplification of the modelling process and possessed the defined features of a good time-scale as defined in reliability theory. The reference relative time-scale has several interpretations and provides a unifying concept that links contemporary approaches in survival and reliability analysis to the traditional epidemiologic methods of Poisson regression and standardised mortality ratios. The community of practitioners has not previously made this connection

    Career success: the role of teenage career aspirations, ambition value and gender in predicting adult social status and earnings

    Get PDF
    Links between family social background, teenage career aspirations, educational performance and adult social status attainment are well documented. Using a contextual developmental framework, this article extends previous research by examining the role of gender and teenage ambition value in shaping social status attainment and earnings in adulthood. Drawing on data from an 18-year British follow up study we tested a path model linking family background factors (such as family social status and parental aspirations) and individual agency factors in adolescence (in particular, career aspirations and ambition value) to social status attainment and earnings in adulthood. The findings suggest that ambition value is linked to adult earnings. That is, young people for whom it is important to get on in their job earn more money in adulthood than their less ambitious peers. The findings also confirm that teenage career aspirations are linked to adult social status attainment, and suggest that family background factors, teenage career aspirations and ambition value interact to influence social status attainment and earnings in adulthood. Gender differences are discusse

    OrChem - An open source chemistry search engine for Oracle®

    Get PDF
    <p>Abstract</p> <p>Background</p> <p>Registration, indexing and searching of chemical structures in relational databases is one of the core areas of cheminformatics. However, little detail has been published on the inner workings of search engines and their development has been mostly closed-source. We decided to develop an open source chemistry extension for Oracle, the de facto database platform in the commercial world.</p> <p>Results</p> <p>Here we present OrChem, an extension for the Oracle 11G database that adds registration and indexing of chemical structures to support fast substructure and similarity searching. The cheminformatics functionality is provided by the Chemistry Development Kit. OrChem provides similarity searching with response times in the order of seconds for databases with millions of compounds, depending on a given similarity cut-off. For substructure searching, it can make use of multiple processor cores on today's powerful database servers to provide fast response times in equally large data sets.</p> <p>Availability</p> <p>OrChem is free software and can be redistributed and/or modified under the terms of the GNU Lesser General Public License as published by the Free Software Foundation. All software is available via <url>http://orchem.sourceforge.net</url>.</p
    • …
    corecore