Evaluation of Landsat 8 OLI imagery for unsupervised inland water extraction

The successful launch of the Landsat 8 satellite continues the Earth observation of the Landsat series, which has been taking place for nearly 40 years. With the increase in the band number and the improved spectral range compared with the previous Landsat imagery, it will be possible to expand the application of the new Landsat 8 imagery. The purpose of this study is to explore water extraction based on the new Landsat 8 Operational Land Imager (OLI) imagery. According to the specific inland water conditions (clear water, turbid water, and eutrophic water), a number of highly adaptable water indices are assessed for water extraction using Landsat OLI imagery. The results show that clear water is the easiest to extract among the different types of waterbodies, with the highest average accuracy of 97%. The highest-accuracy methods are the automated water extraction index for shadow pixels (AWEI_sh), the normalized difference water index using bands 4 and 7 (NDWI₄₇), and the normalized difference water index using bands 3 and 7 (NDWI₃₇), with accuracies of 98.55%, 95.50%, and 96.61%, corresponding to clear water, turbid water, and eutrophic water, respectively. Through the analysis of the different methods for optimal band selection, the seventh band OLI7 (shortwave infrared 2, SWIR-2) of Landsat OLI shows the best performance in water identification. When applying the water indices to water extraction, Otsu’s algorithm has been used to automatically select the water threshold. Using extensive experiments with Otsu’s algorithm and a manual method, it was found that Otsu’s algorithm can replace manual selection and has the ability to select an accurate threshold for water extraction.     

Phase adjustment for multistatic passive radar imaging based on image entropy and image contrast

Multistatic passive radar imaging system (MPRIS) does not behave as well as traditional inverse synthetic aperture radar (ISAR) imaging system does on account of the limited illuminators of opportunity and relatively narrow bandwidth of the signals. Furthermore, in the MPRIS, limited by the unavoidable measurement errors of the positions of the illuminators or receivers, or the manoeuvrability of the moving target, the translation motion of the target cannot be compensated accurately, in which the echo will be contaminated by an error phase, resulting in the occurrence of serious image defocus and the degeneracy of the image quality. In this article, two nonparametric autofocusing techniques based on the principles of minimum entropy and maximum contrast, respectively, are proposed to deal with the undesired problems under the multistate geographical configuration consisting of one illuminator and several receivers distributed around a target. The error phase is corrected by introducing an adjustment phase in the frequency domain and the adjustment phase can be searched by iteratively solving an equation that is derived by optimizing the quality measure of the image. Since no assumption is made during the derivation, the proposed techniques could be used to compensate any form of the phase error. In addition, the influence of the multistatic configuration on the image resolution is analysed and an optimized configuration is obtained. The effectiveness of the proposed algorithms is verified via the theoretical derivations and simulations.     

A new fast normal-based interpolating subdivision scheme by cubic Bézier curves

In this paper, we propose a new fast normal-based interpolating subdivision scheme for curve and surface design. Different from the 4-points interpolating subdivision scheme, it is based on cubic Bezier curves and the normal vectors are used to generate a circle. Both a convex edge and an inflexion edge can be subdivided into convex sub-edges and then generate smooth curves. Under proper angle conditions, this subdivision scheme converges and the limit curve will be \(\hbox {G}^{1}\) smoothness. When applying it to subdivide surface on triangle/quadrilateral meshes, we use the normal vectors and have no need to consider the meshes neighboring to the current surface elements. Such advantage leads to that the subdivision scheme has fast rendering speed without changing the topology of the meshes. Subdivision examples and results by our scheme are illustrated and meantime is compared with those generated by other well-known schemes. It shows that this scheme can generate a more smooth curve based on both a convex edge and an inflexion edge, and the limit surface has better smoothness than those of other interpolating schemes.     

Fast fractal prediction of surge over underwater vehicle

In order to realize accurate control of underwater vehicles, this paper proposed a fractal prediction model of surge. Firstly, we introduce the current state-of-the-art of fractal prediction; secondly, we complete a fractal analysis with the R_S method, calculating the fractal dimension of surge using the short-time dimension method; thirdly, we correct the vertical scaling factor of the Iterated Function System (IFS) using the fractal dimension. Then the predictive value can be calculated through anti-iteration according to the statistical significantly IFS and proposing a fractal prediction model. Finally, we complete a simulation analysis based on the actual data and a comparison to another prediction algorithm. The result shows that the fractal prediction algorithm of this article has better comprehensive performance.     

Image morphing with conformal welding

We address the issue of deforming an image of a source object to that of a target. Previous works including barycentric coordinates and functional maps can hardly enforce shape consistency, especially for the objects with complex nested shape components. We leverage the conformal welding theory that maps 2D shapes (planar contours) to the automorphisms of the unit circle, named shape signatures. Conformal welding enables us to apply the Laplacian constraint to deformations in the signature space (or unit circle domain), which renders efficiency and flexibility. Additionally, we are able to fully reconstruct complex shape contours from deformed signatures, and hence generate the morphed images for target shapes. The experiments on complex shape contours and facial images, where multiple components exist, validate the effectiveness of the proposed approach.     

CUDA-based real-time hand gesture interaction and visualization for CT volume dataset using leap motion

Touchless interaction has received considerable attention in recent years with benefit of removing barriers of physical contact. Several approaches are available to achieve mid-air interactions. However, most of these techniques cause discomfort when the interaction method is not direct manipulation. In this paper, gestures based on unimanual and bimanual interactions with different tools for exploring CT volume dataset are designed to perform the similar tasks in realistic applications. Focus + context approach based on GPU volume ray casting by trapezoid-shaped transfer function is used for visualization and the level-of-detail technique is adopted for accelerating interactive rendering. Comparing the effectiveness and intuitiveness of interaction approach with others by experiments, ours has a better performance and superiority with less completion time. Moreover, the bimanual interaction with more advantages is timesaving when performing continuous exploration task.     

On the tag localization of web video

Nowadays, numerous social videos have pervaded on the web. Social web videos are characterized with the accompanying rich contextual information which describe the content of videos and thus greatly facilitate video search and browsing. Generally, those contextual data such as tags are provided at the whole video level, without temporal indication of when they actually appear in the video, let alone the spatial annotation of object related tags in the video frames. However, many tags only describe parts of the video content. Therefore, tag localization, the process of assigning tags to the underlying relevant video segments or frames even regions in frames is gaining increasing research interests and a benchmark dataset for the fair evaluation of tag localization algorithms is highly desirable. In this paper, we describe and release a dataset called DUT-WEBV, which contains about 4,000 videos collected from YouTube portal by issuing 50 concepts as queries. These concepts cover a wide range of semantic aspects including scenes like “mountain”, events like “flood”, objects like “cows”, sites like “gas station”, and activities like “handshaking”, offering great challenges to the tag (i.e., concept) localization task. For each video of a tag, we carefully annotate the time durations when the tag appears in the video and also label the spatial location of object with mask in frames for object related tag. Besides the video itself, the contextual information, such as thumbnail images, titles, and YouTube categories, is also provided. Together with this benchmark dataset, we present a baseline for tag localization using multiple instance learning approach. Finally, we discuss some open research issues for tag localization in web videos.     

Recommendation using DMF-based fine tuning method

Recommender Systems (RS) have been comprehensively analyzed in the past decade, Matrix Factorization (MF)-based Collaborative Filtering (CF) method has been proved to be an useful model to improve the performance of recommendation. Factors that inferred from item rating patterns shows the vectors which are useful for MF to characterize both items and users. A recommendation can concluded from good correspondence between item and user factors. A basic MF model starts with an object function, which is consisted of the squared error between original training matrix and predicted matrix as well as the regularization term (regularization parameters). To learn the predicted matrix, recommender systems minimize the squared error which has been regularized. However, two important details have been ignored: (1) the predicted matrix will be more and more accuracy as the iterations carried out, then a fix value of regularization parameters may not be the most suitable choice. (2) the final distribution trend of ratings of predicted matrix is not similar with the original training matrix. Therefore, we propose a Dynamic-MF algorithm and fine tuning method which is quite general to overcome the mentioned detail problems. Some other information, such as social relations, etc, can be easily incorporated into this method (model). The experimental analysis on two large datasets demonstrates that our approaches outperform the basic MF-based method.     

SDN中基于负载均衡的最优路径选择算法研究

针对传统网络控制与转发的紧耦合,其路径分配算法的全局性差,实时性不足,根据软件定义网络的集中控制,提出一种基于马尔科夫链负载均衡(Markov Chain-Load Balancing ,MC-LB)算法。该算法使用马尔科夫链的转移概率计算链路重要性,并同时对业务流请求量和网络负载均衡率两个目标进行优化,获得多请求下的最优路径分配。通过大量实验对比表明该算法优于传统SPF（Shortest Path First）算法,最大可以增加网络负载均衡率30%,提升网络业务流请求接受率20%。达到了负载均衡效果,提高了网络的性能。     

Reversible data hiding in encrypted images based on multi-level encryption and block histogram modification

Multimedia Tools and Applications - In recent years there has been significant interest in reversible data hiding, and also in particular, reversible data hiding in encrypted images (RDH-EI). This...