Results 21 to 30 of about 131,957 (312)

Global Context Descriptors for SURF and MSER Feature Descriptors [PDF]

open access: yes2010 Canadian Conference on Computer and Robot Vision, 2010
Global context descriptors are vectors of additional information appended to an existing descriptor, and are computed as a log-polar histogram of nearby curvature values. These have been proposed in the past to make Scale Invariant Feature Transform (SIFT) matching more robust. This additional information improved matching results especially for images
Gail Carmichael   +2 more
openaire   +1 more source

Descriptor-Driven de Novo Design Algorithms for DOCK6 Using RDKit

open access: yes, 2023
Structure-based methods that employ principles of de novo design can be used to construct small organic molecules from scratch using pre-existing fragment libraries to sample chemical space and are an important class of computational algorithms for drug ...
Guilherme Duarte Ramos Matos (3947738)   +2 more
core   +1 more source

Rethinking the sGLOH Descriptor

open access: yesIEEE Transactions on Pattern Analysis and Machine Intelligence, 2018
sGLOH (shifting GLOH) is a histogram-based keypoint descriptor that can be associated to multiple quantized rotations of the keypoint patch without any recomputation. This property can be exploited to define the best distance between two descriptor vectors, thus avoiding computing the dominant orientation.
Fabio Bellavia, Carlo Colombo
openaire   +4 more sources

Assigning Main Orientation to an EOH Descriptor on Multispectral Images

open access: yesSensors, 2015
This paper proposes an approach to compute an EOH (edge-oriented histogram) descriptor with main orientation. EOH has a better matching ability than SIFT (scale-invariant feature transform) on multispectral images, but does not assign a main orientation ...
Yong Li   +4 more
doaj   +1 more source

Component evolution analysis in descriptor graphs for descriptor ranking [PDF]

open access: yesDigital Signal Processing, 2014
Abstract This paper presents a method based on graph behaviour analysis for the evaluation of descriptor graphs (applied to image/video datasets) for descriptor performance analysis and ranking. Starting from the Erdős–Renyi model on uniform random graphs, the paper presents results of investigating random geometric graph behaviour in relation with ...
Levente Kovács   +2 more
openaire   +1 more source

Investigation of Solvolysis Kinetics of New Synthesized Fluocinolone Acetonide C-21 Esters—An In Vitro Model for Prodrug Activation

open access: yesMolecules, 2011
In this study the solvolysis of newly synthesized fluocinolone acetonide C-21 esters was analysed in comparison with fluocinonide during a 24-hour period of time.
Katarina D. Karljikovic-Rajic   +5 more
doaj   +1 more source

Asymptotics for Object Descriptors

open access: yesBiometrical Journal, 2014
This is a discussion of the following paper: “Overview of object oriented data analysis” by J. Steve Marron and Andrés M. Alonso.
Telschow, Fabian J. E.   +2 more
openaire   +4 more sources

Descriptor Revision for Conditionals: Literal Descriptors and Conditional Preservation [PDF]

open access: yes, 2020
Descriptor revision by Hansson is a framework for addressing the problem of belief change. In descriptor revision, different kinds of change processes are dealt with in a joint framework. Individual change requirements are qualified by specific success conditions expressed by a belief descriptor, and belief descriptors can be combined by logical ...
Kai Sauerwald   +3 more
openaire   +2 more sources

Fall Detection in Videos With Trajectory-Weighted Deep-Convolutional Rank-Pooling Descriptor

open access: yesIEEE Access, 2019
Automatic fall detection in videos could enable timely delivery of medical service to the injured elders who have fallen and live alone. Deep ConvNets have been used to detect fall actions.
Zhimeng Zhang   +3 more
doaj   +1 more source

Anisotropic Diffusion Descriptors

open access: yesComputer Graphics Forum, 2016
AbstractSpectral methods have recently gained popularity in many domains of computer graphics and geometry processing, especially shape processing, computation of shape descriptors, distances, and correspondence. Spectral geometric structures are intrinsic and thus invariant to isometric deformations, are efficiently computed, and can be constructed on
Davide Boscaini   +4 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy