• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.10a
• /
• pp.451-454
• /
• 2002

The fiber optic communication technology is considered as a key solution for the future communication. However the assembly of the fiber optic components highly depends on manual or semi-automated alignment process. And the light search algorithm is recognized an important factor to reduce the manufacturing process time. Therefore this paper investigates optimal search algorithm for the automatic alignment of fiber optic components. The experiments show the effectiveness of Hill Climbing Search, Adaptive Hill Climbing Search and Steepest Search algorithms, in a view of process time.

• International conference on construction engineering and project management
• /
• 2020.12a
• /
• pp.399-408
• /
• 2020

The construction industry is suffering from aging workers, frequent accidents, as well as low productivity. With the rapid development of information technologies in recent years, automatic construction, especially automatic cranes, is regarded as a promising solution for the above problems and attracting more and more attention. However, in practice, limited by the complexity and dynamics of construction environment, manual inspection which is time-consuming and error-prone is still the only way to recognize the search object for the operation of crane. To solve this problem, an image-processing-based automated object recognition approach is proposed in this paper, which is a fusion of Convolutional-Neutral-Network (CNN)-based and traditional object detections. The search object is firstly extracted from the background by the trained Faster R-CNN. And then through a series of image processing including Canny, Hough and Endpoints clustering analysis, the vertices of the search object can be determined to locate it in 3D space uniquely. Finally, the features (e.g., centroid coordinate, size, and color) of the search object are extracted for further recognition. The approach presented in this paper was implemented in OpenCV, and the prototype was written in Microsoft Visual C++. This proposed approach shows great potential for the automatic operation of crane. Further researches and more extensive field experiments will follow in the future.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3855-3865
• /
• 2000

The automatic indexing is a compulsory part for the text retrieval system. However it is impossible to rank the appropriate texts at top. Furthermore, it is more difficult to prevent to rank the inappropriate texts having homonyms at top by only the automatic indexing. In this paper, we proposed the two-level retrieval system to enhance the retrieval efficiency, in which Automatic Keyword Network (AKN) is used at the second-level process. The firsHevel search is carried out with an inverted index file generated by the automatic indexing. On the other hand the second-level search exploits AKN based on the degree of asslxiation between terms. We have developed several formulas for rearranging the rank of texts at second-level search, and evaluated the performance of the effects of them on resolving the word sense ambiguities.

• Convergence Security Journal
• /
• v.6 no.3
• /
• pp.107-115
• /
• 2006

It discovered a design error from the module to search required installing security patch of Windows Update and Automatic Updates that Microsoft supports it to install security patch easily and quickly. It explains and tests security patch-disguise attack by this error. Security patch-disguise attack is to maintains a vulnerability and to be not searched the security patch simultaneously. Also it composes an attack scenario. Is like that, it proposes the method which solves an design error of the module to search required installing security patch.

• Journal of Forest and Environmental Science
• /
• v.34 no.2
• /
• pp.142-144
• /
• 2018

This paper discusses the development of semi-automatic search program for crown delineation in stand level. The crown of an individual tree was delineated by applying the Watershed (WS) and Valley Following (VF) algorithms. Unmanned Aerial Vehicle (UAV) images were used in the semi-automatic search program to delineate the crown area. The overall accuracy and Khat were used in accuracy assessment. WS algorithm's model showed the overall accuracy and Khat index of 0.80 and 0.59, respectively, in Plot 1. However, the overall accuracy and Khat of VF algorithm's model were 0.78 and 0.51, respectively, in Plot 2.

• The KIPS Transactions:PartD
• /
• v.19D no.2
• /
• pp.133-138
• /
• 2012

Queries entered in a search box are the results of users' activities to actively seek information. Therefore, search logs are important data which represent users' information needs. The purpose of this study is to examine if there is a relationship between the results of queries automatically classified and the categories of documents accessed. Search sessions were identified in 2009 NDSL(National Discovery for Science Leaders) log dataset of KISTI (Korea Institute of Science and Technology Information). Queries and items used were extracted by session. The queries were processed using an automatic classifier. The identified queries were then compared with the subject categories of items used. As a result, it was found that the average similarity was 58.8% for the automatic classification of the top 100 queries. Interestingly, this result is a numerical value lower than 76.8%, the result of search evaluated by experts. The reason for this difference explains that the terms used as queries are newly emerging as those of concern in other fields of research.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.13 no.3
• /
• pp.329-336
• /
• 2000

A method for automatic extraction of 2-dimensional finite element connectivities by searching the shortest closed path from a certain node to the starting node was developed. Only the best path among the possible paths was probed. The uniqueness and validity of the extracted path were examined. The proposed method was proved to be complete. Examples show that the proposed method can extract elements exactly from the irregular mesh which can not be handled easily by the conventional automatic mesh generation.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.1
• /
• pp.63-71
• /
• 1988

In this paper, a fast matching method using hierarchical neighborhood search and subtemplate to reduce very heavy computational load of the conventional matching method, is presented. Some parameters of the proposed method are chosen so that an automatic target tracker to which it is applied can track one moving object well in comparatively simple background. Experimental results show that its performance is not so degraded in spite of high computational reduction over that of the matching method using 3-step search.

• Nuclear Engineering and Technology
• /
• v.55 no.8
• /
• pp.3030-3038
• /
• 2023

Nowadays, mobile robots have been used to search for uncontrolled radioactive source in indoor environments to avoid radiation exposure for technicians. However, in the indoor environments, especially in the presence of obstacles, how to make the robots with limited sensing capabilities automatically search for the radioactive source remains a major challenge. Also, the source search efficiency of robots needs to be further improved to meet practical scenarios such as limited exploration time. This paper proposes an automatic source search strategy, abbreviated as ACA: the location of source is estimated by a convolutional neural network (CNN), and the path is planned by the A-star algorithm. First, the search area is represented as an occupancy grid map. Then, the radiation dose distribution of the radioactive source in the occupancy grid map is obtained by Monte Carlo (MC) method simulation, and multiple sets of radiation data are collected through the eight neighborhood self-avoiding random walk (ENSAW) algorithm as the radiation data set. Further, the radiation data set is fed into the designed CNN architecture to train the network model in advance. When the searcher enters the search area where the radioactive source exists, the location of source is estimated by the network model and the search path is planned by the A-star algorithm, and this process is iterated continuously until the searcher reaches the location of radioactive source. The experimental results show that the average number of radiometric measurements and the average number of moving steps of the ACA algorithm are only 2.1% and 33.2% of those of the gradient search (GS) algorithm in the indoor environment without obstacles. In the indoor environment shielded by concrete walls, the GS algorithm fails to search for the source, while the ACA algorithm successfully searches for the source with fewer moving steps and sparse radiometric data.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.6
• /
• pp.99-108
• /
• 2004

In this paper, a new fast detection and clutter rejection method is proposed for CCD-image-based Automatic Target Detection System. For defence application, fast computation is a critical point, thus we concentrated on the ability to detect various targets with simple computation. In training stage, 1D template set is generated by regional vertical projection and K-means clustering, and binary tree structure is adopted to reduce the number of template matching in test stage. We also use adaptive skip-width by Correlation-based Adaptive Predictive Search(CAPS) to further improve the detecting speed. In clutter rejection stage, we obtain Fourier Descriptor coefficients from boundary information, which are useful to rejected clutters.