• 제목/요약/키워드: Model matching

검색결과 1,365건 처리시간 0.029초

실내디자인업체 평가 및 선정 프로세스 모델에 관한 연구 (A Study on Evaluation Method and Matching Process Model for Interior Design Firms)

  • 정선영;이현수;최용의;김인한
    • 한국실내디자인학회논문집
    • /
    • 제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.

  • PDF

직선 조합의 에너지 전파를 이용한 고속 물체인식 (Fast Object Recognition using Local Energy Propagation from Combination of Saline Line Groups)

  • 강동중
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2000년도 제15차 학술회의논문집
    • /
    • 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.

  • PDF

모델차수축소법을 이용한 효율적인 진동해석 (Efficient Vibration Simulation Using Model Order Reduction)

  • 한정삼
    • 대한기계학회논문집A
    • /
    • 제30권3호
    • /
    • 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.

개선된 S-curve 모델과 RGB 칼라 참조표를 이용한 모니터와 모바일 디스플레이 장치간 색 정합 (Color matching between monitor and mobile display device using improved S-curve model and RGB color LUT)

  • 박기현;이명영;이철희;하영호
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
    • /
    • 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.

  • PDF

A method on Digital Elevation Model Extraction Using Satellite Images

  • Ye, Soo-Chul;Jeon, Min-Byung;Lee, Kwae-Hi
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 1998년도 Proceedings of International Symposium on Remote Sensing
    • /
    • 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.

  • PDF

AraProdMatch: A Machine Learning Approach for Product Matching in E-Commerce

  • Alabdullatif, Aisha;Aloud, Monira
    • International Journal of Computer Science & Network Security
    • /
    • 제21권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.

부품 조립 공정에서 경로의 최적화 알고리즘 (Optimal Algorithm of Path in the Part-Matching Process)

  • 오제휘;차영엽
    • 한국정밀공학회지
    • /
    • 제14권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.

  • PDF

구간 분할 및 HMM 기반 융합 모델에 의한 온라인 서명 검증 (On-line Signature Verification Using Fusion Model Based on Segment Matching and HMM)

  • 양동화;이대종;전명근
    • 한국지능시스템학회논문지
    • /
    • 제15권1호
    • /
    • pp.12-17
    • /
    • 2005
  • 기존의 참조서명과 입력서명을 비교하는 방법 쿵 분절 단위 비교 방법은 전역적 방법과 점 단위 방법에 비하여 우수한 장점을 가지고 있다. 그러나 분절 단위 비교 방법은 인식률과 직접적인 관계가 있는 분절의 불안정 문제점이 있다. 본 연구에서는 분절 단위 비교 방법을 이용한 서명검증의 신뢰도를 향상시키기 위해 두 가지 형태의 모델을 구축하였다. 우선 기존에 사용된 구간 분할 매칭 방법을 사용하여 서명의 동적정보에 대한 매칭도를 산출하였다. 다음으로 서명의 정적정보를 균일하게 분할한 후 분할된 영역을 주성분 분석 기법에 의해 특징 벡터를 산출하고 HMM에 의해 서명간의 매칭도를 산출하였다. 최종 융합단계에서는 SVM 분류기에 의해 서명의 진위여부를 결정하도록 구축하였다. 실험 결과 제안된 기법은 분절단위 기반의 구간 분할 매칭 기법에 비해 우수한 성능을 나타냈다.

강인 H₂필터를 이용한 속도정합 알고리즘 (Velocity Matching Algorithm Using Robust H₂Filter)

  • 양철관;심덕선;박찬국
    • 제어로봇시스템학회논문지
    • /
    • 제7권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.

동적계획법을 이용한 컬러 스테레오 정합 (Color Stereo Matching Using Dynamic Programming)

  • 오종규;이찬호;김종구
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2000년도 추계학술대회 논문집 학회본부 D
    • /
    • 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.

  • PDF