• Title/Summary/Keyword: Point-extraction

Search Result 930, Processing Time 0.029 seconds

The Real-Time Height Measurement through a Geometry Information and 0bject Extraction (기하학 정보와 객체 추출을 통한 실시간 높이 측정)

  • Kim Jong Su;Kim Tae Yong;Choi Jong Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.12C
    • /
    • pp.1652-1659
    • /
    • 2004
  • In this paper, we propose the algorithm that automatically measures the height of the object to move on the base plane by using the geometric information. To extract a moving object from real-time images creates the background image and each pixel is modeled by the three values. The extracted region is represented by cardboard model and calculates the coordinate center in the each part. The top and bottom point of an object are extracted by the calculated coordinate center and an iterative computation. The two points, top and bottom, are used for measuring the height. Given the vanishing line of the ground plane, the vertical vanishing point, and at least one reference height in the scene; then the height of any point from the ground may be computed by specifying the image of the point and the image of the vertical intersection with the ground plane at that point. Through a confidence valuation of the height to be measured, we confirmed similar actual height and result in the simulation experiment.

Automatic Extraction of Fractures and Their Characteristics in Rock Masses by LIDAR System and the Split-FX Software (LIDAR와 Split-FX 소프트웨어를 이용한 암반 절리면의 자동추출과 절리의 특성 분석)

  • Kim, Chee-Hwan;Kemeny, John
    • Tunnel and Underground Space
    • /
    • v.19 no.1
    • /
    • pp.1-10
    • /
    • 2009
  • Site characterization for structural stability in rock masses mainly involves the collection of joint property data, and in the current practice, much of this data is collected by hand directly at exposed slopes and outcrops. There are many issues with the collection of this data in the field, including issues of safety, slope access, field time, lack of data quantity, reusability of data and human bias. It is shown that information on joint orientation, spacing and roughness in rock masses, can be automatically extracted from LIDAR (light detection and ranging) point floods using the currently available Split-FX point cloud processing software, thereby reducing processing time, safety and human bias issues.

Development of An Inspection Method for Defect Detection on the Surface of Automotive Parts (자동차 부품 형상 결함 탐지를 위한 측정 방법 개발)

  • Park, Hong-Seok;Tuladhar, Upendra Mani;Shin, Seung-Cheol
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.22 no.3
    • /
    • pp.452-458
    • /
    • 2013
  • Over the past several years, many studies have been carried out in the field of 3D data inspection systems. Several attempts have been made to improve the quality of manufactured parts. The introduction of laser sensors for inspection has made it possible to acquire data at a remarkably high speed. In this paper, a robust inspection technique for detecting defects in 3D pressed parts using laser-scanned data is proposed. Point cloud data are segmented for the extraction of features. These segmented features are used for shape matching during the localization process. An iterative closest point (ICP) algorithm is used for the localization of the scanned model and CAD model. To achieve a higher accuracy rate, the ICP algorithm is modified and then used for matching. To enhance the speed of the matching process, aKd-tree algorithm is used. Then, the deviation of the scanned points from the CAD model is computed.

A Study on the Extraction of Basis Functions for ECG Signal Processing (심전도 신호 처리를 위한 기저함수 추출에 관한 연구)

  • Park, Kwang-Li;Lee, Jeon;Lee, Byung-Chae;Jeong, Kee-Sam;Yoon, Hyung-Ro;Lee, Kyoung-Joung
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.53 no.4
    • /
    • pp.293-299
    • /
    • 2004
  • This paper is about the extraction of basis function for ECG signal processing. In the first step, it is assumed that ECG signal consists of linearly mixed independent source signals. 12 channel ECG signals, which were sampled at 600sps, were used and the basis function, which can separate and detect source signals - QRS complex, P and T waves, - was found by applying the fast fixed point algorithm, which is one of learning algorithms in independent component analysis(ICA). The possibilities of significant point detection and classification of normal and abnormal ECG, using the basis function, were suggested. Finally, the proposed method showed that it could overcome the difficulty in separating specific frequency in ECG signal processing by wavelet transform. And, it was found that independent component analysis(ICA) could be applied to ECG signal processing for detection of significant points and classification of abnormal beats.

Development of a Characteristic Point Detection Algorithm for the Calculation of Pulse Wave Velocity (맥파전달속도 계산을 위한 특징점 검출 알고리즘 개발)

  • Lee, Lark-Beom;Im, Jae-Joong
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.5
    • /
    • pp.902-907
    • /
    • 2008
  • Shape of the pulse waveform is affected by the visco-elasticity characteristics of the arterial wall and the reflection waves generated at the bifurcations of arterial branches. This study was designed to improve the accuracy for the extraction of pulse wave features, then proved the superiority of the developed algorithm by clinical evaluation. Upstroke point of the pulse wave was used as an extraction feature since it is minimally affected by the waveform variation. R-peak of the ECG was used as a reference to decide the minimum level, then intersection of the least squares of regression line was used as an upstroke point. Developed algorithm was compared with the existing minimum value detection algorithm and tangent-intersection algorithm using data obtained from 102 subjects. Developed algorithm showed the least standard deviation of $0.29{\sim}0.44\;m/s$ compared with that of the existing algorithms, $0.91{\sim}3.66\;m/s$. Moreover, the rate of standard deviation of more than 1.00m/s for the PWV values reduced with the range of $29.0{\sim}42.4%$, which proved the superiority of the newly developed algorithm.

Registration of Aerial Image with Lines using RANSAC Algorithm

  • Ahn, Y.;Shin, S.;Schenk, T.;Cho, W.
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.25 no.6_1
    • /
    • pp.529-536
    • /
    • 2007
  • Registration between image and object space is a fundamental step in photogrammetry and computer vision. Along with rapid development of sensors - multi/hyper spectral sensor, laser scanning sensor, radar sensor etc., the needs for registration between different sensors are ever increasing. There are two important considerations on different sensor registration. They are sensor invariant feature extraction and correspondence between them. Since point to point correspondence does not exist in image and laser scanning data, it is necessary to have higher entities for extraction and correspondence. This leads to modify first, existing mathematical and geometrical model which was suitable for point measurement to line measurements, second, matching scheme. In this research, linear feature is selected for sensor invariant features and matching entity. Linear features are incorporated into mathematical equation in the form of extended collinearity equation for registration problem known as photo resection which calculates exterior orientation parameters. The other emphasis is on the scheme of finding matched entities in the aide of RANSAC (RANdom SAmple Consensus) in the absence of correspondences. To relieve computational load which is a common problem in sampling theorem, deterministic sampling technique and selecting 4 line features from 4 sectors are applied.

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
    • /
    • v.23 no.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.

Building Boundary Extraction from Airborne LIDAR Data (항공 라이다자료를 이용한 건물경계추출에 관한 연구)

  • Lee, Suk Kun
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.28 no.6D
    • /
    • pp.923-929
    • /
    • 2008
  • Due to the increasing need for 3D spatial data, modeling of topography and artificial structures plays an important role in three-dimensional Urban Analysis. This study suggests a methodology for solving the problem of calculation for the extraction of building boundary, minimizing the user's intervention, and automatically extracting building boundary, using the LIDAR data. The methodology suggested in this study is characterized by combining the merits of the point-based process and the image-based process. The procedures for extracting building boundary are three steps: 1) LIDAR point data are interpolated to extract approximately building region. 2) LIDAR point data are triangulated in each individual building area. 3) Extracted boundary of each building is then simplified in consideration of its area, minimum length of building.The performance of the developed methodology is evaluated using real LIDAR data. Through the experiment, the extracted building boundaries are compared with digital map.

FPGA Design of a SURF-based Feature Extractor (SURF 알고리즘 기반 특징점 추출기의 FPGA 설계)

  • Ryu, Jae-Kyung;Lee, Su-Hyun;Jeong, Yong-Jin
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.3
    • /
    • pp.368-377
    • /
    • 2011
  • This paper explains the hardware structure of SURF(Speeded Up Robust Feature) based feature point extractor and its FPGA verification result. SURF algorithm produces novel scale- and rotation-invariant feature point and descriptor which can be used for object recognition, creation of panorama image, 3D Image restoration. But the feature point extraction processing takes approximately 7,200msec for VGA-resolution in embedded environment using ARM11(667Mhz) processor and 128Mbytes DDR memory, hence its real-time operation is not guaranteed. We analyzed integral image memory access pattern which is a key component of SURF algorithm to reduce memory access and memory usage to operate in c real-time. We assure feature extraction that using a Vertex-5 FPGA gives 60frame/sec of VGA image at 100Mhz.