Good Features to Correlate for Visual Tracking

During the recent years, correlation filters have shown dominant and spectacular results for visual object tracking. The types of the features that are employed in these family of trackers significantly affect the performance of visual tracking. The ultimate goal is to utilize robust features invariant to any kind of appearance change of the object, while predicting the object location as properly as in the case of no appearance change. As the deep learning based methods have emerged, the study of learning features for specific tasks has accelerated. For instance, discriminative visual tracking methods based on deep architectures have been studied with promising performance. Nevertheless, correlation filter based (CFB) trackers confine themselves to use the pre-trained networks which are trained for object classification problem. To this end, in this manuscript the problem of learning deep fully convolutional features for the CFB visual tracking is formulated. In order to learn the proposed model, a novel and efficient backpropagation algorithm is presented based on the loss function of the network. The proposed learning framework enables the network model to be flexible for a custom design. Moreover, it alleviates the dependency on the network trained for classification. Extensive performance analysis shows the efficacy of the proposed custom design in the CFB tracking framework. By fine-tuning the convolutional parts of a state-of-the-art network and integrating this model to a CFB tracker, which is the top performing one of VOT2016, 18% increase is achieved in terms of expected average overlap, and tracking failures are decreased by 25%, while maintaining the superiority over the state-of-the-art methods in OTB-2013 and OTB-2015 tracking datasets.Comment: Accepted version of IEEE Transactions on Image Processin

Ge nanocrystals embedded in ultrathin Si3N4 multilayers with SiO2 barriers

Multilayers of germanium nanocrystals (NCs) embedded in thin films of silicon nitride matrix separated with SiO2 barriers have been fabricated using plasma enhanced chemical vapor deposition (PECVD). SiGeN/SiO2 alternating bilayers have been grown on quartz and Si substrates followed by post annealing in Ar ambient from 600 to 900 °C. High resolution transmission electron microscopy (HRTEM) as well as Raman spectroscopy show good crystallinity of Ge confined to SiGeN layers in samples annealed at 900 °C. Strong compressive stress for SiGeN/SiO2 structures were observed through Raman spectroscopy. Size, as well as NC-NC distance were controlled along the growth direction for multilayer samples by varying the thickness of bilayers. Visible photoluminescence (PL) at 2.3 and 3.1 eV with NC size dependent intensity is observed and possible origin of PL is discussed. © 2017 Elsevier Lt

Cell-level pathway scoring comparison with a biologically constrained variational autoencoder

This preprint has not undergone peer review or any post-submission improvements or corrections. The Version of Record of this contribution is published in: Pang, J., Niehren, J. (eds) Computational Methods in Systems Biology. CMSB 2023. Lecture Notes in Computer Science, vol 14137. Springer, Cham. Available online at https://doi.org/10.1007/978-3-031-42697-1_

A Novel Parallel Triangle Counting Algorithm with Reduced Communication

Counting and finding triangles in graphs is often used in real-world analytics for characterizing the cohesiveness and identifying communities in graphs. In this paper, we present novel sequential and parallel triangle counting algorithms based on identifying horizontal-edges in a breadth-first search (BFS) traversal of the graph. The BFS allows our algorithm to drastically reduce the number of edges examined for set intersections. Our new approach is the first communication-optimal parallel algorithm that asymptotically reduces the communication on massive graphs such as from real social networks and synthetic graphs from the Graph500 Benchmark. In our estimate from massive-scale Graph500 graphs, our new algorithms reduces the communication by 21.8x on a scale 36 and by 180x on a scale 42. Because communication is known to be the dominant cost of parallel triangle counting, our new parallel algorithm, to our knowledge, is now the fastest method for counting triangles in large graphs.Comment: 10 page

Sparse representation of two- and three-dimensional images with fractional Fourier, Hartley, linear canonical, and Haar wavelet transforms

Sparse recovery aims to reconstruct signals that are sparse in a linear transform domain from a heavily underdetermined set of measurements. The success of sparse recovery relies critically on the knowledge of transform domains that give compressible representations of the signal of interest. Here we consider two- and three-dimensional images, and investigate various multi-dimensional transforms in terms of the compressibility of the resultant coefficients. Specifically, we compare the fractional Fourier (FRT) and linear canonical transforms (LCT), which are generalized versions of the Fourier transform (FT), as well as Hartley and simplified fractional Hartley transforms, which differ from corresponding Fourier transforms in that they produce real outputs for real inputs. We also examine a cascade approach to improve transform-domain sparsity, where the Haar wavelet transform is applied following an initial Hartley transform. To compare the various methods, images are recovered from a subset of coefficients in the respective transform domains. The number of coefficients that are retained in the subset are varied systematically to examine the level of signal sparsity in each transform domain. Recovery performance is assessed via the structural similarity index (SSIM) and mean squared error (MSE) in reference to original images. Our analyses show that FRT and LCT transform yield the most sparse representations among the tested transforms as dictated by the improved quality of the recovered images. Furthermore, the cascade approach improves transform-domain sparsity among techniques applied on small image patches. © 2017 Elsevier Lt

Design of a Gd-DOTA-Phthalocyanine Conjugate Combining MRI Contrast Imaging and Photosensitization Properties as a Potential Molecular Theranostic

Cataloged from PDF version of article.The design and synthesis of a phthalocyanine - Gd-DOTA conjugate is presented to open the way to novel molecular theranostics, combining the properties of MRI contrast imaging with photodynamic therapy. The rational design of the conjugate integrates isomeric purity of the phthalocyanine core substitution, suitable biocompatibility with the use of polyoxo water-solubilizing substituents, and a convergent synthetic strategy ended by the use of click chemistry to graft the Gd-DOTA moiety to the phthalocyanine. Photophysical and photochemical properties, contrast imaging experiments and preliminary in vitro investigations proved that such a combination is relevant and lead to a new type of potential theranostic agent

Laser induced sponge-like Si in Si-rich oxides for photovoltaics

We show that a sponge-like structure of interconnected Si nanowires embedded in a dielectric matrix can be obtained by laser annealing of silicon rich oxides (SRO). Due to quantum confinement, the large bandgap displayed by these percolated nanostructures can be utilized as a tandem stage in 3rd generation thin-film solar cells. Well passivated by the SiO2 dielectric matrix, they are expected to overcome the difficulty of carrier separation encountered in the case of isolated crystalline quantum dots. In this study PECVD grown SRO were irradiated by a cw Ar+ laser. Raman spectroscopy has been used to assess the crystallinity of the Si nanostructures and thus to optimize the annealing conditions as dwell times and power densities. In addition, Si plasmon imaging in the transmission electron microscope was applied to identify the sponge-like structure of phase-separated silicon. © 2013 Optical Society of America