Stereo Matching of Planar Curves Composed of Time Stamped Points

Matching features such as curve segments in stereo images play a very important role in scene recomtruction. In this paper, a stereo matching algorithm for the trajectories composed of time stamped points is proposed. Based on time stamped points, planar curve match measurements are given first, such as time constraint, cross-ratio invariant constraint and eplpolar geometry constraint; then, a trajectory matching method is proposed based on epipolar geometry constraint and cross-ratio invariant constraint. In order to match the planar curve segments projected by perspective projection system, the curve start time and end time are selected first to prepare match candidates. Then, the epipolar equation is used to discard the unmatched curve segment candidates. At last, a cross ratio invariant constxaint is used to find the most matched curve segments. If their match measurement is higher than the specialized threshold, a candidate with the least cross ratio difference is then selected as the match result; otherwise, no match is found. Unlike the conventional planar curve segments matching algorithm, this paper presents a weakly calibrated binocular stereo vision system which is based on wide baseline. The stamped points are obtained by targets detecting method of flying objects from image sequences. Due to wide baseline, there must exist the projection not in epipolar monotonic order or the curve segments located in very short distance and keeping the epipolar monotonic order. By using the method mentioned above, experiments are made to match planar curve segments not only in epipolar monotonic order but also not in epipolar monotonic order. The results show that the performance of our curve matching algorithm is effective for matching the arc-like planar trajectories composed of time stamped points.

Image Relaxation Matching Based on Feature Points for DSM Generation

In photogrammetry and remote sensing, image matching is a basic and crucial process for automatic DEM generation. In this paper we presented a image relaxation matching method based on feature points. This method can be considered as an extention of regular grid point based matching. It avoids the shortcome of grid point based matching. For example, with this method, we can avoid low or even no texture area where errors frequently appear in cross correlaton matching. In the mean while, it makes full use of some mature techniques such as probability relaxation, image pyramid and the like which have already been successfully used in grid point matching process. Application of the technique to DEM generaton in different regions proved that it is more reasonable and reliable.

AUTOMATED IMAGE MATCHING WITH CODED POINTS IN STEREOVISION MEASUREMENT

A coding-based method to solve the image matching problems in stereovision measurement is presented. The solution is to add and append an identity ID to the retro-reflect point, so it can be identified efficiently under the complicated circumstances and has the characteristics of rotation, zooming, and deformation independence. Its design architecture and implementation process in details based on the theory of stereovision measurement are described. The method is effective on reducing processing data time, improving accuracy of image matching and automation of measuring system through experiments.

GRADIENT OF REFERENCE DIFFERENCE BASED MATCHING ALGORITHM FOR IMAGE FEATURE POINT

During matching on feature point, gray correlation matching technology is utilized to extract multi-peaks as a coarse matching set. A pair of given corresponding reference points within the left and right images is used to calculate gradients of reference difference between the reference points and each feature point within the multi-peaks set. The unique correspondence is determined by criterion of minimal gradients of reference difference. The obtained correspondence is taken as a new pair of reference points to update the reference points continuously until all feature points in the left (or right) image being matched with the right (or left) image. The gradients of reference difference can be calculated easily by means of pre-setting a pair of obvious feature points in the left and right images as a pair of corresponding reference points. Besides, the efficiency of matching can be improved greatly by taking the obtained matching point as a new pair of reference points, and by updating the reference point continuously. It is proved that the proposed algorithm is valid and reliable by 3D reconstruction on two pairs of actual natural images with abundant and weak texture, respectively.

A calculation method for low dynamic vehicle velocity based on fusion of optical flow and feature point matching

Aming at the problem of the low accuracy of low dynamic vehicle velocity under the environment of uneven distribution of light intensity,an improved adaptive Kalman filter method for the velocity error estimate by the fusion of optical flow tracking and scale mvaiant feature transform(SIFT)is proposed.The algorithm introduces anonlinear fuzzy membership function and the filter residual for the noise covariance matrix in the adaptive adjustment process.In the process of calculating the velocity of the vehicle,the tracking and matching of the inter-frame displacement a d the vehicle velocity calculation a e carried out by using the optical fow tracing and the SIF'T methods,respectively.Meanwhile,the velocity difference between theoutputs of thesetwo methods is used as the observation of the improved adaptive Kalman filter.Finally,the velocity calculated by the optical fow method is corrected by using the velocity error estimate of the output of the modified adaptive Kalman filter.The results of semi-physical experiments show that the maximum velocityeror of the fusion algorithm is decreased by29%than that of the optical fow method,and the computation time is reduced by80%compared with the SIFT method.

Design of a coated thinly clad chalcogenide long-period fiber grating refractive index sensor based on dual-peak resonance near the phase matching turning point

A novel method for designing chalcogenide long-period fiber grating(LPFG) sensors based on the dual-peak resonance effect of the LPFG near the phase matching turning point(PMTP) is presented. Refractive index sensing in a high-refractive-index chalcogenide fiber is achieved with a coated thinly clad film. The dual-peak resonant characteristics near the PMTP and the refractive index sensing properties of the LPFG are analyzed first by the phase-matching condition of the LPFG. The effects of film parameters and cladding radius on the sensitivity of refractive index sensing are further discussed. The sensor is optimized by selecting the appropriate film parameters and cladding radius. Simulation results show that the ambient refractive index sensitivity of a dual-peak coated thinly clad chalcogenide LPFG at the PMTP can be 2400 nm/RIU, which is significantly higher than that of non-optimized gratings. It has great application potential in the field of chemical sensing and biosensors.

Image Feature Extraction and Matching of Augmented Solar Images in Space Weather

Augmented solar images were used to research the adaptability of four representative image extraction and matching algorithms in space weather domain.These include the scale-invariant feature transform algorithm,speeded-up robust features algorithm,binary robust invariant scalable keypoints algorithm,and oriented fast and rotated brief algorithm.The performance of these algorithms was estimated in terms of matching accuracy,feature point richness,and running time.The experiment result showed that no algorithm achieved high accuracy while keeping low running time,and all algorithms are not suitable for image feature extraction and matching of augmented solar images.To solve this problem,an improved method was proposed by using two-frame matching to utilize the accuracy advantage of the scale-invariant feature transform algorithm and the speed advantage of the oriented fast and rotated brief algorithm.Furthermore,our method and the four representative algorithms were applied to augmented solar images.Our application experiments proved that our method achieved a similar high recognition rate to the scale-invariant feature transform algorithm which is significantly higher than other algorithms.Our method also obtained a similar low running time to the oriented fast and rotated brief algorithm,which is significantly lower than other algorithms.

改进的OFDM双向中继功率分配策略

针对放大转发(AF)模式下正交频分复用(OFDM)双向中继网络如何提高系统总容量的问题,提出了一种低复杂度的以系统总速率最大化为目标的最优功率分配策略。该策略先建立用户与中继节点间的最优功率分配比例关系,将三层功率最优化问题简化为一层最优化问题,实现了将节点上的功率优化分配问题转化成一种易于处理的形式,以较小的复杂度获得了各节点上分配的功率占所在子载波对上分配的功率的比重;然后利用原对偶内点法求解各子载波间的功率分配问题;最终,求得各节点最优的功率分配。仿真实验表明,所提算法能显著提升系统总速率,且其性能随子载波数的增多而提升。

3ds max中创建Camera Match点方法的探讨

通过创建一辅助长方体并对其进行变换,用其变换后的方向来反映3dsmax中背景图像的透视方向,并利用其对场景与背景图像匹配的CameraMatch点进行定位,为进行摄像机匹配提供了一种方便快捷、实用的新途径.

A Review of Point Feature Based Medical Image Registration

Point features, as the basis of lines, surfaces, and bodies, are commonly used in medical image registration. To obtain an elegant spatial transformation of extracted feature points, many point set matching algorithms(PMs) have been developed to match two point sets by optimizing multifarious distance functions. There are ample reviews related to medical image registration and PMs which summarize their basic principles and main algorithms separately. However,to data, detailed summary of PMs used in medical image registration in different clinical environments has not been published. In this paper, we provide a comprehensive review of the existing key techniques of the PMs applied to medical image registration according to the basic principles and clinical applications. As the core technique of the PMs, geometric transformation models are elaborated in this paper, demonstrating the mechanism of point set registration. We also focus on the clinical applications of the PMs and propose a practical classification method according to their applications in different clinical surgeries. The aim of this paper is to provide a summary of pointfeaturebased methods used in medical image registration and to guide doctors or researchers interested in this field to choose appropriate techniques in their research.

Spectral matching algorithm based on nonsubsampled contourlet transform and scale-invariant feature transform

A new spectral matching algorithm is proposed by us- ing nonsubsampled contourlet transform and scale-invariant fea- ture transform. The nonsubsampled contourlet transform is used to decompose an image into a low frequency image and several high frequency images, and the scale-invariant feature transform is employed to extract feature points from the low frequency im- age. A proximity matrix is constructed for the feature points of two related images. By singular value decomposition of the proximity matrix, a matching matrix （or matching result） reflecting the match- ing degree among feature points is obtained. Experimental results indicate that the proposed algorithm can reduce time complexity and possess a higher accuracy.

Three-Dimensional Reconstruction of Welding Pool Surface by Binocular Vision

Current research of binocular vision systems mainly need to resolve the camera’s intrinsic parameters before the reconstruction of three-dimensional(3D)objects.The classical Zhang’calibration is hardly to calculate all errors caused by perspective distortion and lens distortion.Also,the image-matching algorithm of the binocular vision system still needs to be improved to accelerate the reconstruction speed of welding pool surfaces.In this paper,a preset coordinate system was utilized for camera calibration instead of Zhang’calibration.The binocular vision system was modified to capture images of welding pool surfaces by suppressing the strong arc interference during gas metal arc welding.Combining and improving the algorithms of speeded up robust features,binary robust invariant scalable keypoints,and KAZE,the feature information of points(i.e.,RGB values,pixel coordinates)was extracted as the feature vector of the welding pool surface.Based on the characteristics of the welding images,a mismatch-elimination algorithm was developed to increase the accuracy of image-matching algorithms.The world coordinates of matching feature points were calculated to reconstruct the 3D shape of the welding pool surface.The effectiveness and accuracy of the reconstruction of welding pool surfaces were verified by experimental results.This research proposes the development of binocular vision algorithms that can reconstruct the surface of welding pools accurately to realize intelligent welding control systems in the future.

Hierarchical adaptive stereo matching algorithm for obstacle detection with dynamic programming

An adaptive weighted stereo matching algorithm with multilevel and bidirectional dynamic programming based on ground control points （GCPs） is presented. To decrease time complexity without losing matching precision, using a multilevel search scheme, the coarse matching is processed in typical disparity space image, while the fine matching is processed in disparity-offset space image. In the upper level, GCPs are obtained by enhanced volumetric iterative algorithm enforcing the mutual constraint and the threshold constraint. Under the supervision of the highly reliable GCPs, bidirectional dynamic programming framework is employed to solve the inconsistency in the optimization path. In the lower level, to reduce running time, disparity-offset space is proposed to efficiently achieve the dense disparity image. In addition, an adaptive dual support-weight strategy is presented to aggregate matching cost, which considers photometric and geometric information. Further, post-processing algorithm can ameliorate disparity results in areas with depth discontinuities and related by occlusions using dual threshold algorithm, where missing stereo information is substituted from surrounding regions. To demonstrate the effectiveness of the algorithm, we present the two groups of experimental results for four widely used standard stereo data sets, including discussion on performance and comparison with other methods, which show that the algorithm has not only a fast speed, but also significantly improves the efficiency of holistic optimization.

POINT PATTERN MATCHING ALGORITHM BASED ON POINT PAIR TOPOLOGICAL CHARACTERISTICS AND SPECTRAL MATCHING

Most of the Point Pattern Matching (PPM) algorithm performs poorly when the noise of the point's position and outliers exist. This paper presents a novel and robust PPM algorithm which combined Point Pair Topological Characteristics (PPTC) and Spectral Matching (SM) together to solve the afore mentioned issues. In which PPTC, a new shape descriptor, is firstly proposed. A new comparability measurement based on PPTC is defined as the matching probability. Finally, the correct matching results are achieved by the spectral matching method. The synthetic data experiments show its robustness by comparing with the other state-of-art algorithms and the real world data experiments show its effectiveness.

Relaxation labeling for non-rigid point matching under neighbor preserving

Non-rigid point matching has received more and more attention.Recently,many works have been developed to discover global relationships in the point set which is treated as an instance of a joint distribution.However,the local relationship among neighboring points is more effective under non-rigid transformations.Thus,a new algorithm taking advantage of shape context and relaxation labeling technique,called SC-RL,is proposed for non-rigid point matching.It is a strategy that joints estimation for correspondences as well as the transformation.In this work,correspondence assignment is treated as a soft-assign process in which the matching probability is updated by relaxation labeling technique with a newly defined compatibility coefficient.The compatibility coefficient is one or zero depending on whether neighboring points preserving their relative position in a local coordinate system.The comparative analysis has been performed against four state-of-the-art algorithms including SC,ICP,TPS-RPM and RPM-LNS,and the results denote that SC-RL performs better in the presence of deformations,outliers and noise.

A Fast Aerial Image Matching Method Using Airborne LiDAR Point Cloud and POS Data

A novel tie point matching algorithm of aerial images with the assistance of airborne LiDAR point clouds and POS data is proposed Firstly,the conjugate point searching strategy used in traditional correlation coefficient matching is improved and a fast algorithm is presented.Secondly,an automatic camera boresight misalignment calibration method based on virtual ground control points is proposed,and then the searching range of image matching is adaptively determined and applied to the image matching of the entire surveying area.Test results verified that the fast correlation coefficient matching algorithm proposed in this paper can reduce approximately 25% of the matching time without the loss of matching accuracy.The camera boresight misalignment calibration method can effectively increase the accuracy of exterior orientation elements of images calculated from POS data,and thus can significantly improve the predicted position of conjugate point for tie point matching.Our proposed image matching algorithm can achieve superior matching accuracy with multi-scale,multi-view,and cross-flight aerial images.

A KY FAN MATCHING THEOREM FOR TRANSFER COMPACTLY OPEN COVERS AND THE APPLICATION TO THE FIXED POINT

In this article, a Ky Fan matching theorem for transfer compactly open covers is established. As applications, a Fan-Browder coincidence theorem, a Ky Fan best approximation theorem and a Brouwer-Schauder-Rothe type fixed point theorem are obtained.

基于双绞线的OFDM接收机物理层设计与实现

针对远距离、点对多点、多业务、大数据量的通信场景,提出了一种适合于双绞线传输的、基于OFDM的无中心无交换的收发信机系统方案。为了弥补远距离有线传输高频信号的衰减,该收发信机在发送端采用自适应调制和预均衡技术。在接收端采用自绕宽带阻抗匹配变压器,结合数模混合的可变增益(VGA)控制技术实现了AD前端信号幅度的调理。该VGA控制技术采用闭环控制,主要包括4个部分:前置放大电路、整流滤波电路、电压比较电路和能量检测电路(FPGA实现)。实验结果表明,在110.592 MHz的时钟频率下,信号调理的时间不到10μs。在10 km传输距离下,能够满足15对用户同时在线。