Searcharxiv⌕ Search

arXiv subjects

Qiang Guo

Publications and source records attributed to Qiang Guo.

At least 37 records · Page 2Linked to original sources

Tensor Robust PCA with Nonconvex and Nonlocal Regularization

Tensor robust principal component analysis (TRPCA) is a classical way for low-rank tensor recovery, which minimizes the convex surrogate of tensor rank by shrinking each tensor singular value equally. However, for real-world visual data, large singular values represent more significant information than small singular values. In this paper, we propose a nonconvex TRPCA (N-TRPCA) model based on the tensor adjustable logarithmic norm. Unlike TRPCA, our N-TRPCA can adaptively shrink small singular values more and shrink large singular values less. In addition, TRPCA assumes that the whole data tensor is of low rank. This assumption is hardly satisfied in practice for natural visual data, restricting the capability of TRPCA to recover the edges and texture details from noisy images and videos. To this end, we integrate nonlocal self-similarity into N-TRPCA, and further develop a nonconvex and nonlocal TRPCA (NN-TRPCA) model. Specifically, similar nonlocal patches are grouped as a tensor and then each group tensor is recovered by our N-TRPCA. Since the patches in one group are highly correlated, all group tensors have strong low-rank property, leading to an improvement of recovery performance. Experimental results demonstrate that the proposed NN-TRPCA outperforms existing TRPCA methods in visual data recovery. The demo code is available at https://github.com/qguo2010/NN-TRPCA.

cs.CV↗

Internet Of Rights(IOR) In Role Based Block Chain

A large amount of data has been accumulated. with the development of the Internet industry. Many problems have been exposed with data explosion: 1. The contradiction between data privacy and data collaborations; 2. The contradiction between data ownership and the right of data usage; 3. The legality of data collection and data usage; 4. The relationship between the governance of data and the governance of rules; 5. Traceability of evidence chain. In order to face such a complicated situation, many algorithms were proposed and developed. This article tries to build a model from the perspective of blockchain to make some breakthroughs.Internet Of Rights(IOR) model uses multi-chain technology to logically break down the consensus mechanism into layers, including storage consensus, permission consensus, role consensus, transaction consensus etc. thus to build a new infrastructure, which enables data sources with complex organizational structures and interactions to collaborate smoothly on the premise of protecting data privacy. With blockchain's nature of decentralization, openness, autonomy, immutability, and controllable anonymity, Internet Of Rights(IOR) model registers the ownership of data, enables applications to build ecosystem based on responsibilities and rights. It also provides cross-domain processing with privacy protection, as well as the separation of data governance and rule governance. With the processing capabilities of artificial intelligence and big data technology, as well as the ubiquitous data collection capabilities of the Internet of Things, Internet Of Rights(IOR) model may provide a new infrastructure concept for realizing swarm intelligence and building a new paradigm of the Internet, i.e. intelligent governance.

cs.NI↗

NTIRE 2021 Challenge on Quality Enhancement of Compressed Video: Methods and Results

This paper reviews the first NTIRE challenge on quality enhancement of compressed video, with a focus on the proposed methods and results. In this challenge, the new Large-scale Diverse Video (LDV) dataset is employed. The challenge has three tracks. Tracks 1 and 2 aim at enhancing the videos compressed by HEVC at a fixed QP, while Track 3 is designed for enhancing the videos compressed by x265 at a fixed bit-rate. Besides, the quality enhancement of Tracks 1 and 3 targets at improving the fidelity (PSNR), and Track 2 targets at enhancing the perceptual quality. The three tracks totally attract 482 registrations. In the test phase, 12 teams, 8 teams and 11 teams submitted the final results of Tracks 1, 2 and 3, respectively. The proposed methods and solutions gauge the state-of-the-art of video quality enhancement. The homepage of the challenge: https://github.com/RenYang-home/NTIRE21_VEnh

eess.IV↗

TSDM: Tracking by SiamRPN++ with a Depth-refiner and a Mask-generator

In a generic object tracking, depth (D) information provides informative cues for foreground-background separation and target bounding box regression. However, so far, few trackers have used depth information to play the important role aforementioned due to the lack of a suitable model. In this paper, a RGB-D tracker named TSDM is proposed, which is composed of a Mask-generator (M-g), SiamRPN++ and a Depth-refiner (D-r). The M-g generates the background masks, and updates them as the target 3D position changes. The D-r optimizes the target bounding box estimated by SiamRPN++, based on the spatial depth distribution difference between the target and the surrounding background. Extensive evaluation on the Princeton Tracking Benchmark and the Visual Object Tracking challenge shows that our tracker outperforms the state-of-the-art by a large margin while achieving 23 FPS. In addition, a light-weight variant can run at 31 FPS and thus it is practical for real world applications. Code and models of TSDM are available at https://github.com/lql-team/TSDM.

cs.CV↗

Time-encoded single-pixel 3D imaging

Recently three-dimensional (3D) imaging achieves tremendous success in consumer and industrial manufacturing. However, current 3D imaging methods rarely observe dynamical events happening in a short time interval due to the imaging speed limitation. Here we propose a time-encoded single-pixel 3D (TESP-3D) imaging method based on active infrared imaging with high-speed structured illumination, which can acquire the 3D information of dynamic events at an ultra-high frame rate. This method uses single-pixel photodetectors instead of conventional CCD or CMOS devices as the imaging sensors to overcome the image capturing speed limitation. As a proof of concept, we perform continuous real-time 3D scanning imaging at a record 500,000 fps and acquire 3D information of objects moving at a speed of up to 25 m/s. We anticipate that this technology will have important applications in industrial on-line inspection and high throughput 3D screening.

physics.optics↗

Multi-task Learning for Macromolecule Classification, Segmentation and Coarse Structural Recovery in Cryo-Tomography

Cellular Electron Cryo-Tomography (CECT) is a powerful 3D imaging tool for studying the native structure and organization of macromolecules inside single cells. For systematic recognition and recovery of macromolecular structures captured by CECT, methods for several important tasks such as subtomogram classification and semantic segmentation have been developed. However, the recognition and recovery of macromolecular structures are still very difficult due to high molecular structural diversity, crowding molecular environment, and the imaging limitations of CECT. In this paper, we propose a novel multi-task 3D convolutional neural network model for simultaneous classification, segmentation, and coarse structural recovery of macromolecules of interest in subtomograms. In our model, the learned image features of one task are shared and thereby mutually reinforce the learning of other tasks. Evaluated on realistically simulated and experimental CECT data, our multi-task learning model outperformed all single-task learning methods for classification and segmentation. In addition, we demonstrate that our model can generalize to discover, segment and recover novel structures that do not exist in the training data.

cs.CV↗

An integration of fast alignment and maximum-likelihood methods for electron subtomogram averaging and classification

Motivation: Cellular Electron CryoTomography (CECT) is an emerging 3D imaging technique that visualizes subcellular organization of single cells at submolecular resolution and in near-native state. CECT captures large numbers of macromolecular complexes of highly diverse structures and abundances. However, the structural complexity and imaging limits complicate the systematic de novo structural recovery and recognition of these macromolecular complexes. Efficient and accurate reference-free subtomogram averaging and classification represent the most critical tasks for such analysis. Existing subtomogram alignment based methods are prone to the missing wedge effects and low signal-to-noise ratio (SNR). Moreover, existing maximum-likelihood based methods rely on integration operations, which are in principle computationally infeasible for accurate calculation. Results: Built on existing works, we propose an integrated method, Fast Alignment Maximum Likelihood method (FAML), which uses fast subtomogram alignment to sample sub-optimal rigid transformations. The transformations are then used to approximate integrals for maximum-likelihood update of subtomogram averages through expectation-maximization algorithm. Our tests on simulated and experimental subtomograms showed that, compared to our previously developed fast alignment method (FA), FAML is significantly more robust to noise and missing wedge effects with moderate increases of computation cost.Besides, FAML performs well with significantly fewer input subtomograms when the FA method fails. Therefore, FAML can serve as a key component for improved construction of initial structural models from macromolecules captured by CECT.

q-bio.QM↗

Feature Decomposition Based Saliency Detection in Electron Cryo-Tomograms

Electron Cryo-Tomography (ECT) allows 3D visualization of subcellular structures at the submolecular resolution in close to the native state. However, due to the high degree of structural complexity and imaging limits, the automatic segmentation of cellular components from ECT images is very difficult. To complement and speed up existing segmentation methods, it is desirable to develop a generic cell component segmentation method that is 1) not specific to particular types of cellular components, 2) able to segment unknown cellular components, 3) fully unsupervised and does not rely on the availability of training data. As an important step towards this goal, in this paper, we propose a saliency detection method that computes the likelihood that a subregion in a tomogram stands out from the background. Our method consists of four steps: supervoxel over-segmentation, feature extraction, feature matrix decomposition, and computation of saliency. The method produces a distribution map that represents the regions' saliency in tomograms. Our experiments show that our method can successfully label most salient regions detected by a human observer, and able to filter out regions not containing cellular components. Therefore, our method can remove the majority of the background region, and significantly speed up the subsequent processing of segmentation and recognition of cellular components captured by ECT.

q-bio.QM↗

High-speed real-time single-pixel microscopy based on Fourier sampling

Single-pixel cameras based on the concepts of compressed sensing (CS) leverage the inherent structure of images to retrieve them with far fewer measurements and operate efficiently over a significantly broader spectral range than conventional silicon-based cameras. Recently, photonic time-stretch (PTS) technique facilitates the emergence of high-speed single-pixel cameras. A significant breakthrough in imaging speed of single-pixel cameras enables observation of fast dynamic phenomena. However, according to CS theory, image reconstruction is an iterative process that consumes enormous amounts of computational time and cannot be performed in real time. To address this challenge, we propose a novel single-pixel imaging technique that can produce high-quality images through rapid acquisition of their effective spatial Fourier spectrum. We employ phase-shifting sinusoidal structured illumination instead of random illumination for spectrum acquisition and apply inverse Fourier transform to the obtained spectrum for image restoration. We evaluate the performance of our prototype system by recognizing quick response (QR) codes and flow cytometric screening of cells. A frame rate of 625 kHz and a compression ratio of 10% are experimentally demonstrated in accordance with the recognition rate of the QR code. An imaging flow cytometer enabling high-content screening with an unprecedented throughput of 100,000 cells/s is also demonstrated. For real-time imaging applications, the proposed single-pixel microscope can significantly reduce the time required for image reconstruction by two orders of magnitude, which can be widely applied in industrial quality control and label-free biomedical imaging.

cs.CV↗

Constructing low-dimensional stochastic wind models through hierarchical spatial temporal decomposition

Current wind turbine simulations successfully use turbulence generating tools for modeling behavior. However, they lack the ability to reproduce variabilities in wind dynamics and inherent stochastic structures (like temporal and spatial coherences, sporadic bursts, high shear regions). This necessitates a more realistic parameterization of the wind that encodes location-, topography-, diurnal-, seasonal and stochastic affects. In this work, we develop a hierarchical temporal and spatial decomposition (TSD) of large-scale meteorology data to construct a low-dimensional yet realistic stochastic wind flow model. Starting from a large data set (Crop Wind-energy EXperiment), a low dimensional stochastic parameterization is constructed. The resulting time-resolved stochastic model encodes the statistical behavior exhibited by the actual wind flow. Moreover, the temporal modes encode the variation of wind speed in the mean sense and resolve diurnal variations and temporal correlation while the spatial modes provide deeper insight into spatial coherence of the wind field - which is a key aspect in current wind turbine sizing, design and classification. Comparison of several important turbulent properties between the simulated wind flow and the original dataset show the utility of the framework. We envision this framework as a useful complement to existing wind simulation codes.

math.NA↗

Web Data Knowledge Extraction

A constantly growing amount of information is available through the web. Unfortunately, extracting useful content from this massive amount of data still remains an open issue. The lack of standard data models and structures forces developers to create adhoc solutions from the scratch. The figure of the expert is still needed in many situations where developers do not have the correct background knowledge. This forces developers to spend time acquiring the needed background from the expert. In other directions, there are promising solutions employing machine learning techniques. However, increasing accuracy requires an increase in system complexity that cannot be endured in many projects. In this work, we approach the web knowledge extraction problem using an expertcentric methodology. This methodology defines a set of configurable, extendible and independent components that permit the reutilisation of large pieces of code among projects. Our methodology differs from similar solutions in its expert-driven design. This design, makes it possible for subject-matter expert to drive the knowledge extraction for a given set of documents. Additionally, we propose the utilization of machine assisted solutions that guide the expert during this process. To demonstrate the capabilities of our methodology, we present a real use case scenario in which public procurement data is extracted from the web-based repositories of several public institutions across Europe. We provide insightful details about the challenges we had to deal with in this use case and additional discussions about how to apply our methodology.

cs.DB↗

Stability of similarity measurements for bipartite networks

Similarity is a fundamental measure in network analyses and machine learning algorithms, with wide applications ranging from personalized recommendation to socio-economic dynamics. We argue that an effective similarity measurement should guarantee the stability even under some information loss. With six bipartite networks, we investigate the stabilities of fifteen similarity measurements by comparing the similarity matrixes of two data samples which are randomly divided from original data sets. Results show that, the fifteen measurements can be well classified into three clusters according to their stabilities, and measurements in the same cluster have similar mathematical definitions. In addition, we develop a top-$n$-stability method for personalized recommendation, and find that the unstable similarities would recommend false information to users, and the performance of recommendation would be largely improved by using stable similarity measurements. This work provides a novel dimension to analyze and evaluate similarity measurements, which can further find applications in link prediction, personalized recommendation, clustering algorithms, community detection and so on.

physics.soc-ph↗

Empirical Analysis of the Online Rating Systems

This paper is to analyze the properties of evolving bipartite networks from four aspects, the growth of networks, the degree distribution, the popularity of objects and the diversity of user behaviours, leading a deep understanding on the empirical data. By empirical studies of data from the online bookstore Amazon and a question and answer site Stack Overflow, which are both rating bipartite networks, we could reveal the rules for the evolution of bipartite networks. These rules have significant meanings in practice for maintaining the operation of real systems and preparing for their future development. We find that the degree distribution of users follows a power law with an exponential cutoff. Also, according to the evolution of popularity for objects, we find that the large-degree objects tend to receive more new ratings than expected depending on their current degrees while the small-degree objects receive less ratings in terms of their degrees. Moreover, the user behaviours show such a trend that the larger degree the users have, the stronger purposes are with their behaviours except the initial periods when users choose a diversity of products to learn about what they want. Finally, we conclude with a discussion on how the bipartite network evolves, which provides guideline for meeting challenges brought by the growth of network.

physics.soc-ph↗

Agglomerative clustering and collectiveness measure via exponent generating function

The key in agglomerative clustering is to define the affinity measure between two sets. A novel agglomerative clustering method is proposed by utilizing the path integral to define the affinity measure. Firstly, the path integral descriptor of an edge, a node and a set is computed by path integral and exponent generating function. Then, the affinity measure between two sets is obtained by path integral descriptor of sets. Several good properties of the path integral descriptor is proposed in this paper. In addition, we give the physical interpretation of the proposed path integral descriptor of a set. The proposed path integral descriptor of a set can be regard as the collectiveness measure of a set, which can be a moving system such as human crowd, sheep herd and so on. Self-driven particle (SDP) model is used to test the ability of the proposed method in measuring collectiveness.

cs.CV↗

Locating influential nodes via dynamics-sensitive centrality

With great theoretical and practical significance, locating influential nodes of complex networks is a promising issues. In this paper, we propose a dynamics-sensitive (DS) centrality that integrates topological features and dynamical properties. The DS centrality can be directly applied in locating influential spreaders. According to the empirical results on four real networks for both susceptible-infected-recovered (SIR) and susceptible-infected (SI) spreading models, the DS centrality is much more accurate than degree, $k$-shell index and eigenvector centrality.

cs.SI↗

Memory effect of the online user preference

The mechanism of the online user preference evolution is of great significance for understanding the online user behaviors and improving the quality of online services. Since users are allowed to rate on objects in many online systems, ratings can well reflect the users' preference. With two benchmark datasets from online systems, we uncover the memory effect in users' selecting behavior which is the sequence of qualities of selected objects and the rating behavior which is the sequence of ratings delivered by each user. Furthermore, the memory duration is presented to describe the length of a memory, which exhibits the power-law distribution, i.e., the probability of the occurring of long-duration memory is much higher than that of the random case which follows the exponential distribution. We present a preference model in which a Markovian process is utilized to describe the users' selecting behavior, and the rating behavior depends on the selecting behavior. With only one parameter for each of the user's selecting and rating behavior, the preference model could regenerate any duration distribution ranging from the power-law form (strong memory) to the exponential form (weak memory).

physics.soc-ph↗

A general method for identifying node spreading influence via the adjacent matrix and spreading rate

With great theoretical and practical significance, identifying the node spreading influence of complex network is one of the most promising domains. So far, various topology-based centrality measures have been proposed to identify the node spreading influence in a network. However, the node spreading influence is a result of the interplay between the network topology structure and spreading dynamics. In this paper, we build up the systematic method by combining the network structure and spreading dynamics to identify the node spreading influence. By combining the adjacent matrix $A$ and spreading parameter $β$, we theoretical give the node spreading influence with the eigenvector of the largest eigenvalue. Comparing with the Susceptible-Infected-Recovered (SIR) model epidemic results for four real networks, our method could identify the node spreading influence more accurately than the ones generated by the degree, K-shell and eigenvector centrality. This work may provide a systematic method for identifying node spreading influence.

physics.soc-ph↗

Ranking the spreading influence in complex networks

Identifying the node spreading influence in networks is an important task to optimally use the network structure and ensure the more efficient spreading in information. In this paper, by taking into account the shortest distance between a target node and the node set with the highest $k$-core value, we present an improved method to generate the ranking list to evaluate the node spreading influence. Comparing with the epidemic process results for four real networks and the Barabási-Albert network, the parameterless method could identify the node spreading influence more accurately than the ones generated by the degree $k$, closeness centrality, $k$-shell and mixed degree decomposition methods. This work would be helpful for deeply understanding the node importance of a network.

physics.soc-ph↗