Search

Adversarial attacks have threatened the application of deep neural networks in security-sensitive scenarios. Most existing black-box attacks fool the target model by interacting with it many times and producing global perturbations. However, all pixels are not equally crucial to the target model; thus, indiscriminately treating all pixels will increase query overhead inevitably. In addition, existing black-box attacks take clean samples as start points, which also limits query efficiency. In this article, we propose a novel black-box attack framework, constructed on a strategy of dual transferability (DT), to perturb the discriminative areas of clean examples within limited queries. The first kind of transferability is the transferability of model interpretations. Based on this property, we identify the discriminative areas of clean samples for generating local perturbations. The second is the transferability of adversarial examples, which helps us to produce local pre-perturbations for further improving query efficiency. We achieve the two kinds of transferability through an independent auxiliary model and do not incur extra query overhead. After identifying discriminative areas and generating pre-perturbations, we use the pre-perturbed samples as better start points and further perturb them locally in a black-box manner to search the corresponding adversarial examples. The DT strategy is general; thus, the proposed framework can be applied to different types of black-box attacks. We conduct extensive experiments to show that, under various system settings, our framework can significantly improve the query efficiency of existing black-box attacks and attack success rates.

With the continued proliferation of mobile Internet and geo-locating technologies, carpooling as a green transport mode is widely accepted and becoming tremendously popular worldwide. In this paper, we focus on a popular carpooling service called ride hitching, which is typically implemented using a publish/subscribe approach. In a ride hitching service, drivers subscribe ride orders published by riders and continuously receive matching ride orders until one is picked. The current systems (e.g., Didi Hitch) adopt a threshold-based approach to filter out ride orders. That is, a new ride order will be sent to all subscribing drivers whose planned trips can match the ride order within a pre-defined detour threshold. A limitation of this approach is that it is difficult for drivers to specify a reasonable detour threshold in practice. In addressing this problem, we propose a novel top-k subscription query called Top-k Ride Subscription (TkRS) query, which continuously returns the best k ride orders that match drivers' trip plans to them. We propose two efficient algorithms to enable the top-k results maintenance. We also design a novel hybrid index and a two-level buffer to efficiently track the top- $k$ results. Finally, extensive experiments on real-life datasets suggest that our algorithms can achieve desirable performance in practical settings.

Medical image fusion generates a fused image containing multiple features extracted from different source images, and it is of great help in clinical analysis and diagnosis. However, training a deep learning model for image fusion usually requires enormous computing power, especially for large volumes of medical data. Meanwhile, the privacy of images is also a critical issue. In this article, we propose a privacy-preserving blockchain-based medical image fusion (BMIF) framework. First, to ensure fusion performance, we design a new medical image fusion model based on convolutional neural network and Inception network and integrate the proposed model into the consensus process of blockchain. Next, to save computing power of blockchain, we design a consensus mechanism by requesting consensus nodes to train the fusion model instead of calculating useless hash values in traditional blockchain. Then, to protect data privacy, we further present an efficient homomorphic encryption to realize the training of fusion model on encrypted medical data. Finally, we conduct theoretical analysis and extensive experiments on public datasets to evaluate the feasibility and the performance of our proposed BMIF. The results exhibit that BMIF is efficient and secure, and our medical image fusion network performs better than state-of-the-art approaches.

Deep Neural Networks (DNN) are gaining higher commercial values in computer vision applications, e.g., image classification, video analytics, etc. This calls for urgent demands of the intellectual property (IP) protection of DNN models. In this paper, we present a novel watermarking scheme to achieve the ownership verification of DNN architectures. Existing works all embedded watermarks into the model parameters while treating the architecture as public property. These solutions were proven to be vulnerable by an adversary to detect or remove the watermarks. In contrast, we claim the model architectures as an important IP for model owners, and propose to implant watermarks into the architectures. We design new algorithms based on Neural Architecture Search (NAS) to generate watermarked architectures, which are unique enough to represent the ownership, while maintaining high model usability. Such watermarks can be extracted via side-channel-based model extraction techniques with high fidelity. We conduct comprehensive experiments on watermarked CNN models for image classification tasks and the experimental results show our scheme has negligible impact on the model performance, and exhibits strong robustness against various model transformations and adaptive attacks., The paper has been accepted by IEEE Transactions on Circuits and Systems for Video Technology

With the advent of cloud computing, it has become more and more popular to outsource various services to the cloud for releasing the burden of local data storage and maintenance. However, it may cause serious privacy problems because the cloud may be untrusted. In this paper, we study the privacy-preserving reverse nearest neighbor (PPRNN) query over encrypted spatial data. First, we introduce the concept of reference-locked order-preserving encryption (RL-OPE) with its construction and security proof, which reveals less information than traditional order-preserving encryption (OPE). Then, we present a novel PPRNN scheme in static setting based on structured encryption (SE) and the proposed RL-OPE, called sPPRNN. After that, we design a generic method that extends a PPRNN scheme in static setting to the counterpart in dynamic setting, called dPPRNN. Furthermore, we present a thorough privacy analysis of our proposal. Finally, we demonstrate its efficiency and effectiveness for practical deployment through extensive experiments.

Decentralized learning has gained great popularity to improve learning efficiency and preserve data privacy. Each computing node makes equal contribution to collaboratively learn a Deep Learning model. The elimination of centralized Parameter Servers (PS) can effectively address many issues such as privacy, performance bottleneck and single-point-failure. However, how to achieve Byzantine Fault Tolerance in decentralized learning systems is rarely explored, although this problem has been extensively studied in centralized systems. In this paper, we present an in-depth study towards the Byzantine resilience of decentralized learning systems with two contributions. First, from the adversarial perspective, we theoretically illustrate that Byzantine attacks are more dangerous and feasible in decentralized learning systems: even one malicious participant can arbitrarily alter the models of other participants by sending carefully crafted updates to its neighbors. Second, from the defense perspective, we propose UBAR, a novel algorithm to enhance decentralized learning with Byzantine Fault Tolerance. Specifically, UBAR provides a Uniform Byzantine-resilient Aggregation Rule for benign nodes to select the useful parameter updates and filter out the malicious ones in each training iteration. It guarantees that each benign node in a decentralized system can train a correct model under very strong Byzantine attacks with an arbitrary number of faulty nodes. We conduct extensive experiments on standard image classification tasks and the results indicate that UBAR can effectively defeat both simple and sophisticated Byzantine attacks with higher performance efficiency than existing solutions.

Non-repetitive scanning Light Detection And Ranging(LiDAR)-Camera systems are commonly used in autonomous navigation industries, benefiting from their low-cost and high-perception characteristics. However, due to the irregular scanning pattern of LiDAR, feature extraction on point cloud encounters the problem of non-uniformity distribution of density and reflectance intensity, accurate extrinsic calibration remains a challenging task. To solve this problem, this paper presented an open-source calibration method using only a printed chessboard. We designed a two-stage coarse-to-fine pipeline for 3D corner extraction. Firstly, a Gaussian Mixture Model(GMM)-based intensity cluster approach is proposed to adaptively identify point segments in different color blocks of the chessboard. Secondly, a novel Iterative Lowest-cost Pose(ILP) algorithm is designed to fit the chessboard grid and refine the 3D corner iteratively. This scheme is unique for turning the corner feature extraction problem into a grid align problem. After the corresponding 3D-2D points are solved, by applying the PnP(Perspective-n-Point) method, along with nonlinear-optimization refinement, the extrinsic parameters are obtained. Extensive simulation and real-world experimental results show that our method achieved subpixel-level precision in terms of reprojection error. The comparison demonstrated that the effectiveness and accuracy of the proposed method outperformed existing methods.

Developing a highly active and durable non-noble metal catalyst for aqueous-phase levulinic acid (LA) hydrogenation to γ-valerolactone (GVL) is an appealing yet challenging task. Herein, we report well-dispersed Co nanoparticles (NPs) embedded in nitrogen-doped mesoporous carbon nanofibers as an efficient catalyst for aqueous-phase LA hydrogenation to GVL. The Co zeolitic imidazolate framework (ZIF-67) nanocrystals were anchored on the sodium dodecyl sulfate modified wipe fiber (WF-S), yielding one-dimensional (1-D) structured composite (ZIF-67/WF-S). Subsequently, Co NPs were uniformly embedded in nitrogen-doped mesoporous carbon nanofibers (CoRNC/SMCNF) through a pyrolysis-reduction strategy using ZIF-67/WF-S as the precursor. Benefiting from introducing modified wipe fiber WF-S to enhance the dispersion of Co NPs, and Co0 with Co-Nx dual active sites, the resulting CoRNC/SMCNF catalyst shows brilliant catalytic activity (206 h−1 turnover frequency). Additionally, the strong metal–support interactions greatly inhibited the Co NPs from aggregation and leaching from the mesoporous carbon nanofibers, and thus increasing the reusability of the CoRNC/SMCNF catalyst (reusable nine times without notable activity loss).

The hydrolysis of cellulose to high-yield glucose in water remains challenging owing to the limited acidity and substrate contact of sulfonated carbons. Herein, we report a unique sulfonated mesoporous carbon fiber with optimized acidity prepared by the pyrolysis of FeCl3-impregnated wipe fibers followed by acid treatment. The Bronsted acidity (especially for SO3H) was produced by sulfonation of the magnetic carbon fiber intermediate, while Lewis acidity originated from small Fe3O4 nanoparticles and the remaining defects. The balanced Bronsted and Lewis acidity combined with hydrophilic functionalities was simultaneously tailored by varying the Fe/wipe fiber (WF) feed ratio and pyrolysis temperature to change the porous structure of the final catalysts. The elaborately fabricated MCF-SO3H-20-500 (20% Fe/WF feed ratio and pyrolysis at 500 °C) delivered 66.0% glucose yield as cellulose was completely converted. This is the highest glucose yield achieved by the hydrolysis of untreated cellulose in water over a sulfonated carbon catalyst. The optimized Bronsted and Lewis acidity was mainly responsible for the controlled conversion of cellulose to glucose, while the rich hydrophilic functionalities and superior mesoporous structure of the catalyst facilitated contact to cellulose and mass transfer. This investigation will open new avenues to design high-performance carbon sulfoacid catalysts toward cellulose hydrolysis.

Perceptual/selective encryption has been gaining widespread attention as an emerging technology for image privacy protection. However, few studies focus on the visual security evaluation of perceptually encrypted images, which has a significant impact on measuring the effectiveness and practicality of these encryption methods. In this paper, we propose an image importance-based visual security index (IIBVSI) by leveraging spatial contrast and texture features. Based on the characteristics of perceptually encrypted images, we present an averaged high-order gradient magnitude map to describe the spatial contrast feature and introduce a combined local amplitude map of multiple log-Gabor filters to represent the texture feature. Specifically, the multiresolution representation of an image is first created by downsampling to simulate the hierarchical property of the human visual system. Next, for each scale of image resolution, the spatial contrast and the texture feature maps are extracted from both plain and encrypted images. Similarity measurements are then conducted on these feature maps to generate the contrast and the texture similarity maps. An image importance-based pooling strategy is subsequently proposed to combine these measurements and generate a visual security score. The final IIBVSI score is computed by averaging the visual security scores of all scales of image resolution. Extensive experiments are conducted on several publicly available databases, and the results demonstrate the superiority and robustness of our proposed IIBVSI compared with existing state-of-the-art work in the low and moderate image quality ranges.

Blind image quality assessment (BIQA) aims to develop quantitative measures to automatically and accurately estimate the visual quality of an image without any prior information about its reference image. This issue has been attracting a great deal of attention for a long time; however, little work has been done on night-time images, which are crucially important for consumer photography and practical applications such as automated driving systems. In this paper, to the best of our knowledge, we conduct the first exploration on subjective and objective quality assessment of night-time images. First, we build a large-scale natural night-time image database (NNID) containing 2240 images with 448 different image contents captured by different photographic equipment in real-world scenarios. Subsequently, we carry out a subjective experiment to evaluate the perceptual quality of all the images in the NNID database. Thereafter, we perform objective assessment of night-time images by proposing a blind night-time image quality assessment metric using brightness and texture features (BNBT). Finally, extensive experiments are conducted to evaluate the performance and efficiency of the proposed BNBT metric on the NNID database. The experimental results demonstrate that this metric outperforms existing state-of-the-art BIQA methods in terms of all evaluation criteria and has an acceptable computational cost at the same time. We have made the NNID database publicly available for downloading at https://sites.google.com/site/xiangtaooo/. This work was supported by the National Natural Science Foundation of China under Grants 61672118 and 61932006. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Hantao Liu.

Perceptual image encryption provides an efficient and effective way to preserve the confidentiality of visual information, and the measurement of content leakage is of fundamental importance for perceptually encrypted images. Numerous visual security indexes (VSIs) have been proposed to evaluate visual content leakage. Due to the lack of perceptually encrypted image databases, image quality assessment (IQA) databases are widely adopted to evaluate the performance of existing VSIs. However, there are huge differences between VSIs and IQAs. The misuse of databases may lead to an inaccurate evaluation. In this paper, we propose a perceptually encrypted image database (PEID) which contains 1080 encrypted images from 20 plain images with 10 well-known perceptual encryption techniques. Both visual quality and content leakage scores of the encrypted images are obtained through a comprehensive subjective evaluation. We also propose a systemic methodology to accurately evaluate the monotonicity, fitness, and accuracy of VSIs. We conduct extensive experiments on the proposed PEID to evaluate the performance of existing state-of-the-art VSIs. We have made the database publicly available for download and hope that the proposed PEID can facilitate the research of visual security evaluation and beyond.

Combined with the characteristic of the multi-slit streak tube imaging LiDAR (MS-STIL) system where the imaging areas corresponding to each slit do not interfere with each other, we denoised the streak images by an improved fast non-local mean filtering algorithm. Experiments were performed to investigate the effectiveness of the method. The experimental results show that the spatial resolution of the system is improved from 22 to 16 mm; the relative distance error is reduced by an average of 22.76%; and the intensity accuracy improved significantly when the distance is 10 m. Additionally, the overall denoising effect is comprehensively verified by long-range target imaging. The mean square error of the reconstructed depth image and intensity image are reduced from 0.0836, 0.0067 to 0.0433, 0.0037, respectively. The applicability of the proposed method was verified through comparative experiments in different environments.

Perceptual encryption is an efficient way of protecting image content by only selectively encrypting a portion of significant data in plain images. Existing security analysis of perceptual encryption usually resorts to traditional cryptanalysis techniques, which require heavy manual work and strict prior knowledge of encryption schemes. In this paper, we introduce a new end-to-end method of analyzing the visual security of perceptually encrypted images, without any manual work or knowing any prior knowledge of the encryption scheme. Specifically, by leveraging convolutional neural networks (CNNs), we propose a progressive recovery network (PRNet) to recover visual content from perceptually encrypted images. Our PRNet is stacked with several dense attention recovery blocks (DARBs), where each DARB contains two branches: feature extraction branch and image recovery branch. These two branches cooperate to rehabilitate more detailed visual information and generate efficient feature representation via densely connected structure and dual-saliency mechanism. We conduct extensive experiments to demonstrate that PRNet works on different perceptual encryption schemes with different settings, and the results show that PRNet significantly outperforms the state-of-the-art CNN-based image restoration methods.