17,530 research outputs found
Image Segmentation with Multidimensional Refinement Indicators
We transpose an optimal control technique to the image segmentation problem.
The idea is to consider image segmentation as a parameter estimation problem.
The parameter to estimate is the color of the pixels of the image. We use the
adaptive parameterization technique which builds iteratively an optimal
representation of the parameter into uniform regions that form a partition of
the domain, hence corresponding to a segmentation of the image. We minimize an
error function during the iterations, and the partition of the image into
regions is optimally driven by the gradient of this error. The resulting
segmentation algorithm inherits desirable properties from its optimal control
origin: soundness, robustness, and flexibility
A study of transonic aerodynamic analysis methods for use with a hypersonic aircraft synthesis code
A means of performing routine transonic lift, drag, and moment analyses on hypersonic all-body and wing-body configurations were studied. The analysis method is to be used in conjunction with the Hypersonic Vehicle Optimization Code (HAVOC). A review of existing techniques is presented, after which three methods, chosen to represent a spectrum of capabilities, are tested and the results are compared with experimental data. The three methods consist of a wave drag code, a full potential code, and a Navier-Stokes code. The wave drag code, representing the empirical approach, has very fast CPU times, but very limited and sporadic results. The full potential code provides results which compare favorably to the wind tunnel data, but with a dramatic increase in computational time. Even more extreme is the Navier-Stokes code, which provides the most favorable and complete results, but with a very large turnaround time. The full potential code, TRANAIR, is used for additional analyses, because of the superior results it can provide over empirical and semi-empirical methods, and because of its automated grid generation. TRANAIR analyses include an all body hypersonic cruise configuration and an oblique flying wing supersonic transport
Variational approach to relaxed topological optimization: closed form solutions for structural problems in a sequential pseudo-time framework
The work explores a specific scenario for structural computational optimization based on the following elements: (a) a relaxed optimization setting considering the ersatz (bi-material) approximation, (b) a treatment based on a non-smoothed characteristic function field as a topological design variable, (c) the consistent derivation of a relaxed topological derivative whose determination is simple, general and efficient, (d) formulation of the overall increasing cost function topological sensitivity as a suitable optimality criterion, and (e) consideration of a pseudo-time framework for the problem solution, ruled by the problem constraint evolution.
In this setting, it is shown that the optimization problem can be analytically solved in a variational framework, leading to, nonlinear, closed-form algebraic solutions for the characteristic function, which are then solved, in every time-step, via fixed point methods based on a pseudo-energy cutting algorithm combined with the exact fulfillment of the constraint, at every iteration of the non-linear algorithm, via a bisection method. The issue of the ill-posedness (mesh dependency) of the topological solution, is then easily solved via a Laplacian smoothing of that pseudo-energy.
In the aforementioned context, a number of (3D) topological structural optimization benchmarks are solved, and the solutions obtained with the explored closed-form solution method, are analyzed, and compared, with their solution through an alternative level set method. Although the obtained results, in terms of the cost function and topology designs, are very similar in both methods, the associated computational cost is about five times smaller in the closed-form solution method this possibly being one of its advantages. Some comments, about the possible application of the method to other topological optimization problems, as well as envisaged modifications of the explored method to improve its performance close the workPeer ReviewedPostprint (author's final draft
An adaptive grid refinement strategy for the simulation of negative streamers
The evolution of negative streamers during electric breakdown of a
non-attaching gas can be described by a two-fluid model for electrons and
positive ions. It consists of continuity equations for the charged particles
including drift, diffusion and reaction in the local electric field, coupled to
the Poisson equation for the electric potential. The model generates field
enhancement and steep propagating ionization fronts at the tip of growing
ionized filaments. An adaptive grid refinement method for the simulation of
these structures is presented. It uses finite volume spatial discretizations
and explicit time stepping, which allows the decoupling of the grids for the
continuity equations from those for the Poisson equation. Standard refinement
methods in which the refinement criterion is based on local error monitors fail
due to the pulled character of the streamer front that propagates into a
linearly unstable state. We present a refinement method which deals with all
these features. Tests on one-dimensional streamer fronts as well as on
three-dimensional streamers with cylindrical symmetry (hence effectively 2D for
numerical purposes) are carried out successfully. Results on fine grids are
presented, they show that such an adaptive grid method is needed to capture the
streamer characteristics well. This refinement strategy enables us to
adequately compute negative streamers in pure gases in the parameter regime
where a physical instability appears: branching streamers.Comment: 46 pages, 19 figures, to appear in J. Comp. Phy
Application of general semi-infinite Programming to Lapidary Cutting Problems
We consider a volume maximization problem arising in gemstone cutting industry. The problem is formulated as a general semi-infinite program (GSIP) and solved using an interiorpoint method developed by Stein. It is shown, that the convexity assumption needed for the convergence of the algorithm can be satisfied by appropriate modelling. Clustering techniques are used to reduce the number of container constraints, which is necessary to make the subproblems practically tractable. An iterative process consisting of GSIP optimization and adaptive refinement steps is then employed to obtain an optimal solution which is also feasible for the original problem. Some numerical results based on realworld data are also presented
Weakly Enforced Boundary Conditions for the NURBS-Based Finite Cell Method
In this paper, we present a variationally consistent formulation for the weak enforcement
of essential boundary conditions as an extension to the finite cell method, a fictitious
domain method of higher order. The absence of boundary fitted elements in fictitious domain or
immersed boundary methods significantly restricts a strong enforcement of essential boundary
conditions to models where the boundary of the solution domain coincides with the embedding
analysis domain. Penalty methods and Lagrange multiplier methods are adequate means to
overcome this limitation but often suffer from various drawbacks with severe consequences for
a stable and accurate solution of the governing system of equations. In this contribution, we
follow the idea of NITSCHE [29] who developed a stable scheme for the solution of the Laplace
problem taking weak boundary conditions into account. An extension to problems from linear
elasticity shows an appropriate behavior with regard to numerical stability, accuracy and an
adequate convergence behavior. NURBS are chosen as a high-order approximation basis to
benefit from their smoothness and flexibility in the process of uniform model refinement
Proceedings of Abstracts Engineering and Computer Science Research Conference 2019
© 2019 The Author(s). This is an open-access work distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. For further details please see https://creativecommons.org/licenses/by/4.0/. Note: Keynote: Fluorescence visualisation to evaluate effectiveness of personal protective equipment for infection control is © 2019 Crown copyright and so is licensed under the Open Government Licence v3.0. Under this licence users are permitted to copy, publish, distribute and transmit the Information; adapt the Information; exploit the Information commercially and non-commercially for example, by combining it with other Information, or by including it in your own product or application. Where you do any of the above you must acknowledge the source of the Information in your product or application by including or linking to any attribution statement specified by the Information Provider(s) and, where possible, provide a link to this licence: http://www.nationalarchives.gov.uk/doc/open-government-licence/version/3/This book is the record of abstracts submitted and accepted for presentation at the Inaugural Engineering and Computer Science Research Conference held 17th April 2019 at the University of Hertfordshire, Hatfield, UK. This conference is a local event aiming at bringing together the research students, staff and eminent external guests to celebrate Engineering and Computer Science Research at the University of Hertfordshire. The ECS Research Conference aims to showcase the broad landscape of research taking place in the School of Engineering and Computer Science. The 2019 conference was articulated around three topical cross-disciplinary themes: Make and Preserve the Future; Connect the People and Cities; and Protect and Care
- …