Showing 2 open source projects for "problem a"

View related business solutions
  • Earn up to 16% annual interest with Nexo. Icon
    Earn up to 16% annual interest with Nexo.

    Access competitive interest rates on your digital assets.

    Generate interest, borrow against your crypto, and trade a range of cryptocurrencies — all in one platform. Geographic restrictions, eligibility, and terms apply.
    Get started with Nexo.
  • Ship Agents Faster Icon
    Ship Agents Faster

    Transform your applications and workflows into powerful agentic systems at global scale.

    Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
    Start Free
  • 1
    GridMos

    GridMos

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

    ...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). GridMos is an open-source software tool conceived to build an image mosaic of a hemocytometer's grid. It is optimized to build the mosaic starting from a sequence of overlapping images previously acquired. The Graphical User Interface (GUI) implemented makes GridMos a very user-friendly software tool. ...
    Downloads: 1 This Week
    Last Update:
    See Project
  • 2

    DCTV

    DUAL CONSTRAINED TV-BASED REGULARIZATION ON GRAPHS

    ...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. The proposed method consequently applies to a variety of other inverse problems including image fusion and mesh filtering.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next