• Title/Summary/Keyword: problem decomposition

Search Result 590, Processing Time 0.026 seconds

Perceptual Fusion of Infrared and Visible Image through Variational Multiscale with Guide Filtering

  • Feng, Xin;Hu, Kaiqun
    • Journal of Information Processing Systems
    • /
    • v.15 no.6
    • /
    • pp.1296-1305
    • /
    • 2019
  • To solve the problem of poor noise suppression capability and frequent loss of edge contour and detailed information in current fusion methods, an infrared and visible light image fusion method based on variational multiscale decomposition is proposed. Firstly, the fused images are separately processed through variational multiscale decomposition to obtain texture components and structural components. The method of guided filter is used to carry out the fusion of the texture components of the fused image. In the structural component fusion, a method is proposed to measure the fused weights with phase consistency, sharpness, and brightness comprehensive information. Finally, the texture components of the two images are fused. The structure components are added to obtain the final fused image. The experimental results show that the proposed method displays very good noise robustness, and it also helps realize better fusion quality.

A High-Dimensional Index Structure Based on Singular Value Decomposition (Singular Value Decomposition 기반 고차원 인덱스 구조)

  • Kim, Sang-Wook;Aggarwal, Charu;Yu, Philip S.
    • Journal of Industrial Technology
    • /
    • v.20 no.B
    • /
    • pp.213-218
    • /
    • 2000
  • The nearest neighbor query is an important operation widely used in multimedia databases for finding the object that is most similar to a given query object. Most of techniques for processing nearest neighbor queries employ multidimensional indexes for effective indexing of objects. However, the performance of previous multidimensional indexes, which use N-dimensional rectangles or spheres for representing the capsule of the object cluster, deteriorates seriously as the number of dimensions gets higher. This paper proposes a new index structure based singular value decomposition resolving this problem and the query processing method using it. We also verify the superiority of our approach through performance evaluation by performing extensive experiments.

  • PDF

A study on the proper orthogonal decomposition of the structural dynamic system (구조진동시스템의 적합직교분해에 관한 연구)

  • Baek, Sung-Min;Cho, Maeng-Hyo
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2010.04a
    • /
    • pp.171-174
    • /
    • 2010
  • 적절한 근사화 과정을 통하여 구축된 축소 시스템은 전체 시스템의 거동을 적은 수의 정보를 통하여 효과적으로 표현할 수 있다. 효과적인 시스템 축소를 위하여 본 연구에서는 주파수 영역 Karhunen-Loeve (Frequency-domain Karhunen-Loeve, FDKL) 기법과 시스템 등가 확장 축소 과정(System equivalent expansion reduction process, SEREP)을 연동한 축소 기법을 제안한다. 적합직교분해(Proper orthogonal decomposition)의 한 방법인 FDKL기법을 통하여 최적모드(Optimal mode)를 구하고 이에 SEREP을 적용하여 자유도 변환 행렬을 구한다. 이때 주자유도 선정은 2단계 축소기법을 적용한다. 최종적으로 제안된 기법은 수치예제를 통하여 검증한다.

  • PDF

An Efficient Implementation of Optimal Power Flow using the Alternating Direction Method (Alternating Direction Method를 이용한 최적조류계산의 분산처리)

  • Kim, Ho-Woong;Park, Marn-Kuen;Kim, Bal-Ho
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.11
    • /
    • pp.1424-1428
    • /
    • 1999
  • This paper presents a mathematical decomposition coordination method to implementing the distributed optimal power flow (OPF), wherein a regional decomposition technique is adopted to parallelize the OPT. The proposed approach is based on the Alternating Direction Method (ADM), a variant of the conventional Augmented Lagrangian approach, and makes it possible the independent regional AC-OPF for each control area while the global optimum for the entire system is assured. This paper is an extension of our previous work based on the auxiliary problem principle (APP). The proposed approach in this paper is a completely new one, however, in that ADM is based on the Proximal Point Algorithm which has long been recognized as one of the attractive methods for convex programming and min-max-convex-concave programming. The proposed method was demonstrated with IEEE 50-Bus system.

  • PDF

Determination of Trace Anions in Concentrated Hydrogen Peroxide by Direct Injection Ion Chromatography with Conductivity Detection after Pt-Catalyzed On-Line Decomposition

  • 김도희;이보경;이동수
    • Bulletin of the Korean Chemical Society
    • /
    • v.20 no.6
    • /
    • pp.696-700
    • /
    • 1999
  • A method has been developed for the determination of trace anion impurities in concentrated hydrogen peroxide. The method involves on-line decomposition of hydrogen peroxide, ion chromatographic separation and subsequent suppressed-type conductivity detection. H2O2 is decomposed in Pt-catalyst filled Gore-Tex membrane tubing and the resulting aqueous solution containing analytes is introduced to the injection valve of an ion chromatograph for periodic determinations. The oxygen gas evolving within the membrane tubing escapes freely through the membrane wall causing no problem in ion chromatographic analysis. Decomposition efficiency is above 99.99% at a flow rate of 0.4mL/min for a 30% hydrogen peroxide concentration. Analytes are quantitatively retained. The analysis results for several brands of commercial hydrogen peroxides are reported.

Proper orthogonal decomposition in wind engineering - Part 2: Theoretical aspects and some applications

  • Carassale, Luigi;Solari, Giovanni;Tubino, Federica
    • Wind and Structures
    • /
    • v.10 no.2
    • /
    • pp.177-208
    • /
    • 2007
  • Few mathematical methods attracted theoretical and applied researches, both in the scientific and humanist fields, as the Proper Orthogonal Decomposition (POD) made throughout the last century. However, most of these fields often developed POD in autonomous ways and with different names, discovering more and more times what other scholars already knew in different sectors. This situation originated a broad band of methods and applications, whose collation requires working out a comprehensive viewpoint on the representation problem for random quantities. Based on these premises, this paper provides and discusses the theoretical foundations of POD in a homogeneous framework, emphasising the link between its general position and formulation and its prevalent use in wind engineering. Referring to this framework, some applications recently developed at the University of Genoa are shown and revised. General remarks and some prospects are finally drawn.

Automatic Generation of Mid-Surfaces of Solid Models by Maximal Volume Decomposition (최대볼륨분해 방법을 이용한 중립면 모델의 자동생성)

  • Woo, Yoon-Hwan;Choo, Chang-Upp
    • Korean Journal of Computational Design and Engineering
    • /
    • v.14 no.5
    • /
    • pp.297-305
    • /
    • 2009
  • Automatic generation of the mid-surfaces of a CAD model is becoming a useful function in that it can help increase the efficiency of engineering analysis as far as it does not affect the result seriously. Several methods had been proposed previously to automatically generate the mid-surfaces, but they often failed to generate the mid-surfaces of complex CAD models. Due to the inherent difficulty of this mid-surface generation problem, it may not be possible to come up with a complete and general method to solve this problem. Since a method that can handle a specific case may not work for different cases, it seems that developing case-specific methods ends up with solving only a fraction of the problem. In this paper, therefore, we propose a method to generate mid-surfaces based on a divide-and-conquer paradigm. This method first decomposes a complex CAD model into simple volumes. The mid-surfaces of the simple volumes are automatically generated by the existing methods, and then they are converted into the mid-surfaces of the original CAD model.

Development of a Package for the Multi-Location Problem by Genetic Algorithm (유전 알고리즘을 이용한 복수 물류센터 입지분석용 패키지의 개발)

  • Yang, Byung-Hak
    • IE interfaces
    • /
    • v.13 no.3
    • /
    • pp.479-485
    • /
    • 2000
  • We consider a Location-Allocation Problem with the Cost of Land(LAPCL). LAPCL has extremely huge size of problem and complex characteristic of location and allocation problem. Heuristics and decomposition approaches on simple Location-Allocation Problem were well developed in last three decades. Recently, genetic algorithm(GA) is used widely at combinatorics and NLP fields. A lot of research shows that GA has efficiency for finding good solution. Our main motive of this research is developing of a package for LAPCL. We found that LAPCL could be reduced to trivial problem, if locations were given. In this case, we can calculate fitness function by simple technique. We built a database constructed by zipcode, latitude, longitude, administrative address and posted land price. This database enables any real field problem to be coded into a mathematical location problem. We developed a package for a class of multi-location problem at PC. The package allows for an interactive interface between user and computer so that user can generate various solutions easily.

  • PDF

Computational Efficiency of Thermo-Elasto-Viscoplastic Damage and Contact Analyses by Domain/Boundary Decomposition (영역/경계 분할에 의한 열탄점소성 손상 및 접촉 해석의 효율화)

  • Kim, Sung-Jun;Shin, Eui-Sup
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.22 no.2
    • /
    • pp.153-161
    • /
    • 2009
  • A domain/boundary decomposition method is applied for efficient analyses of thermo-elasto-viscoplastic damage and contact problems under the assumption of infinitesimal deformation. For the decomposition of a whole domain and contact boundaries, all the equality constraints on the interface and contact interfaces are restated with simple penalty functional. Therefore, the non-linearity of the problem is localized within finite element matrices in a few subdomains and on contact interfaces. By setting up suitable solution algorithms, the computational efficiency can be improved considerably. The general tendency of the computational efficiency is illustrated with some numerical experiments.

Prediction of Core Promoter Region with Dependency - Reflecting Decomposition Model (의존성 반영 분해모델에 의한 유전자의 핵심 프로모터 영역 예측)

  • 김기봉;박기정;공은배
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.3_4
    • /
    • pp.379-387
    • /
    • 2003
  • A lot of microbial genome projects have been completed to pour the enormous amount of genomic sequence data. In this context. the problem of identifying promoters in genomic DNA sequences by computational methods has attracted considerable research attention in recent years. In this paper, we propose a new model of prokaryotic core promoter region including the -10 region and transcription initiation site, that is Dependency-Reflecting Decomposition Model (DRDM), which captures the most significant biological dependencies between positions (allowing for non-adjacent as well as adjacent dependencies). DRDM showed a good result of performance test and it will be employed effectively in predicting promoters in long microbial genomic Contigs.