• 제목/요약/키워드: Mean Average Precision (MAP)

검색결과 12건 처리시간 0.028초

Z-map과 절삭계수를 이용한 볼엔드밀의 평균절삭력 예측 (Prediction of Mean Cutting Force in Ball-end Milling using 2-map and Cutting Parameter)

  • 황인길;김규만;주종남
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 1995년도 추계학술대회 논문집
    • /
    • pp.179-184
    • /
    • 1995
  • A new cutting parameter is defined in the spherical part of ball end-mill cutter. A series of slot cutting experiments were carried out to obtain the cutting parameter. The cutter contact area is expressed as the grid posiotion in the cutting plane using Z map. The cutting forces in each grid are calculated and saved as force map, prior to the average cutting forces calculation. The cutting force, in the arbitrary cutting area, can be easily calculated by summing up the cutting forces of the engaged grid in the force map. This model was verified in the inclined surface cutting by cutting test of a cylindrical part.

  • PDF

실내 자율주행 로봇을 위한 3차원 다층 정밀 지도 구축 및 위치 추정 알고리즘 (3D Multi-floor Precision Mapping and Localization for Indoor Autonomous Robots)

  • 강규리;이대규;심현철
    • 로봇학회논문지
    • /
    • 제17권1호
    • /
    • pp.25-31
    • /
    • 2022
  • Moving among multiple floors is one of the most challenging tasks for indoor autonomous robots. Most of the previous researches for indoor mapping and localization have focused on singular floor environment. In this paper, we present an algorithm that creates a multi-floor map using 3D point cloud. We implement localization within the multi-floor map using a LiDAR and an IMU. Our algorithm builds a multi-floor map by constructing a single-floor map using a LOAM-based algorithm, and stacking them through global registration that aligns the common sections in the map of each floor. The localization in the multi-floor map was performed by adding the height information to the NDT (Normal Distribution Transform)-based registration method. The mean error of the multi-floor map showed 0.29 m and 0.43 m errors in the x, and y-axis, respectively. In addition, the mean error of yaw was 1.00°, and the error rate of height was 0.063. The real-world test for localization was performed on the third floor. It showed the mean square error of 0.116 m, and the average differential time of 0.01 sec. This study will be able to help indoor autonomous robots to operate on multiple floors.

Detection of Traditional Costumes: A Computer Vision Approach

  • Marwa Chacha Andrea;Mi Jin Noh;Choong Kwon Lee
    • 스마트미디어저널
    • /
    • 제12권11호
    • /
    • pp.125-133
    • /
    • 2023
  • Traditional attire has assumed a pivotal role within the contemporary fashion industry. The objective of this study is to construct a computer vision model tailored to the recognition of traditional costumes originating from five distinct countries, namely India, Korea, Japan, Tanzania, and Vietnam. Leveraging a dataset comprising 1,608 images, we proceeded to train the cutting-edge computer vision model YOLOv8. The model yielded an impressive overall mean average precision (MAP) of 96%. Notably, the Indian sari exhibited a remarkable MAP of 99%, the Tanzanian kitenge 98%, the Japanese kimono 92%, the Korean hanbok 89%, and the Vietnamese ao dai 83%. Furthermore, the model demonstrated a commendable overall box precision score of 94.7% and a recall rate of 84.3%. Within the realm of the fashion industry, this model possesses considerable utility for trend projection and the facilitation of personalized recommendation systems.

MFMAP: Learning to Maximize MAP with Matrix Factorization for Implicit Feedback in Recommender System

  • Zhao, Jianli;Fu, Zhengbin;Sun, Qiuxia;Fang, Sheng;Wu, Wenmin;Zhang, Yang;Wang, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권5호
    • /
    • pp.2381-2399
    • /
    • 2019
  • Traditional recommendation algorithms on Collaborative Filtering (CF) mainly focus on the rating prediction with explicit ratings, and cannot be applied to the top-N recommendation with implicit feedbacks. To tackle this problem, we propose a new collaborative filtering approach namely Maximize MAP with Matrix Factorization (MFMAP). In addition, in order to solve the problem of non-smoothing loss function in learning to rank (LTR) algorithm based on pairwise, we also propose a smooth MAP measure which can be easily implemented by standard optimization approaches. We perform experiments on three different datasets, and the experimental results show that the performance of MFMAP is significantly better than other recommendation approaches.

질의 어휘와의 근접도를 반영한 단어 그래프 기반 질의 확장 (Query Expansion based on Word Graph using Term Proximity)

  • 장계훈;이경순
    • 정보처리학회논문지B
    • /
    • 제19B권1호
    • /
    • pp.37-42
    • /
    • 2012
  • 잠정적 적합성 피드백모델은 초기 검색 결과의 상위에 순위화된 문서를 적합 문서라 가정하고, 상위문서에서 빈도가 높은 어휘를 확장 질의로 선택한다. 빈도수를 이용한 질의 확장 방법의 단점은 문서 안에서 포함된 어휘들 사이의 근접도에 상관없이 각 어휘를 독립적으로 생각한다는 것이다. 본 논문에서는 어휘빈도를 이용한 질의 확장을 대체할 수 있는 어휘 근접도를 반영한 단어 그래프 기반 질의 확장을 제안한다. 질의 어휘 주변에 발생한 어휘들을 노드로 표현하고, 어휘들 사이의 근접도를 에지의 가중치로 하여 단어 그래프를 표현한다. 반복된 연산을 통해 확장 질의를 선택함으로써 성능을 향상시키는 기법을 제안한다. 유효성 검증을 위해 웹문서 집합인 TREC WT10g 테스트 컬렉션에 대한 실험에서 언어모델 보다 MAP 평가 기준에서 6.4% 향상됨을 보였다.

단어 근접도를 반영한 단어 그래프 기반 질의 확장 (Query Expansion based on Word Graph using Term Proximity)

  • 장계훈;조승현;이경순
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2010년도 추계학술발표대회
    • /
    • pp.754-757
    • /
    • 2010
  • 질의 확장은 초기 검색결과에서 질의와 연관된 단어를 선택하여 질의를 확장함으로써 검색 성능을 향상시키는 기법이다. 페이지 랭크(PageRank) 알고리즘은 웹문서 사이의 링크구조를 이용하여 문서들의 상대적인 중요성을 측정하기 위해 제안되었다. 본 논문에서는 문서들 사이의 관계가 아니라 문서 안에서 단어 그래프(Word Graph)를 통해 단어들 사이의 상대적인 중요성을 계산하였다. 질의와 가까이 위치한 단어들 사이의 관계를 단어 그래프에 적용하여 중요도를 계산하고 확장단어를 선택한다. 본 논문의 유효성을 검증하기 위해 웹문서 집합인 TREC WT10g 에 대해 실험하였고, 적합모델(Relevance Model)보다 MAP(Mean Average Precision)가 4.1% 향상되었다.

SuperDepthTransfer: Depth Extraction from Image Using Instance-Based Learning with Superpixels

  • Zhu, Yuesheng;Jiang, Yifeng;Huang, Zhuandi;Luo, Guibo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권10호
    • /
    • pp.4968-4986
    • /
    • 2017
  • In this paper, we primarily address the difficulty of automatic generation of a plausible depth map from a single image in an unstructured environment. The aim is to extrapolate a depth map with a more correct, rich, and distinct depth order, which is both quantitatively accurate as well as visually pleasing. Our technique, which is fundamentally based on a preexisting DepthTransfer algorithm, transfers depth information at the level of superpixels. This occurs within a framework that replaces a pixel basis with one of instance-based learning. A vital superpixels feature enhancing matching precision is posterior incorporation of predictive semantic labels into the depth extraction procedure. Finally, a modified Cross Bilateral Filter is leveraged to augment the final depth field. For training and evaluation, experiments were conducted using the Make3D Range Image Dataset and vividly demonstrate that this depth estimation method outperforms state-of-the-art methods for the correlation coefficient metric, mean log10 error and root mean squared error, and achieves comparable performance for the average relative error metric in both efficacy and computational efficiency. This approach can be utilized to automatically convert 2D images into stereo for 3D visualization, producing anaglyph images that are visually superior in realism and simultaneously more immersive.

딥러닝을 활용한 단안 카메라 기반 실시간 물체 검출 및 거리 추정 (Monocular Camera based Real-Time Object Detection and Distance Estimation Using Deep Learning)

  • 김현우;박상현
    • 로봇학회논문지
    • /
    • 제14권4호
    • /
    • pp.357-362
    • /
    • 2019
  • This paper proposes a model and train method that can real-time detect objects and distances estimation based on a monocular camera by applying deep learning. It used YOLOv2 model which is applied to autonomous or robot due to the fast image processing speed. We have changed and learned the loss function so that the YOLOv2 model can detect objects and distances at the same time. The YOLOv2 loss function added a term for learning bounding box values x, y, w, h, and distance values z as 클래스ification losses. In addition, the learning was carried out by multiplying the distance term with parameters for the balance of learning. we trained the model location, recognition by camera and distance data measured by lidar so that we enable the model to estimate distance and objects from a monocular camera, even when the vehicle is going up or down hill. To evaluate the performance of object detection and distance estimation, MAP (Mean Average Precision) and Adjust R square were used and performance was compared with previous research papers. In addition, we compared the original YOLOv2 model FPS (Frame Per Second) for speed measurement with FPS of our model.

Korean-Chinese Person Name Translation for Cross Language Information Retrieval

  • Wang, Yu-Chun;Lee, Yi-Hsun;Lin, Chu-Cheng;Tsai, Richard Tzong-Han;Hsu, Wen-Lian
    • 한국언어정보학회:학술대회논문집
    • /
    • 한국언어정보학회 2007년도 정기학술대회
    • /
    • pp.489-497
    • /
    • 2007
  • Named entity translation plays an important role in many applications, such as information retrieval and machine translation. In this paper, we focus on translating person names, the most common type of name entity in Korean-Chinese cross language information retrieval (KCIR). Unlike other languages, Chinese uses characters (ideographs), which makes person name translation difficult because one syllable may map to several Chinese characters. We propose an effective hybrid person name translation method to improve the performance of KCIR. First, we use Wikipedia as a translation tool based on the inter-language links between the Korean edition and the Chinese or English editions. Second, we adopt the Naver people search engine to find the query name's Chinese or English translation. Third, we extract Korean-English transliteration pairs from Google snippets, and then search for the English-Chinese transliteration in the database of Taiwan's Central News Agency or in Google. The performance of KCIR using our method is over five times better than that of a dictionary-based system. The mean average precision is 0.3490 and the average recall is 0.7534. The method can deal with Chinese, Japanese, Korean, as well as non-CJK person name translation from Korean to Chinese. Hence, it substantially improves the performance of KCIR.

  • PDF

머신러닝 기반 MMS Point Cloud 의미론적 분할 (Machine Learning Based MMS Point Cloud Semantic Segmentation)

  • 배재구;서동주;김진수
    • 대한원격탐사학회지
    • /
    • 제38권5_3호
    • /
    • pp.939-951
    • /
    • 2022
  • 자율주행차에 있어 가장 중요한 요소는 차량 주변 환경과 정확한 위치를 인식하는 것이며, 이를 위해 다양한 센서와 항법 시스템 등이 활용된다. 하지만 센서와 항법 시스템의 한계와 오차로 인해 차량 주변 환경과 위치 인식에 어려움이 있다. 이러한 한계를 극복하고 안전하고 편리한 자율주행을 위해서 고정밀의 인프라 정보를 제공하는 정밀도로지도(high definition map, HD map)의 필요성은 증대되고 있다. 정밀도로지도는 모바일 매핑 시스템(mobile mapping system, MMS)을 통해 획득된 3차원 point cloud 데이터를 이용하여 작성된다. 하지만 정밀도로지도 작성에 많은 양의 점을 필요로 하고 작성 항목이 많아 수작업이 요구되어 많은 비용과 시간이 소요된다. 본 연구는 정밀도로지도의 필수 요소인 차선을 포함한 도로, 연석, 보도, 중앙분리대, 기타 6개의 클래스로 MMS point cloud 데이터를 유의미한정보로 분할하여 정밀도로지도의 효율적인 작성에 목적을 둔다. 분할에는 머신러닝 모델인 random forest (RF), support vector machine (SVM), k-nearest neighbor (KNN) 그리고 gradient boosting machine (GBM)을 사용하였고 MMS point cloud 데이터의 기하학적, 색상, 강도 특성과 차선 분할을 위해 추가한 도로 설계적 특성을 고려하여 11개의 변수를 선정하였다. 부산광역시 미남역 일대 5차선도로 130 m 구간의 MMS point cloud 데이터를 사용하였으며, 분할 결과 각 모델의 평균 F1 score는 RF 95.43%, SVM 92.1%, GBM 91.05%, KNN 82.63%로 나타났다. 가장 좋은 분할 성능을 보인 모델은 RF이며 클래스 별 F1 score는 도로, 보도, 연석, 중앙분리대, 차선에서 F1 score가 각각 99.3%, 95.5%, 94.5%, 93.5%, 90.1% 로 나타났다. RF 모델의 변수 중요도 결과는 본 연구에서 추가한 도로 설계적 특성의 변수 XY dist., Z dist. 모두 mean decrease accuracy (MDA), mean decrease gini (MDG)가 높게 나타났다. 이는 도로 설계적 특성을 고려한 변수가 차선을 포함한 여러 클래스 분할에 중요하게 작용하였음을 뜻한다. 본 연구를 통해 MMS point cloud를 머신러닝 기반으로 차선을 포함한 여러 클래스로 분할 가능성을 확인하고 정밀도로지도 작성 시 수작업으로 인한 비용과 시간 소모를 줄이는데 도움이 될 것으로 기대한다.