• Journal of the Optical Society of Korea
• /
• 제9권1호
• /
• pp.6-12
• /
• 2005

The perturbation approach is applied to solve the nonlinear Schrodinger equation, and its valid range has been determined by comparing with the results of the split-step Fourier method over a wide range of parameter values. With γ= 2㎞/sup -1/mW/sup -1/, the critical distance for the first order perturbation approach is estimated to be(equation omitted). The critical distance, Z/sub c/, is defined as the distance at which the normalized square deviation compared to the split-step Fourier method reaches 10/sup -3/. Including the second order perturbation will increase Z/sub c/ more than a factor of two, but the increased computation load makes the perturbation approach less attractive. In addition, it is shown mathematically that the perturbation approach is equivalent to the Volterra series approach, which can be used to design a nonlinear equalizer (or compensator). Finally, the perturbation approach is applied to obtain the sinusoidal response of the fiber, and its range of validity has been studied.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.1876-1879
• /
• 1997

This paper developes an efficient algorithm for the minimum distance calculation between general polyhedra(convex and/or concave). The polyhedron approximates and object using flat polygons which composed of more than three veritices. The algorithm developed in this paper basically computes minimun distance betwen two convex polygons and finds a set of polygons whcih makes a global minimum distance. The advantage of the algorithm is that the global minimum distance can be computed in any cases. But the big disadvantage is that minimum distance computing time is repidly increased with the number of polygons which used to approximate an object. This paper developes a method to eliminate unnecessary sets of polygons, and an efficinet algorithm to compute a minimum distance between two polygons in order to compensate the inherent disadvantage of the algorithm. It takes only a few times iteration to find minimum distance for msot polygons. The correctness of the algortihm are visually tested with a line which connects two points making a global minimum distance of simple convex object(box) and concave object(pipe). The algorithm can find minimum distance between two convex objects made of about 200 polygons respectively less than a second computing time.

• Journal of the Optical Society of Korea
• /
• 제20권5호
• /
• pp.579-585
• /
• 2016

Integral imaging combined with photon-counting detection has been researched for three-dimensional information sensing under low-light-level conditions. This paper addresses the extraction of distance information with photon-counting integral imaging. The longitudinal distance to the object is obtained utilizing photon-counting elemental images. The pixel disparity is estimated by maximizing the nonlinear correlation of photocounts. The first- and second-order statistical properties of the nonlinear correlation are theoretically derived. In the experiments, these properties are verified by varying the mean number of photocounts in the scene. The average distance is compared to that from the intensity information, showing the robustness of the proposed system even at low photocounts.

• 전기학회논문지
• /
• 제58권10호
• /
• pp.2047-2051
• /
• 2009

In this paper, we propose the localization method on WSN(Wireless Sensor Network) using fuzzy model and Kalman filter. The proposed method is as follows: First, we estimate the distance of RSSI(Receive Signal Strength Index) by using fuzzy model in order to minimize the distance error. Second, we use a triangulation measurement for estimating the localization. And then, we minimize the localization error using a Kalman filter. Finally, we show the effectiveness and feasibility of the proposed method through some experiments.

• 정보처리학회논문지B
• /
• 제13B권2호
• /
• pp.83-88
• /
• 2006

일정한 형태의 물체를 분석하기 위해 사용되는 각-거리 그래프를 이용하여 임의의 물체의 경계선 내부 영역의 면적을 측정하는 디지털 영상처리 알고리듬을 제안한다. 물체의 경계선 내부의 한 점을 중심으로 1차 각-거리 그래프를 생성하고 이 그래프로부터 거리 값이 급격히 변화하는 위치를 추출하여 1차 그래프에서 접근하지 못한 영역을 인식하여 새 영역에서의 한 점을 중심으로 2차 각-거리 그래프를 생성한다. 물체의 형태가 복잡한 경우 차수가 증가하게 되며 이와 같이 계층적으로 구성된 각-거리 그래프 그룹에 대해 거리의 제곱을 각도 방향으로 적분하여 물체의 경계선 내부 영역의 면적을 측정한다.

• 대한기계학회논문집B
• /
• 제22권6호
• /
• pp.823-831
• /
• 1998

In order to investigate the impulsive noise at the exit of high-speed railway tunnel and the pressure transients inside the tunnel, numerical calculations using a Total Variation Dimishing difference scheme were applied to axisymmetric unsteady compressible flow field. Some compression wave forms were assumed to model the compression wave produced in real high-speed railway tunnel. The numerical data were extensively explored to analyze the peak over-pressure and maximum pressure gradient in the pressure wavefront. The effect of the distance and cross-sectional area ratio between two-continuous ducts on the characteristics of the pressure waves were investigated. The peak over-pressure inside the second duct decreases for the distance and cross-sectional area ratio between two tunnels to increase. The peak over-pressure and maximum pressure gradient of the pressure wavefront inside the second duct increase as the maximum pressure gradient of initial compression wave increases. The present results were qualitatively well agreed with the results of the previous shock tube experiment.

• 전자공학회논문지
• /
• 제54권1호
• /
• pp.70-79
• /
• 2017

본 논문에서는 도로안내표지판 내의 거리정보를 빠르고 정확하게 획득하는 방법을 제안한다. 제안된 방법은 표지판의 인식, 거리를 획득하기 용이한 전 처리 과정, 거리정보를 습득하는 것으로 구성된다. 표지판의 인식은 여러 가지 잡음을 해결하기 위해 감마 보정을 포함한 색상검출을 사용하였으며, 거리정보를 용이하게 획득하기 위해서 직선 인자를 이용한 기울기 보정과 고속 푸리에변환을 이용한 해상도 보정을 적용하였다. 거리정보를 습득하는 과정은 모폴로지 연산을 통해 영역을 부각하고 레이블링, 템플릿 매칭을 사용하였다. 이러한 과정을 통해 도로안내표지판의 거리정보를 습득하여 분기점까지 남은 거리를 출력하는 시스템을 제안하였다. 결과적으로 연산속도 개선에 중점을 두어 실시간으로 처리할 수 있는 시스템에 사용 가능하며, 그 결과 프레임 당 평균 0.46초의 속도를 가지며, 정확도에서도 유사도 0.65의 수치를 갖는다.

• 전기학회논문지
• /
• 제58권11호
• /
• pp.2095-2100
• /
• 2009

Since most of the Extra High Voltage (EHV) transmission lines are untransposed and multi-circuits, errors are occurred inevitably because of the unbalanced impedances of the lines and so on. Therefore, a distance relaying algorithm applicable to the untransposed multi-circuits transmission lines needs to be developed. The proposed algorithm of fault location estimation in the paper uses the fundamental phasor to reduce the effects of the harmonics. This algorithm also analyzes the second-order difference of the phasor to calculate the traveling times of waves generated by faults. The traveling time of the waves generated by faults is derived from the second-order difference of the phasor. Finally, the distance from the relaying point to the faults is estimated using the traveling times. To analyze the performance of the algorithm, a power system with the EHV untransposed double-circuit transmission lines are modeled and simulated under various fault conditions such as several fault types, fault locations, fault inception angles and fault resistances. The results of the simulations show that the proposed algorithm has the capability to estimate the fault locations quickly and accurately.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제6권
• /
• pp.371-381
• /
• 1997

Let p be an odd prime number. We introduce simple and useful decoding algorithm for orthogonal Latin square codes of order p. Let H be the parity check matrix of orthogonal Latin square code. For any x ${\in}$ GF(p)$^{n}$, we call xH$^{T}$ the syndrome of x. This method is based on the syndrome decoding for linear codes. In L$_{p}$, we need to find the first and the second coordinates of codeword in order to correct the errored received vector.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제52권5호
• /
• pp.305-310
• /
• 2003

In this paper, we proposed an IJADE(Improved joint approximate diagonalisation of eigenmatrices) which use high order statistics instead of second order statistics for data whitening. For simulation, we artificially construct signals mixed with two ECG signals, 60Hz power line interference and 16Hz sine signal and then put them into a JADE and an IJADE. To evaluate the performance of separated ECG signal in each algorithm, we have adopted indices such as kurtosis, standard deviation ratio, correlation coefficient and euclidean distance. As a results, IJ ADE showed theimproved performances as kurtosis of $2\%,$ standard deviation ratio of 0.2194, and Euclidean distance of 0.07 except correlation coefficient showing similar value. In conclusion, the proposed IJADE showed a good performance in separating ECG and a possibilities in applying to the various biological signal.