• Korean Institute of Interior Design Journal
• /
• no.25
• /
• pp.280-289
• /
• 2000

The purpose of this study is to suggest a evaluation method and matching process model which derives suitable design firm for a client. Unlike the existing evaluation method, the suggested evaluation method and matching process for interior design firm allows a client specify his own needs. The evaluation methods utilizes designers experience record, past performance and customers post occupancy evaluation to derive design firms meeting clients requirements. With this method and matching process model, customers could access the design firms more efficiently and the design firms suitable for the clients needs could be suggested.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.311-311
• /
• 2000

We propose a DP-based formulation for matching line patterns by defining a robust and stable geometric representation that is based on the conceptual organizations. Usually, the endpoint proximity and collinearity of image lines, as two main conceptual organization groups, are useful cues to match the model shape in the scene. As the endpoint proximity, we detect junctions from image lines. We then search for junction groups by using geometric constraint between the junctions. A junction chain similar to the model chain is searched in the scene, based on a local comparison. A Dynamic Programming-based search algorithm reduces the time complexity for the search of the model chain in the scene. Our system can find a reasonable matching, although there exist severely distorted objects in the scene. We demonstrate the feasibility of the DP-based matching method using both synthetic and real images.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.30 no.3 s.246
• /
• pp.310-317
• /
• 2006

Currently most practical vibration and structural problems in automotive suspensions require the use of the finite element method to obtain their structural responses. When the finite element model has a very large number of degrees of freedom the harmonic and dynamic analyses are computationally too expensive to repeat within a feasible design process time. To alleviate the computational difficulty, this paper presents a moment-matching based model order reduction (MOR) which reduces the number of degrees of freedom of the original finite element model and speeds up the necessary simulations with the reduced-size models. The moment-matching model reduction via the Arnoldi process is performed directly to ANSYS finite element models by software mor4ansys. Among automotive suspension components, a knuckle is taken as an example to demonstrate the advantages of this approach for vibration simulation. The frequency and transient dynamic responses by the MOR are compared with those by the mode superposition method.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.15-18
• /
• 2003

This paper proposes a color matching 3D look-up table simplifying the complex color matching procedure between a monitor and a mobile display device. In order to perform color matching, it is necessary to process color of image in the device independent color space like CIEXYZ or CIELAB. We improved the S-curve model to have smaller characterization error than tolerance error. Also, as a result of the experiments, we concluded that the color matching look-up table with 64(4$\times$4$\times$4) is the smallest size allowing characterization error to be acceptable.

• Proceedings of the KSRS Conference
• /
• 1998.09a
• /
• pp.342-348
• /
• 1998

The purpose of this paper is to extract fast DEM (Digital Elevation Model) using satellite images. DEM extraction consists of three parts. First part is the modeling of satellite position and attitude, second part is the matching of two images to find corresponding poults of them and third part is to calculate the elevation of each point by using the result of the first and second part. The position and attitude modeling of satellite is processed by using GCPs. A area based matching method is used to find corresponding points between the stereo satellite images. In the DEM generation system, this procedure holds most of a processing time, therefore a new fast matching algorithm is proposed to reduce the time for matching. The elevation of each point is calculated using the exterior orientation obtained from modeling and disparity from matching. In this paper, the SPOT satellite images, level IA 6000 $\times$6000 panchromatic images are used to extract DEM. The experiment result shows the possibility of fast DEM. extraction with the satellite images.

• International Journal of Computer Science & Network Security
• /
• v.21 no.4
• /
• pp.214-222
• /
• 2021

Recently, the growth of e-commerce in Saudi Arabia has been exponential, bringing new remarkable challenges. A naive approach for product matching and categorization is needed to help consumers choose the right store to purchase a product. This paper presents a machine learning approach for product matching that combines deep learning techniques with standard artificial neural networks (ANNs). Existing methods focused on product matching, whereas our model compares products based on unstructured descriptions. We evaluated our electronics dataset model from three business-to-consumer (B2C) online stores by putting the match products collectively in one dataset. The performance evaluation based on k-mean classifier prediction from three real-world online stores demonstrates that the proposed algorithm outperforms the benchmarked approach by 80% on average F1-measure.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.8
• /
• pp.122-129
• /
• 1997

In this paper, we propose a Hopfield model for solving the part-matching in case that is the number of parts and positions are changed. The goal of this paper is to minimize part-connection in pairs and total path of part-connections. Therefore, this kind of problem is referred to as a combinatiorial optimization problem. First of all, we review the theoretical basis for Hopfield model and present two optimal algorithms of part-matching. The first algorithm is Traveling Salesman Problem(TSP) which improved the original and the second algorithm is Wdighted Matching Problem (WMP). Finally, we show demonstration through com- puter simulation and analyze the stability and feasibility of the generated solutions for the proposed con- nection methods. Therefore, we prove that the second algorithm is better than the first algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.1
• /
• pp.12-17
• /
• 2005

The segment matching method shows better performance than the global and points-based methods to compare reference signature with an input signature. However, the segment-to-segment matching method has the problem of decreasing recognition rate according to the variation of partitioning points. This paper proposes a fusion model based on the segment matching and HMM to construct a more reliable authentic system. First, a segment matching classifier is designed by conventional technique to calculate matching values lot dynamic information of signatures. And also, a novel HMM classifier is constructed by using the principal component analysis to calculate matching values for static information of signatures. Finally, SVM classifier is adopted to effectively combine two independent classifiers. From the various experiments, we find that the proposed method shows better performance than the conventional segment matching method.

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.4
• /
• pp.363-363
• /
• 2001

We study on the velocity matching algorithm for transfer alignment of inertial navigation system(INS) using a robust H₂ filter. We suggest an uncertainty model and a discrete robust H₂filter for INS and apply the suggested robust H₂ filter to the uncertainty model. The discrete robust H₂filter is shown by simulation to have better performance time and accuracy than Kalman filter.

• Proceedings of the KIEE Conference
• /
• 2000.11d
• /
• pp.747-749
• /
• 2000

In this paper, we proposed color stereo matching algorithm using dynamic programming. The conventional gray stereo matching algorithms show blur at depth discontinuities and non-existence of matching pixel in occlusion lesions. Also it accompanies matching error by lack of matching information in the untextured region. This paper defines new cost function makes up for the problems happening in conventional gray stereo matching algorithm. New cost function contain the following properties. I) Edge points are corresponded to edge points. ii) Non-edge points are corresponded to non-edge points. iii) In case of exiting the amount of edges, the cost function has some weight in proportion to path distance. Proposed algorithm was applied in various images obtained by parallel camera model. As the result, proposed algorithm showed improved performance in the aspect of matching error and processing in the occlusion region compared to conventional gray stereo matching algorithms.