6,841 research outputs found

    MicroRNA-466 inhibits tumor growth and bone metastasis in prostate cancer by direct regulation of osteogenic transcription factor RUNX2.

    Get PDF
    MicroRNAs (miRNAs) have emerged as key players in cancer progression and metastatic initiation yet their importance in regulating prostate cancer (PCa) metastasis to bone has begun to be appreciated. We employed multimodal strategy based on in-house PCa clinical samples, publicly available TCGA cohorts, a panel of cell lines, in silico analyses, and a series of in vitro and in vivo assays to investigate the role of miR-466 in PCa. Expression analyses revealed that miR-466 is under-expressed in PCa compared to normal tissues. Reconstitution of miR-466 in metastatic PCa cell lines impaired their oncogenic functions such as cell proliferation, migration/invasion and induced cell cycle arrest, and apoptosis compared to control miRNA. Conversely, attenuation of miR-466 in normal prostate cells induced tumorigenic characteristics. miR-466 suppressed PCa growth and metastasis through direct targeting of bone-related transcription factor RUNX2. Overexpression of miR-466 caused a marked downregulation of integrated network of RUNX2 target genes such as osteopontin, osteocalcin, ANGPTs, MMP11 including Fyn, pAkt, FAK and vimentin that are known to be involved in migration, invasion, angiogenesis, EMT and metastasis. Xenograft models indicate that miR-466 inhibits primary orthotopic tumor growth and spontaneous metastasis to bone. Receiver operating curve and Kaplan-Meier analyses show that miR-466 expression can discriminate between malignant and normal prostate tissues; and can predict biochemical relapse. In conclusion, our data strongly suggests miR-466-mediated attenuation of RUNX2 as a novel therapeutic approach to regulate PCa growth, particularly metastasis to bone. This study is the first report documenting the anti-bone metastatic role and clinical significance of miR-466 in prostate cancer

    An Automatic Level Set Based Liver Segmentation from MRI Data Sets

    Get PDF
    A fast and accurate liver segmentation method is a challenging work in medical image analysis area. Liver segmentation is an important process for computer-assisted diagnosis, pre-evaluation of liver transplantation and therapy planning of liver tumors. There are several advantages of magnetic resonance imaging such as free form ionizing radiation and good contrast visualization of soft tissue. Also, innovations in recent technology and image acquisition techniques have made magnetic resonance imaging a major tool in modern medicine. However, the use of magnetic resonance images for liver segmentation has been slow when we compare applications with the central nervous systems and musculoskeletal. The reasons are irregular shape, size and position of the liver, contrast agent effects and similarities of the gray values of neighbor organs. Therefore, in this study, we present a fully automatic liver segmentation method by using an approximation of the level set based contour evolution from T2 weighted magnetic resonance data sets. The method avoids solving partial differential equations and applies only integer operations with a two-cycle segmentation algorithm. The efficiency of the proposed approach is achieved by applying the algorithm to all slices with a constant number of iteration and performing the contour evolution without any user defined initial contour. The obtained results are evaluated with four different similarity measures and they show that the automatic segmentation approach gives successful results

    Sparsity and Incoherence in Compressive Sampling

    Get PDF
    We consider the problem of reconstructing a sparse signal x0Rnx^0\in\R^n from a limited number of linear measurements. Given mm randomly selected samples of Ux0U x^0, where UU is an orthonormal matrix, we show that 1\ell_1 minimization recovers x0x^0 exactly when the number of measurements exceeds mConstμ2(U)Slogn, m\geq \mathrm{Const}\cdot\mu^2(U)\cdot S\cdot\log n, where SS is the number of nonzero components in x0x^0, and μ\mu is the largest entry in UU properly normalized: μ(U)=nmaxk,jUk,j\mu(U) = \sqrt{n} \cdot \max_{k,j} |U_{k,j}|. The smaller μ\mu, the fewer samples needed. The result holds for ``most'' sparse signals x0x^0 supported on a fixed (but arbitrary) set TT. Given TT, if the sign of x0x^0 for each nonzero entry on TT and the observed values of Ux0Ux^0 are drawn at random, the signal is recovered with overwhelming probability. Moreover, there is a sense in which this is nearly optimal since any method succeeding with the same probability would require just about this many samples

    Compressive sampling for accelerometer signals in structural health monitoring

    Get PDF
    In structural health monitoring (SHM) of civil structures, data compression is often needed to reduce the cost of data transfer and storage, because of the large volumes of sensor data generated from the monitoring system. The traditional framework for data compression is to first sample the full signal and, then to compress it. Recently, a new data compression method named compressive sampling (CS) that can acquire the data directly in compressed form by using special sensors has been presented. In this article, the potential of CS for data compression of vibration data is investigated using simulation of the CS sensor algorithm. For reconstruction of the signal, both wavelet and Fourier orthogonal bases are examined. The acceleration data collected from the SHM system of Shandong Binzhou Yellow River Highway Bridge is used to analyze the data compression ability of CS. For comparison, both the wavelet-based and Huffman coding methods are employed to compress the data. The results show that the values of compression ratios achieved using CS are not high, because the vibration data used in SHM of civil structures are not naturally sparse in the chosen bases
    corecore