Browse
Submit Data
Databases
API
Help

Dataset Information

16 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Rotation Estimation: A Closed-Form Solution Using Spherical Moments.

ABSTRACT: Photometric moments are global descriptors of an image that can be used to recover motion information. This paper uses spherical photometric moments for a closed form estimation of 3D rotations from images. Since the used descriptors are global and not of the geometrical kind, they allow to avoid image processing as features extraction, matching, and tracking. The proposed scheme based on spherical projection can be used for the different vision sensors obeying the central unified model: conventional, fisheye, and catadioptric. Experimental results using both synthetic data and real images in different scenarios are provided to show the efficiency of the proposed method.

SUBMITTER: Hadj-Abdelkader H

PROVIDER: S-EPMC6891670 | biostudies-literature | 2019 Nov

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Rotation Estimation: A Closed-Form Solution Using Spherical Moments.

Hadj-Abdelkader Hicham H Tahri Omar O Benseddik Houssem-Eddine HE

Sensors (Basel, Switzerland) 20191114 22

Photometric moments are global descriptors of an image that can be used to recover motion information. This paper uses spherical photometric moments for a closed form estimation of 3D rotations from images. Since the used descriptors are global and not of the geometrical kind, they allow to avoid image processing as features extraction, matching, and tracking. The proposed scheme based on spherical projection can be used for the different vision sensors obeying the central unified model: convent ...[more]

PMID: 31739484

Similar Datasets

Polynomial probability distribution estimation using the method of moments.

Project description:We suggest a procedure for estimating Nth degree polynomial approximations to unknown (or known) probability density functions (PDFs) based on N statistical moments from each distribution. The procedure is based on the method of moments and is setup algorithmically to aid applicability and to ensure rigor in use. In order to show applicability, polynomial PDF approximations are obtained for the distribution families Normal, Log-Normal, Weibull as well as for a bimodal Weibull distribution and a data set of anonymized household electricity use. The results are compared with results for traditional PDF series expansion methods of Gram-Charlier type. It is concluded that this procedure is a comparatively simple procedure that could be used when traditional distribution families are not applicable or when polynomial expansions of probability distributions might be considered useful approximations. In particular this approach is practical for calculating convolutions of distributions, since such operations become integrals of polynomial expressions. Finally, in order to show an advanced applicability of the method, it is shown to be useful for approximating solutions to the Smoluchowski equation.

| S-EPMC5386244 | biostudies-literature

Project description:Adopting a measure is essential in many multimedia applications. Recently, distance learning is becoming an active research problem. In fact, the distance is the natural measure for dissimilarity. Generally, a pairwise relationship between two objects in learning tasks includes two aspects: similarity and dissimilarity. The similarity measure provides different information for pairwise relationships. However, similarity learning has been paid less attention in learning problems. In this work, firstly, we propose a general framework for similarity measure learning (SML). Additionally, we define a generalized type of correlation as a similarity measure. By a set of parameters, generalized correlation provides flexibility for learning tasks. Based on this similarity measure, we present a specific algorithm under the SML framework, called correlation similarity measure learning (CSML), to learn a parameterized similarity measure over input space. A nonlinear extension version of CSML, kernel CSML, is also proposed. Particularly, we give a closed-form solution avoiding iterative search for a local optimal solution in the high-dimensional space as the previous work did. Finally, classification experiments have been performed on face databases and a handwritten digits database to demonstrate the efficiency and reliability of CSML and KCSML.

| S-EPMC4099089 | biostudies-other

SC-GRAPPA: Self-constraint noniterative GRAPPA reconstruction with closed-form solution.

Project description:Parallel MRI (pMRI) reconstruction techniques are commonly used to reduce scan time by undersampling the k-space data. GRAPPA, a k-space based pMRI technique, is widely used clinically because of its robustness. In GRAPPA, the missing k-space data are estimated by solving a set of linear equations; however, this set of equations does not take advantage of the correlations within the missing k-space data. All k-space data in a neighborhood acquired from a phased-array coil are correlated. The correlation can be estimated easily as a self-constraint condition, and formulated as an extra set of linear equations to improve the performance of GRAPPA. The authors propose a modified k-space based pMRI technique called self-constraint GRAPPA (SC-GRAPPA) which combines the linear equations of GRAPPA with these extra equations to solve for the missing k-space data. Since SC-GRAPPA utilizes a least-squares solution of the linear equations, it has a closed-form solution that does not require an iterative solver.The SC-GRAPPA equation was derived by incorporating GRAPPA as a prior estimate. SC-GRAPPA was tested in a uniform phantom and two normal volunteers. MR real-time cardiac cine images with acceleration rate 5 and 6 were reconstructed using GRAPPA and SC-GRAPPA.SC-GRAPPA showed a significantly lower artifact level, and a greater than 10% overall signal-to-noise ratio (SNR) gain over GRAPPA, with more significant SNR gain observed in low-SNR regions of the images.SC-GRAPPA offers improved pMRI reconstruction, and is expected to benefit clinical imaging applications in the future.

| S-EPMC3528788 | biostudies-other

Maximum precision closed-form solution for localizing diffraction-limited spots in noisy images.

Project description:Super-resolution techniques like PALM and STORM require accurate localization of single fluorophores detected using a CCD. Popular localization algorithms inefficiently assume each photon registered by a pixel can only come from an area in the specimen corresponding to that pixel (not from neighboring areas), before iteratively (slowly) fitting a Gaussian to pixel intensity; they fail with noisy images. We present an alternative; a probability distribution extending over many pixels is assigned to each photon, and independent distributions are joined to describe emitter location. We compare algorithms, and recommend which serves best under different conditions. At low signal-to-noise ratios, ours is 2-fold more precise than others, and 2 orders of magnitude faster; at high ratios, it closely approximates the maximum likelihood estimate.

| S-EPMC3503144 | biostudies-literature

Universal Path-Following of Wheeled Mobile Robots: A Closed-Form Bounded Velocity Solution.

Project description:This paper presents a nonlinear, universal, path-following controller for Wheeled Mobile Robots (WMRs). This approach, unlike previous algorithms, solves the path-following problem for all common categories of holonomic and nonholonomic WMRs, such as omnidirectional, unicycle, car-like, and all steerable wheels. This generality is the consequence of a two-stage solution that tackles separately the platform path-following and wheels' kinematic constraints. In the first stage, for a mobile platform divested of the wheels' constraints, we develop a general paradigm of a path-following controller that plans asymptotic paths from the WMR to the desired path and, accordingly, we derive a realization of the presented paradigm. The second stage accounts for the kinematic constraints imposed by the wheels. In this stage, we demonstrate that the designed controller simplifies the otherwise impenetrable wheels' kinematic and nonholonomic constraints into explicit proportional functions between the velocity of the platform and that of the wheels. This result enables us to derive a closed-form trajectory generation scheme for the asymptotic path that constantly keeps the wheels' steering and driving velocities within their corresponding, pre-specified bounds. Extensive experimental results on several types of WMRs, along with simulation results for the other types, are provided to demonstrate the performance and the efficacy of the method.

| S-EPMC8624698 | biostudies-literature

Alignment Solution for CT Image Reconstruction using Fixed Point and Virtual Rotation Axis.

Project description:Since X-ray tomography is now widely adopted in many different areas, it becomes more crucial to find a robust routine of handling tomographic data to get better quality of reconstructions. Though there are several existing techniques, it seems helpful to have a more automated method to remove the possible errors that hinder clearer image reconstruction. Here, we proposed an alternative method and new algorithm using the sinogram and the fixed point. An advanced physical concept of Center of Attenuation (CA) was also introduced to figure out how this fixed point is applied to the reconstruction of image having errors we categorized in this article. Our technique showed a promising performance in restoring images having translation and vertical tilt errors.

| S-EPMC5264594 | biostudies-literature

Space Time Clustering and the Permutation Moments of Quadratic Form.

Project description:The Mantel and Knox space-time clustering statistics are popular tools to establish transmissibility of a disease and detect outbreaks. The most commonly used null distributional approximations may provide poor fits, and researchers often resort to direct sampling from the permutation distribution. However, the exact first four moments for these statistics are available, and Pearson distributional approximations are often effective. Thus, our first goal is to clarify the literature and to make these tools more widely available. In addition, by rewriting terms in the statistics we obtain the exact first four permutation moments for the most commonly used quadratic form statistics, which need not be positive definite. The extension of this work to quadratic forms greatly expands the utility of density approximations for these problems, including for high-dimensional applications, where the statistics must be extreme in order to exceed stringent testing thresholds. We demonstrate the methods using examples from the investigation of disease transmission in cattle, the association of a gene expression pathway with breast cancer survival, regional genetic association with cystic fibrosis lung disease, and hypothesis testing for smoothed local linear regression.

| S-EPMC4157666 | biostudies-literature

Non-spherical particles in optical tweezers: A numerical solution.

Project description:We present numerical methods for modeling the dynamics of arbitrarily shaped particles trapped within optical tweezers, which improve the predictive power of numerical simulations for practical use. We study the dependence of trapping on the shape and size of particles in a single continuous wave beam setup. We also consider the implications of different particle compositions, beam types and media. The major result of the study is that for different irregular particle shapes, a range of beam powers generally leads to trapping. The trapping power range depends on whether the particle can be characterized as elongated or flattened, and the range is also limited by Brownian forces.

| S-EPMC6894773 | biostudies-literature

Comparing distance metrics for rotation using the k-nearest neighbors algorithm for entropy estimation.

Project description:Distance metrics facilitate a number of methods for statistical analysis. For statistical mechanical applications, it is useful to be able to compute the distance between two different orientations of a molecule. However, a number of distance metrics for rotation have been employed, and in this study, we consider different distance metrics and their utility in entropy estimation using the k-nearest neighbors (KNN) algorithm. This approach shows a number of advantages over entropy estimation using a histogram method, and the different approaches are assessed using uniform randomly generated data, biased randomly generated data, and data from a molecular dynamics (MD) simulation of bulk water. The results identify quaternion metrics as superior to a metric based on the Euler angles. However, it is demonstrated that samples from MD simulation must be independent for effective use of the KNN algorithm and this finding impacts any application to time series data.

| S-EPMC4238811 | biostudies-other

Form effects on the estimation of students' oral reading fluency using DIBELS.

Project description:This study examined the effects of passage and presentation order on progress monitoring assessments of oral reading fluency in 134 second grade students. The students were randomly assigned to read six one-minute passages in one of six fixed orders over a seven week period. The passages had been developed to be comparable based on readability formulas. Estimates of oral reading fluency varied across the six stories (67.9 to 93.9), but not as a function of presentation order. These passage effects altered the shape of growth trajectories and affected estimates of linear growth rates, but were shown to be removed when forms were equated. Explicit equating is essential to the development of equivalent forms, which can vary in difficulty despite high correlations across forms and apparent equivalence through readability indices.

| S-EPMC2396583 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data