• Journal of the Optical Society of Korea
• /
• v.9 no.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.10a
• /
• 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
• /
• v.20 no.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.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.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.

• The KIPS Transactions:PartB
• /
• v.13B no.2 s.105
• /
• pp.83-88
• /
• 2006

Digital image processing algorithm was proposed to measure the area inside of an object image using angle-distance graph used to analyze the pattern of an object in the digital image processing techniques. The first angle-distance graph is generated from a point inside of an object area. The second angle-distance graphs are generated for the areas missed in the first graph by extracting the positions with large gradient in the first angle-distance graph. The order of the graph increases according to the complexity of an object pattern. Size of the area inside of an object boundary is measured by integrating square of distance multiplied by angle for each area from the hierarchical angie-distance graphs.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.22 no.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.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.1
• /
• pp.70-79
• /
• 2017

This study proposes a method to quickly and accurately acquire distance information on direction signs. The proposed method is composed of the recognition of the sign, pre-processing to facilitate the acquisition of the road sign distance, and the acquisition of the distance data. The road sign recognition uses color detection including gamma correction in order to mitigate various noise issues. In order to facilitate the acquisition of distance data, this study applied tilt correction using linear factors, and resolution correction using Fourier transform. To acquire the distance data, morphological operation was used to highlight the area, along with labeling and template matching. By acquiring the distance information on the direction sign through such a processes, the proposed system can be output the distance remaining to the next junction. As a result, when the proposed method is applied to system it can process the data in real-time using the fast calculation speed, average speed was shown to be 0.46 second per frame, with accuracy of 0.65 in similarity value.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.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.

• Communications of Mathematical Education
• /
• v.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.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.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.