• 제목/요약/키워드: Point-Based Data Processing

검색결과 498건 처리시간 0.026초

[Retracted]Hot Spot Analysis of Tourist Attractions Based on Stay Point Spatial Clustering

  • Liao, Yifan
    • Journal of Information Processing Systems
    • /
    • 제16권4호
    • /
    • pp.750-759
    • /
    • 2020
  • The wide application of various integrated location-based services (LBS social) and tourism application (app) has generated a large amount of trajectory space data. The trajectory data are used to identify popular tourist attractions with high density of tourists, and they are of great significance to smart service and emergency management of scenic spots. A hot spot analysis method is proposed, based on spatial clustering of trajectory stop points. The DBSCAN algorithm is studied with fast clustering speed, noise processing and clustering of arbitrary shapes in space. The shortage of parameters is manually selected, and an improved method is proposed to adaptively determine parameters based on statistical distribution characteristics of data. DBSCAN clustering analysis and contrast experiments are carried out for three different datasets of artificial synthetic two-dimensional dataset, four-dimensional Iris real dataset and scenic track retention point. The experiment results show that the method can automatically generate reasonable clustering division, and it is superior to traditional algorithms such as DBSCAN and k-means. Finally, based on the spatial clustering results of the trajectory stay points, the Getis-Ord Gi* hotspot analysis and mapping are conducted in ArcGIS software. The hot spots of different tourist attractions are classified according to the analysis results, and the distribution of popular scenic spots is determined with the actual heat of the scenic spots.

Point-based Method 를 사용한 포인트 클라우드 연구 동향 (A Survey on Point Cloud Research Paradigm Using Point - based Method)

  • 한정우;김종국
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2021년도 추계학술발표대회
    • /
    • pp.783-786
    • /
    • 2021
  • In recent years, the use of LiDAR sensors is increasing as autonomous driving, robot control, and drones are considered more. Contrary to ordinary cameras, LiDAR sensors make it possible to handle challenging problems by calculating the distance between objects. This crucial characteristic makes more active research on deep learning models dealing with point clouds which are data of LiDAR. In this paper, among the schemes of using the point cloud, the Point-based approach is mainly discussed. Furthermore, future streams and insights can be considered by looking at solving methods and the limitations.

Query with SUM Aggregate Function on Encrypted Floating-Point Numbers in Cloud

  • Zhu, Taipeng;Zou, Xianxia;Pan, Jiuhui
    • Journal of Information Processing Systems
    • /
    • 제13권3호
    • /
    • pp.573-589
    • /
    • 2017
  • Cloud computing is an attractive solution that can provide low cost storage and powerful processing capabilities for government agencies or enterprises of small and medium size. Yet the confidentiality of information should be considered by any organization migrating to cloud, which makes the research on relational database system based on encryption schemes to preserve the integrity and confidentiality of data in cloud be an interesting subject. So far there have been various solutions for realizing SQL queries on encrypted data in cloud without decryption in advance, where generally homomorphic encryption algorithm is applied to support queries with aggregate functions or numerical computation. But the existing homomorphic encryption algorithms cannot encrypt floating-point numbers. So in this paper, we present a mechanism to enable the trusted party to encrypt the floating-points by homomorphic encryption algorithm and partial trusty server to perform summation on their ciphertexts without revealing the data itself. In the first step, we encode floating-point numbers to hide the decimal points and the positive or negative signs. Then, the codes of floating-point numbers are encrypted by homomorphic encryption algorithm and stored as sequences in cloud. Finally, we use the data structure of DoubleListTree to implement the aggregate function of SUM and later do some extra processes to accomplish the summation.

Development of Internet Based GPS Data Processing Service

  • Kim, Sang-Ho;Park, Kwan-Dong;Kim, Hye-In
    • 한국항해항만학회:학술대회논문집
    • /
    • 한국항해항만학회 2006년도 International Symposium on GPS/GNSS Vol.2
    • /
    • pp.291-295
    • /
    • 2006
  • As GPS equipments improve, one can acquire GPS data easily in the field. However, to obtain precise and accurate coordinates, post processing is additionally required and the processing needs high degree of skills. Besides, it is very common that we can't operate processing software in the field because required system environment is usually not prepared. The aim of this study is the development of internet-based GPS data processing service. For post processing, we use GIPSY developed by JPL. It has many advantages such as precise point positioning, which enables a rapid determination of receiver positions. The developed service in this study proceeds as following orders by interlocking GIPSY and internet service on a Linux platform: Users upload raw data files on the internet, then GIPSY runs automatically and then the user get the result in the field. We use an Apache Web Server as a hosting program and PHP is used in coding web pages.

  • PDF

프로세서 노드 상황을 고려하는 효율적인 메시지 스캐터 및 개더 알고리즘 (Efficient Message Scattering and Gathering Based on Processing Node Status)

  • Park, Jongsu
    • 한국정보통신학회논문지
    • /
    • 제26권4호
    • /
    • pp.637-640
    • /
    • 2022
  • To maximize performance in a high-performance multicore processor system. it is essential to enable effective data communication between processing cores. Data communication between processor nodes can be broadly classified into collective and point-to-point communications. Collective communication comprises scattering and gathering. This paper presents a efficient message scattering and gathering based on processing node status. In the proposed algorithms, the transmission order is changed according to the data size of the pre-existing communication, to reduce the waiting time required until the collective communications begin. From the simulation, the performances of the proposed message scattering and gathering algorithms were improved by approximately 71.41% and 69.84%.

Pointwise CNN for 3D Object Classification on Point Cloud

  • Song, Wei;Liu, Zishu;Tian, Yifei;Fong, Simon
    • Journal of Information Processing Systems
    • /
    • 제17권4호
    • /
    • pp.787-800
    • /
    • 2021
  • Three-dimensional (3D) object classification tasks using point clouds are widely used in 3D modeling, face recognition, and robotic missions. However, processing raw point clouds directly is problematic for a traditional convolutional network due to the irregular data format of point clouds. This paper proposes a pointwise convolution neural network (CNN) structure that can process point cloud data directly without preprocessing. First, a 2D convolutional layer is introduced to percept coordinate information of each point. Then, multiple 2D convolutional layers and a global max pooling layer are applied to extract global features. Finally, based on the extracted features, fully connected layers predict the class labels of objects. We evaluated the proposed pointwise CNN structure on the ModelNet10 dataset. The proposed structure obtained higher accuracy compared to the existing methods. Experiments using the ModelNet10 dataset also prove that the difference in the point number of point clouds does not significantly influence on the proposed pointwise CNN structure.

산악지역 점군자료 분류기법 연구 (Point Cloud Classification Method for Mountainous Area)

  • 최연웅;이근상;조기성
    • 한국측량학회:학술대회논문집
    • /
    • 한국측량학회 2010년 춘계학술발표회 논문집
    • /
    • pp.387-388
    • /
    • 2010
  • There is no generalized and systematic method yet to data pre-processing for point cloud data classification even if there have been lots of previous studies such as local maxima filter, morphology filter, slope based filter and so on. Main focus of this study is to present classification method for bare ground information from LiDAR data for the mountainous area.

  • PDF

Simplification of LIDAR Data for Building Extraction Based on Quad-tree Structure

  • Du, Ruoyu;Lee, Hyo Jong
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2011년도 추계학술발표대회
    • /
    • pp.355-356
    • /
    • 2011
  • LiDAR data is very large, which contains an amount of redundant information. The information not only takes up a lot of storage space but also brings much inconvenience to the LIDAR data transmission and application. Therefore, a simplified method was proposed for LiDAR data based on quad-tree structure in this paper. The boundary contour lines of the buildings are displayed as building extraction. Experimental results show that the method is efficient for point's simplification according to the rule of mapping.

토공 BIM 설계 효율화를 위한 포인트 클라우드 데이터 처리 프로그램 개선에 관한 연구 (The Improvement of Point Cloud Data Processing Program For Efficient Earthwork BIM Design)

  • 김희연;김정환;서종원;심호
    • 한국건설관리학회논문집
    • /
    • 제21권5호
    • /
    • pp.55-63
    • /
    • 2020
  • 토공 자동화는 건설 산업에서 유망한 기술로 주목받고 있으며, 토공 자동화 기술의 적용은 건설 현장의 포인트 클라우드 데이터(Point Cloud Data, PCD) 취득 및 처리로부터 시작된다. PCD는 광범위한 건설 현장의 특성상 백만 개 이상의 많은 데이터를 가지며, 이에 대한 원데이터의 처리 속도는 디지털 지형 모델(Digital Terrain Model, DTM) 생성 및 공사의 효율성 증가에 매우 중요한 요소이다. 현재 국내 설계기준에 적합한 PCD 처리 및 BIM 설계 통합 프로그램인 벤치마크 프로그램(Benchmark Program, BP)이 존재하지만, 사용자의 편의성과 효율성을 위한 수정과 개선이 필요한 상황이다. 본 연구에서는 BP의 기존 PCD 처리 기능을 유지하며, PCD 파일의 호환성에 대한 확장 및 컴파일(Compile) 기반 개발 환경, OpenGL의 활용 및 UI/UX 디자인을 이용한 개선 프로그램을 개발하였다. 개발된 프로그램에 다양한 크기의 PCD를 로드 했을 때, 기존 프로그램과 비교하여 92~99%의 속도 향상이 있었다. 이 프로그램은 추후 PCD와 토공 BIM 기능을 통합하여 설계와 시공 사이의 간극을 줄이는 프로그램 개발의 기반이 될 수 있고, 나아가 토공 생산성 향상에 기여할 것으로 기대된다.

대단위 점 데이터를 위한 빠른 삼차원 삼각망 생성방법 (The Fast 3D mesh generation method for a large scale of point data)

  • 이상한;박강
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2000년도 추계학술대회논문집A
    • /
    • pp.705-711
    • /
    • 2000
  • This paper presents a fast 3D mesh generation method using a surface based method with a stitching algorithm. This method uses the surface based method since the volume based method that uses 3D Delaunay triangulation can hardly deal with a large scale of scanned points. To reduce the processing time, this method also uses a stitching algorithm: after dividing the whole point data into several sections and performing mesh generation on individual sections, the meshes from several sections are stitched into one mesh. Stitching method prevents the surface based method from increasing the processing time exponentially as the number of the points increases. This method works well with different types of scanned points: a scattered type points from a conventional 3D scanner and a cross-sectional type from CT or MRI.

  • PDF