• Title/Summary/Keyword: Key-point

Search Result 1,837, Processing Time 0.029 seconds

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

  • Ryu, kwon-Yeal
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.19 no.1
    • /
    • pp.1-6
    • /
    • 2018
  • In this paper, we propose the method to eliminate repetitive processes for key-point detection on multi-scale image space. The proposed method detects key-points from the original image, and select a good key-points using the cluster filters, and create the key-point clusters. And it select reference objects by using direction angles of the key-point clusters, predict the scale of the original image by using the distributed distance ratio. It transform the scale of the reference image, and apply the detection of key-points to the transformed reference image. In the results of the experiment, the proposed method can be found to improve the key-points detection time by 75 % and 71 % compared to SIFT method and scaled ORB method using the multi-scale images.

A comparative study of three collocation point methods for odd order stochastic response surface method

  • Li, Dian-Qing;Jiang, Shui-Hua;Cheng, Yong-Gang;Zhou, Chuang-Bing
    • Structural Engineering and Mechanics
    • /
    • v.45 no.5
    • /
    • pp.595-611
    • /
    • 2013
  • This paper aims to compare three collocation point methods associated with the odd order stochastic response surface method (SRSM) in a systematical and quantitative way. The SRSM with the Hermite polynomial chaos is briefly introduced first. Then, three collocation point methods, namely the point method, the root method and the without origin method underlying the odd order SRSMs are highlighted. Three examples are presented to demonstrate the accuracy and efficiency of the three methods. The results indicate that the condition that the Hermite polynomial information matrix evaluated at the collocation points has a full rank should be satisfied to yield reliability results with a sufficient accuracy. The point method and the without origin method are much more efficient than the root method, especially for the reliability problems involving a large number of random variables or requiring complex finite element analysis. The without origin method can also produce sufficiently accurate reliability results in comparison with the point and root methods. Therefore, the origin often used as a collocation point is not absolutely necessary. The odd order SRSMs with the point method and the without origin method are recommended for the reliability analysis due to their computational accuracy and efficiency. The order of SRSM has a significant influence on the results associated with the three collocation point methods. For normal random variables, the SRSM with an order equaling or exceeding the order of a performance function can produce reliability results with a sufficient accuracy. The order of SRSM should significantly exceed the order of the performance function involving strongly non-normal random variables.

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

  • Sang-Hyeon Lee;Duksu Kim
    • Journal of the Korea Computer Graphics Society
    • /
    • v.29 no.1
    • /
    • pp.1-11
    • /
    • 2023
  • Deep-learning-based image segmentation is one of the most widely employed lane detection approaches, and it requires a post-process for extracting the key points on the lanes. A general approach for key-point extraction is using a fixed threshold defined by a user. However, finding the best threshold is a manual process requiring much effort, and the best one can differ depending on the target data set (or an image). We propose a novel key-point extraction algorithm that automatically adapts to the target image without any manual threshold setting. In our adaptive key-point extraction algorithm, we propose a line-level normalization method to distinguish the lane region from the background clearly. Then, we extract a representative key point for each lane at a line (row of an image) using a kernel density estimation. To check the benefits of our approach, we applied our method to two lane-detection data sets, including TuSimple and CULane. As a result, our method achieved up to 1.80%p and 17.27% better results than using a fixed threshold in the perspectives of accuracy and distance error between the ground truth key-point and the predicted point.

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

  • Seung-Woo Kang;Jung-Hoon Yun;Yong-Sik Jeong;Kyung-Chul Kim;Dae-Hyun Lee
    • Journal of Drive and Control
    • /
    • v.21 no.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.

CKGS: A Way Of Compressed Key Guessing Space to Reduce Ghost Peaks

  • Li, Di;Li, Lang;Ou, Yu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.3
    • /
    • pp.1047-1062
    • /
    • 2022
  • Differential power analysis (DPA) is disturbed by ghost peaks. There is a phenomenon that the mean absolute difference (MAD) value of the wrong key is higher than the correct key. We propose a compressed key guessing space (CKGS) scheme to solve this problem and analyze the AES algorithm. The DPA based on this scheme is named CKGS-DPA. Unlike traditional DPA, the CKGS-DPA uses two power leakage points for a combined attack. The first power leakage point is used to determine the key candidate interval, and the second is used for the final attack. First, we study the law of MAD values distribution when the attack point is AddRoundKey and explain why this point is not suitable for DPA. According to this law, we modify the selection function to change the distribution of MAD values. Then a key-related value screening algorithm is proposed to obtain key information. Finally, we construct two key candidate intervals of size 16 and reduce the key guessing space of the SubBytes attack from 256 to 32. Simulation experimental results show that CKGS-DPA reduces the power traces demand by 25% compared with DPA. Experiments performed on the ASCAD dataset show that CKGS-DPA reduces the power traces demand by at least 41% compared with DPA.

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

  • Kim, Jong-Min;Kang, Myung-A
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.11
    • /
    • pp.2478-2484
    • /
    • 2010
  • In this paper, real-time detection methods for Panorama system Key-Points offers. A recent study in PANORAMA system real-time area navigation or DVR to apply such research has recently been actively. The detection of the Key-Point is the most important elements that make up a Panorama system. Not affected by contrast, scale, Orientation must be detected Key-Point. Existing research methods are difficult to use in real-time Because it takes a lot of computation time. Therefore, this paper propose BLOG(BitRate Laplacian Of Gaussian)method for faster time Key-Point Detecting and Through various experiments to detect the Speed, Computation, detection performance is compared against.

Submodule Level Distributed Maximum Power Point Tracking PV Optimizer with an Integrated Architecture

  • Wang, Feng;Zhu, Tianhua;Zhuo, Fang;Yi, Hao;Shi, Shuhuai
    • Journal of Power Electronics
    • /
    • v.17 no.5
    • /
    • pp.1308-1316
    • /
    • 2017
  • The distributed maximum power point tracking (DMPPT) concept is widely adopted in photovoltaic systems to avoid mismatch loss. However, the high cost and complexity of DMPPT hinder its further promotion in practice. Based on the concept of DMPPT, this paper presents an integrated submodule level half-bridge stack structure along with an optimal current point tracking (OCPT) control algorithm. In this full power processing integrated solution, the number of power switches and passive components is greatly reduced. On the other hand, only one current sensor and its related AD unit are needed to perform the ideal maximum power generation for all of the PV submodules in any irradiance case. The proposal can totally eliminate different small-scaled mismatch effects in real-word condition and the true maximum power point of each PV submodule can be achieved. As a result, the ideal maximum power output of the whole PV system can be achieved. Compared with current solutions, the proposal further develops the integration level of submodule DMPPT solutions with a lower cost and a smaller size. Moreover, the individual MPPT tracking for all of the submodules are guaranteed.

Moth-Flame Optimization-Based Maximum Power Point Tracking for Photovoltaic Systems Under Partial Shading Conditions

  • Shi, Ji-Ying;Zhang, Deng-Yu;Xue, Fei;Li, Ya-Jing;Qiao, Wen;Yang, Wen-Jing;Xu, Yi-Ming;Yang, Ting
    • Journal of Power Electronics
    • /
    • v.19 no.5
    • /
    • pp.1248-1258
    • /
    • 2019
  • This paper presents a moth-flame optimization (MFO)-based maximum power point tracking (MPPT) method for photovoltaic (PV) systems. The MFO algorithm is a new optimization method that exhibits satisfactory performance in terms of exploration, exploitation, local optima avoidance, and convergence. Therefore, the MFO algorithm is quite suitable for solving multiple peaks of PV systems under partial shading conditions (PSCs). The proposed MFO-MPPT is compared with four MPPT algorithms, namely the perturb and observe (P&O)-MPPT, incremental conductance (INC)-MPPT, particle swarm optimization (PSO)-MPPT and whale optimization algorithm (WOA)-MPPT. Simulation and experiment results demonstrate that the proposed algorithm can extract the global maximum power point (MPP) with greater tracking speed and accuracy under various conditions.

A Two-Phase Approach of Progressive Mesh Reconstruction from Unorganized Point Clouds

  • Zhang, Hongxin;Liu, Hua;Hua, Wei;Bao, Hujun
    • International Journal of CAD/CAM
    • /
    • v.7 no.1
    • /
    • pp.103-112
    • /
    • 2007
  • This paper presents a practical approach for surface reconstruction from unoriented point clouds. Instead of estimating local surface orientation, we first generate a set of depth images from the input point clouds, and a coarse mesh is then generated based on them by space carving techniques. The resultant mesh is progressively refined by local mesh refinement and optimization according to surface distance measure. A manifold mesh approximating the input points within an given tolerance is finally obtained. Our approach is easy to implement, but has the ability to outputs high quality meshes in different resolutions. We show that the proposed approach is not sensitive to several types of data disfigurement and is able to reconstruct models robustly from variance input data.

Suggestion of Safety Management Activities and Key Check point for Safety Management in Modular Construction Sites (모듈러 건설현장의 단위작업별 안전관리 활동 및 중점 체크사항 제안)

  • Jun, Young-Hun;Kim, Kyoon-Tai
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2022.04a
    • /
    • pp.202-203
    • /
    • 2022
  • In this study, focusing on work types of lifting modules and modules assembly in modular construction sites, unit works were defined according to the construction process of each work type, and safety management elements, safety management activities, and key check point were proposed. The results of this study may have somewhat overlapping contents in the construction procedure in order to derive specific safety management activities and check point for each unit work. Therefore, there is a limit to use the results in an actual modular construction site. In future research, we plan to improve this part and derive a checklist that considers field usability.

  • PDF