• Title/Summary/Keyword: Algorithm decomposition

Search Result 789, Processing Time 0.024 seconds

Projective Reconstruction from Multiple Images using Matrix Decomposition Constraints (행렬 분해 제약을 사용한 다중 영상에서의 투영 복원)

  • Ahn, Ho-Young;Park, Jong-Seung
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.6
    • /
    • pp.770-783
    • /
    • 2012
  • In this paper, we propose a novel structure recovery algorithm in the projective space using image feature points. We use normalized image feature coordinates for the numerical stability. To acquire an initial value of the structure and motion, we decompose the scaled measurement matrix using the singular value decomposition. When recovering structure and motion in projective space, we introduce matrix decomposition constraints. In the reconstruction procedure, a nonlinear iterative optimization technique is used. Experimental results showed that the proposed method provides proper accuracy and the error deviation is small.

The Impacts of Decomposition Levels in Wavelet Transform on Anomaly Detection from Hyperspectral Imagery

  • Yoo, Hee Young;Park, No-Wook
    • Korean Journal of Remote Sensing
    • /
    • v.28 no.6
    • /
    • pp.623-632
    • /
    • 2012
  • In this paper, we analyzed the effect of wavelet decomposition levels in feature extraction for anomaly detection from hyperspectral imagery. After wavelet analysis, anomaly detection was experimentally performed using the RX detector algorithm to analyze the detecting capabilities. From the experiment for anomaly detection using CASI imagery, the characteristics of extracted features and the changes of their patterns showed that radiance curves were simplified as wavelet transform progresses and H bands did not show significant differences between target anomaly and background in the previous levels. The results of anomaly detection and their ROC curves showed the best performance when using the appropriate sub-band decided from the visual interpretation of wavelet analysis which was L band at the decomposition level where the overall shape of profile was preserved. The results of this study would be used as fundamental information or guidelines when applying wavelet transform to feature extraction and selection from hyperspectral imagery. However, further researches for various anomaly targets and the quantitative selection of optimal decomposition levels are needed for generalization.

Parallel Processing Based Decompositon Technique for Efficient Collaborative Optimization (효율적 분산협동최적설계를 위한 병렬처리 기반 분해 기법)

  • Park, Hyeong-Uk;Kim, Seong-Chan;Kim, Min-Su;Choe, Dong-Hun
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.25 no.5
    • /
    • pp.883-890
    • /
    • 2001
  • In practical design studies, most of designers solve multidisciplinary problems with large size and complex design system. These multidisciplinary problems have hundreds of analysis and thousands of variables. The sequence of process to solve these problems affects the speed of total design cycle. Thus it is very important for designer to reorder the original design processes to minimize total computational cost. This is accomplished by decomposing large multidisciplinary problem into several multidisciplinary analysis subsystem (MDASS) and processing it in parallel. This paper proposes new strategy for parallel decomposition of multidisciplinary problem to raise design efficiency by using genetic algorithm and shows the relationship between decomposition and multidisciplinary design optimization (MDO) methodology.

Block Sparse Low-rank Matrix Decomposition based Visual Defect Inspection of Rail Track Surfaces

  • Zhang, Linna;Chen, Shiming;Cen, Yigang;Cen, Yi;Wang, Hengyou;Zeng, Ming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.12
    • /
    • pp.6043-6062
    • /
    • 2019
  • Low-rank matrix decomposition has shown its capability in many applications such as image in-painting, de-noising, background reconstruction and defect detection etc. In this paper, we consider the texture background of rail track images and the sparse foreground of the defects to construct a low-rank matrix decomposition model with block sparsity for defect inspection of rail tracks, which jointly minimizes the nuclear norm and the 2-1 norm. Similar to ADM, an alternative method is proposed in this study to solve the optimization problem. After image decomposition, the defect areas in the resulting low-rank image will form dark stripes that horizontally cross the entire image, indicating the preciselocations of the defects. Finally, a two-stage defect extraction method is proposed to locate the defect areas. The experimental results of the two datasets show that our algorithm achieved better performance compared with other methods.

Comparison of artificial intelligence models reconstructing missing wind signals in deep-cutting gorges

  • Zhen Wang;Jinsong Zhu;Ziyue Lu;Zhitian Zhang
    • Wind and Structures
    • /
    • v.38 no.1
    • /
    • pp.75-91
    • /
    • 2024
  • Reliable wind signal reconstruction can be beneficial to the operational safety of long-span bridges. Non-Gaussian characteristics of wind signals make the reconstruction process challenging. In this paper, non-Gaussian wind signals are converted into a combined prediction of two kinds of features, actual wind speeds and wind angles of attack. First, two decomposition techniques, empirical mode decomposition (EMD) and variational mode decomposition (VMD), are introduced to decompose wind signals into intrinsic mode functions (IMFs) to reduce the randomness of wind signals. Their principles and applicability are also discussed. Then, four artificial intelligence (AI) algorithms are utilized for wind signal reconstruction by combining the particle swarm optimization (PSO) algorithm with back propagation neural network (BPNN), support vector regression (SVR), long short-term memory (LSTM) and bidirectional long short-term memory (Bi-LSTM), respectively. Measured wind signals from a bridge site in a deep-cutting gorge are taken as experimental subjects. The results showed that the reconstruction error of high-frequency components of EMD is too large. On the contrary, VMD fully extracts the multiscale rules of the signal, reduces the component complexity. The combination of VMD-PSO-Bi-LSTM is demonstrated to be the most effective among all hybrid models.

Parallel Finite Element Analysis System Based on Domain Decomposition Method Bridges (영역분할법에 기반을 둔 병렬 유한요소해석 시스템)

  • Lee, Joon-Seong;Shioya, Ryuji;Lee, Eun-Chul;Lee, Yang-Chang
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.22 no.1
    • /
    • pp.35-44
    • /
    • 2009
  • This paper describes an application of domain decomposition method for parallel finite element analysis which is required to large scale 3D structural analysis. A parallel finite element method system which adopts a domain decomposition method is developed. Node is generated if its distance from existing node points is similar to the node spacing function at the point. The node spacing function is well controlled by the fuzzy knowledge processing. The Delaunay triangulation method is introduced as a basic tool for element generation. Domain decomposition method using automatic mesh generation system holds great benefits for 3D analyses. Aa parallel numerical algorithm for the finite element analyses, domain decomposition method was combined with an iterative solver, i.e. the conjugate gradient(CG) method where a whole analysis domain is fictitiously divided into a number of subdomains without overlapping. Practical performance of the present system are demonstrated through several examples.

Variational Mode Decomposition with Missing Data (결측치가 있는 자료에서의 변동모드분해법)

  • Choi, Guebin;Oh, Hee-Seok;Lee, Youngjo;Kim, Donghoh;Yu, Kyungsang
    • The Korean Journal of Applied Statistics
    • /
    • v.28 no.2
    • /
    • pp.159-174
    • /
    • 2015
  • Dragomiretskiy and Zosso (2014) developed a new decomposition method, termed variational mode decomposition (VMD), which is efficient for handling the tone detection and separation of signals. However, VMD may be inefficient in the presence of missing data since it is based on a fast Fourier transform (FFT) algorithm. To overcome this problem, we propose a new approach based on a novel combination of VMD and hierarchical (or h)-likelihood method. The h-likelihood provides an effective imputation methodology for missing data when VMD decomposes the signal into several meaningful modes. A simulation study and real data analysis demonstrates that the proposed method can produce substantially effective results.

An Efficient Robot Path Generation Using Delaunay Mesh (딜레노이 메시를 이용한 효율적인 로봇 경로 생성방법)

  • Noh, Sung-Woo;Ko, Nak-Yong;Kim, Kwang-Jin
    • The Journal of Korea Robotics Society
    • /
    • v.5 no.1
    • /
    • pp.41-47
    • /
    • 2010
  • This paper proposes a path planning method of a mobile robot in two-dimensional work space. The path planning method is based on a cell decomposition approach. To create a path which consists of a number of line segments, the Delaunay Triangulation algorithm is used. Using the cells produced by the Delaunay Triangulation algorithm, a mesh generation algorithm connects the starting position to the goal position. Dijkstra algorithm is used to find the shortest distance path. Greedy algorithm optimizes the path by deleting the path segments which detours without collision with obstacles.

Multi-Level Optimization for Steel Frames using Discrete Variables (이산형 변수를 이용한 뼈대구조물의 다단계 최적설계)

  • 조효남;민대용;박준용
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2000.10a
    • /
    • pp.115-124
    • /
    • 2000
  • An efficient multi-level (EML) optimization algorithm using discrete variables of framed structures is proposed in this paper. For the efficiency of the proposed algorithm multi-level optimization techniques using a decomposition method that separates both system-level and element-level are incorporated in the algorithm In the system-level, to save the numerical efforts an efficient reanalysis technique through approximated structural responses such as moments and frequencies with respect to intermediate variables is proposed in the paper. Sensitivity analysis of dynamic structural response is executed by automatic differentiation (AD) that is a powerful technique for computing complex or implicit derivatives accurately and efficiently with minimal human effort. In the element-level, to use AISC W-sections a section search algorithm is introduced. The efficiency and robustness of the EML algorithm, compared with a conventional multi-level (CML) algorithm and single-level genetic algorithm is successfully demonstrated in the numerical examples.

  • PDF

Morphological Hand-Gesture Recognition Algorithm (형태론적 손짓 인식 알고리즘)

  • Choi Jong-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.8
    • /
    • pp.1725-1731
    • /
    • 2004
  • The use of gestures provides an attractive alternate to cumbersome interface devices for human-computer interaction. This has motivated a very active research area concerned with computer vision-based analysis and interpretation of hand gestures. The most important issues in gesture recognition are the simplification of algorithm and the reduction of processing time. The mathematical morphology based on geometrical set theory is best used to perform the processing. A key idea of proposed algorithm in this paper is to apply morphological shape decomposition. The primitive elements extracted to a hand gesture include in very important information on the directivity of the hand gestures. Based on this characteristic, we proposed the morphological gesture recognition algorithm using feature vectors calculated to lines connecting the center points of a main-primitive element and sub-primitive elements. Through the experiment, we demonstrated the efficiency of proposed algorithm. Coupling natural interactions such as hand gesture with an appropriately designed interface is a valuable and powerful component in the building of TV switch navigating and video contents browsing system.