589 research outputs found

    Improved Depth Map Estimation from Stereo Images based on Hybrid Method

    Get PDF
    In this paper, a stereo matching algorithm based on image segments is presented. We propose the hybrid segmentation algorithm that is based on a combination of the Belief Propagation and Mean Shift algorithms with aim to refine the disparity and depth map by using a stereo pair of images. This algorithm utilizes image filtering and modified SAD (Sum of Absolute Differences) stereo matching method. Firstly, a color based segmentation method is applied for segmenting the left image of the input stereo pair (reference image) into regions. The aim of the segmentation is to simplify representation of the image into the form that is easier to analyze and is able to locate objects in images. Secondly, results of the segmentation are used as an input of the local window-based matching method to determine the disparity estimate of each image pixel. The obtained experimental results demonstrate that the final depth map can be obtained by application of segment disparities to the original images. Experimental results with the stereo testing images show that our proposed Hybrid algorithm HSAD gives a good performance

    Continuously Diagonalizing the Shape Operator

    Get PDF
    In this paper, we investigate the behavior of the curvature of non-developable surfaces around an umbilic point at the origin. The surfaces are of the form z = f(x,y) where f is a nonhomogeneous bivariate polynomial with cubic and quartic terms. We do this by looking at the continuity of the principal directions around the origin as well as the rate that the principal curvatures converge to zero as they approach the origin. This is done by considering the eigenvectors and eigenvalues of the shape operator. In our main result, we prove that a continuously diagonalizable shape operator implies the existence of a path through the origin with noncomparable principal curvatures

    KSHV Rta Promoter Specification and Viral Reactivation

    Get PDF
    Viruses are obligate intracellular pathogens whose biological success depends upon replication and packaging of viral genomes, and transmission of progeny viruses to new hosts. The biological success of herpesviruses is enhanced by their ability to reproduce their genomes without producing progeny viruses or killing the host cells, a process called latency. Latency permits a herpesvirus to remain undetected in its animal host for decades while maintaining the potential to reactivate, or switch, to a productive life cycle when host conditions are conducive to generating viral progeny. Direct interactions between many host and viral molecules are implicated in controlling herpesviral reactivation, suggesting complex biological networks that control the decision. One viral protein that is necessary and sufficient to switch latent Kaposi’s sarcoma-associated herpesvirus (KSHV) into the lytic infection cycle is called K-Rta. K-Rta is a transcriptional activator that specifies promoters by binding DNA directly and interacting with cellular proteins. Among these cellular proteins, binding of K-Rta to RBP-Jk is essential for viral reactivation. In contrast to the canonical model for Notch signaling, RBP-Jk is not uniformly and constitutively bound to the latent KSHV genome, but rather is recruited to DNA by interactions with K-Rta. Stimulation of RBP-Jk DNA binding requires high affinity binding of Rta to repetitive and palindromic “CANT DNA repeats” in promoters, and formation of ternary complexes with RBP-Jk. However, while K-Rta expression is necessary for initiating KSHV reactivation, K-Rta’s role as the switch is inefficient. Many factors modulate K-Rta’s function, suggesting that KSHV reactivation can be significantly regulated post-Rta expression and challenging the notion that herpesviral reactivation is bistable. This review analyzes rapidly evolving research on KSHV K-Rta to consider the role of K-Rta promoter specification in regulating the progression of KSHV reactivation

    Im2Vec: Synthesizing Vector Graphics without Vector Supervision

    Get PDF
    Vector graphics are widely used to represent fonts, logos, digital artworks, and graphic designs. But, while a vast body of work has focused on generative algorithms for raster images, only a handful of options exists for vector graphics. One can always rasterize the input graphic and resort to image-based generative approaches, but this negates the advantages of the vector representation. The current alternative is to use specialized models that require explicit supervision on the vector graphics representation at training time. This is not ideal because large-scale high quality vector-graphics datasets are difficult to obtain. Furthermore, the vector representation for a given design is not unique, so models that supervise on the vector representation are unnecessarily constrained. Instead, we propose a new neural network that can generate complex vector graphics with varying topologies, and only requires indirect supervision from readily-available raster training images (i.e., with no vector counterparts). To enable this, we use a differentiable rasterization pipeline that renders the generated vector shapes and composites them together onto a raster canvas. We demonstrate our method on a range of datasets, and provide comparison with state-of-the-art SVG-VAE and DeepSVG, both of which require explicit vector graphics supervision. Finally, we also demonstrate our approach on the MNIST dataset, for which no groundtruth vector representation is available. Source code, datasets, and more results are available at geometry.cs.ucl.ac.uk/projects/2021/Im2Vec

    Grassroots prescriptivism

    Get PDF
    Until the beginning of this century, with few notable exceptions, prescriptivism has received little serious attention among the academic linguistic community as a factor in language variation and change. The five studies included in this book are embedded in the growing research initiative that is attempting to paint a fine-grained picture of linguistic prescriptivism in the English language. In contrast to institutional prescriptivism, or the so-called prescriptivism from above, which is enforced by bodies such as language planning boards, governmental committees, and agencies, this book focuses on grassroots prescriptivism – the attempts of lay people to promote the standard language ideology. Grassroots prescriptivism investigates the metalinguistic comments of language users expressed on traditional (letters to newspaper editors and radio phone-ins) and new media platforms (forum and blog discussions). This book demonstrates that, contrary to popular belief, language users are not passive recipients of language rules, but active participants in matters of linguistic prescriptivism. The diachronic exploration of grassroots prescriptivism reveals a complex picture. While in many respects, twenty-first-century prescriptivism represents a continuation of the 250-year-old prescriptive tradition, the author argues that prescriptivism, like language itself, undergoes change over time. Nederlandse Organisatie voor Wetenschappelijk Onderzoek (NWO)Language Use in Past and Presen

    A quantum genetic algorithm with quantum crossover and mutation operations

    Full text link
    In the context of evolutionary quantum computing in the literal meaning, a quantum crossover operation has not been introduced so far. Here, we introduce a novel quantum genetic algorithm which has a quantum crossover procedure performing crossovers among all chromosomes in parallel for each generation. A complexity analysis shows that a quadratic speedup is achieved over its classical counterpart in the dominant factor of the run time to handle each generation.Comment: 21 pages, 1 table, v2: typos corrected, minor modifications in sections 3.5 and 4, v3: minor revision, title changed (original title: Semiclassical genetic algorithm with quantum crossover and mutation operations), v4: minor revision, v5: minor grammatical corrections, to appear in QI
    corecore