• 제목/요약/키워드: model update

검색결과 646건 처리시간 0.026초

Establishment of Priority Update Area for Land Coverage Classification Using Orthoimages and Serial Cadastral Maps

  • Song, Junyoung;Won, Taeyeon;Jo, Su Min;Eo, Yang Dam;Park, Jin Sue
    • 대한원격탐사학회지
    • /
    • 제37권4호
    • /
    • pp.763-776
    • /
    • 2021
  • This paper introduces a method of selecting priority update areas for subdivided land cover maps by training orthoimages and serial cadastral maps in a deep learning model. For the experiment, orthoimages and serial cadastral maps were obtained from the National Spatial Data Infrastructure Portal. Based on the VGG-16 model, 51,470 images were trained on 33 subdivided classifications within the experimental area and an accuracy evaluation was conducted. The overall accuracy was 61.42%. In addition, using the differences in the classification prediction probability of the misclassified polygon and the cosine similarity that numerically expresses the similarity of the land category features with the original subdivided land cover class, the cases were classified and the areas in which the boundary setting was incorrect and in which the image itself was determined to have a problem were identified as the priority update polygons that should be checked by operators.

LSU 메시지 수를 제어 가능한 QoS 라우팅 링크 상태 갱신 알고리즘 (LSU Message Count Controlled Link State Update Algorithm in QoS Routin)

  • 조강홍;김남훈
    • 한국컴퓨터정보학회논문지
    • /
    • 제17권6호
    • /
    • pp.75-81
    • /
    • 2012
  • 본 논문에서는 QoS 라우팅 알고리즘의 성능을 유지하면서 LSU(Link State Update) 메시지의 수를 제어할 수 있는 QoS 라우팅 링크 상태 갱신 알고리즘을 제안하였다. 기존에 제시된 대부분의 LSU 알고리즘은 QoS 라우팅의 성능을 향상시키는데 중점을 두고 있기 때문에 LSU 메시지의 수가 늘어나더라도 제어할 수 있는 메커니즘을 가지고 있지 않다. 특히 트래픽 통계에 근거한 적응형 알고리즘의 경우 더욱더 그러하며 트래픽이 과도하거나 변화가 심할 경우 이와 비례해서 LSU 메시지 수도 증가하여 과도한 LSU 메시지가 성능을 오히려 좋지 않게 한다. 제시하는 알고리즘은 QoS 라우팅 성능과 상충관계에 있는 과도한 LSU 메시지의 수를 제어하기 위해 요구 대역폭이 가용대역폭에 미치는 영향에 따라 LSU 메시지의 중요도를 구분하고 중요도와 단위시간 당 업데이트 비율 ${\gamma}$에 따라 LSU 메시지의 전송 여부를 결정하여 LSU 메시지 수를 제어한다. 성능 평가를 위해 기존에 제시된 다양한 LSU 알고리즘과 본 논문에서 제안하는 알고리즘을 MCI 네트워크상에서 라우팅 Blocking 확률과 링크 당 평균 LSU 메시지의 개수 등을 성능 평가 항목으로 하여 시뮬레이션을 수행하였고 제안하는 알고리즘의 우수성을 확인하였다.

LIDAR 자료를 이용한 수치지도 건물레이어 갱신 (Building Layer Update of Digital Map using LIDAR Data)

  • 김성삼;구신회;김원석;유환희
    • 한국측량학회:학술대회논문집
    • /
    • 한국측량학회 2006년도 춘계학술발표회 논문집
    • /
    • pp.411-417
    • /
    • 2006
  • As NGIS project has been implemented in 1995 and effectiveness of spatial information increased, Digital maps serve several purpose in administrative, living, and industrial fields. But, Digital maps have many differences with real world information and difficulties in application of managing urban facilities due to high update cost and long generation period. In this study, We suggest methodology to update a building layer of digital map in urban area as regenerating a building layer by detection of changed buildings in the existing digital map anf extraction using LIDAR data and Aerial images, more easier to acquire data and available to guarantee accuracy. Experimental results are expected to applied for constructing 3D urban model in a broad expensive urban area.

  • PDF

내포 질의의 효율적 평가를 위한 분리 색인 기법 (A Separated Indexing Technique for Efficient Evaluation of Nested Queries)

  • 권영무;박용진
    • 전자공학회논문지B
    • /
    • 제29B권7호
    • /
    • pp.11-22
    • /
    • 1992
  • In this paper, a new indexing technique is proposed for efficient evaluation of nested queries on aggregation hierarchy in object-oriented data model. As an index data structure, an extended $B^{+}$ tree is introduced in which instance identifier to be searched and path information used for update of index record are stored in leaf node and subleaf node, respectively. the retrieval and update algorithm on the introduced index data structure is provided. Comparisons under a variety of conditions are given with current indexing techniques, showing improved performance in cost, i.e., the total number of pages accessed for retrieval and update.

  • PDF

다중 상태 기반의 이동성에 대한 혼합형 위치 갱신 방법의 성능분석 (Performance Analysis of Hybrid Location Update Strategy for Multi-States Based Mobile Users)

  • 이구연
    • 산업기술연구
    • /
    • 제27권A호
    • /
    • pp.141-147
    • /
    • 2007
  • In this paper, we define the multi-states exponential cell resident time mobility model for describing the mobility characteristics of mobile user and analyzed the total cost of the hybrid method using multi-states cell resident time. Generally, the mobile user has three states for its movement, such as staying, walking and driving. This multi-states cell resident time based hybrid method reflects the movement characteristics of mobile user and adapts the location update period according to the states of mobility speed. As a results of the performance analysis, we can get the optimum parameters of the hybrid method for multi-states based mobile users.

  • PDF

외부 센서를 이용한 이동 로봇 실내 위치 추정 (Indoor Localization of a Mobile Robot Using External Sensor)

  • 고낙용;김태균
    • 제어로봇시스템학회논문지
    • /
    • 제16권5호
    • /
    • pp.420-427
    • /
    • 2010
  • This paper describes a localization method based on Monte Carlo Localization approach for a mobile robot. The method uses range data which are measured from ultrasound transmitting beacons whose locations are given a priori. The ultrasound receiver on-board a robot detects the range from the beacons. The method requires several beacons, theoretically over three. The method proposes a sensor model for the range sensing based on statistical analysis of the sensor output. The experiment uses commercialized beacons and detector which are used for trilateration localization. The performance of the proposed method is verified through real implementation. Especially, it is shown that the performance of the localization degrades as the sensor update rate decreases compared with the MCL algorithm update rate. Though the method requires exact location of the beacons, it doesn't require geometrical map information of the environment. Also, it is applicable to estimation of the location of both the beacons and robot simultaneously.

최적화용 신경망의 성능개선을 위한 새로운 최적화 기법 (A new optimization method for improving the performance of neural networks for optimization)

  • 조영현
    • 전자공학회논문지C
    • /
    • 제34C권12호
    • /
    • pp.61-69
    • /
    • 1997
  • This paper proposes a new method for improving the performances of the neural network for optimization using a hyubrid of gradient descent method and dynamic tunneling system. The update rule of gradient descent method, which has the fast convergence characteristic, is applied for high-speed optimization. The update rule of dynamic tunneling system, which is the deterministic method with a tunneling phenomenon, is applied for global optimization. Having converged to the for escaping the local minima by applying the dynamic tunneling system. The proposed method has been applied to the travelling salesman problems and the optimal task partition problems to evaluate to that of hopfield model using the update rule of gradient descent method.

  • PDF

The Study on Nonlinear Compensation Characteristics of Multi-tap Update Algorithm in Broadband PCS Channel

  • 이승대
    • 한국컴퓨터산업학회논문지
    • /
    • 제9권2호
    • /
    • pp.77-82
    • /
    • 2008
  • The diversity reception and the equal gain combining technique are applied to the compensation of the distortion of channel, which occurs in transmission of data at rapid speed. DSSS BPSK system which has the receiving structure with the compensation algorithm is formed on the diversity branch, and the characteristics of the system are evaluated at the view point of the average bit error rate due to the SNR. In addition, the multi-tap update algorithm which is superior for the data compensation is suggested. Moreover, using the American Joint Technical Committee PCS RF channel characterization and system deployment model standard, the suggested multi-tap update algorithm is compared and analyzed with the view-point of the average bit error rate and convergence speed for evaluating the realistic efficiency of the system.

  • PDF

Object Tracking Based on Weighted Local Sub-space Reconstruction Error

  • Zeng, Xianyou;Xu, Long;Hu, Shaohai;Zhao, Ruizhen;Feng, Wanli
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권2호
    • /
    • pp.871-891
    • /
    • 2019
  • Visual tracking is a challenging task that needs learning an effective model to handle the changes of target appearance caused by factors such as pose variation, illumination change, occlusion and motion blur. In this paper, a novel tracking algorithm based on weighted local sub-space reconstruction error is presented. First, accounting for the appearance changes in the tracking process, a generative weight calculation method based on structural reconstruction error is proposed. Furthermore, a template update scheme of occlusion-aware is introduced, in which we reconstruct a new template instead of simply exploiting the best observation for template update. The effectiveness and feasibility of the proposed algorithm are verified by comparing it with some state-of-the-art algorithms quantitatively and qualitatively.

효율적인 실시간 차량 시뮬레이션을 위한 자코비안 갱신이 불필요한 뉴턴 적분방법 (A Jacobian Update-Free Newton's Method for Efficient Real-Time Vehicle Simulation)

  • 강종수;임준현;배대성
    • 한국생산제조학회지
    • /
    • 제23권4호
    • /
    • pp.337-344
    • /
    • 2014
  • While implicit integration methods such as Newton's method have excellent stability for the analysis of stiff and constrained mechanical systems, they have the drawback that the evaluation and LU-factorization of the system Jacobian matrix required at every time step are time-consuming. This paper proposes a Jacobian update-free Newton's method in order to overcome these defects. Because the motions of all bodies in a vehicle model are limited with respect to the chassis body, the equations are formulated with respect to the moving chassis-body reference frame instead of the fixed inertial reference frame. This makes the system Jacobian remain nearly constant, and thus allows the Newton's method to be free from the Jacobian update. Consequently, the proposed method significantly decreases the computational cost of the vehicle dynamic simulation. This paper provides detailed generalized formulation procedures for the equations of motion, constraint equations, and generalized forces of the proposed method.