• Title/Summary/Keyword: Model Updating

Search Result 568, Processing Time 0.032 seconds

A Study on Building Object Change Detection using Spatial Information - Building DB based on Road Name Address - (기구축 공간정보를 활용한 건물객체 변화 탐지 연구 - 도로명주소건물DB 중심으로 -)

  • Lee, Insu;Yeon, Sunghyun;Jeong, Hohyun
    • Journal of Cadastre & Land InformatiX
    • /
    • v.52 no.1
    • /
    • pp.105-118
    • /
    • 2022
  • The demand for information related to 3D spatial objects model in metaverse, smart cities, digital twins, autonomous vehicles, urban air mobility will be increased. 3D model construction for spatial objects is possible with various equipments such as satellite-, aerial-, ground platforms and technologies such as modeling, artificial intelligence, image matching. However, it is not easy to quickly detect and convert spatial objects that need updating. In this study, based on spatial information (features) and attributes, using matching elements such as address code, number of floors, building name, and area, the converged building DB and the detected building DB are constructed. Both to support above and to verify the suitability of object selection that needs to be updated, one system prototype was developed. When constructing the converged building DB, the convergence of spatial information and attributes was impossible or failed in some buildings, and the matching rate was low at about 80%. It is believed that this is due to omitting of attributes about many building objects, especially in the pilot test area. This system prototype will support the establishment of an efficient drone shooting plan for the rapid update of 3D spatial objects, thereby preventing duplication and unnecessary construction of spatial objects, thereby greatly contributing to object improvement and cost reduction.

The Macroeconomic Impacts of Korean Elections and Their Future Consequences (선거(選擧)의 거시경제적(巨視經濟的) 충격(衝擊)과 파급효과(波及效果))

  • Shim, Sang-dal;Lee, Hang-yong
    • KDI Journal of Economic Policy
    • /
    • v.14 no.1
    • /
    • pp.147-165
    • /
    • 1992
  • This paper analyzes the macroeconomic effects of elections on the Korean economy and their future ramifications. It measures the shocks to the Korean economy caused by elections by taking the average of sample forecast errors from four major elections held in the 1980s. The seven variables' Bayesian Vector Autoregression Model which includes the Monetary Base, Industrial Production, Consumption, Consumer Price, Exports, and Investment is based on the quarterly time series data starting from 1970 and is updated every quarter before forecasts are made for the next quarter. Because of this updating of coefficients, which reflects in part the rapid structural changes of the Korean economy, this study can capture the shock effect of elections, which is not possible when using election dummies with a fixed coefficient model. In past elections, especially the elections held in the 1980s, $M_2$ did not show any particular movement, but the currency and base money increased during the quarter of the election was held and the increment was partly recalled in the next quarter. The liquidity of interest rates as measured by corporate bond yields fell during the quarter the election and then rose in the following quarter, which is somewhat contrary to the general concern that interest rates will increase during election periods. Manufacturing employment fell in the quarter of the election because workers turned into campaigners. This decline in employment combined with voting holiday produce a sizeable decline in industrial production during the quarter in which elections are held, but production catches up in the next quarter and sometimes more than offsets the disruption caused during the election quarter. The major shocks to price occur in the previous quarter, reflecting the expectational effect and the relaxation of government price control before the election when we simulate the impulse responses of the VAR model, imposing the same shocks that was measured in the past elections for each election to be held in 1992 and assuming that the elections in 1992 will affect the economy in the same manner as in the 1980s elections, 1992 is expected to see a sizeable increase in monetary base due to election and prices increase pressure will be amplified substantially. On the other hand, the consumption increase due to election is expected to be relatively small and the production will not decrease. Despite increased liquidity, a large portion of liquidity in circulation being used as election funds will distort the flow of funds and aggravate the fund shortage causing investments in plant and equipment and construction activities to stagnate. These effects will be greatly amplified if elections for the head of local government are going to be held this year. If mayoral and gubernatorial elections are held after National Assembly elections, their effect on prices and investment will be approximately double what they normally will have been have only congressional and presidential elections been held. Even when mayoral and gubernatorial elections are held at the same time as congressional elections, the elections of local government heads are shown to add substantial effects to the economy for the year. The above results are based on the assumption that this year's elections will shock the economy in the same manner as in past elections. However, elections in consecutive quarters do not give the economy a chance to pause and recuperate from past elections. This year's elections may have greater effects on prices and production than shown in the model's simulations because campaigners' return to industry may be delayed. Therefore, we may not see a rapid recall of money after elections. In view of the surge in the monetary base and price escalation in the periods before and after elections, economic management in 1992 should place its first priority on controlling the monetary aggregate, in particular, stabilizing the growth of the monetary base.

  • PDF

A Real-Time Head Tracking Algorithm Using Mean-Shift Color Convergence and Shape Based Refinement (Mean-Shift의 색 수렴성과 모양 기반의 재조정을 이용한 실시간 머리 추적 알고리즘)

  • Jeong Dong-Gil;Kang Dong-Goo;Yang Yu Kyung;Ra Jong Beom
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.6
    • /
    • pp.1-8
    • /
    • 2005
  • In this paper, we propose a two-stage head tracking algorithm adequate for real-time active camera system having pan-tilt-zoom functions. In the color convergence stage, we first assume that the shape of a head is an ellipse and its model color histogram is acquired in advance. Then, the min-shift method is applied to roughly estimate a target position by examining the histogram similarity of the model and a candidate ellipse. To reflect the temporal change of object color and enhance the reliability of mean-shift based tracking, the target histogram obtained in the previous frame is considered to update the model histogram. In the updating process, to alleviate error-accumulation due to outliers in the target ellipse of the previous frame, the target histogram in the previous frame is obtained within an ellipse adaptively shrunken on the basis of the model histogram. In addition, to enhance tracking reliability further, we set the initial position closer to the true position by compensating the global motion, which is rapidly estimated on the basis of two 1-D projection datasets. In the subsequent stage, we refine the position and size of the ellipse obtained in the first stage by using shape information. Here, we define a robust shape-similarity function based on the gradient direction. Extensive experimental results proved that the proposed algorithm performs head hacking well, even when a person moves fast, the head size changes drastically, or the background has many clusters and distracting colors. Also, the propose algorithm can perform tracking with the processing speed of about 30 fps on a standard PC.

The Protostome database (PANM-DB): Version 2.0 release with updated sequences (연체동물 NGS 데이터 분석을 위한 PANM 데이터베이스 업데이트 (Version II))

  • Kang, Se Won;Park, So Young;Patnaik, Bharat Bhusan;Hwang, Hee Ju;Chung, Jong Min;Song, Dae Kwon;Park, Young-Su;Lee, Jun Sang;Han, Yeon Soo;Park, Hong Seog;Lee, Yong Seok
    • The Korean Journal of Malacology
    • /
    • v.32 no.3
    • /
    • pp.185-188
    • /
    • 2016
  • PANM-DB (version 1.0) was constructed as a web-based interface for the analysis and annotation of Next-Generation Sequencing (NGS) data of Mollusca, Arthropoda, and Nematoda. The database collected the sequences of Protostomes (Mollusca, Arthropoda, and Nematoda) from the NCBI Taxonomy Browser, and the same were compiled in a multi-FASTA format and stored using the formatdb program. This improved the processing of the RNA-seq sequences in terms of speed and hit percentage. PANM-DB has been successfully used for the transcriptome annotation of butterfly, land snail, and other commercial mollusca. We have improved the database by updating the same with new sequences and version 2.0 contains a total of 7,571,246 protein sequences (two times more as compared to version 1.0). Furthermore, the updated version contains the Cephalopoda database. The constructed web interface is available that independently analyses following these updates that is an improvement of the mollusks BLAST server. The updated version of PANM-DB will be helpful for the analysis of the NGS based sequencing data of non-model species, especially Mollusca, Arthropoda, Nematoda.

Collaboration and Node Migration Method of Multi-Agent Using Metadata of Naming-Agent (네이밍 에이전트의 메타데이터를 이용한 멀티 에이전트의 협력 및 노드 이주 기법)

  • Kim, Kwang-Jong;Lee, Yon-Sik
    • The KIPS Transactions:PartD
    • /
    • v.11D no.1
    • /
    • pp.105-114
    • /
    • 2004
  • In this paper, we propose a collaboration method of diverse agents each others in multi-agent model and describe a node migration algorithm of Mobile-Agent (MA) using by the metadata of Naming-Agent (NA). Collaboration work of multi-agent assures stability of agent system and provides reliability of information retrieval on the distributed environment. NA, an important part of multi-agent, identifies each agents and series the unique name of each agents, and each agent references the specified object using by its name. Also, NA integrates and manages naming service by agents classification such as Client-Push-Agent (CPA), Server-Push-Agent (SPA), and System-Monitoring-Agent (SMA) based on its characteristic. And, NA provides the location list of mobile nodes to specified MA. Therefore, when MA does move through the nodes, it is needed to improve the efficiency of node migration by specified priority according to hit_count, hit_ratio, node processing and network traffic time. Therefore, in this paper, for the integrated naming service, we design Naming Agent and show the structure of metadata which constructed with fields such as hit_count, hit_ratio, total_count of documents, and so on. And, this paper presents the flow of creation and updating of metadata and the method of node migration with hit_count through the collaboration of multi-agent.

Updating GIS Data using Linear Features of Imagery (영상의 선형 정보를 이용한 GIS 자료의 갱신에 대한 연구)

  • 손홍규;최종현;피문희;이진화
    • Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
    • /
    • 2003.04a
    • /
    • pp.388-393
    • /
    • 2003
  • 도시화 속도의 증가와 더불어 3차원 자료 획득의 출처가 다양해지연서, 도로 및 건물경계선과 같은 선형 GIS 정보에 대한 신속한 갱신 또한 요구되고 있다. 임의의 출처 자료로부터 대상 자료를 갱신하기 위해서는 가장 먼저 두 자료간의 위치 관계를 결정하여야 하며, 특히 영상정보와 같은 출처 자료와 GIS 자료와 같은 대상 자료간의 위치 관계를 결정하기 위하여 기존에 제시되어온 대부분의 방법들은 두 개 자료간의 관계를 정의 할 수 있는 기준정과 같은 정확한 점 정합 요소(point matching entities)를 요구하고 있다. 따라서 정확한 정합 요소들을 획득할 수 없는 경우 영상과 GIS 자료간의 위치 관계를 결정할 수 없을뿐더러 위치 관계 정립의 결과는 정합 요소들의 분포 및 정확도에 매우 의존하게 된다. 또한 이러한 점 정합 요소들을 정의하기 위해서는 대부분의 경우 수동적으로 이루어질 수밖에 없다. 따라서 본 연구에서는 영상 및 GIS 자료의 선형 정보를 이용하여 정확한 점 정합 요소들을 모르더라도 영상과 GIS 자료간의 위치 관계를 결정할 수 있는 기법을 제시하고자 한다. 사용된 알고리즘은 개선된 Hough 변환(Modified Hough Transform)을 기반으로 다수의 선형 정보 중에 정합되는 요소들을 자동으로 찾아내고 이들을 최소제곱법으로 풀이함으로써 두 데이터간의 기하학적 변환 관계를 결정하는 기법이다. 본 연구에서는 이와 같은 접근을 통해 데이터간의 기하학적 변환 관계를 결정한 후, 영상 상에는 존재하지만 GIS 자료에는 존재하지 않는 선형 정보에 대한 갱신 여부를 확인하고 갱신함으로써 3차원 위치 자료의 자동 생성에 대한 가능성을 제시하고자 한다.로 갈수록 퇴적이 우세한 것으로 관측되었다.보체계의 구축사업의 시각이 행정정보화, 생활정보화, 산업정보화 등 다양한 분야와 결합하여 보다 큰 시너지 효과와 사용자 중심의 서비스 개선을 창출할 수 있는 기반을 제공할 것을 기대해 본다.. 이상의 결과를 종합해볼 때, ${\beta}$-glucan은 고용량일 때 직접적으로 또는 $IFN-{\gamma}$ 존재시에는 저용량에서도 복강 큰 포식세로를 활성화시킬 뿐 아니라, 탐식효율도 높임으로써 면역기능을 증진 시키는 것으로 나타났고, 그 효과는 crude ${\beta}$-glucan의 추출조건에 따라 달라지는 것을 알 수 있었다.eveloped. Design concepts and control methods of a new crane will be introduced in this paper.and momentum balance was applied to the fluid field of bundle. while the movement of′ individual material was taken into account. The constitutive model relating the surface force and the deformation of bundle was introduced by considering a representative prodedure that stands for the bundle movement. Then a fundamental equations system could be simplified considering a steady state of th

  • PDF

Component-Based Systematic Reengineering Process (컴포넌트 기반의 체계적인 재공학 프로세스)

  • Cha Jung-Jun;Kim Chul Hong;Yang Young-Jong
    • The KIPS Transactions:PartD
    • /
    • v.12D no.7 s.103
    • /
    • pp.947-956
    • /
    • 2005
  • Software(S/W) reengineering is one of the effective technologies to produce a business worth and en and the S/W ROI continuously. In spite of, S/W reengineering has been recognized a cost-consumptive works with inefficient productivity. In fact we have used to transform to confusion system with destructive system architecture by extending and updating legacy system in a temporary expedients. Moreover it is impossible to provide the time-market products for coping with rapid changeable system environment and meeting to complicated customer's requirements. Therefore, we need a systematic reengineering methodology to fulfill the changeable environment, as appearance of new IT techniques, various alteration of business information model, and increment of business logic. Legacy systems can be utilized as the core property in business organization through reengineering methodology. In this paper, we target to establish the reengineering process, proposed MaRMI-RE consisting of initial Planning phase, reverse engineering and component transformation phase. To describe the MaRMI-RE, we presented the concrete tasks and techniques and artifacts per individual phase in process, and the case study is showed briefly.

Skills Development Programmes and Activities for LIS Professionals in India: A Road Map For South Asian Countries (문헌정보학 전문가를 위한 인도의 기술개발 프로그램과 활동 분석)

  • Ramesha, Ramesha
    • Journal of Information Management
    • /
    • v.42 no.4
    • /
    • pp.95-113
    • /
    • 2011
  • The new millennium with mystifying convergence of IT has opened new challenges to LIS profession. This has resulted to continuous skill development and lifelong learning, for capacity building in consonant with contemporary changes. The LIS profession in India has created several mechanisms to organize and conduct several skills development programmes through which professionals are continuously enabled to update their professional knowledge and skills, in practice and teaching. There is a good organizational infrastructure and identified areas related to the recent developmental trends and as such LIS professionals and educators have facilities for updating their knowledge at veritable levels and intervals. The paper has surveyed programmes conducted by different organizations at different levels and highlights the aspects of the organizational infrastructure and the emergent areas of applications in LIS teaching, research and professional practices in India. The selection of areas and subjects for various skill development programmes suggest the competencies acquired by the LIS professionals from India, and the empowerment of their professional knowledge can be of immense value to its neighbouring countries. The paper highlights the knowledge and competencies of the LIS professionals in India and the broad-based facilities available here which can be a model for those countries which are seeking to utilize the LIS human resources from this part of the sub-continent. The paper in this circumstance surveyed on the institutional infrastructure for skill developmental opportunities available in India which would meet such requirements within and to the countries outside in the South Asian region seeking its collaboration in such manpower development work.

Optimal parameter derivation for Muskingum method in consideration of lateral inflow and travel time (측방유입유량 및 유하시간을 고려한 Muskingum 최적 매개변수 도출)

  • Kim, Sang Ho;Kim, Ji-sung;Lee, Chang Hee
    • Journal of Korea Water Resources Association
    • /
    • v.50 no.12
    • /
    • pp.827-836
    • /
    • 2017
  • The most important parameters of the Muskingum method, widely used in hydrologic river routing, are the storage coefficient and the weighting factor. The Muskingum method does not consider the lateral inflow from the upstream to the downstream, but the lateral inflow actually occurs due to the rainfall on the watershed. As a result, it is very difficult to estimate the storage coefficient and the weighting factor by using the actual data of upstream and downstream. In this study, the flow without the lateral inflow was calculated from the river flow through the hydraulic flood routing by using the HEC-RAS one-dimensional unsteady flow model, and the method of the storage coefficient and the weighting factor calculation is presented. Considering that the storage coefficient relates to the travel time, the empirical travel time formulas used in the establishment of the domestic river basin plan were applied as the storage coefficient, and the simulation results were compared and analyzed. Finally, we have developed a formula for calculating the travel time considering the flow rate, and proposed a method to perform flood routing by updating the travel time according to the inflow change. The rise and fall process of the flow rate, the peak flow rate, and the peak time are well simulated when the travel time in consideration of the flow rate is applied as the storage coefficient.

Generalized Sigmidal Basis Function for Improving the Learning Performance fo Multilayer Perceptrons (다층 퍼셉트론의 학습 성능 개선을 위한 일반화된 시그모이드 베이시스 함수)

  • Park, Hye-Yeong;Lee, Gwan-Yong;Lee, Il-Byeong;Byeon, Hye-Ran
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.11
    • /
    • pp.1261-1269
    • /
    • 1999
  • 다층 퍼셉트론은 다양한 응용 분야에 성공적으로 적용되고 있는 대표적인 신경회로망 모델이다. 그러나 다층 퍼셉트론의 학습에서 나타나는 플라토에 기인한 느린 학습 속도와 지역 극소는 실제 응용문제에 적용함에 있어서 가장 큰 문제로 지적되어왔다. 이 문제를 해결하기 위해 여러 가지 다양한 학습알고리즘들이 개발되어 왔으나, 계산의 비효율성으로 인해 실제 문제에는 적용하기 힘든 예가 많은 등, 현재까지 만족할 만한 해결책은 제시되지 못하고 있다. 본 논문에서는 다층퍼셉트론의 베이시스 함수로 사용되는 시그모이드 함수를 보다 일반화된 형태로 정의하여 사용함으로써 학습에 있어서의 플라토를 완화하고, 지역극소에 빠지는 것을 줄이는 접근방법을 소개한다. 본 방법은 기존의 변형된 가중치 수정식을 사용한 학습 속도 향상의 방법들과는 다른 접근 방법을 택함으로써 기존의 방법들과 함께 사용하는 것이 가능하다는 특징을 갖고 있다. 제안하는 방법의 성능을 확인하기 위하여 간단한 패턴 인식 문제들에의 적용 실험 및 기존의 학습 속도 향상 방법을 함께 사용하여 시계열 예측 문제에 적용한 실험을 수행하였고, 그 결과로부터 제안안 방법의 효율성을 확인할 수 있었다. Abstract A multilayer perceptron is the most well-known neural network model which has been successfully applied to various fields of application. Its slow learning caused by plateau and local minima of gradient descent learning, however, have been pointed as the biggest problems in its practical use. To solve such a problem, a number of researches on learning algorithms have been conducted, but it can be said that none of satisfying solutions have been presented so far because the problems such as computational inefficiency have still been existed in these algorithms. In this paper, we propose a new learning approach to minimize the effect of plateau and reduce the possibility of getting trapped in local minima by generalizing the sigmoidal function which is used as the basis function of a multilayer perceptron. Adapting a new approach that differs from the conventional methods with revised updating equation, the proposed method can be used together with the existing methods to improve the learning performance. We conducted some experiments to test the proposed method on simple problems of pattern recognition and a problem of time series prediction, compared our results with the results of the existing methods, and confirmed that the proposed method is efficient enough to apply to the real problems.