• 제목/요약/키워드: Space Matching

검색결과 491건 처리시간 0.027초

Location Estimation Enhancement Using Space-time Signal Processing in Wireless Sensor Networks: Non-coherent Detection

  • Oh, Chang-Heon
    • Journal of information and communication convergence engineering
    • /
    • 제10권3호
    • /
    • pp.269-275
    • /
    • 2012
  • In this paper, we proposed a novel location estimation algorithm based on the concept of space-time signature matching in a moving target environment. In contrast to previous fingerprint-based approaches that rely on received signal strength (RSS) information only, the proposed algorithm uses angle, delay, and RSS information from the received signal to form a signature, which in turn is utilized for location estimation. We evaluated the performance of the proposed algorithm in terms of the average probability of error and the average error distance as a function of target movement. Simulation results confirmed the effectiveness of the proposed algorithm for location estimation even in moving target environment.

A Study on Metaverse Culture Contents Matching Platform

  • Kim, Jeong-Gwon
    • International Journal of Advanced Culture Technology
    • /
    • 제9권3호
    • /
    • pp.232-237
    • /
    • 2021
  • Pre-Corona cultural content was largely formed face to face. For example, the service was great while visiting tourist attractions, visiting performances to see K-Pop, or visiting lectures to learn K-Beauty. However, after the coronation, the virtual world-centered Metaverse began to take the spotlight as non-face-to-face services changed. IT and cultural contents have been combined and developed into various digital services. In that sense, Metaverse, which breaks the boundaries between real-world space and virtual space, has the potential to escape from physical time and space constraints. However, Korea still lacks a Metaverse platform for cultural content. In particular, it is necessary to match each other's necessary services by providing Metaverse -oriented cultural contents that users want, including experienced cultural contents such as K-pop and K-beauty, away from cultural contents that are developed around history museums. Therefore, in this paper, we would like to propose a Metaverse-based cultural content matching platform where users can experience cultural content directly or indirectly.

수치 사진측량에 있어서 정합 강도 측정에 의한 불량 정합점 제거에 관한 연구 (Blunder Detection by Matching Strength Measurement in Digital Photogrammetry)

  • 정명훈;윤홍식;위광재
    • 한국측량학회지
    • /
    • 제18권2호
    • /
    • pp.191-198
    • /
    • 2000
  • 수치사진 측량은 신속한 정보 획득과 갱신을 통하여 지리정보체계의 데이터 베이스 구축에 중요한 역할을 하고 있다. 이러한 수치사진측량의 기본적인 처리과정 중의 하나는 영상정합이다. 그러나 어떠한 영상정합 알고리즘도 인간의 판단과 지적 능력에 의해서 수행되는 것만큼 만족스러운 결과를 산출하지는 못하고 있다. 따라서 본 논문에서는 대상지역이 완만한 경우 정합점이라고 판단되는 점과 그 이웃 점들간에 전체적인 유사성을 관측하여 불량 정합점들을 제거하는 방법(정합 강도의 측정)을 제안하였고, 또한 최종적으로 얻어지는 정합점들의 3차원 좌표를 광속 조정법을 통하여 구하였다 실험결과 제안방법은 불량정합점들을 효과적으로 제거하였고, 계산된 3차원 지상좌표도 허용 오차 범위 이내로 들어왔다.

  • PDF

적응공명이론에 의한 자동 부분형상 인식시스템 (Automatic partial shape recognition system using adaptive resonance theory)

  • 박영태;양진성
    • 전자공학회논문지B
    • /
    • 제33B권3호
    • /
    • pp.79-87
    • /
    • 1996
  • A new method for recognizing and locating partially occluded or overlapped two-dimensional objects regardless of their size, translation, and rotation, is presented. Dominant points approximating occuluding contoures of objects are generated by finding local maxima of smoothed k-cosine function, and then used to guide the contour segment matching procedure. Primitives between the dominant points are produced by projecting the local contours onto the line between the dominant points. Robust classification of primitives. Which is crucial for reliable partial shape matching, is performed using adaptive resonance theory (ART2). The matched primitives having similar scale factors and rotation angles are detected in the hough space to identify the presence of the given model in the object scene. Finally the translation vector is estimated by minimizing the mean squred error of the matched contur segment pairs. This model-based matching algorithm may be used in diveerse factory automation applications since models can be added or changed simply by training ART2 adaptively without modifying the matching algorithm.

  • PDF

컬러 동시발생 히스토그램의 피라미드 매칭에 의한 물체 인식 (Object Recognition by Pyramid Matching of Color Cooccurrence Histogram)

  • 방희범;이상훈;서일홍;박명관;김성훈;홍석규
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
    • /
    • pp.304-306
    • /
    • 2007
  • Methods of Object recognition from camera image are to compare features of color. edge or pattern with model in a general way. SIFT(scale-invariant feature transform) has good performance but that has high complexity of computation. Using simple color histogram has low complexity. but low performance. In this paper we represent a model as a color cooccurrence histogram. and we improve performance using pyramid matching. The color cooccurrence histogram keeps track of the number of pairs of certain colored pixels that occur at certain separation distances in image space. The color cooccurrence histogram adds geometric information to the normal color histogram. We suggest object recognition by pyramid matching of color cooccurrence histogram.

  • PDF

2차원 사전 정합을 위한 실용적인 알고리즘 (A Practical Algorithm for Two-Dimensional Dictionary Matching)

  • 이광수
    • 한국정보처리학회논문지
    • /
    • 제6권3호
    • /
    • pp.812-820
    • /
    • 1999
  • In two-dimensional dictionary matching problem, we are given a two-dimensional text T and a dictionary D={P\ulcorner, ...., P\ulcorner} as a set of two-dimensional patterns. We seek the locations of all the dictionary patterns that appear in T. We present a new two-dimensional pattern matching algorithm that can handle just a single pattern, and then show how to extend it into two-dimensional dictionary matching algorithm. The suggested algorithm is practical in the sense that it can deal that it uses a small extra space proportional to the size of the dictionary, and that it is quite simple to be implemented without depending on complicated data structures.

  • PDF

2차원 영상에서 패턴매칭을 이용한 3차원 물체의 변환정보 추정 (The Estimation of the Transform Parameters Using the Pattern Matching with 2D Images)

  • 조택동;이호영;양상민
    • 한국정밀공학회지
    • /
    • 제21권7호
    • /
    • pp.83-91
    • /
    • 2004
  • The determination of camera position and orientation from known correspondences of 3D reference points and their images is known as pose estimation in computer vision or space resection in photogrammetry. This paper discusses estimation of transform parameters using the pattern matching method with 2D images only. In general, the 3D reference points or lines are needed to find out the 3D transform parameters, but this method is applied without the 3D reference points or lines. It uses only two images to find out the transform parameters between two image. The algorithm is simulated using Visual C++ on Windows 98.

SURF based Hair Matching and VR Hair Cutting

  • Sung, Changjo;Park, Kyoungsoo;Chin, Seongah
    • International journal of advanced smart convergence
    • /
    • 제11권3호
    • /
    • pp.49-55
    • /
    • 2022
  • Hair styling has a significant influence on human social perception. An increasing number of people are learning hair styling and obtaining hair designer licenses. However, it takes a considerable amount of money and time to learn professional hairstyle and beauty techniques for hair styling. Since COVID-19, there has been a growing need for offline and video lectures due to the decline in onsite training opportunities. This study provides a field practice environment in which real hair beauty is performed in a virtual space. Further, the hairstyle that is most similar to the user's hair taken with a webcam or mobile phone is determined through an image matching system using the speeded up robust features (SURF) method. The matching hairstyle was created into a three-dimensional (3D) hair model. The created 3D hair model uses a head-mounted display (HMD) and a controller that enables finger tracking through mapping to reproduce the haircutting scissors' motion while providing a feeling of real hair beauty.

Bi-directional Maximal Matching Algorithm to Segment Khmer Words in Sentence

  • Mao, Makara;Peng, Sony;Yang, Yixuan;Park, Doo-Soon
    • Journal of Information Processing Systems
    • /
    • 제18권4호
    • /
    • pp.549-561
    • /
    • 2022
  • In the Khmer writing system, the Khmer script is the official letter of Cambodia, written from left to right without a space separator; it is complicated and requires more analysis studies. Without clear standard guidelines, a space separator in the Khmer language is used inconsistently and informally to separate words in sentences. Therefore, a segmented method should be discussed with the combination of the future Khmer natural language processing (NLP) to define the appropriate rule for Khmer sentences. The critical process in NLP with the capability of extensive data language analysis necessitates applying in this scenario. One of the essential components in Khmer language processing is how to split the word into a series of sentences and count the words used in the sentences. Currently, Microsoft Word cannot count Khmer words correctly. So, this study presents a systematic library to segment Khmer phrases using the bi-directional maximal matching (BiMM) method to address these problematic constraints. In the BiMM algorithm, the paper focuses on the Bidirectional implementation of forward maximal matching (FMM) and backward maximal matching (BMM) to improve word segmentation accuracy. A digital or prefix tree of data structure algorithm, also known as a trie, enhances the segmentation accuracy procedure by finding the children of each word parent node. The accuracy of BiMM is higher than using FMM or BMM independently; moreover, the proposed approach improves dictionary structures and reduces the number of errors. The result of this study can reduce the error by 8.57% compared to FMM and BFF algorithms with 94,807 Khmer words.

Column Space Fitting (CSF)을 이용한 3차원 복원을 위한 특징점 매칭에 대한 연구 (A study on feature points matching for 3D reconstruction using Column Space Fitting (CSF))

  • 오장석;홍형길;우성용;송수환;서갑호;김대희
    • 한국컴퓨터정보학회:학술대회논문집
    • /
    • 한국컴퓨터정보학회 2018년도 제58차 하계학술대회논문집 26권2호
    • /
    • pp.389-390
    • /
    • 2018
  • 본 논문에서는 3차원 복원을 위한 특징점 추출 및 매칭에 대한 보다 정확한 방법을 제안한다. 이 방법은 컴퓨터 비전의 기본이 되는 분야로 복원뿐 만 아니라 SLAM과 같은 지도 작성 및 자율 운행에도 필요한 방법이다. 본 연구는 3차원 물체 복원을 위해서 사용하는 방법 중 하나인 Column space fitting(CSF)을 이용하여 turntable-image data에 적용하여 성능을 평가하여 정확성을 검증을 한다. 오늘날 3D scanner를 이용하여 물체를 3차원 모델을 획득하고 3D프린터를 이용하여 다양한 분야에 적용한다. 그러나 고가의 장비이기 때문에 접근성이 떨어진다. 본 연구는 영상들만을 가지고 기하학적 계산을 통해 3차원 모델을 획득한다. 본 연구결과는 기존의 방법인 KLT 알고리즘과 비교하여 RMSE의 값을 약 5배를 줄이는 성능 향상을 보인다.

  • PDF