• Title/Summary/Keyword: Matching Point

Search Result 840, Processing Time 0.022 seconds

A Performance Evaluation of Constellation Matching-MMA Adaptive Equalization Algorithm in QAM System (QAM 시스템에서 Constellation Matching-MMA 적응 등화 알고리즘의 성능 평가)

  • Lim, Seung-Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.2
    • /
    • pp.105-110
    • /
    • 2015
  • This paper relates with the eualization performance of Constellation Matching-MMA (CM-MMA) in order to the consists of optimum receiver for the minimization of intersymbol interference and additive noise effects that is occurs in the nonlinear communication channel. The error signal were obtained that combines the Constellation Matching technique that inserts the zero point between the signal point of equalizer for improving the residual isi and convergence speed compared to the currently used MMA algorithm. In the initial state of adaptive equalization, it depends on the MMA characteristics mainly. And in the steady state, it depends on the CM characteristics mainly. In order to analyzing the equalization performance, the output signal constellation, residual isi, maximum distortion, MSE and SER were applied, then it were compared with the present MMA algorithm. As a result of computer simulation, the CM-MMA has more better performance in the every performance index, and it was also confirmed that the constellation matching effect can be obtained in the greater than 20dB signal to noise ratio.

Post-processing Method of Point Cloud Extracted Based on Image Matching for Unmanned Aerial Vehicle Image (무인항공기 영상을 위한 영상 매칭 기반 생성 포인트 클라우드의 후처리 방안 연구)

  • Rhee, Sooahm;Kim, Han-gyeol;Kim, Taejung
    • Korean Journal of Remote Sensing
    • /
    • v.38 no.6_1
    • /
    • pp.1025-1034
    • /
    • 2022
  • In this paper, we propose a post-processing method through interpolation of hole regions that occur when extracting point clouds. When image matching is performed on stereo image data, holes occur due to occlusion and building façade area. This area may become an obstacle to the creation of additional products based on the point cloud in the future, so an effective processing technique is required. First, an initial point cloud is extracted based on the disparity map generated by applying stereo image matching. We transform the point cloud into a grid. Then a hole area is extracted due to occlusion and building façade area. By repeating the process of creating Triangulated Irregular Network (TIN) triangle in the hall area and processing the inner value of the triangle as the minimum height value of the area, it is possible to perform interpolation without awkwardness between the building and the ground surface around the building. A new point cloud is created by adding the location information corresponding to the interpolated area from the grid data as a point. To minimize the addition of unnecessary points during the interpolation process, the interpolated data to an area outside the initial point cloud area was not processed. The RGB brightness value applied to the interpolated point cloud was processed by setting the image with the closest pixel distance to the shooting center among the stereo images used for matching. It was confirmed that the shielded area generated after generating the point cloud of the target area was effectively processed through the proposed technique.

2D Grid Map Compensation Using ICP Algorithm based on Feature Points (특징 점 기반의 ICP 알고리즘을 이용한 2차원 격자지도 보정)

  • Hwang, Yu-Seop;Lee, Dong-Ju;Yu, Ho-Yun;Lee, Jang-Myung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.21 no.10
    • /
    • pp.965-971
    • /
    • 2015
  • This paper suggests a feature point-based Iterative Closest Point (ICP) algorithm to compensate for the disparity error in building a two-dimensional map. The ICP algorithm is a typical algorithm for matching a common object in two different images. In the process of building a two-dimensional map using the laser scanner data, warping and distortions exist in the map because of the disparity between the two sensor values. The ICP algorithm has been utilized to reduce the disparity error in matching the scanned line data. For this matching process in the conventional ICP algorithm, pre-known reference data are required. Since the proposed algorithm extracts characteristic points from laser-scanned data, reference data are not required for the matching. The laser scanner starts from the right side of the mobile robot and ends at the left side, which causes disparity in the scanned line data. By finding the matching points between two consecutive frame images, the motion vector of the mobile robot can be obtained. Therefore, the disparity error can be minimized by compensating for the motion vector caused by the mobile robot motion. The validity of the proposed algorithm has been verified by comparing the proposed algorithm in terms of map-building accuracy to conventional ICP algorithm real experiments.

Extended SURF Algorithm with Color Invariant Feature and Global Feature (컬러 불변 특징과 광역 특징을 갖는 확장 SURF(Speeded Up Robust Features) 알고리즘)

  • Yoon, Hyun-Sup;Han, Young-Joon;Hahn, Hern-Soo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.6
    • /
    • pp.58-67
    • /
    • 2009
  • A correspondence matching is one of the important tasks in computer vision, and it is not easy to find corresponding points in variable environment where a scale, rotation, view point and illumination are changed. A SURF(Speeded Up Robust Features) algorithm have been widely used to solve the problem of the correspondence matching because it is faster than SIFT(Scale Invariant Feature Transform) with closely maintaining the matching performance. However, because SURF considers only gray image and local geometric information, it is difficult to match corresponding points on the image where similar local patterns are scattered. In order to solve this problem, this paper proposes an extended SURF algorithm that uses the invariant color and global geometric information. The proposed algorithm can improves the matching performance since the color information and global geometric information is used to discriminate similar patterns. In this paper, the superiority of the proposed algorithm is proved by experiments that it is compared with conventional methods on the image where an illumination and a view point are changed and similar patterns exist.

Development of an edge-based point correlation algorithm for fast and stable visual inspection system (고속 검사자동화를 위한 에지기반 점 상관 알고리즘의 개발)

  • 강동중;노태정
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.9 no.8
    • /
    • pp.640-646
    • /
    • 2003
  • We presents an edge-based point correlation algorithm for fast and stable visual inspection system. Conventional algorithms based on NGC(normalized gray-level correlation) have to overcome some difficulties in applying automated inspection systems to real factory environment. First of all, NGC algorithms involve highly complex computation and thus require high performance hardware for realtime process. In addition, lighting condition in realistic factory environments is not stable and therefore intensity variation from uncontrolled lights gives many troubles for applying NGC directly as pattern matching algorithm. We propose an algorithm to solve these problems, using thinned and binarized edge data, which are obtained from the original image. A point correlation algorithm with the thinned edges is introduced with image pyramid technique to reduce the computational complexity. Matching edges instead of using original gray-level image pixels overcomes problems in NGC method and pyramid of edges also provides fast and stable processing. All proposed methods are proved by the experiments using real images.

Modal Analysis of Point and Discretized Continuous Spectra for Metal-Insulator-Metal Waveguides in the Terahertz Region

  • Hur, Jun;Choo, Hosung;Park, Jong-Eon
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.4
    • /
    • pp.1644-1654
    • /
    • 2018
  • Eigenvalue distributions for a periodic metal-insulator-metal waveguide, classified into the point spectrum and the discretized continuous spectrum (DCS), are investigated as functions of frequencies, gap widths, and periods. Muller's method is suggested for solving exact eigenvalues, and we propose the scheme for finding proper initial values in the Muller's method by considering only ${\Re}e({\varepsilon}_r)$ in the dispersion equation. We then find that anti-crossing behavior, repulsive effect between the point spectrum and the DCS, becomes stronger when the real parts of the roots in the point spectrum have smaller values. Finally, we examine the transmittances of a single subwavelength slit for real metals using the mode matching technique. The transmittances in real metals similarly follow those of the perfect electric conductor (PEC) at low frequencies, while the patterns at higher frequencies begin to differ from the PEC.

Genetic lesion matching algorithm using medical image (의료영상 이미지를 이용한 유전병변 정합 알고리즘)

  • Cho, Young-bok;Woo, Sung-Hee;Lee, Sang-Ho;Han, Chang-Su
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.5
    • /
    • pp.960-966
    • /
    • 2017
  • In this paper, we proposed an algorithm that can extract lesion by inputting a medical image. Feature points are extracted using SIFT algorithm to extract genetic training of medical image. To increase the intensity of the feature points, the input image and that raining image are matched using vector similarity and the lesion is extracted. The vector similarity match can quickly lead to lesions. Since the direction vector is generated from the local feature point pair, the direction itself only shows the local feature, but it has the advantage of comparing the similarity between the other vectors existing between the two images and expanding to the global feature. The experimental results show that the lesion matching error rate is 1.02% and the processing speed is improved by about 40% compared to the case of not using the feature point intensity information.

Human Motion Tracking based on 3D Depth Point Matching with Superellipsoid Body Model (타원체 모델과 깊이값 포인트 매칭 기법을 활용한 사람 움직임 추적 기술)

  • Kim, Nam-Gyu
    • Journal of Digital Contents Society
    • /
    • v.13 no.2
    • /
    • pp.255-262
    • /
    • 2012
  • Human motion tracking algorithm is receiving attention from many research areas, such as human computer interaction, video conference, surveillance analysis, and game or entertainment applications. Over the last decade, various tracking technologies for each application have been demonstrated and refined among them such of real time computer vision and image processing, advanced man-machine interface, and so on. In this paper, we introduce cost-effective and real-time human motion tracking algorithms based on depth image 3D point matching with a given superellipsoid body representation. The body representative model is made by using parametric volume modeling method based on superellipsoid and consists of 18 articulated joints. For more accurate estimation, we exploit initial inverse kinematic solution with classified body parts' information, and then, the initial pose is modified to more accurate pose by using 3D point matching algorithm.

Orientation Analysis between UAV Video and Photos for 3D Measurement of Bridges (교량의 3차원 측정을 위한 UAV 비디오와 사진의 표정 분석)

  • Han, Dongyeob;Park, Jae Bong;Huh, Jungwon
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.36 no.6
    • /
    • pp.451-456
    • /
    • 2018
  • UAVs (Unmanned Aerial Vehicles) are widely used for maintenance and monitoring of facilities. It is necessary to acquire a high-resolution image for evaluating the appearance state of the facility in safety inspection. In addition, it is essential to acquire the video data in order to acquire data over a wide area rapidly. In general, since video data does not include position information, it is difficult to analyze the actual size of the inspection object quantitatively. In this study, we evaluated the utilization of 3D point cloud data of bridges using a matching between video frames and reference photos. The drones were used to acquire video and photographs. And exterior orientations of the video frames were generated through feature point matching with reference photos. Experimental results showed that the accuracy of the video frame data is similar to that of the reference photos. Furthermore, the point cloud data generated by using video frames represented the shape and size of bridges with usable accuracy. If the stability of the product is verified through the matching test of various conditions in the future, it is expected that the video-based facility modeling and inspection will be effectively conducted.

Extraction of the three-dimensional surface coordinate from a stereo image (스테레오 영상을 이용한 3차원 표면좌표 추출 알고리즘)

  • 원성혁;김민기;김병우;이기식;김헌배
    • Proceedings of the IEEK Conference
    • /
    • 2000.06d
    • /
    • pp.210-213
    • /
    • 2000
  • In the closed range space, the parallel two CCD cameras are used to acquire a pair of stereo image. The acquired stereo image are computed with Wavelet Transform repeatedly and including the low frequency component, the image size of those are reduced. It is the pyramid structure. The optimum matching point is searched to the pixel. Then appling the optimum matching point to DLT, it extract the three - dimensional surface coordinate from a stereo image. The direct linear transformation(DLT) method is used to calibrate the stereo camera compute the coordinate on a three dimensional space. To find the parameters for the DLT method, 30 control points which marked on the cylinder type object are used. To improve the matching algorithm, the paper select the pyramid structure for Wavelet Transform. The acquired disparity information is used to represent the really three-dimensional surface coordinate.

  • PDF