Images and videos taken in foggy weather often suffer from low visibility. Recent studies demonstrate the effectiveness of dark channel prior [3] and guided filter [4] based approaches for image dehazing. However, the...
详细信息
ISBN:
(纸本)9781479982479
Images and videos taken in foggy weather often suffer from low visibility. Recent studies demonstrate the effectiveness of dark channel prior [3] and guided filter [4] based approaches for image dehazing. However, these methods require high computational cost which makes them infeasible for realtime and embedding systems. In this paper, we propose Edge-Guided Interpolated Filter (EGIF) for fast image and video dehazing. the main contributions are twofold. Firstly, we develop Guided Interpolated Filter (GIF) to significantly speed up the estimation of transmission map, which is the most computational cost step in previous methods. Secondly, we utilize edge map as guidance image in GIF to enhance the fine details in dehazed images. Experimental results show that GIF can largely improve the computational efficiency and achieve comparable dehazing performance as previous guided filter based methods. EGIF can further enhance the sharpness of transmission map. Our method can achieve real-time processing for image of size 1024 × 768 with single CPU core (2GHz).
Cloud-based trading platforms have become a broadly accepted business approach in China. Flexible and scalable online services have brought enormous benefits for e-commerce. However, many cloud-based e-commerce provid...
详细信息
ISBN:
(纸本)9781479989386
Cloud-based trading platforms have become a broadly accepted business approach in China. Flexible and scalable online services have brought enormous benefits for e-commerce. However, many cloud-based e-commerce providers are encountering a serious challenge from counterfeits, which is already harmful for many chinese e-commerce companies. this paper addresses anti-counterfeit issues and proposes a novel mechanism for proactively prevent counterfeits in the chinese context. the proposed paradigm also considers the cost-benefit and profit-maximizations. the model was evaluated by the case study research with examining various use cases. Four use cases are represented in this paper and the outcomes of the use cases proved the efficiency of the proposed model.
We propose binary range-sample feature in depth. It is based on t tests and achieves reasonable invariance with respect to possible change in scale, viewpoint, and background. It is robust to occlusion and data corrup...
详细信息
ISBN:
(纸本)9781479951178
We propose binary range-sample feature in depth. It is based on t tests and achieves reasonable invariance with respect to possible change in scale, viewpoint, and background. It is robust to occlusion and data corruption as well. the descriptor works in a high speed thanks to its binary property. Working together with standard learning algorithms, the proposed descriptor achieves state-of-the-art results on benchmark datasets in our experiments. Impressively short running time is also yielded.
Hashing is very effective for many tasks in reducing the processing time and in compressing massive databases. Although lots of approaches have been developed to learn data-dependent hash functions in recent years, ho...
详细信息
ISBN:
(纸本)9781467383929
Hashing is very effective for many tasks in reducing the processing time and in compressing massive databases. Although lots of approaches have been developed to learn data-dependent hash functions in recent years, how to learn hash functions to yield good performance with acceptable computational and memory cost is still a challenging problem. Based on the observation that retrieval precision is highly related to the kNN classification accuracy, this paper proposes a novel kNN-based supervised hashing method, which learns hash functions by directly maximizing the kNN accuracy of the Hamming-embedded training data. To make it scalable well to large problem, we propose a factorized neighborhood representation to parsimoniously model the neighborhood relationships inherent in training data. Considering that real-world data are often linearly inseparable, we further kernelize this basic model to improve its performance. As a result, the proposed method is able to learn accurate hashing functions with tolerable computation and storage cost. Experiments on four benchmarks demonstrate that our method outperforms the state-of-the-arts.
We address the false response influence problem when learning and applying discriminative parts to construct the mid-level representation in scene classification. It is often caused by the complexity of latent image s...
详细信息
ISBN:
(纸本)9781479951178
We address the false response influence problem when learning and applying discriminative parts to construct the mid-level representation in scene classification. It is often caused by the complexity of latent image structure when convolving part filters with input images. this problem makes mid-level representation, even after pooling, not distinct enough to classify input data correctly to categories. Our solution is to learn important spatial pooling regions along withtheir appearance. the experiments show that this new framework suppresses false response and produces improved results on several datasets, including MIT-Indoor, 15-Scene, and UIUC 8-Sport. When combined with global image features, our method achieves state-of-the-art performance on these datasets.
Convolution operations have been widely used in many important application domains, such as deep learning and computervision, in which convolution is always the most time-consuming part. High computational throughput...
详细信息
ISBN:
(纸本)9781479989386
Convolution operations have been widely used in many important application domains, such as deep learning and computervision, in which convolution is always the most time-consuming part. High computational throughput and memory bandwidth make many-core architectures the promising targets to accelerate these applications. In this paper, we implement and optimize different convolution operations, including 1D convolution, 2D convolution and multi-channel 2D convolution executed in mini-batch mode, on both GPU and Intel MIC many-core architectures. We find out that the performance bottleneck of 1D and 2D convolutions is on registers rather than local memory or L1/L2 cache, and therefore, register tiling is used to improve the performance. In addition, we present a novel solution for multi-channel 2D convolution, in which convolution is conducted on images directly instead of being translated to matrix multiplication, and the data reuse of the algorithm is fully exploited. We further summarize the parameters of autotuning for multichannel 2D convolution and prune the search space based on heuristics. the experimental results show that, for the large filter size, our solution gets up to 33% performance improvement over cuDNN-v2 and up to 28% over clBLASbased implementation, on GTX TITAN and AMD W8000 respectively. On Intel MIC, our solution gets up to 25% of the theoretical peak performance.
In this paper, we propose an efficient method to reconstruct surface-from-gradients (SfG). Our method is formulated under the framework of discrete geometry processing. Unlike the existing SfG approaches, we transfer ...
详细信息
ISBN:
(纸本)9781479951178
In this paper, we propose an efficient method to reconstruct surface-from-gradients (SfG). Our method is formulated under the framework of discrete geometry processing. Unlike the existing SfG approaches, we transfer the continuous reconstruction problem into a discrete space and efficiently solve the problem via a sequence of least-square optimization steps. Our discrete formulation brings three advantages: 1) the reconstruction preserves sharp-features, 2) sparse/incomplete set of gradients can be well handled, and 3) domains of computation can have irregular boundaries. Our formulation is direct and easy to implement, and the comparisons with state-of-the-arts show the effectiveness of our method.
Gradient domain methods are popular for image processing. However, these methods even the edge-preserving ones cannot preserve edges well in some cases. In this paper, we present new constraints explicitly to better p...
详细信息
ISBN:
(纸本)9781479951178
Gradient domain methods are popular for image processing. However, these methods even the edge-preserving ones cannot preserve edges well in some cases. In this paper, we present new constraints explicitly to better preserve edges for general gradient domain image filtering and theoretically analyse why these constraints are edge-aware. Our edge-aware constraints are easy to implement, fast to compute and can be seamlessly integrated into the general gradient domain optimization framework. the improved framework can better preserve edges while maintaining similar image filtering effects as the original image filters. We also demonstrate the strength of our edge-aware constraints on various applications such as image smoothing, image colorization and Poisson image cloning.
Images and videos are often characterized by multiple types of local descriptors such as SIFT, HOG and HOF, each of which describes certain aspects of object feature. recognition systems benefit from fusing multiple t...
详细信息
ISBN:
(纸本)9781479951178
Images and videos are often characterized by multiple types of local descriptors such as SIFT, HOG and HOF, each of which describes certain aspects of object feature. recognition systems benefit from fusing multiple types of these descriptors. Two widely applied fusion pipelines are descriptor concatenation and kernel average. the first one is effective when different descriptors are strongly correlated, while the second one is probably better when descriptors are relatively independent. In practice, however, different descriptors are neither fully independent nor fully correlated, and previous fusion methods may not be satisfying. In this paper, we propose a new global representation, Multi-View Super Vector (MVSV), which is composed of relatively independent components derived from a pair of descriptors. Kernel average is then applied on these components to produce recognition result. To obtain MVSV, we develop a generative mixture model of probabilistic canonical correlation analyzers (M-PCCA), and utilize the hidden factors and gradient vectors of M-PCCA to construct MVSV for video representation. Experiments on video based action recognition tasks show that MVSV achieves promising results, and outperforms FV and VLAD with descriptor concatenation or kernel average fusion strategy.
Given a single outdoor image, this paper proposes a collaborative learning approach for labeling it as either sunny or cloudy. Never adequately addressed, this two-class classification problem is by no means trivial g...
详细信息
ISBN:
(纸本)9781479951178
Given a single outdoor image, this paper proposes a collaborative learning approach for labeling it as either sunny or cloudy. Never adequately addressed, this two-class classification problem is by no means trivial given the great variety of outdoor images. Our weather feature combines special cues after properly encoding them into feature vectors. they then work collaboratively in synergy under a unified optimization framework that is aware of the presence (or absence) of a given weather cue during learning and classification. Extensive experiments and comparisons are performed to verify our method. We build a new weather image dataset consisting of 10K sunny and cloudy images, which is available online together withthe executable.
暂无评论