• Title/Summary/Keyword: 데이터 매칭

Search Result 688, Processing Time 0.028 seconds

A User Detection Technique Based on Parallel Orthogonal Matching Pursuit for Large-Scale Random Access Networks (대규모 랜덤 액세스 네트워크에서 병렬 직교매칭퍼슛 기술을 이용한 사용자 검출 기법)

  • Park, Jeonghong;Jung, Bang Chul;Kim, Jinwoo;Kim, Jeong-Pil
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.6
    • /
    • pp.1313-1320
    • /
    • 2015
  • In this paper, we propose a user detection technique based on parallel orthogonal matching pursuit (POMP) for uplink multi-user random access networks (RANs) with a number of users and receiver antennas. In general RANs, it is difficult to estimate the number of users simultaneously transmitting packets at the receiver because users with data send the data without grant of BS. In this paper, therefore, we modify the original POMP for the RAN and evaluate its performances through extensive computer simulations. Simulation results show that the proposed POMP can effectively detect activated users more than about 2%~8% compared with the conventional OMP in RANs.

A Study on the Pattern Matching Algorithm of 3D Coordinates for Quality Control in Ship Blocks (선박블록의 정도관리를 위한 3차원 좌표의 패턴매칭 알고리즘에 대한 연구)

  • Lee, Ho Cheol;Lee, Dong Myung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.10
    • /
    • pp.933-939
    • /
    • 2012
  • In general, the three-dimensional(3D) coordinates of the manufactured ship blocks are measured using the laser measuring equipment by ship engineers. But, many deflections between the measured coordinates in manufactured step and the designed coordinates in the design step are occurred because of the measuring process of ship blocks manually. Thus, the ship engineer should conform the consistency between the measured coordinates and the designed coordinates step by step, and it largely causes the loss of manpower and time. In this paper, the automated pattern matching algorithm of 3D coordinates for quality control in ship blocks is suggested in order to solve this problem, and the performance of the algorithm is analyzed using the 3D coordinates simulation software developed by our research laboratory. The coordinates matching rate of the measured coordinates in the single/multi ship block(s) is about 90.2% under the tolerated distance error range is 20~25cm.

A Method of Image Matching by 2D Alignment of Unit Block based on Comparison between Block Content (단위블록의 색공간 내용비교 기반 2차원 블록정렬을 이용한 이미지 매칭방법)

  • Jang, Chul-Jin;Cho, Hwan-Gue
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.8
    • /
    • pp.611-615
    • /
    • 2009
  • Due to the popular use of digital camera, a great number of photos are taken at every usage of camera. It is essential to reveal relationship between photos to manage digital photos efficiently. We propose a method that tessellates image into unit blocks and applies 2D alignment to extend content-based similar region from seed block pair having high similarity. Through an alignment, we can get a block region scoring best matching value on whole image. The method can distinguish whether photos are sharing the same object or background. Our result is less sensitive to transition or pause change of objects. In experiment, we show how our alignment method is applied to real photo and necessities for further research like photo clustering and massive photo management.

A Study on the Data Fusion Method using Decision Rule for Data Enrichment (의사결정 규칙을 이용한 데이터 통합에 관한 연구)

  • Kim S.Y.;Chung S.S.
    • The Korean Journal of Applied Statistics
    • /
    • v.19 no.2
    • /
    • pp.291-303
    • /
    • 2006
  • Data mining is the work to extract information from existing data file. So, the one of best important thing in data mining process is the quality of data to be used. In this thesis, we propose the data fusion technique using decision rule for data enrichment that one phase to improve data quality in KDD process. Simulations were performed to compare the proposed data fusion technique with the existing techniques. As a result, our data fusion technique using decision rule is characterized with low MSE or misclassification rate in fusion variables.

An Implementation of Digital TV Stream Analyzer (디지틸 TV 스트림 분석기 구현)

  • 정혜진;김용한
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2000.11b
    • /
    • pp.95-100
    • /
    • 2000
  • 본 논문에서는 디지털 TV 방송 스트림을 분석, 검증하기 위한 시스템을 PC 상에서 소프트웨어 기반으로 구현하였다. 저장되어 있는 MPEG-2 트란스포트 스트림(transport stream, TS) 파일을 입력으로 받으며 별도의 하드웨어 장치를 사용하지 않는다. 이 분석기는 PSI(program specific information), TS 섹션, TS 헤더 등 기본 내용뿐만 아니라, TS 패킷들을 오디오, 비디오, PCR(program clock reference), 부가 데이터, 널(null) 패킷 등으로 구분하여 그래픽 사용자 인터페이스 통하여 보여 준다. 또한, 현재 표시되고 있는 TS 패킷과 가장 가까운 I 프레임를 디스플레이 해줌으로써 비트스트림 상의 오류 부분과 실제 영상과 쉽게 매칭시킬 수 있도록 해 준다. 본 논문의 분석기는 MPEG-2 비트스트림 적합성 검사 기능도 제공하며, 데이터 방송을 위한 여러 가지 부가 데이터를 MPEG-2 기본 스트림에 삽입하는 기능도 갖고 있다. 본 논문의 분석기를 이용함으로써 저비용으로 방송 스트림을 분석, 검증할 수 있을 뿐만 아니라, 실험실 연구를 위한 데이터 방송용 비트스트림을 저비용으로 제작할 수 있다.

  • PDF

A Study on Algorithm for Travel Time Estimation using Restricted GPS Data (제한된 GPS정보를 활용한 통행 시간 추정 알고리즘에 관한 연구)

  • Yoo, Nam-Hyun
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.9 no.12
    • /
    • pp.1373-1380
    • /
    • 2014
  • In order to calculate accurate traffic and traffic speed, qualified and sufficient GPS data should be provided. However, it is difficult to provide accurate traffic information using restricted GPS data from probe vehicles because of communication costs. This paper developed a algorithm that recovers links omitted by restricted GPS data with topology information, and calculate traffic speed with original links and recovered links. T traffic information service of city with a new algorithm can provide more accurate traffic and traffic speed than the original system.

A Smart System for Product Recommendation Using NFS tags (NFC태그를 이용한 스마트 상품 추천 시스템)

  • Kim, Hyun-Chul;No, Hyun-Duck;Kim, Jea-Gu;Kim, Woo-Sung;Im, Dong-Hyuk;Park, Geun-Duk
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2015.04a
    • /
    • pp.720-721
    • /
    • 2015
  • 본 논문에서는 스마트폰 NFC 기술을 이용하여 모바일 쿠폰 및 포인트 적립 등을 하며, 고객의 관심사를 프로파일화 하고 사용자가 찾아가 가게의 상품 데이터베이스와 온톨로지 데이터를 사용하여 유사 매칭을 시도하여 상품을 추천하는 어플리케이션을 개발하였다. 고객용 어플리케이션과 가게용 어플리케이션을 각각 따로 개발하여 데이터를 따로 보관하게 구현 하였으며, 고객의 데이터는 우리가 규정한 데이터로 확인하여 가게에서는 고객의 성함과 관심 품목만 나타나게 구현하였다.

A Study on the Data Fusion for Data Enrichment (데이터 보강을 위한 데이터 통합기법에 관한 연구)

  • 정성석;김순영;김현진
    • The Korean Journal of Applied Statistics
    • /
    • v.17 no.3
    • /
    • pp.605-617
    • /
    • 2004
  • One of the best important thing in data mining process is the quality of data used. When we perform the mining on data with excellent quality, the potential value of data mining can be improved. In this paper, we propose the data fusion technique for data enrichment that one phase can improve data quality in KDD process. We attempted to add k-NN technique to the regression technique, to improve performance of fusion technique through reduction of the loss of information. Simulations were performed to compare the proposed data fusion technique with the regression technique. As a result, the newly proposed data fusion technique is characterized with low MSE in continuous fusion variables.

Optimization of Post-Processing for Subsequence Matching in Time-Series Databases (시계열 데이터베이스에서 서브시퀀스 매칭을 위한 후처리 과정의 최적화)

  • Kim, Sang-Uk
    • The KIPS Transactions:PartD
    • /
    • v.9D no.4
    • /
    • pp.555-560
    • /
    • 2002
  • Subsequence matching, which consists of index searching and post-processing steps, is an operation that finds those subsequences whose changing patterns are similar to that of a given query sequence from a time-series database. This paper discusses optimization of post-processing for subsequence matching. The common problem occurred in post-processing of previous methods is to compare the candidate subsequence with the query sequence for discarding false alarms whenever each candidate subsequence appears during index searching. This makes a sequence containing candidate subsequences to be accessed multiple times from disk, and also have a candidate subsequence to be compared with the query sequence multiple times. These redundancies cause the performance of subsequence matching to degrade seriously. In this paper, we propose a new optimal method for resolving the problem. The proposed method stores ail the candidate subsequences returned by index searching into a binary search tree, and performs post-processing in a batch fashion after finishing the index searching. By this method, we are able to completely eliminate the redundancies mentioned above. For verifying the performance improvement effect of the proposed method, we perform extensive experiments using a real-life stock data set. The results reveal that the proposed method achieves 55 times to 156 times speedup over the previous methods.

Development of System for Real-Time Object Recognition and Matching using Deep Learning at Simulated Lunar Surface Environment (딥러닝 기반 달 표면 모사 환경 실시간 객체 인식 및 매칭 시스템 개발)

  • Jong-Ho Na;Jun-Ho Gong;Su-Deuk Lee;Hyu-Soung Shin
    • Tunnel and Underground Space
    • /
    • v.33 no.4
    • /
    • pp.281-298
    • /
    • 2023
  • Continuous research efforts are being devoted to unmanned mobile platforms for lunar exploration. There is an ongoing demand for real-time information processing to accurately determine the positioning and mapping of areas of interest on the lunar surface. To apply deep learning processing and analysis techniques to practical rovers, research on software integration and optimization is imperative. In this study, a foundational investigation has been conducted on real-time analysis of virtual lunar base construction site images, aimed at automatically quantifying spatial information of key objects. This study involved transitioning from an existing region-based object recognition algorithm to a boundary box-based algorithm, thus enhancing object recognition accuracy and inference speed. To facilitate extensive data-based object matching training, the Batch Hard Triplet Mining technique was introduced, and research was conducted to optimize both training and inference processes. Furthermore, an improved software system for object recognition and identical object matching was integrated, accompanied by the development of visualization software for the automatic matching of identical objects within input images. Leveraging satellite simulative captured video data for training objects and moving object-captured video data for inference, training and inference for identical object matching were successfully executed. The outcomes of this research suggest the feasibility of implementing 3D spatial information based on continuous-capture video data of mobile platforms and utilizing it for positioning objects within regions of interest. As a result, these findings are expected to contribute to the integration of an automated on-site system for video-based construction monitoring and control of significant target objects within future lunar base construction sites.