白丝美女被狂躁免费视频网站,500av导航大全精品,yw.193.cnc爆乳尤物未满,97se亚洲综合色区,аⅴ天堂中文在线网官网

Systems and methods for encoding image features of high-resolution digital images of biological specimens

專利號
US11176412B2
公開日期
2021-11-16
申請人
Ventana Medical Systems, Inc.(US AZ Tucson)
發(fā)明人
Yao Nie
IPC分類
G06K9/00; G06K9/62; G06T7/11; G06K9/46
技術(shù)領(lǐng)域
superpixel,image,clustering,centroid,clusters,in,cluster,vectors,vector,biological
地域: AZ AZ Tucson

摘要

An image analysis system for analyzing biological specimen images is disclosed. The system may include: a superpixel generator configured to obtain a biological specimen image and group pixels of the biological specimen image into a plurality of superpixels; a feature extractor configured to extract, from each superpixel in the plurality of superpixels, a feature vector comprising a plurality of image features; a clustering engine configured to assign the plurality of superpixels to a predefined number of clusters, each cluster being characterized by a centroid vector of feature vectors of superpixels assigned to the cluster; and a storage interface configured to store, for each superpixel in the plurality of superpixels, clustering information identifying the one cluster to which the superpixel is assigned. The system may also include a graph engine configured construct a graph based on the stored information, and use the graph to perform a graph-based image processing task.

說明書

In some embodiments, clustering engine 112 may cluster the superpixels using a k-means clustering algorithm such as the Lloyd's algorithm, or using any related clustering algorithms such as the k-medians clustering algorithm; the k-medoids or the partitioning around medoids (PAM) algorithm; the Fuzzy C-Means Clustering algorithm; the Gaussian mixture models trained with expectation-maximization algorithm; the k-means++ algorithm; hierarchical variants such as Bisecting k-means, X-means clustering, or G-means clustering; and the like. In other embodiments, clustering engine 112 may use any other algorithm suitable for clustering the superpixels into a predefined number of clusters based on the similarities of superpixels' feature vectors.

K-means or other algorithms mentioned above typically perform clustering based on distances between the feature vectors and the centroid vector of each cluster. In some embodiments, clustering engine 112 may use a Euclidean distance as the distance metric for performing the clustering. In other embodiments, clustering engine 112 may use other distance metrics such as the sum of absolute differences, correlation and hamming distance, and so forth.

權(quán)利要求

1
微信群二維碼
意見反饋