This paper deals with the development and implementation of a cloud screening algorithm for image time series, with the focus on the forthcoming Sentinel-2 satellites to be launched under the ESA Copernicus Programme....
详细信息
ISBN:
(纸本)9781479979295
This paper deals with the development and implementation of a cloud screening algorithm for image time series, with the focus on the forthcoming Sentinel-2 satellites to be launched under the ESA Copernicus Programme. The proposed methodology is based on kernel ridge regression and exploits the temporal information to detect anomalous changes that correspond to cloud covers. The huge data volumes to be processed when dealing with high temporal, spatial, and spectral resolution datasets motivate the implementation of the algorithm within distributed computer resources. In consequence, an operational cloud screening service has been specifically designed and implemented in the frame of the Sentinels Synergy Framework (SenSyF). The effectiveness of the proposed method is successfully illustrated using a time series dataset with a 5-day revisit derived from SPOT-4 at high resolution, which has been collected by ESA in preparation for the exploitation of the Sentinel-2 mission.
Improving both accuracy and computational performance of numerical tools is a major challenge for seismic imaging and generally requires specialized implementations to make full use of modern parallel architectures. W...
详细信息
Improving both accuracy and computational performance of numerical tools is a major challenge for seismic imaging and generally requires specialized implementations to make full use of modern parallel architectures. We present a computational strategy for reverse-time migration (RTM) with accelerator-aided clusters. A new imaging condition computed from the pressure and velocity fields is introduced. The model solver is based on a high-order discontinuous Galerkin time-domain (DGTD) method for the pressure-velocity system with unstructured meshes and multirate local time stepping. We adopted the MPI+X approach for distributed programming where X is a threaded programming model. In this work we chose OCCA, a unified framework that makes use of major multithreading languages (e.g. CUDA and OpenCL) and offers the flexibility to run on several hardware architectures. DGTD schemes are suitable for efficient computations with accelerators thanks to localized element-to-element coupling and the dense algebraic operations required for each element. Moreover, compared to high-order finite-difference schemes, the thin halo inherent to DGTD method reduces the amount of data to be exchanged between MPI processes and storage requirements for RTM procedures. The amount of data to be recorded during simulation is reduced by storing only boundary values in memory rather than on disk and recreating the forward wavefields. Computational results are presented that indicate that these methods are strong scalable up to at least 32 GPUs for a three-dimensional RTM case.
The hyperspectral remote sensing is one of the frontier techniques in the remote sensing research fields. Applying the sparse coding model to the hyperspectral remote sensing imageprocessing is a hot topic in hypersp...
详细信息
ISBN:
(纸本)9781467372206
The hyperspectral remote sensing is one of the frontier techniques in the remote sensing research fields. Applying the sparse coding model to the hyperspectral remote sensing imageprocessing is a hot topic in hyperspectral information processing. To improve the accuracy of hyperspectral image classification, we propose a classification method based on the spatial-spectral joint contextual sparse coding. Firstly, a dictionary is obtained by training using samples selected from the ground-truth reference data. Then, the sparse coefficients of each pixel are calculated based on the learned dictionary. Afterward, the sparse coefficients are input to the classifier and the final classification result is obtained. The visible and near-infrared hyperspectral remote sensing image collected by Tiangong-1 in Chaoyang District of Beijing is used to evaluate the performance of the proposed approach. Experimental results show that the proposed method yields the best classification performance with the overall accuracy of 95.74% and the Kappa coefficient of 0.9476 in comparison with other classification methods.
Benefit from tremendous growth of user-generated content, social annotated tags get higher importance in organization and retrieval of large scale image database on Online Sharing Websites (OSW). To obtain high-qualit...
详细信息
ISBN:
(纸本)9781450332743
Benefit from tremendous growth of user-generated content, social annotated tags get higher importance in organization and retrieval of large scale image database on Online Sharing Websites (OSW). To obtain high-quality tags from existing community contributed tags with missing information and noise, tag-based annotation or recommendation methods have been proposed for performance promotion of tag prediction. While images from OSW contain rich social attributes, existing studies only utilize the relations between visual content and tags to construct global information completion models. In this paper, beyond the image-tag relation, we take full advantage of the ubiquitous GPS locations and image-user relationship, to enhance the accuracy of tag prediction and improve the computational efficiency. For GPS locations, we define the popular geo-locations where people tend to take more images as Points of Interests (POI), which are discovered by mean shift approach. For image user relationship, we integrate a localized prior constraint, expecting the completed tag sub-matrix in each POI to maintain consistency with users' tagging behaviors. Based on these two key issues, we propose a unified tag matrix completion framework which learns the image-tag relation within each POI. To solve the proposed model, an efficient proximal sub-gradient descent algorithm is designed. The model optimization can be easily parallelized and distributed to learn the tag sub-matrix for each POI. Extensive experimental results reveal that the learned tag sub-matrix of each POI reflects the major trend of users' tagging results with respect to different POIs and users, and the parallel learning process provides strong support for processing large scale online image database.
The proceedings contain 34 papers. The special focus in this conference is on imageprocessing and Communications. The topics include: Classifier selection uses decision profiles in binary classification task;2DHMM-ba...
ISBN:
(纸本)9783319238135
The proceedings contain 34 papers. The special focus in this conference is on imageprocessing and Communications. The topics include: Classifier selection uses decision profiles in binary classification task;2DHMM-based face recognition method;corner detection based on directional gradients;sensor fusion enhancement for mobile positioning systems;thermal face recognition;feature reduction using similarity measure in object detector learning with haar-like features;assessment of the brain coverage ratio in the postoperative craniosynostosis based on 3D CT scans;combined imaging system for taking facial portraits in visible and thermal spectra;the PUT surveillance database;automatic analysis of vehicle trajectory applied to visual surveillance;algorithmically optimized AVC video encoder with parallelprocessing of data;neural video compression based on SURF scene change detection algorithm;cell detection in corneal endothelial images using directional filters;the method of probabilistic nodes combination in 2D information retrieval, pattern recognition and biometric modeling;3-D reconstruction of real objects using an android device;methods of natural image preprocessing supporting the automatic text recognition using the OCR algorithms;fast machine vision line detection for mobile robot navigation in dark environments;adjustment of viterbi algorithm for line following robots;studentized range for spatio-temporal track-before-detect algorithm;real-time US image enhancement by forward-backward diffusion using GPU;face-based distributed visitor identification system;color space optimization for lacunarity method in analysis of papanicolaou smears and toward texture-based 3D level set image segmentation.
Non-negative matrix factorization (NMF) is a popular matrix decomposition technique that has attracted extensive attentions from data mining community. However, NMF suffers from the following deficiencies: (1) it is n...
详细信息
ISBN:
(数字)9783319265353
ISBN:
(纸本)9783319265353;9783319265346
Non-negative matrix factorization (NMF) is a popular matrix decomposition technique that has attracted extensive attentions from data mining community. However, NMF suffers from the following deficiencies: (1) it is non-trivial to guarantee the representation of the data points to be sparse, and (2) NMF often achieves unsatisfactory clustering results because it completely neglects the labels of the dataset. Thus, this paper proposes a semi-supervised non-negative local coordinate factorization (SNLCF) to overcome the above deficiencies. Particularly, SNLCF induces the sparse coefficients by imposing the local coordinate constraint and propagates the labels of the labeled data to the unlabeled ones by indicating the coefficients of the labeled examples to be the class indicator. Benefit from the labeled data, SNLCF can boost NMF in clustering the unlabeled data. Experimental results on UCI datasets and two popular face image datasets suggest that SNLCF outperforms the representative methods in terms of both average accuracy and average normalized mutual information.
An efficient implementation are necessary, as most medical imaging methods are computational expensive, and the amount of medical imaging data is growing. Graphic processing units (GPUs) can solve large data parallel ...
详细信息
An efficient implementation are necessary, as most medical imaging methods are computational expensive, and the amount of medical imaging data is growing. Graphic processing units (GPUs) can solve large data parallel problems at a higher speed than the traditional CPU, while being more affordable and energy efficient than distributed systems. This review investigates the use of GPUs to accelerate medical imaging methods. A set of criteria for efficient use of GPUs are defined. The review concludes that most medical imageprocessingmethods may benefit from GPU processing due to the methods' data parallel structure and high thread count. However, factors such as synchronization, branch divergence and memory usage can limit the speedup.
In recognition that inmodern applications billions of images are stored into distributed databases in different logical or physical locations, we propose a similarity search strategy over the cloud based on the dimens...
详细信息
In recognition that inmodern applications billions of images are stored into distributed databases in different logical or physical locations, we propose a similarity search strategy over the cloud based on the dimensions value cardinalities of image descriptors. Our strategy has low preprocessing requirements by dividing the computational cost of the preprocessing steps into several nodes over the cloud and locating the descriptors with similar dimensions value cardinalities logically close. New images are inserted into the distributed databases over the cloud efficiently, by supporting dynamical update in real-time. The proposed insertion algorithm has low computational complexity, depending exclusively on the dimensionality of descriptors and a small subset of descriptors with similar dimensions value cardinalities. Finally, an efficient query processing algorithm is proposed, where the dimensions of image descriptors are prioritized in the searching strategy, assuming that dimensions of high value cardinalities have more discriminative power than the dimensions of low ones. The computation effort of the query processing algorithm is divided into several nodes over the cloud infrastructure. In our experiments with seven publicly available datasets of image descriptors, we show that the proposed similarity search strategy outperforms competitive methods of single node, parallel and cloud-based architectures, in terms of preprocessing cost, search time and accuracy.
暂无评论