Offline versus Online Triplet Mining based on Extreme Distances of Histopathology Patches

07/04/2020
by   Milad Sikaroudi, et al.
0

We analyze the effect of offline and online triplet mining for colorectal cancer (CRC) histopathology dataset containing 100,000 patches. We consider the extreme, i.e., farthest and nearest patches with respect to a given anchor, both in online and offline mining. While many works focus solely on how to select the triplets online (batch-wise), we also study the effect of extreme distances and neighbor patches before training in an offline fashion. We analyze the impacts of extreme cases for offline versus online mining, including easy positive, batch semi-hard, and batch hard triplet mining as well as the neighborhood component analysis loss, its proxy version, and distance weighted sampling. We also investigate online approaches based on extreme distance and comprehensively compare the performance of offline and online mining based on the data patterns and explain offline mining as a tractable generalization of the online mining with large mini-batch size. As well, we discuss the relations of different colorectal tissue types in terms of extreme distances. We found that offline mining can generate a better statistical representation of the population by working on the whole dataset.

READ FULL TEXT

page 1

page 3

page 4

page 6

page 8

research
07/10/2020

Batch-Incremental Triplet Sampling for Training Triplet Networks Using Bayesian Updating Theorem

Variants of Triplet networks are robust entities for learning a discrimi...
research
11/27/2019

AdaSample: Adaptive Sampling of Hard Positives for Descriptor Learning

Triplet loss has been widely employed in a wide range of computer vision...
research
03/07/2020

Adaptive Offline Quintuplet Loss for Image-Text Matching

Existing image-text matching approaches typically leverage triplet loss ...
research
03/21/2017

No Fuss Distance Metric Learning using Proxies

We address the problem of distance metric learning (DML), defined as lea...
research
02/28/2023

Global Proxy-based Hard Mining for Visual Place Recognition

Learning deep representations for visual place recognition is commonly p...
research
12/09/2021

HBReID: Harder Batch for Re-identification

Triplet loss is a widely adopted loss function in ReID task which pulls ...
research
07/10/2022

NGAME: Negative Mining-aware Mini-batching for Extreme Classification

Extreme Classification (XC) seeks to tag data points with the most relev...

Please sign up or login with your details

Forgot password? Click here to reset