403 research outputs found

    Deep Sketch Hashing: Fast Free-hand Sketch-Based Image Retrieval

    Full text link
    Free-hand sketch-based image retrieval (SBIR) is a specific cross-view retrieval task, in which queries are abstract and ambiguous sketches while the retrieval database is formed with natural images. Work in this area mainly focuses on extracting representative and shared features for sketches and natural images. However, these can neither cope well with the geometric distortion between sketches and images nor be feasible for large-scale SBIR due to the heavy continuous-valued distance computation. In this paper, we speed up SBIR by introducing a novel binary coding method, named \textbf{Deep Sketch Hashing} (DSH), where a semi-heterogeneous deep architecture is proposed and incorporated into an end-to-end binary coding framework. Specifically, three convolutional neural networks are utilized to encode free-hand sketches, natural images and, especially, the auxiliary sketch-tokens which are adopted as bridges to mitigate the sketch-image geometric distortion. The learned DSH codes can effectively capture the cross-view similarities as well as the intrinsic semantic correlations between different categories. To the best of our knowledge, DSH is the first hashing work specifically designed for category-level SBIR with an end-to-end deep architecture. The proposed DSH is comprehensively evaluated on two large-scale datasets of TU-Berlin Extension and Sketchy, and the experiments consistently show DSH's superior SBIR accuracies over several state-of-the-art methods, while achieving significantly reduced retrieval time and memory footprint.Comment: This paper will appear as a spotlight paper in CVPR201

    Background Subtraction Based on Perception-Contained Piecewise Memorizing Framework

    Get PDF
    A key issue for full-time video surveillance is to search or establish a reference image of background which corresponds to current video frame. However, background that was ever in presence long time ago is enclosed or discarded due to background forgetting assumption. How to rapidly pick up or even rebuild long-term background needs to be discussed. This paper aims to present a framework for background maintenance in order to solve the problem. A piecewise memorizing framework is proposed for matching, updating and even rebuilding long-term background. Based on the metaphors of psychological selective attention theory, the framework is composed of a prior piecewise perception processor for intensity stationary test. Besides, a hierarchical memorizing mechanism constitutes the other part of the framework for overcoming the exponential forgetting of long period background appearances. Applied to Gaussian mixture model (GMM), this framework is capable of maintaining short-term background states, identifying long period background appearances, and rapidly adjusting to new background states according to different expressions derived from the prior perception of scene intensity changes. Its effectiveness can be demonstrated by experimental results for solving various typical problems

    Towards better banking crisis prediction: could an automatic variable selection process improve the performance?*

    Get PDF
    This study proposes using the Least Absolute Shrinkage and Selection Operator (LASSO) method with cross-validation to automate the variable selection process of the conventional multivariate logit early warning system (EWS), the purpose being to improve the prediction of systemic banking crises. Using a dataset covering 23 OECD countries with quarterly data from 1970Q1 to 2018Q3, model performance is evaluated in a recursive out-of-sample forecasting exercise, taking policy-makers' preference of missed crises and false alarms into account. The results suggest that the automatic variable selection process can enhance the predictive performance of the EWS. It also highlights the importance of extracting information from variable interactions and lags that may not be easily identified and accessed by typical subjective variable pre-selection. This simple approach is easy to interpret and is transparent, which are important aspects for effective policy communication. Five variables, namely credit growth, domestic and global credit gaps, real house price growth and the real effective exchange rate, are identified as the most important key indicators of systemic banking crises

    One stone, two birds: A lightweight multidimensional learned index with cardinality support

    Full text link
    Innovative learning based structures have recently been proposed to tackle index and cardinality estimation tasks, specifically learned indexes and data driven cardinality estimators. These structures exhibit excellent performance in capturing data distribution, making them promising for integration into AI driven database kernels. However, accurate estimation for corner case queries requires a large number of network parameters, resulting in higher computing resources on expensive GPUs and more storage overhead. Additionally, the separate implementation for CE and learned index result in a redundancy waste by storage of single table distribution twice. These present challenges for designing AI driven database kernels. As in real database scenarios, a compact kernel is necessary to process queries within a limited storage and time budget. Directly integrating these two AI approaches would result in a heavy and complex kernel due to a large number of network parameters and repeated storage of data distribution parameters. Our proposed CardIndex structure effectively killed two birds with one stone. It is a fast multidim learned index that also serves as a lightweight cardinality estimator with parameters scaled at the KB level. Due to its special structure and small parameter size, it can obtain both CDF and PDF information for tuples with an incredibly low latency of 1 to 10 microseconds. For tasks with low selectivity estimation, we did not increase the model's parameters to obtain fine grained point density. Instead, we fully utilized our structure's characteristics and proposed a hybrid estimation algorithm in providing fast and exact results
    • …
    corecore