• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.543-545
• /
• 2003

In this study, the authors evaluate the suitability of the candidate routes selected by the route selection method, which is developed by the authors, by combination of Geographic Information Systems (GIS) and Analytic Hierarchy Process. To evaluate the suitability of the candidate routes, from the viewpoint of the residents, we have considered element factors such as, population, household, aging situation, elevation, gradient, housing density and the Control Point. The results of this study are expected to assess the suitability of the candidate routes of the hillside transportation for the residents and examine the application limit of the route selection method.

• KIISE Transactions on Computing Practices
• /
• v.20 no.12
• /
• pp.652-657
• /
• 2014

Given a starting point, destination point and various Points Of Interest (POIs), which contain a full or partial order, for a user to visit we wish to create, a sequenced route from the starting point to the destination point that includes one member of each POI type in a particular order. This paper proposes a method for finding the approximate shortest route between the start point, destination point and one member of each POI type. There are currently two algorithms that perform this task but they both have weaknesses. One of the algorithms only considers the distance between the visited POI (or starting point) and POI to visit next. The other algorithm chooses candidate points near the straight-line distance between the start point and destination but does not consider the order of visits on the corresponding network path. This paper outlines an algorithm that chooses the candidate points that are nearer to the network path between the start point and destination using network search. The algorithm looks for routes using the candidate points and finds the approximate shortest route by assigning an adaptive priority to the route that visits more POIs in a short amount of time.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.754-757
• /
• 2003

In Oriental medicine, the shape of collarette that formed with position in iris of patients often used by health diagnotcian to grasp health condition. In this paper, we present method that effectively extract collarette that exist in Iris image. After proposed method detert iris area using circular edge detector, derides boundary candidate point through radial line search and threshold value establishment. And boundary candidate line is treated to use nearest neighbor calculation at each boundary candidate point, finally extracts collarette through linear interpolation. As a result of experimenting about iris images, We Confirmed that can be used as assistant tool of diagnostic system that can presume state of ventriculus of human body.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.12
• /
• pp.1-11
• /
• 1993

This paper concentrates on models useful for analyzing the error performance of ML(Maximum Likelihood) estimators of a single unknown signal parameter: that is the error intensity model. We first develop the point process representation for the estimation error and the conditional distribution of the estimator as well as the distribution of error candidate point process. Then the error intensity function is defined as the probability dessity of the estimate and the general form of the error intensity function is derived. We then develop several intensity models depending on the way we choose the candidate error locations. For each case, we compute the explicit form of the intensity function and discuss the trade-off among models as well as the extendability to the case of multiple parameter estimation.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.554-556
• /
• 2006

A key component for autonomous mobile robot is to localize ifself. In this paper we suggest a vision-based localization and compensation of robot's location using ultrasound. Mobile robot travels along wall and searches each feature in indoor environment and transformed absolute coordinates of actuality environment using these points and builds a map. And we obtain information of the environment because mobile robot travels along wall. Localzation search robot's location candidate point by ultrasound and decide position among candidate point by features matching.

• Journal of Information Processing Systems
• /
• v.11 no.4
• /
• pp.528-537
• /
• 2015

Text in images is one of the most important cues for understanding a scene. In this paper, we propose a novel approach based on interest points to localize text in natural scene images. The main ideas of this approach are as follows: first we used interest point detection techniques, which extract the corner points of characters and center points of edge connected components, to select candidate regions. Second, these candidate regions were verified by using tensor voting, which is capable of extracting perceptual structures from noisy data. Finally, area, orientation, and aspect ratio were used to filter out non-text regions. The proposed method was tested on the ICDAR 2003 dataset and images of wine labels. The experiment results show the validity of this approach.

• Journal of Korean Library and Information Science Society
• /
• v.45 no.4
• /
• pp.409-428
• /
• 2014

The purpose of this study is to analyze the economic feasibility of Busan Regional Central Library. The four candidate sites were included for the analysis. To achieve the purpose of this study, we applied three types of indices such as Benefit-Cost analysis, Net Present Value, and Internal Rate of Return. We used CVM(Contingent Valuation Method) to calculate the benefit; we conducted two investigations to calculate WTP, which are for pretest and for main survey. From results of pretest, we designed five optimal prices. On the basis of them, main survey was accomplished to figure out WTPs for four candidate sites. The results show that four candidate sites were all feasible from an economic point of view. Of these, the Busan Citizen Park site got the highest point of B/C ratio.

• Journal of Korea Multimedia Society
• /
• v.3 no.4
• /
• pp.356-364
• /
• 2000

Block based fast motion estimation algorithm use the fixed search pattern to reduce the search point, and are based on the assumption that the error in the mean absolute error space monotonically decreases to the global minimum. Therefore, in case of many local minima in a search region we are likely to find local minima instead of the global minimum and highly rely on the initial search points. This situation is evident in the motion boundary. In this paper we define the candidate regions within the search region using the motion information of the neighbor blocks and we propose the multiple local search method (MLSM) which search for the solution throughout the candidate regions to reduce the possibilities of isolation to the local minima. In the MLSM we mark the candidate region in the search point map and we avoid to search the candidate regions already visited to reduce the calculation. In the simulation results the proposed method shows more excellent results than that of other gradient based method especially in the search of motion boundary. Especially, in PSNR the proposed method obtains similar estimate accuracy with the significant reduction of search points to that of full search.

• Journal of Power Electronics
• /
• v.17 no.2
• /
• pp.368-379
• /
• 2017

In this paper, a direct torque control algorithm with novel duty cycle-based modulation is proposed for permanent magnet synchronous motor drives fed by neutral-point clamped three-level inverters. Compared with the standard DTC, the proposed algorithm can suppress steady-state torque ripples as well as ensure neutral-point potential balance and smooth vector switching. A unified torque/flux evaluation table with multiple voltage vectors and precise control levels is established and used in this method. This table can be used to evaluate the effects of duty-cycle vectors on torque and flux directly, and the elements of the table are independent of the motor parameters. Consequently, a high number of appropriate voltage vectors and their corresponding duty cycles can be selected as candidate vectors to reduce torque ripples by looking up the table. Furthermore, small vectors are incorporated into the table to ensure the neutral-point potential balance with the numerous candidate vectors. The feasibility and effectiveness of the proposed algorithm are verified by both simulations and experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.1951-1972
• /
• 2018

Wi-Fi Access Point (AP) optimization approaches are used in indoor positioning systems for signal coverage enhancement, as well as positioning precision improvement. Although the huge power consumption of the AP optimization forms a serious problem due to the signal coverage requirement for large-scale indoor environment, the conventional approaches treat the problem of power consumption independent from the design of indoor positioning systems. This paper proposes a new Fast Water-filling algorithm Group Power Constraint (FWA-GPC) based Wi-Fi AP optimization approach for indoor positioning in which the power consumed by the AP optimization is significantly considered. This paper has three contributions. First, it is not restricted to conventional concept of one AP for one candidate AP location, but considered spare APs once the active APs break off. Second, it utilizes the concept of water-filling model from adaptive channel power allocation to calculate the number of APs for each candidate AP location by maximizing the location fingerprint discrimination. Third, it uses a fast version, namely Fast Water-filling algorithm, to search for the optimal solution efficiently. The experimental results conducted in two typical indoor Wi-Fi environments prove that the proposed FWA-GPC performs better than the conventional AP optimization approaches.