Showing 2 open source projects for "problem a"

View related business solutions
  • Custom VMs From 1 to 96 vCPUs With 99.95% Uptime Icon
    Custom VMs From 1 to 96 vCPUs With 99.95% Uptime

    General-purpose, compute-optimized, or GPU/TPU-accelerated. Built to your exact specs.

    Live migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
    Start Free
  • Paessler - Monitor Your Whole Network in Minutes Icon
    Paessler - Monitor Your Whole Network in Minutes

    Auto-discovery finds your devices and deploys pre-configured sensors instantly. No project plan required, just visibility from day one.

    Waiting weeks for a monitoring rollout isn't an option when infrastructure doesn't stop running. PRTG's auto-discovery scans your network and suggests from over 200 pre-configured sensor types, so you're watching servers, applications and devices within minutes, not after a multi-week deployment. Enterprise-strength monitoring, without the enterprise complexity. Start your free trial today.
    Start Free 30-Day Trial
  • 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