Showing 2 open source projects for "live-graph"

View related business solutions
  • MongoDB Atlas runs apps anywhere Icon
    MongoDB Atlas runs apps anywhere

    Deploy in 115+ regions with the modern database for every enterprise.

    MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
    Start Free
  • Build Agents and Models on One Platform Icon
    Build Agents and Models on One Platform

    Everything you need to build production-ready agents and models. Access 200+ Google and third-party AI models and tools.

    Gemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
    Try It Free
  • 1
    GridMos

    GridMos

    GridMos, mosaicing tool (in MATLAB) to improve cell counting.

    Nowadays, the manual cell counting, performed directly by looking through the microscope’s oculars by using a tally counter and a hemocytometer, still is the gold standard method to count Live&Dead cells (Trypan Blue is typically used to stain the dead cells). However, performing the cell counting by tagging the cells in a steady image mosaic increases the reliability of the counts performed. Unfortunately, to build a mosaic of a hemocytometer's grid shows some problem due to the repeated patterns (i.e., the squared blocks of the grid). ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2

    DCTV

    DUAL CONSTRAINED TV-BASED REGULARIZATION ON GRAPHS

    ...They play a key role in a variety of applications such as image denoising, compressive sensing and inverse problems in general. In this work, we extend the TV dual framework that includes Chambolle's and Gilboa-Osher's projection algorithms for TV minimization. We use a flexible graph data representation that allows us to generalize the constraint on the projection variable. We show how this new formulation of the TV problem may be solved by means of fast parallel proximal algorithms. On denoising and deblurring examples, the proposed approach is shown not only to perform better than recent TV-based approaches, but also to perform well on arbitrary graphs instead of regular grids. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next