• Title/Summary/Keyword: Split-Algorithm

Search Result 316, Processing Time 0.024 seconds

A BI-Level Programming Model for Transportation Network Design (BI-Level Programming 기법을 이용한 교통 네트워크 평가방법 연구)

  • Kim, Byung-Jong;Kim, Won-Kyu
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.7 s.85
    • /
    • pp.111-123
    • /
    • 2005
  • A network design model has been proposed. which represents a transportation facility investment decision problem. The model takes the discrete hi-level programming form in which two types of decision makers, government and travelers, are involved. The model is characterized by its ability to address the total social costs occurring in transportation networks and to estimate the equilibrium link volumes in multi-modal networks. Travel time and volume for each link in the multi-modal network are predicted by a joint modal split/traffic assignment model. An efficient solution algorithm has been developed and an illustrative example has been presented.

Partitioned coupling strategies for fluid-structure interaction with large displacement: Explicit, implicit and semi-implicit schemes

  • He, Tao
    • Wind and Structures
    • /
    • v.20 no.3
    • /
    • pp.423-448
    • /
    • 2015
  • In this paper the unsteady fluid-structure interaction (FSI) problems with large structural displacement are solved by partitioned solution approaches in the arbitrary Lagrangian-Eulerian finite element framework. The incompressible Navier-Stokes equations are solved by the characteristic-based split (CBS) scheme. Both a rigid body and a geometrically nonlinear solid are considered as the structural models. The latter is solved by Newton-Raphson procedure. The equation governing the structural motion is advanced by Newmark-${\beta}$ method in time. The dynamic mesh is updated by using moving submesh approach that cooperates with the ortho-semi-torsional spring analogy method. A mass source term (MST) is introduced into the CBS scheme to satisfy geometric conservation law. Three partitioned coupling strategies are developed to take FSI into account, involving the explicit, implicit and semi-implicit schemes. The semi-implicit scheme is a mixture of the explicit and implicit coupling schemes due to the fluid projection splitting. In this scheme MST is renewed for interfacial elements. Fixed-point algorithm with Aitken's ${\Delta}^2$ method is carried out to couple different solvers within the implicit and semi-implicit schemes. Flow-induced vibrations of a bridge deck and a flexible cantilever behind an obstacle are analyzed to test the performance of the proposed methods. The overall numerical results agree well with the existing data, demonstrating the validity and applicability of the present approaches.

The Facial Area Extraction Using Multi-Channel Skin Color Model and The Facial Recognition Using Efficient Feature Vectors (Multi-Channel 피부색 모델을 이용한 얼굴영역추출과 효율적인 특징벡터를 이용한 얼굴 인식)

  • Choi Gwang-Mi;Kim Hyeong-Gyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.7
    • /
    • pp.1513-1517
    • /
    • 2005
  • In this paper, I make use of a Multi-Channel skin color model with Hue, Cb, Cg using Red, Blue, Green channel altogether which remove bight component as being consider the characteristics of skin color to do modeling more effective to a facial skin color for extracting a facial area. 1 used efficient HOLA(Higher order local autocorrelation function) using 26 feature vectors to obtain both feature vectors of a facial area and the edge image extraction using Harr wavelet in image which split a facial area. Calculated feature vectors are used of date for the facial recognition through learning of neural network It demonstrate improvement in both the recognition rate and speed by proposed algorithm through simulation.

Performance Improvement of Tree Structured Subband Filtering (트리구조 필터뱅크를 이용한 서브밴드 필터링에서의 수렴 성능 향상)

  • 최창권;조병모
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.4 no.2
    • /
    • pp.407-416
    • /
    • 2000
  • Adaptive digital filtering and noise cancelling technique using a tree structured filter bank are presented to reduce a undesirable aliasing due to the decimation of filtered output and improve the performance in terms of mean-square error and the convergence speed using a aliasing canceller. A signal is split into two subband by analysis filter bank and decimated by decimator and reconstructed by interpolation technique and synthesis filter bank. A variable step-size LMS algorithm is used to improve the convergence speed in case of existing the measurement noise in desired input of filter. It is shown by computer simulation that the proposed subband structure in this paper is superior to conventional subband filter structure in terms of mean-square error and convergence speed.

  • PDF

Efficient Sphere Partition Method for Finding the Maximum Intersection of Spherical Convex Polygons (구 볼록 다각형들의 최대 교차를 찾기 위한 효율적인 구 분할 방식)

  • 하종성
    • Korean Journal of Computational Design and Engineering
    • /
    • v.6 no.2
    • /
    • pp.101-110
    • /
    • 2001
  • The maximum intersection of spherical convex polygons are to find spherical regions owned by the maximum number of the polygons, which is applicable for determining the feasibility in manufacturing problems such mould design and numerical controlled machining. In this paper, an efficient method for partitioning a sphere with the polygons into faces is presented for the maximum intersection. The maximum intersection is determined by examining the ownerships of partitioned faces, which represent how many polygons contain the faces. We take the approach of edge-based partition, in which, rather than the ownerships of faces, those of their edges are manipulated as the sphere is partitioned incrementally by each of the polygons. Finally, gathering the split edges with the maximum number of ownerships as the form of discrete data, we approximately obtain the centroids of all solution faces without constructing their boundaries. Our approach is analyzed to have an efficient time complexity Ο(nv), where n and v, respectively, are the numbers of polygons and all vertices. Futhermore, it is practical from the view of implementation since it can compute numerical values robustly and deal with all degenerate cases.

  • PDF

Estimation of daily maximum air temperature using NOAA/AVHRR data (NOAA/AVHRR 자료를 이용한 일 최고기온 추정에 관한 연구)

  • 변민정;한영호;김영섭
    • Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
    • /
    • 2003.04a
    • /
    • pp.291-296
    • /
    • 2003
  • This study estimated surface temperature by using split-window technique and NOAA/AVHRR data was used. For surface monitoring, cloud masking procedure was carried out using threshold algorithm. The daily maximum air temperature is estimated by multiple regression method using independent variables such as satellite-derived surface temperature, EDD, and latitude. When the EDD data added, the highest correlation shown. This indicates that EDD data is the necessary element for estimation of the daily maximum air temperature. We derived correlation and experience equation by three approaching method to estimate daily maximum air temperature. 1) non-considering landcover method as season, 2) considering landcover method as season, and 3) just method as landcover. The last approaching method shows the highest correlation. So cross-validation procedure was used in third method for validation of the estimated value. For all landcover type 5, the results using the cross-validation procedure show reasonable agreement with measured values(slope=0.97, intercept=-0.30, R$^2$=0.84, RMSE=4.24$^{\circ}C$). Also, for all landcover type 7, the results using the cross-validation procedure show reasonable agreement with measured values(slope=0.993, Intercept=0.062, R$^2$=0.84, RMSE=4.43$^{\circ}C$).

  • PDF

VA-Tree : An Efficient Multi-Dimensional Index Structure for Large Data Set (VA-Tree : 대용량 데이터를 위한 효율적인 다차원 색인구조)

  • 송석일;이석희;조기형;유재수
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.5
    • /
    • pp.753-768
    • /
    • 2003
  • In this paper, we propose a multi-dimensional index structure, tailed a VA(Vector Approximate)-tree that is constructed with vector approximates of multi-dimensional feature vectors. To save storage space for index structures, the VA-tree employs vector approximation concepts of VA-file that presents feature vectors with much smaller number of bits than original value. Since the VA-tree is a tree structure, it does not suffer from performance degradation owing to the increase of data. Also, even though the VA-tree is MBR(Minimum Bounding Region) based tree structure like a R-tree, its split algorithm never allows overlap between MBRs. We show through various experiments that our proposed VA-tree is a suitable index structure for large amount of multi-dimensional data.

  • PDF

단일 밴드 중적외선 영상을 이용한 표면온도 추정 방법 연구

  • Park, Uk;Lee, Yun-Gyeong;Won, Jung-Seon;Lee, Seung-Geun;Kim, Jong-Min
    • Proceedings of the KSRS Conference
    • /
    • 2008.03a
    • /
    • pp.125-130
    • /
    • 2008
  • Mid-Infrared (MIR) 영상은 화산 활동 및 산불로 인한 재난관측, 지표물질 관측, 해수 온도 측정과 같은 분야들에서 사용되고 있다. 그러나 MIR영역은 지표의 복사율과 대기의 영향으로 인한 변화가 매우 심하고, 낮 영상의 경우 태양 복사량에 의한 영향도 고려해야 하는 어려움이 있다. 따라서 단일밴드인 MIR영상을 이용하여 표면온도를 얻기 위해서는 영상이 취득된 시간과 장소에서 관측된 태양 복사량 및 여러 가지 대기 변수가 필요하다. 본 연구의 목적은 기존의 MIR 영상 연구가 다중밴드를 기반으로 한 것과 달리 단일 밴드의 영상을 이용하여 표면온도를 측정하는데 있다. 이를 위하여 MODIS MIR 영상을 대상으로 MODTRAN을 사용하여 MIR 영역의 대기보정 기법을 적용 한 뒤 복사전달 모델을 이용하여 지표의 복사량을 측정하였다. 획득된 지표온도 영상의 정밀도를 측정하기 위해서 기존의 온도 알고리즘인 split-window algorithm에 의해 얻어진 해수온도 영상과의 비교를 통하여 오차 원인에 대해 분석을 실시하였다. 그 결과 낮 영상의 경우 -4.19${\pm}$1.19$^{\circ}C$ 정도의 온도 차가 났으며, 밤 영상의 경우 0.5$^{\pm}C$0.39$^{\circ}C$ 정도로 비교적 좋은 결과를 보였다. 이는 낮 영상의 경우 지표의 복사율에 대한 온도의 민감도가 매우 높기 때문에 높은 오차가 발생하지만, 밤 영상의 경우 태양빛에 의한 영향이 없으므로 좋은 결과를 나타내기 때문이다. 따라서 단일밴드 MIR영상을 이용한 지표온도 추정 시 대기에 의한 영향보다 지표 복사율에 의한 영향이 높다고 추정할 수 있다.

  • PDF

A Continuous Network Design Model for Target-Oriented Transport Mode Choice Problem (목표지향 교통수단선택을 위한 연속형 교통망설계모형)

  • Im, Yong-Taek
    • Journal of Korean Society of Transportation
    • /
    • v.27 no.6
    • /
    • pp.157-166
    • /
    • 2009
  • A network design problem (NDP) is to find a design parameter to optimize the performance of transportation system. This paper presents a modified NDP, called target-oriented NDP, which contains a target that we try to arrive in real world, and also proposes a solution algorithm. Unlike general NDP which seeks an optimal value to minimize or to maximize objective function of the system, in target-oriented NDP traffic manager or operator can set a target level prior and then try to find an optimal design variable to attain this goal. A simple example for mode choice problem is given to test the model.

Real-Time Vehicle Detector with Dynamic Segmentation and Rule-based Tracking Reasoning for Complex Traffic Conditions

  • Wu, Bing-Fei;Juang, Jhy-Hong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.12
    • /
    • pp.2355-2373
    • /
    • 2011
  • Vision-based vehicle detector systems are becoming increasingly important in ITS applications. Real-time operation, robustness, precision, accurate estimation of traffic parameters, and ease of setup are important features to be considered in developing such systems. Further, accurate vehicle detection is difficult in varied complex traffic environments. These environments include changes in weather as well as challenging traffic conditions, such as shadow effects and jams. To meet real-time requirements, the proposed system first applies a color background to extract moving objects, which are then tracked by considering their relative distances and directions. To achieve robustness and precision, the color background is regularly updated by the proposed algorithm to overcome luminance variations. This paper also proposes a scheme of feedback compensation to resolve background convergence errors, which occur when vehicles temporarily park on the roadside while the background image is being converged. Next, vehicle occlusion is resolved using the proposed prior split approach and through reasoning for rule-based tracking. This approach can automatically detect straight lanes. Following this step, trajectories are applied to derive traffic parameters; finally, to facilitate easy setup, we propose a means to automate the setting of the system parameters. Experimental results show that the system can operate well under various complex traffic conditions in real time.