http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
洪淳穆 경북대학교 공과대학 1980 工大硏究誌 Vol.9 No.-
The maximum Euclidean norm of the complementary signal response at samling times of the networks of which element values are within tolerance and are interconnected properly, is chosen as the criterion of GO-NO-GO decision. And using SPICE program, the fault detection resolution to single component parameter variations is determined about a 2-pole Butterworth filter and a 4-pole/2-zero Butterworth filter and it is shown that the maximum Euclidean norm of the output can be used as a simple criterion for fault detection.
김항준,홍순목,박민호 경북대학교 공과대학 1983 工大硏究誌 Vol.12 No.-
syntactic method is a general tool for pattern recognition but it's not good at distinguishing similar object. In this paper, we use attributed grammar to distinguish long nose plier from diagonal cutter, and good experimental results are obtained.
Quantification of Angular Prediction Accuracy for Phased Array Radar Tracking
홍순목(Sun-Mog Hong) 대한전자공학회 2012 電子工學會論文誌-SC (System and control) Vol.49 No.1
위상배열레이더를 이용한 추적의 성능을 지수화하기 위해서 각도예측 오차공분산행렬의 함수를 이용한 정량화 방법에 대해 검토하였다. 특히, 이 오차공분산행렬의 함수로 최대고유값과 대각합을 이용하여 정량화하는 경우에 대해 안테나 빔조향 손실을 반영한 표적탐지확률을 기준으로 정량화의 일관성을 수치실험을 통해 검토하였다. 이를 통해 추적성능을 표적탐지확률로 기준하는 경우, 대각합이 최대고유값 보다 더 일관성을 갖는 정량화 함수임을 확인하였다. Scalar quantification of the angular prediction error covariance matrix is considered for characterizing tracking performances in phased array radar tracking. Specifically, the maximum eigenvalue and the trace of the covariance matrix are examined in terms of consistency in parameterizing the probability of detection, taking antenna beam-pointing losses into account, and it is shown numerically that the latter is more consistent.
Closed-Form Solution of ECA Target-Tracking Filter using Position and Velocity Measurements
Yong-Ki Yoon. Sun-Mog Hong 한국정보과학회 1997 Journal of Electrical Engineering and Information Vol.2 No.4
Presented are closed-form expressions of the three-state exponentially correlated acceleration(ECA) target-tracking filter. The steady-state solution is derived based on Vaughan's approach for the case that the measurements of target position and velocity are available at discrete points in time. The solution for the ECA tracking filter using only position measurements and the solution for the constant acceleration(CA) tracking filter are obtained as a special case of the presented results.
홍순목,신해곤 한국센서학회 1993 센서학회지 Vol.2 No.1
In this paper the normalized innovations squared of a Kalman filter is used to detect a bias level in prediction errors due to target accelerations. The probability density function of the normalized innovation squared is obtained for a steady state Kalman filter, and it is used to calculate the detection probability of the bias level. A typical example is given to compute the detection probability and to plot the maneuver detector operating characteristic curves.
위상배열 레이다를 위한 가변 표본화 빈도 추적 필터의 설계
홍순목 한국센서학회 1992 센서학회지 Vol.1 No.1
The phased array antenna has the ability to perform adaptive sampling by directing the radar beam without inertia in any direction. The adaptive sampling capability of the phased array antenna allows each sampling time interval to be varied for each target, depending on the acceleration of each target at any time. In this paper we design a three-dimensional adaptive tracking algorithm for the phased array radar system with a given set of measurement parameters. The tracking algorithm avoids taking unnecessarily frequent samples, while keeping the angular prediction error within a fraction of antenna beamwidth so that the probability of detection will not be degraded during a track update illuminations. In our algorithm, the target model and the sampling rate are selected depending on the target range and the target maneuver status which is determined by a maneuver detector. A detailed simulation is conducted to test the validity of our tracking algorithm for encounter geometries under various conditions of maneuver.
홍순목,여준혁 경북대학교 전자기술연구소 1997 電子技術硏究誌 Vol.18 No.1
In this paper we propose an efficient algorithm for computing the growth function between moving polytopes. The algorithm can track contact features between moving polytopes which are either grown or contracted so that they just touch. The contact features are determined by checking the maintenance of contact coherence or by tracking the contact transition. The contact features are exploited effectively in computing the growth function of moving polytopes at grid points along a given path. Numerical results show that the algorithm is more effective as either the total number of faces or the number of grid-points increases.