• The Journal of the Acoustical Society of Korea
• /
• v.27 no.1
• /
• pp.47-56
• /
• 2008

In the detection of an underwater target, there exists an optimal search depth for the sonar systems, at which the Probability of Detection is maximized. The optimal search depth is dependent on the depths of the target and sonar, the sound speed profile, and the bathymetry. In this paper, we address this question in range-dependent environments, particularly for the bathymetry with slope and with warm eddy. For range-dependent bathymetry, the typical sound profile in the East Sea of Korea was used. The detection range was greater when the sonar was located in deep water than in shallow water. As for the case of eddy, mesoscale warm eddy was used, and the detection range was greater when looking out of the warm eddy than when looking into the eddy.

• The KIPS Transactions:PartD
• /
• v.9D no.6
• /
• pp.1025-1042
• /
• 2002

The goal of this study is to generate a structured document which improves the performance of an information retrieval system by using thesaurus, information on relations between words (terms), and to study on the technique for searching this structured document. In order to accomplish this goal, we propose a DODI (Depth -Oriented Decomposition Index) technique for the structured document and an algorithm to search for related information efficient]y through this index technique that uses a thesaurus. We establish a storage system by which the structured document generated by this index technique is saved in a database through OpenXML and XML documents are generated through ForXML methods.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1666-1669
• /
• 2002

In the process of creating architectural scenes from photographs using Model-based Stereo 〔1〕, the geometric model is used as prior information to solve correspondence problems and recover the depth or disparity of real scenes. This paper presents an Image Subregioning algorithm that divides left and right images into several rectangular sub-images. The division is done according to the estimated depth of real scenes using a Heuristic Approach. The depth difference between the reality and the model can be partitioned into each depth level. This reduces disparity search range in the Similarity Function. For architectural scenes with complex depth, experiments using the above approach show that accurate disparity maps and better results when rendering scenes can be achieved by the proposed algorithm.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.460-465
• /
• 2009

This paper presents a new algorithm that includes a mechanism to avoid local solutions in a motion vector detection method that uses the steepest descent method. Two different implementations of the algorithm are demonstrated using two major search methods for tree structures, depth first search and breadth first search. Furthermore, it is shown that by avoiding local solutions, both of these implementations are able to obtain smaller prediction errors compared to conventional motion vector detection methods using the steepest descent method, and are able to perform motion vector detection within an arbitrary upper limit on the number of computations. The effects that differences in the search order have on the effectiveness of avoiding local solutions are also presented.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.6
• /
• pp.1431-1438
• /
• 1995

In this paper, we present a multiple-view stereo matching method in case of moving in the direction of optical axis with stereo camera. Also we analyze the obtainable depth precision to show that multiple-view stereo increases the virtual baseline with single-view stereo. This method decides candidate points for correspondence in each image pair and then search for the correct combinations of correspondences among them using the geometrical consistency they must satisfy. Adantages of this method are capability in increasing the accuracy in matching by using the multiple stereo images and less computation due to local processing. This method computes 3-D depth by averaging the depth obtained in each multiple-view stereo. We show that the resulting depth has more precision than depth obtainable by each independent stereo when the position of image feature is uncertain due to image noise. This paper first defines a multipleview stereo agorithm in case of moving in the direction of optical axis with stereo camera and analyze the obtainable precision of computed depth. Then we represent the effect of removing the incorrect matching candidate and precision enhancement with experimental result.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.39 no.1
• /
• pp.106-120
• /
• 2015

This study analyzed the effects of website and consumer's characteristics on price sensitivity as well as the effects of price sensitivity on repurchasing and switching intention. It ascertains differences in: website and consumer's characteristics, price sensitivity, and repurchasing and switching intention according to type of internet shopping mall. A survey was conducted from July 10 to August 20 in 2013, and 492 responses were used for data analysis. As a result, the reputation, ease of price search, and depth of product information positively influenced the price search and the interactivity of website characteristics positively influenced price importance. Product knowledge and information search of fashion consumers positively influenced price sensitivity. Also, the price sensitivity of internet fashion consumer positively influenced repurchasing intention. The price search positively affected the switching intention, while the price importance negatively affected the switching intention. Last, there were significant differences in the reputation, ease of price search, information search, price sensitivity, repurchasing and switching intention according to type of internet shopping mall.

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.2
• /
• pp.96-105
• /
• 2004

The recovering 3D image from 2D requires the depth information for each picture element. The manual creation of those 3D models is time consuming and expensive. The goal in this paper is to estimate the relative depth information of every region from single view image with camera translation. The paper is based on the fact that the motion of every point within image which taken from camera translation depends on the depth. Motion vector using full-search motion estimation is compensated for camera rotation and zooming. We have developed a framework that estimates the average frame depth by analyzing motion vector and then calculates relative depth of region to average frame depth. Simulation results show that the depth of region belongs to a near or far object is consistent accord with relative depth that man recognizes.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1411-1414
• /
• 1997

It is essential to obtain a distane informaion in order to completely execute assembly tasks such as a grasping and an insertion. In this paper, we propose a method estimating a measurement distance from a sensor to an object through using the omni-directional image sensing system for assembly(OISSA) and show its features and feasibility by a computer simulation. The method, utilizing a forwarded motion stereo technique, is simple to search the corresponding points and possible to immediatiely obtain a three-dimensional 2.pi.-shape information.

• Journal of the Korean Society for Library and Information Science
• /
• v.45 no.4
• /
• pp.77-102
• /
• 2011

The purpose of this study is to design, implement and evaluate a personalized search system using gathered information on users to provide more accurate search results. For this purpose, a hybrid-based user profile is constructed by using subject classification. In order to evaluate the performance of the proposed system, experts directly measured and evaluated MRR, MAP and usability by using the Korean journal articles of science and technology DB. Its performance was better than the general search system in the area of "Computer Science" and "Library and Information Science". Especially better results were shown when tested on ambiguous keywords. Evaluation through in-depth interviews proved that the proposed personalized search system was more efficient in looking up and obtaining information. In addition, the proposed personalized search system provided a variety of recommendation systems which proved helpful in navigating for new information. High user satisfaction ratings on the proposed personalized search system were another proof of its usefulness. In this study, we were able to prove through expert evaluation that the proposed personalized search system was more efficient in information retrieval.

• Korean Chemical Engineering Research
• /
• v.57 no.6
• /
• pp.781-789
• /
• 2019

There are frequent accidents by chemicals during laboratory experiments and pilot plant and reactor operations. It is necessary to find and comprehend relevant information to prevent accidents before starting synthesis experiments. In the process design stage, reaction information is also necessary to prevent runaway reactions. Although there are various sources available for synthesis information, including the Internet, it takes long time to search and is difficult to choose the right path because the substances used in each synthesis method are different. In order to solve these problems, we propose an intelligent synthetic path search system to help researchers shorten the search time for synthetic paths and identify hazardous intermediates that may exist on paths. The system proposed in this study automatically updates the database by collecting information existing on the Internet through Web scraping and crawling using Selenium, a Python package. Based on the depth-first search, the path search performs searches based on the target substance, distinguishes hazardous chemical grades and yields, etc., and suggests all synthetic paths within a defined limit of path steps. For the benefit of each research institution, researchers can register their private data and expand the database according to the format type. The system is being released as open source for free use. The system is expected to find a safer way and help prevent accidents by supporting researchers referring to the suggested paths.