1,221 research outputs found

    Polar codes and polar lattices for the Heegard-Berger problem

    Get PDF
    Explicit coding schemes are proposed to achieve the rate-distortion function of the Heegard-Berger problem using polar codes. Specifically, a nested polar code construction is employed to achieve the rate-distortion function for doublysymmetric binary sources when the side information may be absent. The nested structure contains two optimal polar codes for lossy source coding and channel coding, respectively. Moreover, a similar nested polar lattice construction is employed when the source and the side information are jointly Gaussian. The proposed polar lattice is constructed by nesting a quantization polar lattice and a capacity-achieving polar lattice for the additive white Gaussian noise channel

    Mathematical modeling of the malignancy of cancer using graph evolution

    Get PDF
    Cataloged from PDF version of article.We report a novel computational method based on graph evolution process to model the malignancy of brain cancer called glioma. In this work, we analyze the phases that a graph passes through during its evolution and demonstrate strong relation between the malignancy of cancer and the phase of its graph. From the photomicrographs of tissues, which are diagnosed as normal, low-grade cancerous and high-grade cancerous, we construct cell-graphs based on the locations of cells; we probabilistically generate an edge between every pair of cells depending on the Euclidean distance between them. For a cell-graph, we extract connectivity information including the properties of its connected components in order to analyze the phase of the cell-graph. Working with brain tissue samples surgically removed from 12 patients, we demonstrate that cell-graphs generated for different tissue types evolve differently and that they exhibit different phase properties, which distinguish a tissue type from another. (C) 2007 Elsevier Inc. All rights reserved

    Graph run-length matrices for histopathological image segmentation

    Get PDF
    Cataloged from PDF version of article.The histopathological examination of tissue specimens is essential for cancer diagnosis and grading. However, this examination is subject to a considerable amount of observer variability as it mainly relies on visual interpretation of pathologists. To alleviate this problem, it is very important to develop computational quantitative tools, for which image segmentation constitutes the core step. In this paper, we introduce an effective and robust algorithm for the segmentation of histopathological tissue images. This algorithm incorporates the background knowledge of the tissue organization into segmentation. For this purpose, it quantifies spatial relations of cytological tissue components by constructing a graph and uses this graph to define new texture features for image segmentation. This new texture definition makes use of the idea of gray-level run-length matrices. However, it considers the runs of cytological components on a graph to form a matrix, instead of considering the runs of pixel intensities. Working with colon tissue images, our experiments demonstrate that the texture features extracted from "graph run-length matrices" lead to high segmentation accuracies, also providing a reasonable number of segmented regions. Compared with four other segmentation algorithms, the results show that the proposed algorithm is more effective in histopathological image segmentatio

    Genistein-induced mir-23b expression inhibits the growth of breast cancer cells

    Get PDF
    Aim of the study: Genistein, an isoflavonoid, plays roles in the inhibition of protein tyrosine kinase phosphorylation, induction of apoptosis, and cell differentiation in breast cancer. This study aims to induce cellular stress by exposing genistein to determine alterations of miRNA expression profiles in MCF-7 cells. Material and methods: XTT assay and trypan blue dye exclusion assays were performed to examine the cytotoxic effects of genistein treatment. Expressions of miRNAs were quantified using Real-Time Online RT-PCR. Results: The IC50 dose of genistein was 175 μM in MCF-7 cell, line and the cytotoxic effect of genistein was detected after 48 hours. miR-23b was found to be up-regulated 56.69 fold following the treatment of genistein. It was found that miR-23b was up-regulated for MCF-7 breast cancer cells after genistein treatment. Conclusions: Up-regulated ex-expression of miR-23b might be a putative biomarker for use in the therapy of breast cancer patients. miR-23b up-regulation might be important in terms of response to genistein. © 2015, Termedia Publishing House Ltd. All rights reserved

    Local object patterns for representation and classification of colon tissue images

    Get PDF
    Cataloged from PDF version of article.This paper presents a new approach for the effective representation and classification of images of histopathological colon tissues stained with hematoxylin and eosin. In this approach, we propose to decompose a tissue image into its histological components and introduce a set of new texture descriptors, which we call local object patterns, on these components to model their composition within a tissue. We define these descriptors using the idea of local binary patterns, which quantify a pixel by constructing a binary string based on relative intensities of its neighbors. However, as opposed to pixel-level local binary patterns, we define our local object pattern descriptors at the component level to quantify a component. To this end, we specify neighborhoods with different locality ranges and encode spatial arrangements of the components within the specified local neighborhoods by generating strings. We then extract our texture descriptors from these strings to characterize histological components and construct the bag-of-words representation of an image from the characterized components. Working on microscopic images of colon tissues, our experiments reveal that the use of these component-level texture descriptors results in higher classification accuracies than the previous textural approaches. © 2013 IEEE

    Morphological assessment of the stylohyoid complex variations with cone beam computed tomography in a Turkish population

    Get PDF
    Background: The aim of this investigation was to evaluate the length, thickness, sagittal and transverse angulations and the morphological variations of the stylohyoid complex (SHC), to assess their probable associations with age and gender, and to investigate the prevalence of it in a wide range of a Turkish sub-population by using cone beam computed tomography (CBCT). Materials and methods: The CBCT images of the 1000 patients were evaluated retrospectively. The length, thickness, sagittal and transverse angulations, morphological variations and ossification degrees of SHC were evaluated on multiplanar reconstructions (MPR) adnd three-dimensional (3D) volume rendering (3DVR) images. The data were analysed statistically by using nonparametric tests, Pearson’s correlation coefficient, Student’s t test, c2 test and one-way ANOVA. Statistical significance was considered at p < 0.05. Results: It was determined that 684 (34.2%) of all 2000 SHCs were elongated (> 35 mm). The mean sagittal angle value was measured to be 72.24° and the mean transverse angle value was 70.81°. Scalariform shape, elongated type and nodular calcification pattern have the highest mean age values between the morphological groups, respectively. Calcified outline was the most prevalent calcification pattern in males. There was no correlation between length and the calcification pattern groups while scalariform shape and pseudoarticular type were the longest variations. Conclusions: We observed that as the anterior sagittal angle gets wider, SHC tends to get longer. The most observed morphological variations were linear shape, elongated type and calcified outline pattern. Detailed studies on the classification will contribute to the literature. (Folia Morphol 2018; 77, 1: 79–89)

    Secure distributed matrix computation with discrete fourier transform

    Get PDF
    We consider the problem of secure distributed matrix computation (SDMC), where a user queries a function of data matrices generated at distributed source nodes. We assume the availability of N honest but curious computation servers, which are connected to the sources, the user, and each other through orthogonal and reliable communication links. Our goal is to minimize the amount of data that must be transmitted from the sources to the servers, called the upload cost, while guaranteeing that no T colluding servers can learn any information about the source matrices, and the user cannot learn any information beyond the computation result. We first focus on secure distributed matrix multiplication (SDMM), considering two matrices, and propose a novel polynomial coding scheme using the properties of finite field discrete Fourier transform, which achieves an upload cost significantly lower than the existing results in the literature. We then generalize the proposed scheme to include straggler mitigation, and to the multiplication of multiple matrices while keeping the input matrices, the intermediate computation results, as well as the final result secure against any T colluding servers. We also consider a special case, called computation with own data, where the data matrices used for computation belong to the user. In this case, we drop the security requirement against the user, and show that the proposed scheme achieves the minimal upload cost. We then propose methods for performing other common matrix computations securely on distributed servers, including changing the parameters of secret sharing, matrix transpose, matrix exponentiation, solving a linear system, and matrix inversion, which are then used to show how arbitrary matrix polynomials can be computed securely on distributed servers using the proposed procedur

    Coded caching in a multi-server system with random topology

    Get PDF
    Cache-aided content delivery is studied in a multi-server system with P servers and K users, each equipped with a local cache memory. In the delivery phase, each user connects randomly to any ρ out of P servers. Thanks to the availability of multiple servers, which model small-cell base stations (SBSs), demands can be satisfied with reduced storage capacity at each server and reduced delivery rate per server; however, this also leads to reduced multicasting opportunities compared to the single-server scenario. A joint storage and proactive caching scheme is proposed, which exploits coded storage across the servers, uncoded cache placement at the users, and coded delivery. The delivery latency is studied for both successive and parallel transmissions from the servers. It is shown that, with successive transmissions the achievable average delivery latency is comparable to the one achieved in the single-server scenario, while the gap between the two depends on ρ, the available redundancy across the servers, and can be reduced by increasing the storage capacity at the SBSs. The optimality of the proposed scheme with uncoded cache placement and MDS-coded server storage is also proved for successive transmissions

    A color and shape based algorithm for segmentation of white blood cells in peripheral blood and bone marrow images

    Get PDF
    Cataloged from PDF version of article.Computer-based imaging systems are becoming important tools for quantitative assessment of peripheral blood and bone marrow samples to help experts diagnose blood disorders such as acute leukemia. These systems generally initiate a segmentation stage where white blood cells are separated from the background and other nonsalient objects. As the success of such imaging systems mainly depends on the accuracy of this stage, studies attach great importance for developing accurate segmentation algorithms. Although previous studies give promising results for segmentation of sparsely distributed normal white blood cells, only a few of them focus on segmenting touching and overlapping cell clusters, which is usually the case when leukemic cells are present. In this article, we present a new algorithm for segmentation of both normal and leukemic cells in peripheral blood and bone marrow images. In this algorithm, we propose to model color and shape characteristics of white blood cells by defining two transformations and introduce an efficient use of these transformations in a marker-controlled watershed algorithm. Particularly, these domain specific characteristics are used to identify markers and define the marking function of the watershed algorithm as well as to eliminate false white blood cells in a postprocessing step. Working on 650 white blood cells in peripheral blood and bone marrow images, our experiments reveal that the proposed algorithm improves the segmentation performance compared with its counterparts, leading to high accuracies for both sparsely distributed normal white blood cells and dense leukemic cell clusters. (C) 2014 International Society for Advancement of Cytometr

    Functional broadcast repair of multiple partial failures in wireless distributed storage systems

    Get PDF
    We consider a distributed storage system with n nodes, where a user can recover the stored file from any k nodes, and study the problem of repairing r partially failed nodes. We consider broadcast repair , that is, d surviving nodes transmit broadcast messages on an error-free wireless channel to the r nodes being repaired, which are then used, together with the surviving data in the local memories of the failed nodes, to recover the lost content. First, we derive the trade-off between the storage capacity and the repair bandwidth for partial repair of multiple failed nodes, based on the cut-set bound for information flow graphs. It is shown that utilizing the broadcast nature of the wireless medium and the surviving contents at the partially failed nodes reduces the repair bandwidth per node significantly. Then, we list a set of invariant conditions that are sufficient for a functional repair code to be feasible. We further propose a scheme for functional repair of multiple failed nodes that satisfies the invariant conditions with high probability, and its extension to the repair of partial failures. The performance of the proposed scheme meets the cut-set bound on all the points on the trade-off curve for all admissible parameters when k is divisible by r , while employing linear subpacketization, which is an important practical consideration in the design of distributed storage codes. Unlike random linear codes, which are conventionally used for functional repair of failed nodes, the proposed repair scheme has lower overhead, lower input-output cost, and lower computational complexity during repair
    corecore