Results 221 to 230 of about 875,579 (253)

Enhanced Ferroelectric Phase Formation via Local Structure Modification in the Pre‐Crystalline State of Hafnium Zirconium Oxide Thin Films

Advanced Functional Materials, EarlyView.
Hafnium zirconium oxide thin films are grown using plasma‐enhanced atomic layer deposition with the addition of an atomic layer annealing (ALA) step. ALA leads to a change in the short‐range structure of the deposit and encourages formation of the ferroelectric Pca21 phase. The result is wake‐up‐free performance with films exposed to ALA.
Nicolas K. Lam, Gerald R. Bejger, Waseem A. Wani, Kristina M. Holsgrove, Andrew N. Titus, Niyorjyoti Sharma, Shihao Wang, Keithen Orson, Megan K. Lenox, Liron Shvilberg, Yong Kyu Choi, Ian A. Brummel, Benjamin L. Aronson, Petra Reinke, Quentin Ramasse, Amit Kumar, Brian J. Rodriguez, Christina M. Rost, Jon F. Ihlefeld   +18 more
wiley   +1 more source

Feature Curve Co‐Completion in Noisy Data

Computer Graphics Forum, 2018
AbstractFeature curves on 3D shapes provide important hints about significant parts of the geometry and reveal their underlying structure. However, when we process real world data, automatically detected feature curves are affected by measurement uncertainty, missing data, and sampling resolution, leading to noisy, fragmented, and incomplete feature ...
Anne Gehre
exaly   +3 more sources

Estimation of tangents to a noisy discrete curve

, 2004
A new notion of discrete tangent, called order d discrete tangent, adapted to noisy curves, is proposed. It is based on the definition of discrete tangents given by A. Vialard in 1996, on the definition of fuzzy segments and on the linear algorithm of fuzzy segments recognition.
Isabelle Debled-Rennesson
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Discrete Polynomial Curve Fitting to Noisy Data

Lecture Notes in Computer Science, 2012
A discrete polynomial curve is defined as a set of points lying between two polynomial curves. This paper deals with the problem of fitting a discrete polynomial curve to given integer points in the presence of outliers. We formulate the problem as a discrete optimization problem in which the number of points included in the discrete polynomial curve ...
Akihiro Sugimoto
exaly   +2 more sources

A parallel algorithm for the optimal detection of a noisy curve

Computer Vision, Graphics, and Image Processing, 1984
Abstract In this paper the problem of recognizing a black curve in a noisy environment using a multiprocessor system is investigated. A dynamic programming parallel algorithm which can solve that image processing problem is presented. It is shown that, under hypothesis of unbounded parallelism and using a simple parallel architecture, the algorithm's
Paola Bertolazzi, Massimo Pirozzi
exaly   +4 more sources

Optimization of the DET curve in speaker verification under noisy conditions

2013 IEEE International Conference on Acoustics, Speech and Signal Processing, 2013
The increasing need for secure authentication systems has motivated recent interest in effective algorithms for Speaker Verification (SV). In particular, there is increasing need for noise robust algorithms for SV, which will allow SV systems to operate successfully in real conditions, which are typically noisy. Speaker verification addresses a pattern
Juan Arturo Nolazco Flores, Bhiksha Raj
exaly   +2 more sources

Quantifying the information in noisy epidemic curves

Nature Computational Science, 2022
Abstract Reliably estimating the dynamics of transmissible diseases from noisy surveillance data is an enduring problem in modern epidemiology. Key parameters, such as the instantaneous reproduction number, R t at time
Kris V. Parag, Christl A. Donnelly, Alexander Eugene Zarebski   +2 more
openaire   +3 more sources

Semi-parametric classification of noisy curves

Pattern Recognition, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Richard H. Glendinning, Amanda J. Goode
openaire   +1 more source

Identifying Skeleton Curves in Noisy Data

Communications in Statistics - Simulation and Computation, 2012
This article presents a Bayesian method to reconstruct the centerline in noisy data using B-spline curves. The method is illustrated on simulated two- and three-dimensional data and is applied to recover the centerline of the colon in single photon emission computed tomography images.
Hanna K. Jankowski, Larissa I. Stanberry
openaire   +2 more sources

Fitting the most probable curve to noisy observations

Proceedings of International Conference on Image Processing, 2002
Orthogonal distance regression (ODR) is widely used to fit a curve through scattered points in the plane. It generally produces good fits, but intuition and practice suggest it can give biased results when fitting closed convex curves or corners. ODR gives the maximum likelihood estimate of the best curve under a straightforward stochastic model for ...
Garry N. Newsam, Nicholas J. Redding
openaire   +2 more sources