• Journal of KIISE
• /
• v.42 no.5
• /
• pp.642-651
• /
• 2015

A vanishing point is a point where parallel lines converge, and they become evident when a camera's lenses are used to project 3D space onto a 2D image plane. Vanishing point detection is the use of the information contained within an image to detect the vanishing point, and can be utilized to infer the relative distance between certain points in the image or for understanding the geometry of a 3D scene. Since parallel lines generally exist for the artificial structures within images, line-detection-based vanishing point-detection techniques aim to find the point where the parallel lines of artificial structures converge. To detect parallel lines in an image, we detect edge pixels through edge detection and then find the lines by using the Hough transform. However, the various textures and noise in an image can hamper the line-detection process so that not all of the lines converging toward the vanishing point are obvious. To overcome this difficulty, it is necessary to assign a different weight to each line according to the degree of possibility that the line passes through the vanishing point. While previous research studies assigned equal weight or adopted a simple weighting calculation, in this paper, we are proposing a new method of assigning weights to lines after noticing that the lines that pass through vanishing points typically belong to artificial structures. Experimental results show that our proposed method reduces the vanishing point-estimation error rate by 65% when compared to existing methods.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.4
• /
• pp.455-461
• /
• 2002

This paper presents a new parametric log line equation of polar form for Hough transform in log-polar plane, in which it can remove the well-known unboundedness problem of Hough parameters. Bolduc's method is used to generate a log-polar image dividing the fovea and periphery from a Cartesian image. Edges of the fovea and periphery are detected by using the Sobel mask and the proposed space-variant gradient mask, and are combined in the log-polar plane. The sampled points that might constitute a log line are quite sparse in a deep peripheral region due to severe under-sampling, which is an inherent property of LPM. To cope with such under-sampling, we determine the values of cumulative cells in Hough space by using the space-variant weighting. In our experiments, the proposed method demonstrates its validity of detecting not only the lines passing through both the fovea and periphery but also the lines in a deep periphery.

• Journal of Korea Multimedia Society
• /
• v.11 no.3
• /
• pp.292-300
• /
• 2008

An algorithm for detecting a line segment in an image is presented using incremental pixel extension. We use a different approach from conventional algorithms, such as the Hough transform approach and the line segment grouping approach. The Canny edge is calculated and an arbitrary point is selected among the edge elements. After the arbitrary point is selected, a base line approximating the line segment is calculated and edge pixels within an arbitrary radius are selected. A weighted value is assigned to each edge pixel, which is selected by using the error of the distance and the direction between the pixel and the base line. A line segment is extracted by Jilting a line using the weighted least square method after determining whether selected pixels are linked or delinked using the sum comparison of the weights. The proposed algorithm is compared with two other methods and results show that our algorithm is faster and can detect the real line segment.

• The Korean Journal of Applied Statistics
• /
• v.6 no.2
• /
• pp.237-245
• /
• 1993

A nonparametric test for the parallelisim of k regression lines against ordered alternatives is proposed. The test statistic is weighted Jonckheere-type statistic applied to slope estimators obtained from each lines. The distribution of the proposed test statistic is asymptotically distribution-free. From the viewpoint of efficiencies, the proposed test desirable properties and is more efficient than the other nonparametric tests.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.2
• /
• pp.357-363
• /
• 2014

OPS is a sabermetric baseball statistic calculated as the sum of a player's on base percentage (OBP) and slugging percentage (SLG). One of the frequently cited problem with OPS is that OPS gives equal weight to its two components, OBP and SLG. In fact, OBP contributes significantly more to scoring runs than SLG does. This paper provides some exploration into the correct weighting of OBP to SLG when adding the two together. By correlating different coefficients of OBP to runs scored per game, the weighted OPS that weighting OBP 56% in two place more than SLG produced the highest correlation. We found that the weight of OBP increases as RPG increases. Also we suggest the linear regression equation of the best OBP coefficient against RPG.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.323-326
• /
• 2007

When traveling on real road network, it generally takes less travel time in a near straight path than a zig-zaged path with same source and destination. In order to making a left(right/u) turn, the delay should be required to decrease the speed. The traffic signal waiting time of left(right/u) turn is probably longer than straight driving. In this paper, we revise the previous hierarchical path finding algorithm to reduce the number of turns. The algorithm proposed in this paper complied with a hierarchical $A^*$ algorithm, but has a distinct strategy for edge weight. We define an edge that makes a turn as a turn-edge and give the turn-edge lower weight to maintain the straightness of the whole path.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.10
• /
• pp.1531-1536
• /
• 2022

This paper considers a problem to find a set of intervals containing all the points for the given n points and m intervals on a line, This is a special case of the set cover problem, well known as an NP-hard problem. As optimization criteria of the problem, there are minimizing the number of intervals to cover the points, maximizing the number of points each of which is covered by exactly one interval, and so on. In this paper, the intervals have weights and the sum of weights of intervals to cover a point is defined as a membership of the point. We will study the problem to find an interval cover minimizing the maximum of memberships of points. Using the dynamic programming method, we provide an O(m²)-time algorithm to improve the time complexity O(nm log n) given in the previous work.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 1999.12a
• /
• pp.59-65
• /
• 1999

베트남은 1980년대 이후 사회전반에 걸쳐 많은 변화를 겪고 있으며, 특히 경제체제의 변화는 다른 분야에 파급효과를 가져오고 있다. 이와 관련해 토지에 대한 개인의 사용권이 인정되었고 따라서 지가를 효율적으로 산정, 관리하는 시스템이 필요하게 되었다. 본 연구는 이를 위해 다른 나라, 특히 한국의 공시지가 시스템을 연구, 적응하였다. 지가결정요인들은 베트남이 시장경제체제의 도입단계라는 것을 감안하여 선택되었다. 연구결과 지가결정요인 중 몇몇 요소들의 자동추출이 가능하였으며, 지가결정의 위치 요인과 물리적인 요인의 가중치를 GIS 기법을 이용해 결정할 수 있었다. 특히, 주요도로로부터 필지까지의 거리를 직선거리가 아닌 실제 이동거리로 계산하는 방법을 사용하였다. 본 연구는 지가산정을 주요소로 하는 베트남의 부동산정보시스템을 구축할 수 있는 가능성을 제시하였다는 점에서 그 의의가 있다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.1
• /
• pp.130-136
• /
• 2017

Recently, as demand of video processor unit rapidly increases, excellent quality of the video has been required. However, generally, video data occurs the quick flame of video due to various external causes in process of acquisition, treatment, and transmission, and major cause of the quick flame of the video is known as the noise. There are various kinds of noise, which are added to the video, AWGN is a typical one. Thus, this thesis suggested algorithm that treats in three methods by scale of the edge through using edge information of local masks. In case that edge pixel is big, it applied spatial weighting according to equation of straight line about direction of edge pixel. In case that edge pixel is middle, it suggested algorithm with spatial weighting filter and average filter, and for the smooth territory, it suggested algorithm that treats with average filter.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.49 no.1
• /
• pp.88-93
• /
• 2012

Lane detection methods using camera, which are part of the driver assistance system, have been developed due to the growth of the vehicle technologies. However, lane detection methods are often failed by varying road conditions such as rainy weather and degraded lanes. This paper proposes a method for lane detection which is robust in varying road condition. Lane candidates are extracted by intensity comparison and lane detection filter. Hough transform is applied to compute the lane pair using lane candidates which is straight line in image. Then, a curved lane is calculated by using B-Snake algorithm. Also, weighting value is computed using previous lane detection result to detect the lanes even in varying road conditions such as degraded/missed lanes. Experimental results proved that the proposed method can detect the lane even in challenging road conditions because of weighting process.