• Title/Summary/Keyword: point matching

Search Result 840, Processing Time 0.028 seconds

A Feature Point Recognition Ratio Improvement Method for Immersive Contents Using Deep Learning (딥 러닝을 이용한 실감형 콘텐츠 특징점 인식률 향상 방법)

  • Park, Byeongchan;Jang, Seyoung;Yoo, Injae;Lee, Jaechung;Kim, Seok-Yoon;Kim, Youngmo
    • Journal of IKEEE
    • /
    • v.24 no.2
    • /
    • pp.419-425
    • /
    • 2020
  • The market size of immersive 360-degree video contents, which are noted as one of the main technology of the fourth industry, increases every year. However, since most of the images are distributed through illegal distribution networks such as Torrent after the DRM gets lifted, the damage caused by illegal copying is also increasing. Although filtering technology is used as a technology to respond to these issues in 2D videos, most of those filtering technology has issues in that it has to overcome the technical limitation such as huge feature-point data volume and the related processing capacity due to ultra high resolution such as 4K UHD or higher in order to apply the existing technology to immersive 360° videos. To solve these problems, this paper proposes a feature-point recognition ratio improvement method for immersive 360-degree videos using deep learning technology.

Estimation of the Blood Pressure Using Point Variation Aspect of Dicrotic Notch on Pulsating Waveform at Each Cardiac Periods (주기별 맥동파형의 절흔점 위치변화 특성을 이용한 혈압 추정)

  • Baik, Seongwan;Park, Sungmin;Shon, Jungman;Park, Geunchul;Lee, Sanghoon;Jang, Wooyoung;Jeon, Ahyoung;Jeon, Gyerok
    • Journal of Sensor Science and Technology
    • /
    • v.22 no.2
    • /
    • pp.136-143
    • /
    • 2013
  • In the study, novel blood pressure estimation method was proposed to improve the accuracy of oscillometric method. The proposed algorithm estimated the blood pressure by comparing and analyzing the point variation aspect of dicrotic notch on pulsating waveform during each cardiac cycle. The waveforms of each cardiac cycle were extracted by maximum points. The extracted pulsating waveforms were applied by re-sampling, end-matching, and normalization. The systolic and diastolic blood pressures were estimated by point variation aspect of dicrotic notch. The blood pressures, which were estimated from proposed algorithm, were compared and analyzed by blood pressures from oscillometric methods and auscultation. The systolic blood pressure from oscillometric methods were +0.88 mmHg more than proposed algorithm, and 1.875 less than the diastolic blood pressures from proposed algorithm. The systolic and diastolic blood pressures from auscultation were 2.89 mmHg and 3.44 mmHg less than the blood pressures from proposed algorithm. As the errors between blood pressures from proposed algorithm, oscillometric method and auscultation were less than 5 mmHg, the proposed algorithm was effective.

Design of Acupuncture Controller and Dummy for Acupuncture Training System based MR (MR 기반 침술 훈련 시스템을 위한 침술 컨트롤러 및 인체모형 설계)

  • Ryu, Chang Ju;Lee, Sang Duck;Han, Seung Jo
    • Smart Media Journal
    • /
    • v.9 no.2
    • /
    • pp.86-91
    • /
    • 2020
  • The current trend of the education market is the development of the fourth industrial revolution and the development of ICT, and various technologies are developing into edu-tech technology that is integrated into the education system. In particular, the market for edu-tech systems capable of lifelike immersive learning effects in virtual space is expanding. However, education in Korean medicine is not objective because of the absence of educational simulators and systems to train and evaluate acupuncture. In this paper, we propose an acupuncture controller and a human body model to increase the effectiveness of acupuncture point training as a follow-up study of "Design of Acupuncture Contents and Dummy for Acupuncture Point Training System". Through the proposed acupuncture controller and Dummy, the accuracy of acupuncture points for the acupuncture point data matching and content motion recognition rate is presented. In addition, the results of temperature and humidity and temperature change tests for evaluating the environmental reliability of the controller are presented.

Design of Deep Learning-Based Automatic Drone Landing Technique Using Google Maps API (구글 맵 API를 이용한 딥러닝 기반의 드론 자동 착륙 기법 설계)

  • Lee, Ji-Eun;Mun, Hyung-Jin
    • Journal of Industrial Convergence
    • /
    • v.18 no.1
    • /
    • pp.79-85
    • /
    • 2020
  • Recently, the RPAS(Remote Piloted Aircraft System), by remote control and autonomous navigation, has been increasing in interest and utilization in various industries and public organizations along with delivery drones, fire drones, ambulances, agricultural drones, and others. The problems of the stability of unmanned drones, which can be self-controlled, are also the biggest challenge to be solved along the development of the drone industry. drones should be able to fly in the specified path the autonomous flight control system sets, and perform automatically an accurate landing at the destination. This study proposes a technique to check arrival by landing point images and control landing at the correct point, compensating for errors in location data of the drone sensors and GPS. Receiving from the Google Map API and learning from the destination video, taking images of the landing point with a drone equipped with a NAVIO2 and Raspberry Pi, camera, sending them to the server, adjusting the location of the drone in line with threshold, Drones can automatically land at the landing point.

Real Time Face Detection and Recognition using Rectangular Feature based Classifier and Class Matching Algorithm (사각형 특징 기반 분류기와 클래스 매칭을 이용한 실시간 얼굴 검출 및 인식)

  • Kim, Jong-Min;Kang, Myung-A
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.1
    • /
    • pp.19-26
    • /
    • 2010
  • This paper proposes a classifier based on rectangular feature to detect face in real time. The goal is to realize a strong detection algorithm which satisfies both efficiency in calculation and detection performance. The proposed algorithm consists of the following three stages: Feature creation, classifier study and real time facial domain detection. Feature creation organizes a feature set with the proposed five rectangular features and calculates the feature values efficiently by using SAT (Summed-Area Tables). Classifier learning creates classifiers hierarchically by using the AdaBoost algorithm. In addition, it gets excellent detection performance by applying important face patterns repeatedly at the next level. Real time facial domain detection finds facial domains rapidly and efficiently through the classifier based on the rectangular feature that was created. Also, the recognition rate was improved by using the domain which detected a face domain as the input image and by using PCA and KNN algorithms and a Class to Class rather than the existing Point to Point technique.

Korea Emissions Inventory Processing Using the US EPA's SMOKE System

  • Kim, Soon-Tae;Moon, Nan-Kyoung;Byun, Dae-Won W.
    • Asian Journal of Atmospheric Environment
    • /
    • v.2 no.1
    • /
    • pp.34-46
    • /
    • 2008
  • Emissions inputs for use in air quality modeling of Korea were generated with the emissions inventory data from the National Institute of Environmental Research (NIER), maintained under the Clean Air Policy Support System (CAPSS) database. Source Classification Codes (SCC) in the Korea emissions inventory were adapted to use with the U.S. EPA's Sparse Matrix Operator Kernel Emissions (SMOKE) by finding the best-matching SMOKE default SCCs for the chemical speciation and temporal allocation. A set of 19 surrogate spatial allocation factors for South Korea were developed utilizing the Multi-scale Integrated Modeling System (MIMS) Spatial Allocator and Korean GIS databases. The mobile and area source emissions data, after temporal allocation, show typical sinusoidal diurnal variations with high peaks during daytime, while point source emissions show weak diurnal variations. The model-ready emissions are speciated for the carbon bond version 4 (CB-4) chemical mechanism. Volatile organic carbon (VOC) emissions from painting related industries in area source category significantly contribute to TOL (Toluene) and XYL (Xylene) emissions. ETH (Ethylene) emissions are largely contributed from point industrial incineration facilities and various mobile sources. On the other hand, a large portion of OLE (Olefin) emissions are speciated from mobile sources in addition to those contributed by the polypropylene industry in point source. It was found that FORM (Formaldehyde) is mostly emitted from petroleum industry and heavy duty diesel vehicles. Chemical speciation of PM2.5 emissions shows that PEC (primary fine elemental carbon) and POA (primary fine organic aerosol) are the most abundant species from diesel and gasoline vehicles. To reduce uncertainties in processing the Korea emission inventory due to the mapping of Korean SCCs to those of U.S., it would be practical to develop and use domestic source profiles for the top 10 SCCs for area and point sources and top 5 SCCs for on-road mobile sources when VOC emissions from the sources are more than 90% of the total.

6D ICP Based on Adaptive Sampling of Color Distribution (색상분포에 기반한 적응형 샘플링 및 6차원 ICP)

  • Kim, Eung-Su;Choi, Sung-In;Park, Soon-Yong
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.5 no.9
    • /
    • pp.401-410
    • /
    • 2016
  • 3D registration is a computer vision technique of aligning multi-view range images with respect to a reference coordinate system. Various 3D registration algorithms have been introduced in the past few decades. Iterative Closest Point (ICP) is one of the widely used 3D registration algorithms, where various modifications are available nowadays. In the ICP-based algorithms, the closest points are considered as the corresponding points. However, this assumption fails to find matching points accurately when the initial pose between point clouds is not sufficiently close. In this paper, we propose a new method to solve this problem using the 6D distance (3D color space and 3D Euclidean distances). Moreover, a color segmentation-based adaptive sampling technique is used to reduce the computational time and improve the registration accuracy. Several experiments are performed to evaluate the proposed method. Experimental results show that the proposed method yields better performance compared to the conventional methods.

A Study on the Unified Method of Coordinate Registration in Cadastral Map Information (지적도면정보 좌표등록의 통일화 방안 연구)

  • Hong, Sung-Eon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.11
    • /
    • pp.7855-7862
    • /
    • 2015
  • Cadastral map information is created by registering parcel information such as location, lot number, land category and boundary through the cadastral survey. However, with regard to boundary point coordinate, computerized cadastral information data was registered to either two decimal places (unit in centimeter) or three decimal places (unit in millimeter) so that a confusion in cadastral administration and cadastral survey has been caused. Therefore, the purpose of this study is to look for a method of matching two different coordinate systems through the consideration of registration of cadastral information data and area calculation. In conclusion, the result of the investigation not only shows that areal change and the creation of minute polygons resulted from land alteration could be solved by changing boundary point coordinate from two decimal places to three decimal places, but also suggests that the related laws and regulations to register boundary point coordinate to three decimal places should be institutionally corrected and applied.

Social graph visualization techniques for public data (공공데이터에 적합한 다양한 소셜 그래프 비주얼라이제이션 알고리즘 제안)

  • Lee, Manjai;On, Byung-Won
    • Journal of the HCI Society of Korea
    • /
    • v.10 no.1
    • /
    • pp.5-17
    • /
    • 2015
  • Nowadays various public data have been serviced to the public. Through the opening of public data, the transparency and effectiveness of public policy developed by governments are increased and users can lead to the growth of industry related to public data. Since end-users of using public data are citizens, it is very important for everyone to figure out the meaning of public data using proper visualization techniques. In this work, to indicate the significance of widespread public data, we consider UN voting record as public data in which many people may be interested. In general, it has high utilization value by diplomatic and educational purposes, and is available in public. If we use proper data mining and visualization algorithms, we can get an insight regarding the voting patterns of UN members. To visualize, it is necessary to measure the voting similarity values among UN members and then a social graph is created by the similarity values. Next, using a graph layout algorithm, the social graph is rendered on the screen. If we use the existing method for visualizing the social graph, it is hard to understand the meaning of the social graph because the graph is usually dense. To improve the weak point of the existing social graph visualization, we propose Friend-Matching, Friend-Rival Matching, and Bubble Heap algorithms in this paper. We also validate that our proposed algorithms can improve the quality of visualizing social graphs displayed by the existing method. Finally, our prototype system has been released in http://datalab.kunsan.ac.kr/politiz/un/. Please, see if it is useful in the aspect of public data utilization.

Subsequence Matching Under Time Warping in Time-Series Databases : Observation, Optimization, and Performance Results (시계열 데이터베이스에서 타임 워핑 하의 서브시퀀스 매칭 : 관찰, 최적화, 성능 결과)

  • Kim Man-Soon;Kim Sang-Wook
    • The KIPS Transactions:PartD
    • /
    • v.11D no.7 s.96
    • /
    • pp.1385-1398
    • /
    • 2004
  • This paper discusses an effective processing of subsequence matching under time warping in time-series databases. Time warping is a trans-formation that enables finding of sequences with similar patterns even when they are of different lengths. Through a preliminary experiment, we first point out that the performance bottleneck of Naive-Scan, a basic method for processing of subsequence matching under time warping, is on the CPU processing step. Then, we propose a novel method that optimizes the CPU processing step of Naive-Scan. The proposed method maximizes the CPU performance by eliminating all the redundant calculations occurring in computing the time warping distance between the query sequence and data subsequences. We formally prove the proposed method does not incur false dismissals and also is the optimal one for processing Naive-Scan. Also, we discuss the we discuss to apply the proposed method to the post-processing step of LB-Scan and ST-Filter, the previous methods for processing of subsequence matching under time warping. Then, we quantitatively verify the performance improvement ef-fects obtained by the proposed method via extensive experiments. The result shows that the performance of all the three previous methods im-proves by employing the proposed method. Especially, Naive-Scan, which is known to show the worst performance, performs much better than LB-Scan as well as ST-Filter in all cases when it employs the proposed method for CPU processing. This result is so meaningful in that the performance inversion among Nive- Scan, LB-Scan, and ST-Filter has occurred by optimizing the CPU processing step, which is their perform-ance bottleneck.