Searcharxiv⌕ Search

arXiv subjects

Na Lu

Publications and source records attributed to Na Lu.

22 records · Page 2Linked to original sources

Fast Dynamic Convolutional Neural Networks for Visual Tracking

Most of the existing tracking methods based on CNN(convolutional neural networks) are too slow for real-time application despite the excellent tracking precision compared with the traditional ones. In this paper, a fast dynamic visual tracking algorithm combining CNN based MDNet(Multi-Domain Network) and RoIAlign was developed. The major problem of MDNet also lies in the time efficiency. Considering the computational complexity of MDNet is mainly caused by the large amount of convolution operations and fine-tuning of the network during tracking, a RoIPool layer which could conduct the convolution over the whole image instead of each RoI is added to accelerate the convolution and a new strategy of fine-tuning the fully-connected layers is used to accelerate the update. With RoIPool employed, the computation speed has been increased but the tracking precision has dropped simultaneously. RoIPool could lose some positioning precision because it can not handle locations represented by floating numbers. So RoIAlign, instead of RoIPool, which can process floating numbers of locations by bilinear interpolation has been added to the network. The results show the target localization precision has been improved and it hardly increases the computational cost. These strategies can accelerate the processing and make it 7x faster than MDNet with very low impact on precision and it can run at around 7 fps. The proposed algorithm has been evaluated on two benchmarks: OTB100 and VOT2016, on which high precision and speed have been obtained. The influence of the network structure and training data are also discussed with experiments.

cs.CV↗

Structural Identifiability of Cyclic Graphical Models of Biological Networks with Latent Variables

An efficient structural identifiability analysis algorithm is developed in this study for a broad range of network structures. The proposed method adopts the Wright's path coefficient method to generate identifiability equations in forms of symbolic polynomials, and then converts these symbolic equations to binary matrices (called identifiability matrix). Several matrix operations are introduced for identifiability matrix reduction with system equivalency maintained. Based on the reduced identifiability matrices, the structural identifiability of each parameter is determined. A number of benchmark models are used to verify the validity of the proposed approach. Finally, the network module for influenza A virus replication is employed as a real example to illustrate the application of the proposed approach in practice. The proposed approach can deal with cyclic networks with latent variables. The key advantage is that it intentionally avoids symbolic computation and is thus highly efficient. Also, this method is capable of determining the identifiability of each single parameter and is thus of higher resolution in comparison with many existing approaches. Overall, this study provides a basis for systematic examination and refinement of graphical models of biological networks from the identifiability point of view, and it has a significant potential to be extended to more complex network structures or high-dimensional systems.

q-bio.MN↗

MDA in Capillary for Whole Genome Amplification

Whole genome amplification (WGA) plays an important role in sample preparation of low-input templates for high-throughput sequencing. Multiple displacement amplification (MDA), a popular isothermal WGA method, suffers a major hurdle of highly uneven amplification. Optimizations have been made in the past by separating the reagents into numbers of tiny chambers or droplets in microfluidic devices, which significantly improves the amplification uniformity of MDA. However, skill barrier still exists for biological researchers to handle chip fabrication and droplet manipulation. Here, we present a novel MDA protocol, in-capillary MDA (icMDA), which significantly simplifies the manipulation and improves the uniformity of amplification by dispersing reagents in a long quasi-1D capillary tubing. We demonstrated that icMDA is able to accurately detect SNVs with higher efficiency and sensitivity. Moreover, this straightforward method employs neither customized instruments nor complicated operations, making it a ready-to-use approach for most laboratories.

q-bio.GN↗

Clustering Tree-structured Data on Manifold

Tree-structured data usually contain both topological and geometrical information, and are necessarily considered on manifold instead of Euclidean space for appropriate data parameterization and analysis. In this study, we propose a novel tree-structured data parameterization, called Topology-Attribute matrix (T-A matrix), so the data clustering task can be conducted on matrix manifold. We incorporate the structure constraints embedded in data into the negative matrix factorization method to determine meta-trees from the T-A matrix, and the signature vector of each single tree can then be extracted by meta-tree decomposition. The meta-tree space turns out to be a cone space, in which we explore the distance metric and implement the clustering algorithm based on the concepts like Fréchet mean. Finally, the T-A matrix based clustering (TAMBAC) framework is evaluated and compared using both simulated data and real retinal images to illustrate its efficiency and accuracy.

cs.CV↗