• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.440-440
• /
• 2000

In general, camera calibration is consisted of Indoor and Outdoor system. In case of Indoor system, it was optimized experimental condition. However, Outdoor system is different camera parameters for each image that is compared to equaled position. That is, it imply that camera parameters are varied by an environment with light or impulse noise, etc. So we make use of Image sequence because that they provide the more information for each image. In addition to, we use Corresponding line because it has less error than Corresponding point. Corresponding line has also the more information. In this paper, we suggest on-line camera calibration method using the time-varying Image sequence and Corresponding line. So we calculate camera parameters with intrinsic and extrinsic parameters in On-line system.

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

Computer vision system is broadly adapted like as autonomous vehicle system, product line inspection, etc., because it has merits which can deal with environment flexibly. However, for applying it for that industry, it has to clear the problem that recognize position parameter of itself. So that computer vision system stands in need of camera calibration to solve that. Camera calibration consists of the intrinsic parameter which describe electrical and optical characteristics and the extrinsic parameter which express the pose and the position of camera. And these parameters have to be reorganized as the environment changes. In traditional methods, however, camera calibration was achieved at off-line condition so that estimation of parameters is in need again. In this paper, we propose a method to the calibration of camera using line correspondence in image sequence varied environment. This method complements the corresponding errors of the point corresponding method statistically by the extraction of line. The line corresponding method is strong by varying environment. Experimental results show that the error of parameter estimated is within 1% and those is effective.

• Journal of Information Processing Systems
• /
• 제16권2호
• /
• pp.406-420
• /
• 2020

In order to make up the deficiencies of the existing research results which cannot effectively deal with the nearest neighbor query based on the line segments in obstacle space, the k nearest neighbor query method of line segment in obstacle space is proposed and the STA_OLkNN algorithm under the circumstance of static obstacle data set is put forward. The query process is divided into two stages, including the filtering process and refining process. In the filtration process, according to the properties of the line segment Voronoi diagram, the corresponding pruning rules are proposed and the filtering algorithm is presented. In the refining process, according to the relationship of the position between the line segments, the corresponding distance expression method is put forward and the final result is obtained by comparing the distance. Theoretical research and experimental results show that the proposed algorithm can effectively deal with the problem of k nearest neighbor query of the line segment in the obstacle environment.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.296-296
• /
• 2000

This paper describes the features of a transmission line and a wiring, and a design rule based on a demanded condition for a wiring. Like as the simulation of a circuit, by tracking the wiring path among parts that are disposed on PCB, we analyze the feature of the corresponding wiring using the design formula and rule. We implement a signal integrity simulator, which is capable of electrical and electronic simulation for the feature of a wiring signal and the corresponding signal, and the results are demonstrated.

• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2011년도 제43차 동계학술발표논문집 19권1호
• /
• pp.59-62
• /
• 2011

A new method is proposed for stereo vision where solution to disparity map is presented in terms of Line constraint and Reliability space -- the first constraint proposes a progressive framework for stereo matching which applies local area pixel-values from corresponding lines in the left and right image pairs. The second states that reliability space based on corresponding points records the disparity and then we are able to apply the median filter in order to reduce the noises which occur in the process. A coarse to fine result is presented after the median filtering, which improves the final result qualitatively. Experiment is evaluated by rectified stereo matching images pairs from Middlebury datasets and has proved that those two adopted strategies yield good matching quantitative results in terms of fast running speed.

• 한국철도학회논문집
• /
• 제6권4호
• /
• pp.239-245
• /
• 2003

In this paper, the track impact factor of conventional line was evaluated using the data for wheel load measured in field and the properties of current operating trains. The equation for track impact factor was presented through the statistical analysis of variational ratio in wheel load and compared with other design equations in domestic and foreign countries. A review on the safety of track system in conventional line was made from the relationship between the velocity and the corresponding impact factor. It was found that the impact factor from the proposed equation is a little less than the values from the equations adopted in both AREA and domestic railway, while it is same as the equation for continuous welded rail(CWR) in Japan. Therefore it could be said that the track satisfies a criteria for dynamic load caused by the train and the corresponding level of safety is guaranteed for dynamic load of the train

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2011년도 정기총회 및 추계학술대회 논문집
• /
• pp.2479-2486
• /
• 2011

Honam's high speed railway line that was designed as the most suitable with corresponding 350km/h for concrete track will be scheduled train operation in 2015. In this study, It was reviewed the performance level of standardized design section for the soil structure with 350km/h and also analyzed the demand level for roadbed structure corresponding with 400km/h speed up of HSR.

• Journal of Electrical Engineering and Technology
• /
• 제11권5호
• /
• pp.1412-1422
• /
• 2016

• Journal of Electrical Engineering and Technology
• /
• 제8권2호
• /
• pp.262-270
• /
• 2013

A boundary protection method for power distribution line based on equivalent boundary effect is presented in this paper. In the proposed scheme, the equivalent resonance component with a certain central frequency is sleeve-mounted at the beginning of protected zone. The 'Line Boundary' is built by using boundary effect, which is created by introducing impedance in the primary-side of line. The 'Line Boundary' is significantly different from line wave impedance. Therefore, the boundary protection principle can be applied to power distribution line without line traps. To analyze the frequency characteristic corresponding to traveling-waves of introducing impedance in the primary-side of line, distributed parameters model of equivalent resonance component is established. The results of PSCAD/EMTDC simulation prove the obvious difference of voltage high frequency component between internal faults and external faults due to equivalent resonance component, and validate the scheme.

• 대한수학회논문집
• /
• 제35권1호
• /
• pp.1-12
• /
• 2020

A pathos block line cut-vertex graph of a tree T, written P BL_c(T), is a graph whose vertices are the blocks, cut-vertices, and paths of a pathos of T, with two vertices of P BL_c(T) adjacent whenever the corresponding blocks of T have a vertex in common or the edge lies on the corresponding path of the pathos or one corresponds to a block B_i of T and the other corresponds to a cut-vertex c_j of T such that c_j is in B_i; two distinct pathos vertices P_m and P_n of P BL_c(T) are adjacent whenever the corresponding paths of the pathos P_m(v_i, v_j) and P_n(v_k, v_l) have a common vertex. We study the properties of P BL_c(T) and present the characterization of graphs whose P BL_c(T) are planar; outerplanar; maximal outerplanar; minimally nonouterplanar; eulerian; and hamiltonian. We further show that for any tree T, the crossing number of P BL_c(T) can never be one.