http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
오늘 본 자료
정영헌,홍순목,진학성 경북대학교 전자기술연구소 1998 電子技術硏究誌 Vol.19 No.1
In this paper, we implement an algorithm for generating the shortest path between two given points in 2-dimensional space in the presence of obstacles. The algorithm obtains the essential visibility graph (the visibility graph with non-redundant path segments only) using the traversability vectors. In particular, we generate the essential visibility graph with ε-clearance path segments only, which guarantees that the distance between obstacles is larger than ε along all the path segments. The shortest path is obtained by searching the essential visibility graph based on the A algorithm. The results of some numerical experiments are presented.
음향교란 항적의 기하학적 특성을 이용한 수중 표적 판별
정영헌,전상운,홍선목 대한전자공학회 1998 電子工學會論文誌, S Vol.s35 No.3
In this paper we discuss an algorithm to discriminate a garget under track against multiple acoustic counter-measure (ACM) sources, based on sequential testings of multiple hypotheses. The ACM sources are separated from the target under track and generate, while drifting, measurements with false range and Doppler information. The purpose of the ACM is to mislead the target tracking and to help the true target evade a pursuer. The proposed algorithm uses as a test statistic a function of the innovation sequences from extended Kalman filters to estimate the target dynamics and the drifting positions of the ACM sources. results of numerical experimenats are presented to show a performance profile of the proposed algorithm.
장기미집행 도시계획시설의 재검토를 위한 정량적 평가기준 설정에 관한 연구
정영헌,이양재 대한국토·도시계획학회 2003 國土計劃 Vol.38 No.1
The objective of this study is to institute the criteria, in particular quantitative criteria- for the review of road facilities that has taken up the biggest portion of unexecuted urban planning facilities in long-term. The quantitative criteria - 9 in total - used for this study are functions of roads, the rate of implementation, the period before implementation, ownership of land (the proportion of government-owned land vs. that of private land), the occupation rate of compensation fee for private building site, the number of obstacle and their area ratio and the slope of roads and the condition of connection on the roads. Based on the total point by road evaluated by item and as a result of Cluster Analysis, it was shown that classifying into 4 groups is the most feasible. The 4 categories of reinvestigation were classified into the following: "existence", "subject to review for existence", "subject to review for elimination", and "elimination." This is a result which is judged to possess significant explanation ability in the primary selections of existence and elimination. Secondly, when compared with the measurement results, 39 places in Iksan City and 3 places in Jangsu County showed contrary results. This is a different that occurs because the government's will was excluded from the quantitative criteria. This study has meanings in that it has clearly presented quantitative criteria, making it possible to sort out urban planning facilities that have been overdue in the 1st round, and that it has tried verifications through comparison with the existent measure matters.
클러터 환경에서의 표적 추적을 위한 준최적의 검출 문턱값
정영헌,신한섭,Jeong, Yeong-Heon,Sin, Han-Seop 대한전자공학회 2002 電子工學會論文誌-SC (System and control) Vol.39 No.2
이 논문에서는 PDA(Probabilistic Data Association) 필터를 이용한 표적 추적에서 평균자승추정오차의 기대값을 최소화하는 표적 검출 문턱값의 최적제어 방법을 제시하고, 닫힌 형태의 준최적해를 구한다. 최적의 검출 문턱값을 구하기 위한 이전의 연구에서는 그래프를 이용한 부정확한 최적화 방법이나, 매우 시간이 많이 소요하는 수치해석적 최적화 알고리듬을 사용하였다. 하지만, 이 논문에서는 정보감소인자의 수치적 근사화식을 이용하여, 최적제어문제로 정식화하여 닫힌 형태의 준최적 검출 문턱값을 구하였다. 이 결과는 실시간 표적 추적에서 유용하게 사용될 수 있다. In this paper, we consider the optimal control of detection threshold to minimize the conditional expectation of mean-square state estimation error for a probabilistic data association (PDA) filter. Earlier works on this problem involved the cumbersome graphical optimization algorithm or time-consuming numerical optimization algorithm. Using the numerical approximation of information reduction factor, we obtained the suboptimal detection threshold in a closed-form. This results are very useful for real- time implementation.