• The Journal of the Convergence on Culture Technology
• /
• v.5 no.3
• /
• pp.283-288
• /
• 2019

We propose a method to search for similar images by using outline lines and viewpoints. In the first test, the three-dimensional image, which can't control the motion, has lower search accuracy than the static flat image. For the cause analysis, six specific tropical fish data were selected. We made a 3D graphics of tropical fishes of each kind, and we made 144 image outline lines with 12 stage viewpoints of top, bottom, left and right. Tropical fish by type were collected and sorted by time of search through similar search. Studies have shown that there are many unique viewpoints for each species of tropical fish. To increase the accuracy of the search, a User Interface was created to select the user's point of view. When the user selects the viewpoint of the image, a method of showing the result in consideration of the range of the related viewpoint is proposed.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.4D
• /
• pp.555-561
• /
• 2009

In lieu of section profile data, a fitting of the bored tunnel shape is more significant confirmation for maintenance of a tunnel. Before the permit on the completion of a tunnel, deformation of the completed tunnel with respect to the design model are considered. And deformation can be produced at continuously along the entire of the tunnel section. This study firstly includes an analysis of algebraic approach and test it with an observed field data. And then a number of methods, line search method, genetic algorithm, and pattern search methods, are compared with the 3D tunnel shape fitting. Algebraic methods can solve a simple circular cylinder type as like a railway tunnel. However, a more complex model (compound circular curve and non circular) as like a highway tunnel has to be solved with soft computing tools in the cause of conditional constraints. The genetic algorithm and pattern search methods are computationally more intensive, but they are more flexible at a complex condition. The line search method is fastest, but it needs a narrow bounds of the initial values.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.7
• /
• pp.473-482
• /
• 2004

In this paper, a detection technique of initial rotor position at a standstill in Toroidal Switched Reluctance Motor(TSRM) with built-in interior central pole search coil is proposed. In case search coils are used as a position sensor, it has many advantages like low cost, decrease in the volume, high robust characteristics and wide applications. However, the initial rotor position detection is very difficult because the search coil's EMF is not exist at a standstill. In this paper, a new detection method of initial rotor position is suggested using interior central pole search coil. The simulation and experiment for the proposed method and their results support the validity of the proposed scheme by verifying the operation of a 6/4 TSRM using search coils.

• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.1006-1010
• /
• 1995

This paper describes Sexual Reproduction Genetic Algorithm(SRGA) for function optimization. In SRGA, each individual utilize a diploid chromosome structure. Sex cells(gametes) are produced through artificial meiosis in which crossover and mutation occur. The proposed method has two selection operators, one, individual selection which selects the individual to fertilize, and the other, gamete selection which makes zygote for offspring production. We consider the effects of multi-selection and diploidy on search performance. SRGA improves local and global search(exploitation and exploration) and show optimum tracking performance in nonstationary environments. Gray coding is incorporated to transforming the search space and Genic uniform distribution method is proposed to alleviate the problem of premature convergence.

• Journal of Intelligence and Information Systems
• /
• v.11 no.1
• /
• pp.153-167
• /
• 2005

In this paper, we consider the problem of exploring unknown environments with a mobile robot or an autonomous character agent. Traditionally, research efforts to address the space exploration problem havefocused on the graph-based space representations and the graph search algorithms. Recently EXPLORE, one of the most efficient search algorithms, has been discovered. It traverses at most min$min(mn, d^2+m)$ edges where d is the deficiency of a edges and n is the number of edges and n is the number of vertices. In this paper, we propose DFS-RTA* and DFS-PHA*, two real-time graph search algorithms for directing an autonomous agent to explore in an unknown space. These algorithms are all built upon the simple depth-first search (DFS) like EXPLORE. However, they adopt different real-time shortest path-finding methods for fast backtracking to the latest node, RTA* and PHA*, respectively. Through some experiments using Unreal Tournament, a 3D online game environment, and KGBot, an intelligent character agent, we analyze completeness and efficiency of two algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.8
• /
• pp.1077-1085
• /
• 2020

In order to Mine Countermeasure (MCM), the search is carried out for the expected mine zone. At this time, mine hunting uses Autonomous Unmanned Vehicle(AUV), taking into account the danger of mine and the stability of our forces. Sonar system for identifying buried mines are equipped with Side Scan Sonar(SSS) or Synthetic Aperture Sonar(SAS). This paper describes the analysis of mine hunting effects according to the commercial SSS characteristics. Based on the characteristics of each SSS, the insonified area and recognition probability were modeled, and the analysis was performed according to the search pattern of the AUV. AUV's search pattern defines three patterns depending on the presence or absence of SSS or shaded areas. The analysis results derived search time and detection probability for each search pattern, and finally, the improvement of search depending on the presence or absence of side injection or shaded area.

• The Journal of Korean Medicine
• /
• v.30 no.4
• /
• pp.47-58
• /
• 2009

Objectives: Several domestic search systems for research projects providing capabilities of searching and managing the research information based on metadata have been completed, although they cannot search projects for specific domains such as the Oriental Medicine field. Therefore, in this paper we propose an effective method for collecting and refining information of research projects in the oriental medicine field. We also design and implement a search management system based on the collected information. Methods: We chose three search elements and defined the collecting process for research projects. The collected information was refined to enhance the quality of results. Then, the search management system was implemented by Adobe Flex. Results: We were able to collect 1,688 research projects in the oriental medicine field. We also implemented the search management system, which provides the functionalities of search and management such as input, update, delete, spreadsheet import/export of R&D projects, user management and access control. Conclusions: The collected information and the search management system will be used in a project analysis system which will be constructed in the future. The project analysis system could help to analyze trends in oriental medicine research as well as construct a technical roadmap.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.1
• /
• pp.22-31
• /
• 2004

This paper deals with the dynamic hand gesture recognition based on computer vision using neural networks. This paper proposes a global search method and a local search method to recognize the hand gesture. The global search recognizes a hand among the hand candidates through the entire image search, and the local search recognizes and tracks only the hand through the block search. Dynamic hand gesture recognition method is based on the skin-color and shape analysis with the invariant moment and direction information. Starting point and ending point of the dynamic hand gesture are obtained from hand shape. Experiments have been conducted for hand extraction, hand recognition and dynamic hand gesture recognition. Experimental results show the validity of the proposed method.

• Journal of Information Processing Systems
• /
• v.16 no.3
• /
• pp.639-647
• /
• 2020

In the vibration target localization algorithms based on time difference of arrival (TDOA), Fang algorithm is often used in practice because of its simple calculation. However, when the delay estimation error is large, the localization equation of Fang algorithm has no solution. In order to solve this problem, one dimensional search location algorithm based on TDOA is proposed in this paper. The concept of search is introduced in the algorithm. The distance d1 between any single sensor and the vibration target is considered as a search variable. The vibration target location is searched by changing the value of d1 in the two-dimensional plane. The experiment results show that the proposed algorithm is superior to traditional methods in localization accuracy.

• ETRI Journal
• /
• v.33 no.6
• /
• pp.904-913
• /
• 2011

Three-dimensional (3D) memories using through-silicon vias (TSVs) as vertical buses across memory layers will likely be the first commercial application of 3D integrated circuit technology. The memory dies to stack together in a 3D memory are selected by a die-selection method. The conventional die-selection methods do not result in a high-enough yields of 3D memories because 3D memories are typically composed of known-good-dies (KGDs), which are repaired using self-contained redundancies. In 3D memory, redundancy sharing between neighboring vertical memory dies using TSVs is an effective strategy for yield enhancement. With the redundancy sharing strategy, a known-bad-die (KBD) possibly becomes a KGD after bonding. In this paper, we propose a novel die-selection method using KBDs as well as KGDs for yield enhancement in 3D memory. The proposed die-selection method uses three search-space conditions, which can reduce the search space for selecting memory dies to manufacture 3D memories. Simulation results show that the proposed die-selection method can significantly improve the yield of 3D memories in various fault distributions.