nils-herrmann/clean_scirepeval huggingface dataset:
Secrecy-Optimized Resource Allocation for Device-to-Device Communication Underlaying Heterogeneous Networks

Device-to-device (D2D) communications have recently attracted much attention for the potential capability to improve spectral efficiency (SE) underlaying the existing heterogeneous networks (HetNets). Due to no sophisticated control, D2D-worked user equipments (DUEs) themselves cannot resist eavesdropping or security attacks. It is urgent to maximize the secure capacity for both cellular users and DUEs. This paper formulates the radio resource-allocation problem to maximize the secure capacity of DUEs for D2D communication underlaying HetNets, which consist of high-power nodes (HPNs) and low-power nodes (LPNs). The optimization objective function with transmit bit rate and power constraints, which is nonconvex and hard to directly derive, is first transformed into a matrix form. Then, the equivalent convex form of the optimization problem is derived according to Perron–Frobenius theory. A heuristic iterative algorithm based on the proximal theory is proposed to solve this equivalent convex problem through evaluating the proximal operator of the Lagrange function. Numerical results show that the proposed radio resource-allocation solution significantly improves the secure capacity with a fast convergence speed.
Video Supervoxels Using Partially Absorbing Random Walks

Supervoxels have been widely used as a preprocessing step to exploit object boundaries to improve the performance of video processing tasks. However, most of the traditional supervoxel algorithms do not perform well in regions with complex textures or weak boundaries. These methods may generate supervoxels with overlapping boundaries. In this paper, we present the novel video supervoxel generation algorithm using partially absorbing random walks to get more accurate supervoxels in these regions. Our spatial-temporal framework is introduced by making full use of the appearance and motion cues, which effectively exploits the temporal consistency in video sequence. Moreover, we build a novel Laplacian optimization structure using two adjacent frames to make our approach more efficient. Experimental results demonstrated that our method achieved better performance than the state-of-the-art supervoxel algorithms.
Error Analysis of Stochastic Gradient Descent Ranking

Ranking is always an important task in machine learning and information retrieval, e.g., collaborative filtering, recommender systems, drug discovery, etc. A kernel-based stochastic gradient descent algorithm with the least squares loss is proposed for ranking in this paper. The implementation of this algorithm is simple, and an expression of the solution is derived via a sampling operator and an integral operator. An explicit convergence rate for leaning a ranking function is given in terms of the suitable choices of the step size and the regularization parameter. The analysis technique used here is capacity independent and is novel in error analysis of ranking learning. Experimental results on real-world data have shown the effectiveness of the proposed algorithm in ranking tasks, which verifies the theoretical analysis in ranking error.
Face Sketch-Photo Synthesis under Multi-dictionary Sparse Representation Framework

Sketch-photo synthesis is one of the important research issues of heterogeneous image transformation. Some available popular synthesis methods, like locally linear embedding (LLE), usually generate sketches or photos with lower definition and blurred details, which reduces the visual quality and the recognition rate across the heterogeneous images. In order to improve the quality of the synthesized images, a multi-dictionary sparse representation based face sketch-photo synthesis model is constructed. In the proposed model, LLE is used to estimate an initial sketch or photo, while the multi-dictionary sparse representation model is applied to generate the high frequency and detail information. Finally, by linear superimposing, the enhanced face sketch or photo can be obtained. Experimental results show that sketches and photos synthesized by the proposed method have higher definition and much richer detail information resulting in a higher face recognition rate between sketches and photos.
General Averaged Divergence Analysis

Subspace selection is a powerful tool in data mining. An important subspace method is the Fisher-Rao linear discriminant analysis (LDA), which has been successfully applied in many fields such as biometrics, bioinformatics, and multimedia retrieval. However, LDA has a critical drawback: the projection to a subspace tends to merge those classes that are close together in the original feature space. If the separated classes are sampled from Gaussian distributions, all with identical covariance matrices, then LDA maximizes the mean value of the Kullback-Leibler (KL) divergences between the different classes. We generalize this point of view to obtain a framework for choosing a subspace by 1) generalizing the KL divergence to the Bregman divergence and 2) generalizing the arithmetic mean to a general mean. The framework is named the general averaged divergence analysis (GADA). Under this GADA framework, a geometric mean divergence analysis (GMDA) method based on the geometric mean is studied. A large number of experiments based on synthetic data show that our method significantly outperforms LDA and several representative LDA extensions.
Multi-view Subspace Clustering

For many computer vision applications, the data sets distribute on certain low-dimensional subspaces. Subspace clustering is to find such underlying subspaces and cluster the data points correctly. In this paper, we propose a novel multi-view subspace clustering method. The proposed method performs clustering on the subspace representation of each view simultaneously. Meanwhile, we propose to use a common cluster structure to guarantee the consistence among different views. In addition, an efficient algorithm is proposed to solve the problem. Experiments on four benchmark data sets have been performed to validate our proposed method. The promising results demonstrate the effectiveness of our method.
Estimating patient-specific shape prior for medical image segmentation

Image segmentation is one of the key problems in medical image analysis. This paper presents a new statistical shape model for automatic image segmentation. In contrast to the previous model based segmentation methods, where shape priors are estimated from a general population-based shape model, our proposed method aims to estimate patient-specific shape priors to achieve more accurate segmentation by using manifold learning techniques. The proposed shape prior estimation method is incorporated into a deformable model based framework for image segmentation. The effectiveness of the proposed method has been demonstrated by the experiments on segmenting the prostate from MR images.
A security-based visual information retrieval scheme

This paper presents a novel idea of combining the content-based image retrieval (CBIR) and concept of security together into the traditional CBIR systems, and a sample system based on digital watermarking can be built for special grade queries. Using this kind of digital watermarking-based systems, the administrators, high-level users, middle-level users and low-level users may retrieve different results under the same query image, because dissimilar digital information has been embedded in the images as digital watermarks. We build a test bed (as a simple sample only) on 56,600 images, and parts of them are watermarked. The experimental result shows our algorithms work well for image database security, while it can be extended for copyright protection in visual information retrieval systems and data packet filters in the network.
Learning Discriminative Binary Codes for Large-scale Cross-modal Retrieval

Hashing based methods have attracted considerable attention for efficient cross-modal retrieval on large-scale multimedia data. The core problem of cross-modal hashing is how to learn compact binary codes that construct the underlying correlations between heterogeneous features from different modalities. A majority of recent approaches aim at learning hash functions to preserve the pairwise similarities defined by given class labels. However, these methods fail to explicitly explore the discriminative property of class labels during hash function learning. In addition, they usually discard the discrete constraints imposed on the to-be-learned binary codes, and compromise to solve a relaxed problem with quantization to obtain the approximate binary solution. Therefore, the binary codes generated by these methods are suboptimal and less discriminative to different classes. To overcome these drawbacks, we propose a novel cross-modal hashing method, termed discrete cross-modal hashing (DCH), which directly learns discriminative binary codes while retaining the discrete constraints. Specifically, DCH learns modality-specific hash functions for generating unified binary codes, and these binary codes are viewed as representative features for discriminative classification with class labels. An effective discrete optimization algorithm is developed for DCH to jointly learn the modality-specific hash function and the unified binary codes. Extensive experiments on three benchmark data sets highlight the superiority of DCH under various cross-modal scenarios and show its state-of-the-art performance.
Multiresolution Imaging

Imaging resolution has been standing as a core parameter in various applications of vision. Mostly, high resolutions are desirable or essential for many applications, e.g., in most remote sensing systems, and therefore much has been done to achieve a higher resolution of an image based on one or a series of images of relatively lower resolutions. On the other hand, lower resolutions are also preferred in some cases, e.g., for displaying images in a very small screen or interface. Accordingly, algorithms for image upsampling or downsampling have also been proposed. In the above algorithms, the downsampled or upsampled (super-resolution) versions of the original image are often taken as test images to evaluate the performance of the algorithms. However, there is one important question left unanswered: whether the downsampled or upsampled versions of the original image can represent the low-resolution or high-resolution real images from a camera? To tackle this point, the following works are carried out: 1) a multiresolution camera is designed to simultaneously capture images in three different resolutions; 2) at a given resolution (i.e., image size), the relationship between a pair of images is studied, one gained via either downsampling or super-resolution, and the other is directly captured at this given resolution by an imaging device; and 3) the performance of the algorithms of super-resolution and image downsampling is evaluated by using the given image pairs. The key reason why we can effectively tackle the aforementioned issues is that the designed multiresolution imaging camera can provide us with real images of different resolutions, which builds a solid foundation for evaluating various algorithms and analyzing the images with different resolutions, which is very important for vision.
Semi-Supervised Multitask Learning for Scene Recognition

Scene recognition has been widely studied to understand visual information from the level of objects and their relationships. Toward scene recognition, many methods have been proposed. They, however, encounter difficulty to improve the accuracy, mainly due to two limitations: 1) lack of analysis of intrinsic relationships across different scales, say, the initial input and its down-sampled versions and 2) existence of redundant features. This paper develops a semi-supervised learning mechanism to reduce the above two limitations. To address the first limitation, we propose a multitask model to integrate scene images of different resolutions. For the second limitation, we build a model of sparse feature selection-based manifold regularization (SFSMR) to select the optimal information and preserve the underlying manifold structure of data. SFSMR coordinates the advantages of sparse feature selection and manifold regulation. Finally, we link the multitask model and SFSMR, and propose the semi-supervised learning method to reduce the two limitations. Experimental results report the improvements of the accuracy in scene recognition.
Exposure Fusion Using Boosting Laplacian Pyramid

This paper proposes a new exposure fusion approach for producing a high quality image result from multiple exposure images. Based on the local weight and global weight by considering the exposure quality measurement between different exposure images, and the just noticeable distortion-based saliency weight, a novel hybrid exposure weight measurement is developed. This new hybrid weight is guided not only by a single image's exposure level but also by the relative exposure level between different exposure images. The core of the approach is our novel boosting Laplacian pyramid, which is based on the structure of boosting the detail and base signal, respectively, and the boosting process is guided by the proposed exposure weight. Our approach can effectively blend the multiple exposure images for static scenes while preserving both color appearance and texture structure. Our experimental results demonstrate that the proposed approach successfully produces visually pleasing exposure fusion images with better color appearance and more texture details than the existing exposure fusion techniques and tone mapping operators.
Actively Learning Human Gaze Shifting Paths for Semantics-Aware Photo Cropping

Photo cropping is a widely used tool in printing industry, photography, and cinematography. Conventional cropping models suffer from the following three challenges. First, the deemphasized role of semantic contents that are many times more important than low-level features in photo aesthetics. Second, the absence of a sequential ordering in the existing models. In contrast, humans look at semantically important regions sequentially when viewing a photo. Third, the difficulty of leveraging inputs from multiple users. Experience from multiple users is particularly critical in cropping as photo assessment is quite a subjective task. To address these challenges, this paper proposes semantics-aware photo cropping, which crops a photo by simulating the process of humans sequentially perceiving semantically important regions of a photo. We first project the local features (graphlets in this paper) onto the semantic space, which is constructed based on the category information of the training photos. An efficient learning algorithm is then derived to sequentially select semantically representative graphlets of a photo, and the selecting process can be interpreted by a path, which simulates humans actively perceiving semantics in a photo. Furthermore, we learn a prior distribution of such active graphlet paths from training photos that are marked as aesthetically pleasing by multiple users. The learned priors enforce the corresponding active graphlet path of a test photo to be maximally similar to those from the training photos. Experimental results show that: 1) the active graphlet path accurately predicts human gaze shifting, and thus is more indicative for photo aesthetics than conventional saliency maps and 2) the cropped photos produced by our approach outperform its competitors in both qualitative and quantitative comparisons.
Rank Preserving Sparse Learning for Kinect Based Scene Classification

With the rapid development of the RGB-D sensors and the promptly growing population of the low-cost Microsoft Kinect sensor, scene classification, which is a hard, yet important, problem in computer vision, has gained a resurgence of interest recently. That is because the depth of information provided by the Kinect sensor opens an effective and innovative way for scene classification. In this paper, we propose a new scheme for scene classification, which applies locality-constrained linear coding (LLC) to local SIFT features for representing the RGB-D samples and classifies scenes through the cooperation between a new rank preserving sparse learning (RPSL) based dimension reduction and a simple classification method. RPSL considers four aspects: 1) it preserves the rank order information of the within-class samples in a local patch; 2) it maximizes the margin between the between-class samples on the local patch; 3) the L1-norm penalty is introduced to obtain the parsimony property; and 4) it models the classification error minimization by utilizing the least-squares error minimization. Experiments are conducted on the NYU Depth V1 dataset and demonstrate the robustness and effectiveness of RPSL for scene classification.
A Biologically Inspired Appearance Model for Robust Visual Tracking

In this paper, we propose a biologically inspired appearance model for robust visual tracking. Motivated in part by the success of the hierarchical organization of the primary visual cortex (area V1), we establish an architecture consisting of five layers: whitening, rectification, normalization, coding, and pooling. The first three layers stem from the models developed for object recognition. In this paper, our attention focuses on the coding and pooling layers. In particular, we use a discriminative sparse coding method in the coding layer along with spatial pyramid representation in the pooling layer, which makes it easier to distinguish the target to be tracked from its background in the presence of appearance variations. An extensive experimental study shows that the proposed method has higher tracking accuracy than several state-of-the-art trackers.
A Hybrid Sparsity and Distance-Based Discrimination Detector for Hyperspectral Images

Hyperspectral target detection is an approach which tries to locate targets in a hyperspectral image on the condition of given targets spectrum. Many classical target detectors are based on the linear mixing model (LMM) and sparsity model. The LMM has a poor performance in dealing with the spectral variability. Therefore, more studies focus on the sparsity-based detectors, most of which are based on residual reconstruction. Owing to the fact that the impure dictionary for the test pixel weakens the detection performance and the discrimination ability of residual function has direct influence on the detecting accuracy, the dictionary purity and discriminative residual function are two most important factors affecting the accuracy of sparsity-based target detectors. In order to obtain more purified dictionary and discriminative residual function, this paper proposes a novel sparsity-based detector named the hybrid sparsity and distance-based discrimination (HSDD) detector for target detection in hyperspectral imagery. The residual function is constrained by the discrimination information during the dictionary construction, which enhances the dictionary purification. Only background samples are used to construct the dictionary because it is easier to remove the target pixel than to select it on the condition that majority of pixels are the background pixels. Hence, a purification process is applied for background training samples in order to construct an effective competition between the residual term and discriminative term. Extensive experimental results with four hyperspectral data sets demonstrate that the proposed HSDD algorithm has a better performance than the state-of-the-art algorithms.
Neural Networks and Learning Systems Come Together

This issue marks the beginning of the IEEE Transactions on Neural Networks and Learning Systems (TNNLS). By adding "Learning Systems" to the title, we now state explicitly the scope of the TRANSACTIONS to include neural networks as well as related learning systems. This issue marks a new era in the history of our TRANSACTIONS. The TRANSACTIONS is now ready to face the challenges of the next 10-20 years. With the evolution of the fields of neural networks in particular and computational intelligence in general, the IEEE Transactions on Neural Networks and Learning Systems will continue to grow and to succeed in this ever-changing world. Also included are a few comments about the review process of TNN manuscripts and the introduction of 14 new TNNLS Associate Editors.
A Feedback-Based Robust Video Stabilization Method for Traffic Videos

Traffic videos are often recorded by vehicle-mounted cameras. Compared with videos recorded by handheld cameras, traffic videos suffer from more challenges, such as higher frequency and more violent jitters, dynamic scenes, large moving objects, and parallax, which can result in significant visual quality degradation. To address these challenges for traffic videos, we propose a special stabilization method. The key aspect of our method is a feedback strategy that divides the extracted feature trajectories into background trajectories and foreground trajectories by feeding back the previous trajectory classification results. The method can perform robustly, even in the case of large moving objects and parallax. Furthermore, our method maintains the number of available background trajectories within a reasonable range via two refinement strategies. One strategy attempts to reliably recover background trajectories from misjudged foreground trajectories when there are an insufficient number of background trajectories. The other strategy can adaptively adjust the number of feature points in each frame to efficiently avoid too many or too few background trajectories. With the obtained background trajectories, a homography matrix between each frame and its stabilized view is computed and implemented to warp the frame image to produce smooth videos. Experimental results confirm that our method is both effective in stabilizing traffic videos and quite robust against large moving objects and parallax.
Scene Parsing From an MAP Perspective

Scene parsing is an important problem in the field of computer vision. Though many existing scene parsing approaches have obtained encouraging results, they fail to overcome within-category inconsistency and intercategory similarity of superpixels. To reduce the aforementioned problem, a novel method is proposed in this paper. The proposed approach consists of three main steps: 1) posterior category probability density function (PDF) is learned by an efficient low-rank representation classifier (LRRC); 2) prior contextual constraint PDF on the map of pixel categories is learned by Markov random fields; and 3) final parsing results are yielded up to the maximum a posterior process based on the two learned PDFs. In this case, the nature of being both dense for within-category affinities and almost zeros for intercategory affinities is integrated into our approach by using LRRC to model the posterior category PDF. Meanwhile, the contextual priori generated by modeling the prior contextual constraint PDF helps to promote the performance of scene parsing. Experiments on benchmark datasets show that the proposed approach outperforms the state-of-the-art approaches for scene parsing.