Computational/in silico methods in drug target and lead prediction

FE Agamah, GK Mazandu, R Hassan… - Briefings in …, 2020 - academic.oup.com
Drug-like compounds are most of the time denied approval and use owing to the
unexpected clinical side effects and cross-reactivity observed during clinical trials. These …

2D Euclidean distance transform algorithms: A comparative survey

R Fabbri, LDF Costa, JC Torelli, OM Bruno - ACM Computing Surveys …, 2008 - dl.acm.org
The distance transform (DT) is a general operator forming the basis of many methods in
computer vision and geometry, with great potential for practical applications. However, all …

[ΒΙΒΛΙΟ][B] Computer vision: algorithms and applications

R Szeliski - 2022 - books.google.com
Humans perceive the three-dimensional structure of the world with apparent ease. However,
despite all of the recent advances in computer vision research, the dream of having a …

Table detection using deep learning

A Gilani, SR Qasim, I Malik… - 2017 14th IAPR …, 2017 - ieeexplore.ieee.org
Table detection is a crucial step in many document analysis applications as tables are used
for presenting essential information to the reader in a structured manner. It is a hard problem …

Improved automatic detection and segmentation of cell nuclei in histopathology images

Y Al-Kofahi, W Lassoued, W Lee… - IEEE Transactions on …, 2009 - ieeexplore.ieee.org
Automatic segmentation of cell nuclei is an essential step in image cytometry and histometry.
Despite substantial progress, there is a need to improve accuracy, speed, level of …

A linear time algorithm for computing exact Euclidean distance transforms of binary images in arbitrary dimensions

CR Maurer, R Qi, V Raghavan - IEEE Transactions on Pattern …, 2003 - ieeexplore.ieee.org
A sequential algorithm is presented for computing the exact Euclidean distance transform
(DT) of a k-dimensional binary image in time linear in the total number of voxels N. The …

Distance transforms of sampled functions

PF Felzenszwalb, DP Huttenlocher - Theory of computing, 2012 - theoryofcomputing.org
We describe linear-time algorithms for solving a class of problems that involve transforming
a cost function on a grid using spatial information. These problems can be viewed as a …

An objective comparison of cell-tracking algorithms

V Ulman, M Maška, KEG Magnusson, O Ronneberger… - Nature …, 2017 - nature.com
We present a combined report on the results of three editions of the Cell Tracking
Challenge, an ongoing initiative aimed at promoting the development and objective …

Fast neural scene flow

X Li, J Zheng, F Ferroni, JK Pontes… - Proceedings of the …, 2023 - openaccess.thecvf.com
Abstract Neural Scene Flow Prior (NSFP) is of significant interest to the vision community
due to its inherent robustness to out-of-distribution (OOD) effects and its ability to deal with …

[ΒΙΒΛΙΟ][B] Digital geometry: Geometric methods for digital picture analysis

R Klette, A Rosenfeld - 2004 - books.google.com
Digital geometry is about deriving geometric information from digital pictures. The field
emerged from its mathematical roots some forty-years ago through work in computer-based …