Blob Detection Using U-Net Distance Maps and Adaptive DoG

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional deep learning tools for blob detection in medical imaging, such as kidney glomeruli, are not robust to noise and require large datasets, leading to high false positive rates and limited applicability in medical applications with small sample sizes.

Innovation Solution

The proposed system uses a U-Net to generate a probability map and derive two distance maps with bounded probabilities, applying Difference of Gaussian (DoG) with an adaptive scale constrained by these maps, and performing Hessian analysis for blob segmentation.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If conventional deep learning tools are used for blob detection, then detection capability is provided, but false positive rates increase and robustness to noise deteriorates

Engineering Contradiction:
Improverobustness to noiseVSAvoidfalse positive rate
Core Design Contradiction:
ReliabilityVSMeasurement precision

Solution Approach 1:

The detection process is segmented into multiple stages: initial blob detection, distance map generation with probability bounds, DoG filtering with adaptive scales, and Hessian analysis for final segmentation. This multi-stage segmentation allows each component to focus on specific aspects of detection, improving overall reliability while maintaining precision.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

Distance maps with bounded probabilities serve as intermediary structures that guide the DoG filtering process. These maps constrain the search space for blob scales and positions, acting as a mediator between the initial detection and final segmentation, thereby reducing false positives while maintaining robustness.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Adaptability or versatility

If conventional blob detectors are used, then detection of glomeruli is attempted, but applicability to small sample sizes deteriorates

Engineering Contradiction:
Improveapplicability to small sample sizesVSAvoiddetection reliability
Core Design Contradiction:
Adaptability or versatilityVSReliability

Solution Approach 1:

The system dynamically adjusts detection parameters including adaptive DoG scales constrained by distance maps, probability thresholds, and Hessian analysis parameters. These parameter changes are adapted to the specific characteristics of small sample sizes while maintaining detection reliability through the structured multi-stage process.

Inventive Principle:
Principle #35Parameter changes

3Measurement precision

If conventional deep learning tools are used, then blob detection is performed, but accuracy in noisy and low-resolution images deteriorates

Engineering Contradiction:
Improveblob detection accuracyVSAvoidimage noise and low resolution
Core Design Contradiction:
Measurement precisionVSObject-affected harmful factors

Solution Approach 1:

Distance maps with bounded probabilities are generated as preliminary structures before the main DoG filtering and Hessian analysis. These preliminary distance maps pre-constrain the search space and provide probability bounds that guide subsequent processing, improving accuracy even in noisy and low-resolution images by preparing the detection framework in advance.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS12299876B2Deep learning based blob detection systems and methods
Publication Date: 2025.05.13 THE ARIZONA BOARD OF REGENTS ON BEHALF OF THE UNIV OF ARIZONA
  • US12299876B2 patent drawing
  • US12299876B2 patent drawing
  • US12299876B2 patent drawing

AI summary

A system for blob detection using deep learning is disclosed. The system may include a non-transitory computer-readable storage medium configured to store a plurality of instructions thereon which, when executed by a processor, cause the system to train a U-Net and generate a probability map including a plurality of centroids of a plurality of corresponding blobs, derive two distance maps with bounded probabilities, apply Difference of Gaussian (DoG) with an adaptive scale constrained by the two distance maps with the bounded probabilities, and apply Hessian analysis and perform a blob segmentation.