• 제목/요약/키워드: key point detection

검색결과 94건 처리시간 0.025초

다중 스케일 영상 공간에서 특징점 클러스터를 이용한 영상스케일 예측 (Image Scale Prediction Using Key-point Clusters on Multi-scale Image Space)

  • 류권열
    • 융합신호처리학회논문지
    • /
    • 제19권1호
    • /
    • pp.1-6
    • /
    • 2018
  • 본 논문에서는 다중 스케일 영상 공간에서 특징점 검출을 위해 수행되는 반복적인 과정을 제거하는 방법을 제안한다. 제안한 방법은 원 영상으로부터 특징점을 검출하고, 클러스터 필터를 이용하여 유효한 특징점을 선별하고, 특징점 클러스터를 생성한다. 그리고 특징점 클러스터의 방향 각도를 이용하여 참조 객체를 선별하고, 분산 거리 비율을 이용하여 원 영상의 스케일을 예측한다. 예측한 스케일에 따라 참조 영상의 스케일을 변환하고, 변환된 참조 영상에 대해 특징점 검출을 적용한다. 실험 결과 제안한 방법은 다중 스케일 영상을 사용하는 SIFT 방법 및 Scaled ORB 방법에 비해 특징점 검출 시간이 각각 75% 및 71% 향상됨을 알 수 있었다.

세그멘테이션 기반 차선 인식 네트워크를 위한 적응형 키포인트 추출 알고리즘 (Adaptive Key-point Extraction Algorithm for Segmentation-based Lane Detection Network)

  • 이상현;김덕수
    • 한국컴퓨터그래픽스학회논문지
    • /
    • 제29권1호
    • /
    • pp.1-11
    • /
    • 2023
  • 딥러닝 기반의 이미지 세그멘테이션은 차선 인식을 위해 널리 사용되는 접근 방식 중 하나로, 차선의 키포인트를 추출하기 위한 후처리 과정이 필요하다. 일반적으로 키포인트는 사용자가 지정한 임계값을 기준으로 추출한다. 하지만 최적의 임계값을 찾는 과정은 큰 노력을 요구하며, 데이터 세트(또는 이미지)마다 최적의 값이 다를 수 있다. 본 연구는 사용자의 직접 임계값 지정 대신, 대상의 이미지에 맞추어 적절한 임계값을 자동으로 설정하는 키포인트 추출 알고리즘을 제안한다. 본 논문의 키포인트 추출 알고리즘은 차선 영역과 배경의 명확한 구분을 위해 줄 단위 정규화를 사용한다. 그리고 커널 밀도 추정을 사용하여, 각 줄에서 각 차선의 키포인트를 추출한다. 제안하는 알고리즘은 TuSimple과 CULane 데이터 세트에 적용되었으며, 고정된 임계값 사용 대비 정확도 및 거리오차 측면에서 1.80%p와 17.27% 향상된 결과를 얻는 것을 확인하였다.

참외 자동 수확을 위한 과일 주요 지점 검출 (Key-point detection of fruit for automatic harvesting of oriental melon)

  • 강승우;윤정훈;정용식;김경철;이대현
    • 드라이브 ㆍ 컨트롤
    • /
    • 제21권2호
    • /
    • pp.65-71
    • /
    • 2024
  • In this study, we suggested a key-point detection method for robot harvesting of oriental melon. Our suggested method could be used to detect the detachment part and major composition of oriental melon. We defined four points (harvesting point, calyx, center, bottom) based on tomato with characteristics similar to those of oriental melon. The evaluation of estimated key-points was conducted by pixel error and PDK (percentage of detected key-point) index. Results showed that the average pixel error was 18.26 ± 16.62 for the x coordinate and 17.74 ± 18.07 for the y coordinate. Considering the resolution of raw images, these pixel errors were not expected to have a serious impact. The PDK score was found to be 89.5% PDK@0.5 on average. It was possible to estimate oriental melon specific key-point. As a result of this research, we believe that the proposed method can contribute to the application of harvesting robot system.

BLOG를 이용한 고속 이미지 정합에 관한 연구 (Study of High Speed Image Registration using BLOG)

  • 김종민;강명아
    • 한국정보통신학회논문지
    • /
    • 제14권11호
    • /
    • pp.2478-2484
    • /
    • 2010
  • 본 논문은 실시간 파노라마를 위한 영상의 특징점 검출 방법을 제안한다. 파노라마 연구는 최근 실시간 지역탐색이나 DVR 등에 적용하는 연구가 최근 활발히 진행되고 있다. 특히 특징점 검출은 파노라마를 이루는 가장 중요한 요소이다. 특징점 검출을 위해서는 어떠한 명암 변화에도 특징점은 불변이어야 하며 이미지의 크기와 회전이 변화하더라도 불변의 점을 찾아야 한다. 기존 연구방법은 고차원적인 벡터와 많은 후보점을 선점하기 때문에 연산량이 많고 수행시간이 길어 실시간에 활용하기에는 어려운 점이 있다. 따라서 본 논문은 보다 빠른 실시간 특징점 검출을 위해 LOG 방법을 비트 단위로 분할 후 결합하는 BLOG 방법을 제안하고 다양한 실험을 통하여 속도와 연산량 그리고 검출 성능에 대하여 비교한다.

A Novel Face Recognition Algorithm based on the Deep Convolution Neural Network and Key Points Detection Jointed Local Binary Pattern Methodology

  • Huang, Wen-zhun;Zhang, Shan-wen
    • Journal of Electrical Engineering and Technology
    • /
    • 제12권1호
    • /
    • pp.363-372
    • /
    • 2017
  • This paper presents a novel face recognition algorithm based on the deep convolution neural network and key point detection jointed local binary pattern methodology to enhance the accuracy of face recognition. We firstly propose the modified face key feature point location detection method to enhance the traditional localization algorithm to better pre-process the original face images. We put forward the grey information and the color information with combination of a composite model of local information. Then, we optimize the multi-layer network structure deep learning algorithm using the Fisher criterion as reference to adjust the network structure more accurately. Furthermore, we modify the local binary pattern texture description operator and combine it with the neural network to overcome drawbacks that deep neural network could not learn to face image and the local characteristics. Simulation results demonstrate that the proposed algorithm obtains stronger robustness and feasibility compared with the other state-of-the-art algorithms. The proposed algorithm also provides the novel paradigm for the application of deep learning in the field of face recognition which sets the milestone for further research.

Skeleton Model-Based Unsafe Behaviors Detection at a Construction Site Scaffold

  • Nguyen, Truong Linh;Tran, Si Van-Tien;Bao, Quy Lan;Lee, Doyeob;Oh, Myoungho;Park, Chansik
    • 국제학술발표논문집
    • /
    • The 9th International Conference on Construction Engineering and Project Management
    • /
    • pp.361-369
    • /
    • 2022
  • Unsafe actions and behaviors of workers cause most accidents at construction sites. Nowadays, occupational safety is a top priority at construction sites. However, this problem often requires money and effort from investors or construction owners. Therefore, decreasing the accidents rates of workers and saving monitoring costs for contractors is necessary at construction sites. This study proposes an unsafe behavior detection method based on a skeleton model to classify three common unsafe behaviors on the scaffold: climbing, jumping, and running. First, the OpenPose method is used to obtain the workers' key points. Second, all skeleton datasets are aggregated from the temporary size. Third, the key point dataset becomes the input of the action classification model. The method is effective, with an accuracy rate of 89.6% precision and 90.5% recall of unsafe actions correctly detected in the experiment.

  • PDF

Crowd escape event detection based on Direction-Collectiveness Model

  • Wang, Mengdi;Chang, Faliang;Zhang, Youmei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권9호
    • /
    • pp.4355-4374
    • /
    • 2018
  • Crowd escape event detection has become one of the hottest problems in intelligent surveillance filed. When the 'escape event' occurs, pedestrians will escape in a disordered way with different velocities and directions. Based on these characteristics, this paper proposes a Direction-Collectiveness Model to detect escape event in crowd scenes. First, we extract a set of trajectories from video sequences by using generalized Kanade-Lucas-Tomasi key point tracker (gKLT). Second, a Direction-Collectiveness Model is built based on the randomness of velocity and orientation calculated from the trajectories to express the movement of the crowd. This model can describe the movement of the crowd adequately. To obtain a generalized crowd escape event detector, we adopt an adaptive threshold according to the Direction-Collectiveness index. Experiments conducted on two widely used datasets demonstrate that the proposed model can detect the escape events more effectively from dense crowd.

Object Detection with LiDAR Point Cloud and RGBD Synthesis Using GNN

  • Jung, Tae-Won;Jeong, Chi-Seo;Lee, Jong-Yong;Jung, Kye-Dong
    • International journal of advanced smart convergence
    • /
    • 제9권3호
    • /
    • pp.192-198
    • /
    • 2020
  • The 3D point cloud is a key technology of object detection for virtual reality and augmented reality. In order to apply various areas of object detection, it is necessary to obtain 3D information and even color information more easily. In general, to generate a 3D point cloud, it is acquired using an expensive scanner device. However, 3D and characteristic information such as RGB and depth can be easily obtained in a mobile device. GNN (Graph Neural Network) can be used for object detection based on these characteristics. In this paper, we have generated RGB and RGBD by detecting basic information and characteristic information from the KITTI dataset, which is often used in 3D point cloud object detection. We have generated RGB-GNN with i-GNN, which is the most widely used LiDAR characteristic information, and color information characteristics that can be obtained from mobile devices. We compared and analyzed object detection accuracy using RGBD-GNN, which characterizes color and depth information.

GPS phase measurement cycle-slip detection based on a new wavelet function

  • Zuoya, Zheng;Xiushan, Lu;Xinzhou, Wang;Chuanfa, Chen
    • 한국항해항만학회:학술대회논문집
    • /
    • 한국항해항만학회 2006년도 International Symposium on GPS/GNSS Vol.2
    • /
    • pp.91-96
    • /
    • 2006
  • Presently, cycle-slip detection is done between adjacent two points in many cycle-slip methods. Inherently, it is simple wavelet analysis. A new idea is put forward that the number of difference point can adjust by a parameter factor; we study this method to smooth raw data and detect cycle-slip with wavelet analysis. Taking CHAMP satellite data for example, we get some significant conclusions. It is showed that it is valid to detect cycle-slip in GPS phase measurement based on this wavelet function, and it is helpful to improve the precision of GPS data pre-processing and positioning.

  • PDF

A Novel Technique for Detection of Repacked Android Application Using Constant Key Point Selection Based Hashing and Limited Binary Pattern Texture Feature Extraction

  • MA Rahim Khan;Manoj Kumar Jain
    • International Journal of Computer Science & Network Security
    • /
    • 제23권9호
    • /
    • pp.141-149
    • /
    • 2023
  • Repacked mobile apps constitute about 78% of all malware of Android, and it greatly affects the technical ecosystem of Android. Although many methods exist for repacked app detection, most of them suffer from performance issues. In this manuscript, a novel method using the Constant Key Point Selection and Limited Binary Pattern (CKPS: LBP) Feature extraction-based Hashing is proposed for the identification of repacked android applications through the visual similarity, which is a notable feature of repacked applications. The results from the experiment prove that the proposed method can effectively detect the apps that are similar visually even that are even under the double fold content manipulations. From the experimental analysis, it proved that the proposed CKPS: LBP method has a better efficiency of detecting 1354 similar applications from a repository of 95124 applications and also the computational time was 0.91 seconds within which a user could get the decision of whether the app repacked. The overall efficiency of the proposed algorithm is 41% greater than the average of other methods, and the time complexity is found to have been reduced by 31%. The collision probability of the Hashes was 41% better than the average value of the other state of the art methods.