• Title/Summary/Keyword: Multi-Decomposition

Search Result 365, Processing Time 0.024 seconds

Multi-scale crack detection using decomposition and composition (해체와 구성을 이용한 다중 스케일 균열 검출)

  • Kim, Young Ro;Chung, Ji Yung
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.9 no.3
    • /
    • pp.13-20
    • /
    • 2013
  • In this paper, we propose a multi-scale crack detection method. This method uses decomposition, composition, and shape properties. It is based on morphology algorithm, crack features. We use a morphology operator which extracts patterns of crack. It segments cracks and background using opening and closing operations. Morphology based segmentation is better than existing integration methods using subtraction in detecting a crack it has small width. However, morphology methods using only one structure element could detect only fixed width crack. Thus, we use decomposition and composition methods. We use a decimation method for decomposition. After decomposition and morphology operation, we get edge images given by binary values. Our method calculates values of properties such as the number of pixels and the maximum length of the segmented region. We decide whether the segmented region belongs to cracks according to those data. Experimental results show that our proposed multi-scale crack detection method has better results than those of existing detection methods.

The Decomposition of Leaf Litters of Some Tree Species in Temperate Deciduous Forest in Korea I. Losses in Dry Weight of Leaf Litter

  • Yang, Keum-Chul;Shim, Jae-Kuk
    • The Korean Journal of Ecology
    • /
    • v.26 no.4
    • /
    • pp.203-208
    • /
    • 2003
  • Losses in the dry weight of leaf litter from six tree species were studied during 16 months on the forest floor in temperate deciduous forest of Mt. Cheonma in the vicinity of Seoul in Korea by using litter bag method. The decomposition rate of each leaf litter varies with each species. After 16 months elapsed, the leaf litter of Acer pseudo-sieboidianum showed the highest decomposition constant (0.82) as Olson´s decomposition constant, while that of Pinus densiflora showed the lowest decomposition constant (0.33). The decomposition constant of Quercus mongolica, Q. serrata, Betula ermani and Carpinus laxiflora showed 0.43, 0.37, 0.66 and 0.75, respectively. The decomposition constant of leaf litter was considered with temperature and precipitation which accumulated daily during each term of litter bag collection. The decomposition constant of leaf litter showed closely positive correlation with daily accumulative temperature and precipitation. The relationships between decomposition constant and the daily accumulative temperature and precipitation at each period of litter bag collection were analyzed through multi-regression analysis. The correlation coefficients as a result of multi-regression analysis in Q. mongolica, Q. serrata, P densiflora, B. ermani, C. laxiflorais and A. pseudo-sieboldianum were 0.83, 0.81, 0.69, 0.77, 0.77 and 0.62, respectively. The precipitation showed higher effect, about 10 times, on the leaf litter decomposition than the daily accumulative temperature.

Sign-Select Lookahead CORDIC based High-Speed QR Decomposition Architecture for MIMO Receiver Applications

  • Lee, Min-Woo;Park, Jong-Sun
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.11 no.1
    • /
    • pp.6-14
    • /
    • 2011
  • This paper presents a high-speed QR decomposition architecture for the multi-input-multi-output (MIMO) receiver based on Givens rotation. Under fast-varying channel, since the inverse matrix calculation has to be performed frequently in MIMO receiver, a high performance and low latency QR decomposition module is highly required. The proposed QR decomposition architecture is composed of Sign-Select Lookahead (SSL) coordinate rotation digital computer (CORDIC). In the SSL-CORDIC, the sign bits, which are computed ahead to select which direction to rotate, are used to select one of the last iteration results, therefore, the data dependencies on the previous iterations are efficiently removed. Our proposed QR decomposition module is implemented using TSMC 0.25 ${\mu}M$ CMOS process. Experimental results show that the proposed QR architecture achieves 34.83% speed-up over the Compact CORDIC based architecture for the 4 ${\times}$ 4 matrix decomposition.

A STUDY ON THE GRID GENERATION FOR TWO-DIMENSIONAL FLOW USING A POTENTIAL SOLVER (포텐셜 해석자를 이용한 2차원 유동의 격자 생성 연구)

  • Lee, J.;Jung, K.
    • Journal of computational fluids engineering
    • /
    • v.21 no.1
    • /
    • pp.36-42
    • /
    • 2016
  • One of the obstacles on the grid generation for complex geometries with multi-block structured grids is the domain decomposition. In this paper, the domain decomposition for two-dimensional flow is studied using the flow characteristics. The potential flow equation with the source distribution on the panel surface is solved to extract the information of the flow. The current approach is applied to a two-dimensional cylinder and Bi-NACA0012 problems. The generated grids are applied to generic flow solvers and reasonable results are obtained. It can be concluded that the current methods is useful in the domain decomposition for the multi-block structured grid.

A System Decomposition Technique Using A Multi-Objective Genetic Algorithm (다목적 유전알고리듬을 이용한 시스템 분해 기법)

  • Park, Hyung-Wook;Kim, Min-Soo;Choi, Dong-Hoon
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.27 no.4
    • /
    • pp.499-506
    • /
    • 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 subcycles. In analyzing or optimizing such a coupled system, it is essential to determine the best order of the processes within these subcycles to reduce design cycle time and cost. This is accomplished by decomposing large multidisciplinary problems into several sub design structure matrices (DSMs) and processing them in parallel This paper proposes a new method for parallel decomposition of multidisciplinary problems to improve design efficiency by using the multi-objective genetic algorithm and two sample test cases are presented to show the effect of the suggested decomposition method.

The Multi-step Adomian Decomposition Method for Approximating a Fractional Smoking Habit Model

  • Zuriqat, Mohammad;Freihat, Asad
    • Kyungpook Mathematical Journal
    • /
    • v.60 no.4
    • /
    • pp.753-765
    • /
    • 2020
  • Smoking is one of the main causes of health problems and continues to be one of the world's most significant health challenges. In this paper, we use the multi-step Adomian decomposition method (MSADM) to obtain approximate analytical solutions for a mathematical fractional model of the evolution of the smoking habit. The proposed MSADM scheme is only a simple modification of the Adomian decomposition method (ADM), in which ADM is treated algorithmically with a sequence of small intervals (i.e. time step) for finding accurate approximate solutions to the corresponding problems. A comparative study between the new algorithm and the classical Runge-Kutta method is presented in the case of integer-order derivatives. The solutions obtained are also presented graphically. The results reveal that the method is effective and convenient for solving linear and nonlinear differential equations of fractional order.

A study of decomposition of applied eccentric load for multi-cell trapezoidal box girders (편심하중이 작용하는 제형 다실박스거더에서의 거동분리연구)

  • Kim Seung Jun;Han Keum Ho;Park Nam hoi;Kang Young Jong
    • Proceedings of the KSR Conference
    • /
    • 2005.11a
    • /
    • pp.229-234
    • /
    • 2005
  • Thin-walled multicell box girders subjected to an eccentric load can he produced the three global behaviors of flexure, torsion, and distortion. Specially in railway bridges subjected to much eccentric load, it is quite important to evaluate influences of torsion and distortion. But it is very difficult to evaluate each influences of major behaviors numerically. If we can decompose an eccentric load P into flexural, torsional, and distortional forces. we can execute quantitative analysis each influences of major behaviors. Decomposition of Applied Load for Thin-walled Rectangular multi-cell box girders is reserched by Park, Nam- Hoi(Development of a multicell Box Beam Element Including Distortional Degrees of Freedom, 2003). But researches about trapezoidal multi-cell section is insufficient. So, this paper deals with multi-cell trapezoidal box girders. An expanded method, which is based on the force decomposition method for a single cell box girder given by Nakai and Yoo, is developed herein to decompose eccentric load Pinto flexural, torsional, and distortional forces. Derive formulas by decomposition of eccentric load is verified by 3D shell-modelling numerical analysis.

  • PDF

Fixed-Complexity Sphere Encoder for Multi-User MIMO Systems

  • Mohaisen, Manar;Chang, Kyung-Hi
    • Journal of Communications and Networks
    • /
    • v.13 no.1
    • /
    • pp.63-69
    • /
    • 2011
  • In this paper, we propose a fixed-complexity sphere encoder (FSE) for multi-user multi-input multi-output (MU-MIMO) systems. The proposed FSE accomplishes a scalable tradeoff between performance and complexity. Also, because it has a parallel tree-search structure, the proposed encoder can be easily pipelined, leading to a tremendous reduction in the precoding latency. The complexity of the proposed encoder is also analyzed, and we propose two techniques that reduce it. Simulation and analytical results demonstrate that in a $4{\times}4$ MU-MIMO system, the proposed FSE requires only 11.5% of the computational complexity needed by the conventional QR decomposition with M-algorithm encoder (QRDM-E). Also, the encoding throughput of the proposed encoder is 7.5 times that of the QRDM-E with tolerable degradation in the BER performance, while achieving the optimum diversity order.

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.

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.