• Title/Summary/Keyword: Adaptive Decomposition Method

Search Result 86, Processing Time 0.023 seconds

Adaptive Parallel Decomposition for Multidisciplinary Design

  • Park, Hyung-Wook;Lee, Se J.;Lee, Hyun-Seop;Park, Dong-Hoon
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.5
    • /
    • pp.814-819
    • /
    • 2004
  • The conceptual design of a rotorcraft system involves many different analysis disciplines. The decomposition of such a system into several subsystems can make analysis and design more efficient in terms of the total computation time. Adaptive parallel decomposition makes the structure of the overall design problem suitable to apply the multidisciplinary design optimization methodologies and it can exploit parallel computing. This study proposes a decomposition method which adaptively determines the number and sequence of analyses in each sub-problem corresponding to the available number of processors in parallel. A rotorcraft design problem is solved and as a result, the adaptive parallel decomposition method shows better performance than other previous methods for the selected design problem.

An Adaptive Decomposition Technique for Multidisciplinary Design Optimization (다분야통합최적설계를 위한 적응분해기법)

  • Park, Hyeong Uk;Choe, Dong Hun;An, Byeong Ho
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.31 no.5
    • /
    • pp.18-24
    • /
    • 2003
  • The design cycle associated with large engineering systems requires an initial decomposition of the complex system into design processes which are coupled through the transference of output data. Some of these design processes may be grouped into iterative sybcycles. Previous researches predifined the numbers of design processes in groups, but these group sizes should be determined optimally to balance the computing time of each groups. This paper proposes adaptive decomposition method, which determines the group sizes and the order of processes simultaneously to raise design efficiency by expanding the chromosome of the genetic algorithm. Finally, two sample cases are presented to show the effects of optimizing the sequence of processes with the adaptive decomposition method.

AN INTERFERENCE FRINGE REMOVAL METHOD BASED ON MULTI-SCALE DECOMPOSITION AND ADAPTIVE PARTITIONING FOR NVST IMAGES

  • Li, Yongchun;Zheng, Sheng;Huang, Yao;Liu, Dejian
    • Journal of The Korean Astronomical Society
    • /
    • v.52 no.2
    • /
    • pp.49-55
    • /
    • 2019
  • The New Vacuum Solar Telescope (NVST) is the largest solar telescope in China. When using CCDs for imaging, equal-thickness fringes caused by thin-film interference can occur. Such fringes reduce the quality of NVST data but cannot be removed using standard flat fielding. In this paper, a correction method based on multi-scale decomposition and adaptive partitioning is proposed. The original image is decomposed into several sub-scales by multi-scale decomposition. The region containing fringes is found and divided by an adaptive partitioning method. The interference fringes are then filtered by a frequency-domain Gaussian filter on every partitioned image. Our analysis shows that this method can effectively remove the interference fringes from a solar image while preserving useful information.

A generalized adaptive variational mode decomposition method for nonstationary signals with mode overlapped components

  • Liu, Jing-Liang;Qiu, Fu-Lian;Lin, Zhi-Ping;Li, Yu-Zu;Liao, Fei-Yu
    • Smart Structures and Systems
    • /
    • v.30 no.1
    • /
    • pp.75-88
    • /
    • 2022
  • Engineering structures in operation essentially belong to time-varying or nonlinear structures and the resultant response signals are usually non-stationary. For such time-varying structures, it is of great importance to extract time-dependent dynamic parameters from non-stationary response signals, which benefits structural health monitoring, safety assessment and vibration control. However, various traditional signal processing methods are unable to extract the embedded meaningful information. As a newly developed technique, variational mode decomposition (VMD) shows its superiority on signal decomposition, however, it still suffers two main problems. The foremost problem is that the number of modal components is required to be defined in advance. Another problem needs to be addressed is that VMD cannot effectively separate non-stationary signals composed of closely spaced or overlapped modes. As such, a new method named generalized adaptive variational modal decomposition (GAVMD) is proposed. In this new method, the number of component signals is adaptively estimated by an index of mean frequency, while the generalized demodulation algorithm is introduced to yield a generalized VMD that can decompose mode overlapped signals successfully. After that, synchrosqueezing wavelet transform (SWT) is applied to extract instantaneous frequencies (IFs) of the decomposed mono-component signals. To verify the validity and accuracy of the proposed method, three numerical examples and a steel cable with time-varying tension force are investigated. The results demonstrate that the proposed GAVMD method can decompose the multi-component signal with overlapped modes well and its combination with SWT enables a successful IF extraction of each individual component.

Shape Reconstruction from Unorganized Cloud of Points using Adaptive Domain Decomposition Method (적응적 영역분할법을 이용한 임의의 점군으로부터의 형상 재구성)

  • Yoo Dong-Jin
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.23 no.8 s.185
    • /
    • pp.89-99
    • /
    • 2006
  • In this paper a new shape reconstruction method that allows us to construct surface models from very large sets of points is presented. In this method the global domain of interest is divided into smaller domains where the problem can be solved locally. These local solutions of subdivided domains are blended together according to weighting coefficients to obtain a global solution using partition of unity function. The suggested approach gives us considerable flexibility in the choice of local shape functions which depend on the local shape complexity and desired accuracy. At each domain, a quadratic polynomial function is created that fits the points in the domain. If the approximation is not accurate enough, other higher order functions including cubic polynomial function and RBF(Radial Basis Function) are used. This adaptive selection of local shape functions offers robust and efficient solution to a great variety of shape reconstruction problems.

New Path Planning Algorithm based on the Visibility Checking using a Quad-tree on a Quantized Space, and its improvements (격자화된 공간상에서 4중-나무 구조를 이용한 가시성 검사를 바탕으로 한 새로운 경로 계획 알고리즘과 그 개선 방안들)

  • Kim, Jung-Tae;Kim, Dai-Jin
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.16 no.1
    • /
    • pp.48-52
    • /
    • 2010
  • In this paper, we introduce a new path planning algorithm which combines the merits of a visibility graph algorithm and an adaptive cell decomposition. We quantize a given map with empty cells, blocked cells, and mixed cells, then find the optimal path on the quantized map using a visibility graph algorithm. For reducing the number of the quantized cells we use the quad-tree technique which is used in an adaptive cell decomposition, and for improving the performance of the visibility checking in making a visibility graph we propose a new visibility checking method which uses the property of the quad-tree instead of the well-known rotational sweep-line algorithm. For the more efficient visibility checking, we propose two additional improvements for our suggested method. Both of them are used for reducing the visited cells in the quad-tree. The experiments for a performance comparison of our algorithm with other well-known algorithms show that our proposed method is superior to others.

Analysis of a nonuniform guiding structure by the adaptive finite-difference and singular value decomposition methods

  • Abdolshakoor Tamandani;Mohammad G. H. Alijani
    • ETRI Journal
    • /
    • v.45 no.4
    • /
    • pp.704-712
    • /
    • 2023
  • This paper presents a flexible finite-difference technique for analyzing the nonuniform guiding structures. Because the voltage and current variations along the nonuniform structure differ for each segment, this work considers the adaptable discretization steps. This technique increases the accuracy of the final response. Moreover, by applying the singular value decomposition and discarding the nonprincipal singular values, an optimal lower rank approximation of the discretization matrix is obtained. The computational cost of the introduced method is significantly reduced using the optimal discretization matrix. Also, the proposed method can be extended to the nonuniform waveguides. The technique is verified by analyzing several practical transmission lines and waveguides with nonuniform profiles.

Adaptive Finite Element Mesh Construction for Optimal Design of Spot Welding (점용접부 최적설계를 위한 적응적 유한요소망의 구성)

  • Park, Jang-Won;Chae, Su-Won;Lee, Tae-Su
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.7 s.178
    • /
    • pp.1763-1770
    • /
    • 2000
  • A finite element interface system for the design of optimal spot welding locations has been developed. In order to find out the optimal locations of spot welding points, iterative finite element an alyses are necessary, and thus automatic generation of finite element model for the structures with spot welded pointsis required. In this interface system, quadrilateral shell elements are automatically generated for finite element analysis of spot welded structured, which employs a domain decomposition methodand adaptive mesh(h-method).

Generating a Rectangular Net from Unorganized Point Cloud Data Using an Implicit Surface Scheme (음 함수 곡면기법을 이용한 임의의 점 군 데이터로부터의 사각망 생성)

  • Yoo, D.J.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.12 no.4
    • /
    • pp.274-282
    • /
    • 2007
  • In this paper, a method of constructing a rectangular net from unorganized point cloud data is presented. In the method an implicit surface that fits the given point data is generated by using principal component analysis(PCA) and adaptive domain decomposition method(ADDM). Then a complete and quality rectangular net can be obtained by extracting voxel data from the implicit surface and projecting exterior faces of extracted voxels onto the implicit surface. The main advantage of the proposed method is that a quality rectangular net can be extracted from randomly scattered 3D points only without any further information. Furthermore the results of this works can be used to obtain many useful information including a slicing data, a solid STL model and a NURBS surface model in many areas involved in treatment of large amount of point data by proper processing of implicit surface and rectangular net generated previously.

A Tone Mapping Algorithm Based on Multi-scale Decomposition

  • Li, Weizhong;Yi, Benshun;Huang, Taiqi;Yao, Weiqing;Peng, Hong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.4
    • /
    • pp.1846-1863
    • /
    • 2016
  • High dynamic range (HDR) images can present the perfect real scene and rich color information. A commonly encountered problem in practical applications is how to well visualize HDR images on standard display devices. In this paper, we propose a multi-scale decomposition method using guided filtering for HDR image tone mapping. In our algorithm, HDR images are directly decomposed into three layers:base layer, coarse scale detail layer and fine detail layer. We propose an effective function to compress the base layer and the coarse scale detail layer. An adaptive function is also proposed for detail adjustment. Experimental results show that the proposed algorithm effectively accomplishes dynamic range compression and maintains good global contrast as well as local contrast. It also presents more image details and keeps high color saturation.