Contents
Academic literature on the topic 'Implicit gradient reconstruction'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Implicit gradient reconstruction.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Implicit gradient reconstruction"
1
Singh, Manish K., N. Munikrishna, V. Ramesh, and N. Balakrishnan. "Implicit gradient reconstruction (IGR) method for compressible flow simulation." Journal of Physics: Conference Series 822 (April 11, 2017): 012030. http://dx.doi.org/10.1088/1742-6596/822/1/012030.
Full text
2
Dahlke, Taylor, Biondo Biondi, and Robert Clapp. "Applied 3D salt body reconstruction using shape optimization with level sets." GEOPHYSICS 85, no. 5 (2020): R437—R446. http://dx.doi.org/10.1190/geo2019-0352.1.
Full textAbstract:
As oil and gas extraction becomes more advanced, deep-water exploration becomes increasingly focused on imaging near or under complex salt geology, which necessitates detailed velocity models with strong contrast interfaces. These interfaces can be elegantly tracked using the level sets of an implicit surface. One can invert for the velocity model that best fits the recorded data in a full-waveform inversion (FWI) style objective function by reparameterizing the model in terms of an implicit surface representation of the salt interface. With this parameterization of the FWI objective function, we find the Hessian and solve a conjugate gradient system for the Newton step at every nonlinear iteration. We sparsify the representation of the implicit surface using radial basis functions, which can hasten convergence of the inner inversion by reducing the number of model parameters. We have developed a guided inversion approach that embeds information about the certainty of different salt boundary regions by the initialization of the implicit surface slope at the salt interface. This can help guide the inversion away from perceived local minima. The results of testing this inversion workflow on a 3D Gulf of Mexico data set show that it can be a useful tool for refining salt models because the initial and final seismic images show clearer and more consistent features below the updated salt area.
3
Boscheri, Walter, Maurizio Tavelli, and Nicola Paoluzzi. "High order Finite Difference/Discontinuous Galerkin schemes for the incompressible Navier-Stokes equations with implicit viscosity." Communications in Applied and Industrial Mathematics 13, no. 1 (2022): 21–38. http://dx.doi.org/10.2478/caim-2022-0003.
Full textAbstract:
Abstract In this work we propose a novel numerical method for the solution of the incompressible Navier-Stokes equations on Cartesian meshes in 3D. The semi-discrete scheme is based on an explicit discretization of the nonlinear convective flux tensor and an implicit treatment of the pressure gradient and viscous terms. In this way, the momentum equation is formally substituted into the divergence-free constraint, thus obtaining an elliptic equation on the pressure which eventually maintains at the discrete level the involution on the divergence of the velocity field imposed by the governing equations. This makes our method belonging to the class of so-called structure-preserving schemes. High order of accuracy in space is achieved using an efficient CWENO reconstruction operator that is exploited to devise a conservative finite difference scheme for the convective terms. Implicit central finite differences are used to remove the numerical dissipation in the pressure gradient discretization. To avoid the severe time step limitation induced by the viscous eigenvalues related to the parabolic terms in the governing equations, we propose to devise an implicit local discontinuous Galerkin (DG) solver. The resulting viscous sub-system is symmetric and positive definite, therefore it can be efficiently solved at the aid of a matrix-free conjugate gradient method. High order in time is granted by a semi-implicit IMEX time stepping technique. Convergence rates up to third order of accuracy in space and time are proven, and a suite of academic benchmarks is shown in order to demonstrate the robustness and the validity of the novel schemes, especially in the context of high viscosity coefficients.
4
Chen, Chong, and Guoliang Xu. "Gradient-flow-based semi-implicit finite-element method and its convergence analysis for image reconstruction." Inverse Problems 28, no. 3 (2012): 035006. http://dx.doi.org/10.1088/0266-5611/28/3/035006.
Full text
5
Zhu, Xiangyuan, Kehua Guo, Hui Fang, Rui Ding, Zheng Wu, and Gerald Schaefer. "Gradient-Based Graph Attention for Scene Text Image Super-resolution." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 3 (2023): 3861–69. http://dx.doi.org/10.1609/aaai.v37i3.25499.
Full textAbstract:
Scene text image super-resolution (STISR) in the wild has been shown to be beneficial to support improved vision-based text recognition from low-resolution imagery. An intuitive way to enhance STISR performance is to explore the well-structured and repetitive layout characteristics of text and exploit these as prior knowledge to guide model convergence. In this paper, we propose a novel gradient-based graph attention method to embed patch-wise text layout contexts into image feature representations for high-resolution text image reconstruction in an implicit and elegant manner. We introduce a non-local group-wise attention module to extract text features which are then enhanced by a cascaded channel attention module and a novel gradient-based graph attention module in order to obtain more effective representations by exploring correlations of regional and local patch-wise text layout properties. Extensive experiments on the benchmark TextZoom dataset convincingly demonstrate that our method supports excellent text recognition and outperforms the current state-of-the-art in STISR. The source code is available at https://github.com/xyzhu1/TSAN.
6
Strauss, Thilo, and Taufiquar Khan. "Implicit Solutions of the Electrical Impedance Tomography Inverse Problem in the Continuous Domain with Deep Neural Networks." Entropy 25, no. 3 (2023): 493. http://dx.doi.org/10.3390/e25030493.
Full textAbstract:
Electrical impedance tomography (EIT) is a non-invasive imaging modality used for estimating the conductivity of an object Ω from boundary electrode measurements. In recent years, researchers achieved substantial progress in analytical and numerical methods for the EIT inverse problem. Despite the success, numerical instability is still a major hurdle due to many factors, including the discretization error of the problem. Furthermore, most algorithms with good performance are relatively time consuming and do not allow real-time applications. In our approach, the goal is to separate the unknown conductivity into two regions, namely the region of homogeneous background conductivity and the region of non-homogeneous conductivity. Therefore, we pose and solve the problem of shape reconstruction using machine learning. We propose a novel and simple jet intriguing neural network architecture capable of solving the EIT inverse problem. It addresses previous difficulties, including instability, and is easily adaptable to other ill-posed coefficient inverse problems. That is, the proposed model estimates the probability for a point of whether the conductivity belongs to the background region or to the non-homogeneous region on the continuous space Rd∩Ω with d∈{2,3}. The proposed model does not make assumptions about the forward model and allows for solving the inverse problem in real time. The proposed machine learning approach for shape reconstruction is also used to improve gradient-based methods for estimating the unknown conductivity. In this paper, we propose a piece-wise constant reconstruction method that is novel in the inverse problem setting but inspired by recent approaches from the 3D vision community. We also extend this method into a novel constrained reconstruction method. We present extensive numerical experiments to show the performance of the architecture and compare the proposed method with previous analytic algorithms, mainly the monotonicity-based shape reconstruction algorithm and iteratively regularized Gauss–Newton method.
7
Zang, Miao, Huimin Xu, and Yongmei Zhang. "Kernel-Based Multiview Joint Sparse Coding for Image Annotation." Mathematical Problems in Engineering 2017 (2017): 1–11. http://dx.doi.org/10.1155/2017/6727105.
Full textAbstract:
It remains a challenging task for automatic image annotation problem due to the semantic gap between visual features and semantic concepts. To reduce the gap, this paper puts forward a kernel-based multiview joint sparse coding (KMVJSC) framework for image annotation. In KMVJSC, different visual features as well as label information are considered as distinct views and are mapped to an implicit kernel space, in which the original nonlinear separable data become linearly separable. Then, all the views are integrated into a multiview joint sparse coding framework aiming to find a set of optimal sparse representations and discriminative dictionaries adaptively, which can effectively employ the complementary information of different views. An optimization algorithm is presented by extending K-singular value decomposition (KSVD) and accelerated proximal gradient (APG) algorithms to the kernel multiview framework. In addition, a label propagation scheme using the sparse reconstruction and weighted greedy label transfer algorithm is also proposed. Comparative experiments on three datasets have demonstrated the competitiveness of proposed approach compared with other related methods.
8
Bates, Oscar, Lluis Guasch, George Strong, et al. "A probabilistic approach to tomography and adjoint state methods, with an application to full waveform inversion in medical ultrasound." Inverse Problems 38, no. 4 (2022): 045008. http://dx.doi.org/10.1088/1361-6420/ac55ee.
Full textAbstract:
Abstract Bayesian methods are a popular research direction for inverse problems. There are a variety of techniques available to solve Bayes’ equation, each with their own strengths and limitations. Here, we discuss stochastic variational inference (SVI), which solves Bayes’ equation using gradient-based methods. This is important for applications which are time-limited (e.g. medical tomography) or where solving the forward problem is expensive (e.g. adjoint methods). To evaluate the use of SVI in both these contexts, we apply it to ultrasound tomography of the brain using full-waveform inversion (FWI). FWI is a computationally expensive adjoint method for solving the ultrasound tomography inverse problem, and we demonstrate that SVI can be used to find a no-cost estimate of the pixel-wise variance of the sound-speed distribution using a mean-field Gaussian approximation. In other words, we show experimentally that it is possible to estimate the pixel-wise uncertainty of the sound-speed reconstruction using SVI and a common approximation which is already implicit in other types of iterative reconstruction. Uncertainty estimates have a variety of uses in adjoint methods and tomography. As an illustrative example, we focus on the use of uncertainty for image quality assessment. This application is not limiting; our variance estimator has effectively no computational cost and we expect that it will have applications in fields such as non-destructive testing or aircraft component design where uncertainties may not be routinely estimated.
9
Bi, Sheng, Jianzhong Zhou, Yi Liu, and Lixiang Song. "A Finite Volume Method for Modeling Shallow Flows with Wet-Dry Fronts on Adaptive Cartesian Grids." Mathematical Problems in Engineering 2014 (2014): 1–20. http://dx.doi.org/10.1155/2014/209562.
Full textAbstract:
A second-order accurate, Godunov-type upwind finite volume method on dynamic refinement grids is developed in this paper for solving shallow-water equations. The advantage of this grid system is that no data structure is needed to store the neighbor information, since neighbors are directly specified by simple algebraic relationships. The key ingredient of the scheme is the use of the prebalanced shallow-water equations together with a simple but effective method to track the wet/dry fronts. In addition, a second-order spatial accuracy in space and time is achieved using a two-step unsplit MUSCL-Hancock method and a weighted surface-depth gradient method (WSDM) which considers the local Froude number is proposed for water depths reconstruction. The friction terms are solved by a semi-implicit scheme that can effectively prevent computational instability from small depths and does not invert the direction of velocity components. Several benchmark tests and a dam-break flooding simulation over real topography cases are used for model testing and validation. Results show that the proposed model is accurate and robust and has advantages when it is applied to simulate flow with local complex topographic features or flow conditions and thus has bright prospects of field-scale application.
10
PADOVANI, E., E. PRIOLO, and G. SERIANI. "LOW AND HIGH ORDER FINITE ELEMENT METHOD: EXPERIENCE IN SEISMIC MODELING." Journal of Computational Acoustics 02, no. 04 (1994): 371–422. http://dx.doi.org/10.1142/s0218396x94000233.
Full textAbstract:
The finite element method (FEM) is a numerical technique well suited to solving problems of elastic wave propagation in complex geometries and heterogeneous media. The main advantages are that very irregular grids can be used, free surface boundary conditions can be easily taken into account, a good reconstruction is possible of irregular surface topography, and complex geometries, such as curved, dipping and rough interfaces, intrusions, cusps, and holes can be defined. The main drawbacks of the classical approach are the need for a large amount of memory, low computational efficiency, and the possible appearance of spurious effects. In this paper we describe some experience in improving the computational efficiency of a finite element code based on a global approach, and used for seismic modeling in geophysical oil exploration. Results from the use of different methods and models run on a mini-superworkstation APOLLO DN10000 are reported and compared. With Chebyshev spectral elements, great accuracy can be reached with almost no numerical artifacts. Static condensation of the spectral element's internal nodes dramatically reduces memory requirements and CPU time. Time integration performed with the classical implicit Newmark scheme is very accurate but not very efficient. Due to the high sparsity of the matrices, the use of compressed storage is shown to greatly reduce not only memory requirements but also computing time. The operation which most affects the performance is the matrix-by-vector product; an effective programming of this subroutine for the storage technique used is decisive. The conjugate gradient method preconditioned by incomplete Cholesky factorization provides, in general, a good compromise between efficiency and memory requirements. Spectral elements greatly increase its efficiency, since the number of iterations is reduced. The most efficient and accurate method is a hybrid iterative-direct solution of the linear system arising from the static condensation of high order elements. The size of 2D models that can be handled in a reasonable time on this kind of computer is nowadays hardly sufficient, and significant 3D modeling is completely unfeasible. However the introduction of new FEM algorithms coupled with the use of new computer architectures is encouraging for the future.