2019
DOI: 10.1109/jbhi.2018.2827703
|View full text |Cite
|
Sign up to set email alerts
|

Deep Convolutional Hashing for Low-Dimensional Binary Embedding of Histopathological Images

Abstract: Compact binary representations of histopathology images using hashing methods provide efficient approximate nearest neighbor search for direct visual query in large-scale databases. They can be utilized to measure the probability of the abnormality of the query image based on the retrieved similar cases, thereby providing support for medical diagnosis. They also allow for efficient managing of large-scale image databases because of a low storage requirement. However, the effectiveness of binary representations… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
10
0
1

Year Published

2019
2019
2021
2021

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 31 publications
(11 citation statements)
references
References 47 publications
0
10
0
1
Order By: Relevance
“…Backpropagation adalah salah satu algoritma supervised learning yang digunakan dalam artificial neural networks. Backpropagation mencari kombinasi bobot untuk meminimalkan kesalahan output untuk dianggap menjadi solusi yang benar [15]. Adapun tahapan Backpropagation adalah sebagai berikut: a. Turunan gradien error terhadap softmax Tahapan turunan gradien error terhadap softmax berdasarkan rumus yang ditulis oleh Peter Sadowski [15].…”
Section: Backpropagationunclassified
“…Backpropagation adalah salah satu algoritma supervised learning yang digunakan dalam artificial neural networks. Backpropagation mencari kombinasi bobot untuk meminimalkan kesalahan output untuk dianggap menjadi solusi yang benar [15]. Adapun tahapan Backpropagation adalah sebagai berikut: a. Turunan gradien error terhadap softmax Tahapan turunan gradien error terhadap softmax berdasarkan rumus yang ditulis oleh Peter Sadowski [15].…”
Section: Backpropagationunclassified
“…An instance of the approach uses an efficient graph partitioner KaHIP to partition the dataset. Others including the DCH method 30 26 which reduces the number of hash tables and alleviates the pressure from the complexity of the algorithm space to a certain extent. Zheng et al propose a LSH framework PM-LSH, 33 which adopts PM-tree to index the data points, and uses a tunable confidence interval to achieve accurate distance estimation and guarantee high result quality.…”
Section: Related Workmentioning
confidence: 99%
“…Here, the method of principal component hashing is introduced into the retrieval to enhance the robustness of the algorithm to different data distributions. In the past few years, some new research works have emerged in this field, including the Deep Convolutional Hashing (DCH) method [30] that was proposed by Sapkota, the HashNet method [31] and the Deep Visual-Semantic Quantization (DVSQ) method [32] that was proposed by Cao. Although the index structure based on a deep neural network has certain advantages with respect to the retrieval accuracy, its training time for large-scale data sets is longer, and the training quality has higher sensitivity to network parameters; therefore, there are still obstacles to its practical application.…”
Section: Related Workmentioning
confidence: 99%