Cam-bike：使用基於光流法後方來車偵測技術之智慧型自行車

Most visual navigation relies on point matching and many of the matching point pairs are faulty. Generally, they are eliminated by the Random Sample Consensus (RANSAC) algorithms. However, RANSAC algorithms are often time-consuming and their parameters are hard to adjust. For such a purpose, a new method is proposed to eliminate the error matching points of every two consecutive images based on motion information. The proposed method is applicable to the cases that the motion information is available and the interest points are all from a horizontal plane. It does not require iteration and thus time-efficient. To demonstrate the effectiveness, the proposed method is tested on synthetic data of both simulation points and real images. The results show that the proposed method has better performance over RANSAC algorithms.

Orthognathic surgery is applied to restore esthetical facial profile and functional occlusion for patients with dentofacial deformity. Virtual surgical planning (VSP) is indispensable for precise and individualized treatment. Manually designing osteotomy planes is time-consuming and highly experience-dependent. This study aimed to develop and validate an automatic osteotomy plane design method based on deep learning. Methods: A deep learning model, Ortho-OPD (orthognathic osteotomy planes de signer), was proposed, consisting of a segmentation network and the random sample consensus (RANSAC) algorithm. The segmentation network was based on a convolutional neural network (CNN), orthognathic segmenting the craniomaxillofacial (CMF) CT data. Osteotomy planes were then defined by the RANSAC algorithm. Ortho-OPD was trained on 71 samples and tested on 31 cases. The performance was evaluated quantitatively and qualitatively. Results: Ortho-OPD functioned smoothly, and all cases were successfully performed. The 3D boundary-sensitive loss was employed to optimize precision. Evaluation metrics included accuracy and clinical efficiency. The mean dice similarity coefficient (DSC) was 0.920.032 in CMF seg mentation. Ortho-OPD showcased excellent productivity, taking an average of about 9 seconds to complete virtual bimaxillary osteotomy compared to manual work. The angular errors between the predicted planes and ground truth planes, plus the shortest distance from the neural tube or the adjacent apical points to predicted planes, were examined, indicating no significant difference and reliability for preserving vital anatomical structures. Overall, the automatic osteotomy plane design from raw CT data was realized using Ortho-OPD, composed of CNN and RANSAC, providing an efficient and ideal alternative in orthognathic osteotomy planning.

When an operator teleoperates a rescue robot, it is necessary for the operator to understand the relationship between the robot and its environment while indirect-vision driving. A LRF (Laser Range Finder) installed on a rotating stage is often used for scanning the environment in order to give the operator spatial information, while there is a tradeoff between its scanning speed and point density. To solve the problem, we implement plane detection by RANSAC (RANdom SAmple Consensus) algorithm, integration of overlapped planes using tables and drawing them as convex hulls. The experimental results show that the scanning speed could be improved because the result of 3D scanning with a low point density shows a good match for that with a high point density by using the implemented methods.

It is important to get reliable measurement data in Electrical impedance tomography (EIT) for getting satisfactory reconstruction result. Because EIT inverse problem is non-linear and ill-posed, incorrect data such as measured data through fault electrode can effect the estimation of resistivity distribution. So, EIT measurement system with methods for checking reliability has been developed. However, most existing methods require extra cost to evaluate reliability of EIT system. This paper presents modified Gauss-Newton (GN) method based on random sample consensus (RANSAC) algorithm for finding fault electrodes and getting good reconstructed image with faulty data for two-phase flow application. Also, suitable residual equation is proposed for determining the threshold to use RANSAC algorithm. Numerical simulations are performed to validate the performance of the proposed method. The results show that the proposed method has a good reconstruction performance compared to the conventional GN method.

Image stitching is one of the branches of computer vision. It combines two or more images for a scene to acquire a high-resolution panoramic image. An invariant local function often uses to stitch two images together. Since the flat plate of a digital radiography (DR) system does not cover all parts of the body, the whole bone structure image cannot seize in a single scan. To solved this problem, image stitching is broadly utilized by medical systems to stitch DR images, which can be helpful for scoliosis or lower extremity deformities in the diagnosis, and pre-operative planning are of great importance. In this paper, the stitching and retrieval of medical images planned. To conquer the background noise in medical images, and improve the recovery of quality and stitching rapidity of medical images, a random sample consensus (RANSAC) algorithm is useful to stitching the images of Chest digital radiography by scale-invariant feature transform (SIFT) and speeded-up robust features (SURF) feature extraction. Down-sampling utilizes to lessen the size of the images and reduction the measure of calculation. In the interim, the phase correlation is engaged to discover the overlapping region. After feature matching and perspective transformation, the stitched image is gotten dependent on the homography. At last, experimentation has finished showing the presentation.

Subpixel translation estimation using phase correlation is a fundamental task for numerous applications in the remote sensing community. The major drawback of the existing subpixel phase correlation methods lies in their sensitivity to corruption, including aliasing and noise, as well as the poor performance in the case of practical remote sensing data. This paper presents a novel subpixel phase correlation method using singular value decomposition (SVD) and the unified random sample consensus (RANSAC) algorithm. In the proposed method, SVD theoretically converts the translation estimation problem to one dimensions for simplicity and efficiency, and the unified RANSAC algorithm acts as a robust estimator for the line fitting, in this case for the high accuracy, stability, and robustness. The proposed method integrates the advantages of Hoge's method and the RANSAC algorithm and avoids the corresponding shortfalls of the original phase correlation method based only on SVD. A pixel-to-pixel dense matching scheme on the basis of the proposed method is also developed for practical image registration. Experiments with both simulated and real data were carried out to test the proposed method. In the simulated case, the comparative results estimated from the generated synthetic image pairs indicate that the proposed method outperforms the other existing methods in the presence of both aliasing and noise, in both accuracy and robustness. Moreover, the pixel locking effect that commonly occurs in subpixel matching was also investigated. The degree of pixel locking effect was found to be significantly weakened by the proposed method, as compared with the original Hoge's method. In the real data case, experiments using different bands of ZY-3 multispectral sensor-corrected images demonstrate the promising performance and feasibility of the proposed method, which is able to identify seams of the image stitching between sub-charge-coupled device units.

Most of the recent works on optical flow estimation focus on introducing more effective CNNs or even the Transformer architecture that is quite popular in today’s CV field, but they all still follow the traditional two-frame input structure. In this paper, we argue that optical flow estimation should be more focused on the dynamic information in the image sequence. To that end, we present a straightforward but effective streaming framework equipped with a novel prediction module for capturing optical flow trends, which is a point that has not yet been discussed in previous works. By employing the backbone of the strong baseline to extract the stream of features from three consecutive frames as inputs, this module can predict the current state and update the previous changing trend of optical flow for feature fusion at the next stage. Additionally, we redesign the training loss, providing two new cost functions, in particular, to measure the variations in the optical flow trend. At the forward stage, we deploy a historical buffer to maintain the inference speed so that it is unaffected by additional input frames. Compared with the strong baseline, our method improves the average end-point error by 21.12% on Sintel Clean and 12.94% on Sintel Final. In addition, it also outperforms existing methods in real-world scenarios with low brightness or fast-moving targets.

An important aspect of chemoinformatics and material-informatics is the usage of machine learning algorithms to build Quantitative Structure Activity Relationship (QSAR) models. The RANdom SAmple Consensus (RANSAC) algorithm is a predictive modeling tool widely used in the image processing field for cleaning datasets from noise. RANSAC could be used as a “one stop shop” algorithm for developing and validating QSAR models, performing outlier removal, descriptors selection, model development and predictions for test set samples using applicability domain. For “future” predictions (i.e., for samples not included in the original test set) RANSAC provides a statistical estimate for the probability of obtaining reliable predictions, i.e., predictions within a pre-defined number of standard deviations from the true values. In this work we describe the first application of RNASAC in material informatics, focusing on the analysis of solar cells. We demonstrate that for three datasets representing different metal oxide (MO) based solar cell libraries RANSAC-derived models select descriptors previously shown to correlate with key photovoltaic properties and lead to good predictive statistics for these properties. These models were subsequently used to predict the properties of virtual solar cells libraries highlighting interesting dependencies of PV properties on MO compositions.

Using a single sensor to determine the pose estimation of a device cannot give accurate results. This paper presents a fusion of an inertial sensor of six degrees of freedom (6-DoF) which comprises the 3-axis of an accelerometer and the 3-axis of a gyroscope, and a vision to determine a low-cost and accurate position for an autonomous mobile robot. For vision, a monocular vision-based object detection algorithm speeded-up robust feature (SURF) and random sample consensus (RANSAC) algorithms were integrated and used to recognize a sample object in several images taken. As against the conventional method that depend on point-tracking, RANSAC uses an iterative method to estimate the parameters of a mathematical model from a set of captured data which contains outliers. With SURF and RANSAC, improved accuracy is certain; this is because of their ability to find interest points (features) under different viewing conditions using a Hessain matrix. This approach is proposed because of its simple implementation, low cost, and improved accuracy. With an extended Kalman filter (EKF), data from inertial sensors and a camera were fused to estimate the position and orientation of the mobile robot. All these sensors were mounted on the mobile robot to obtain an accurate localization. An indoor experiment was carried out to validate and evaluate the performance. Experimental results show that the proposed method is fast in computation, reliable and robust, and can be considered for practical applications. The performance of the experiments was verified by the ground truth data and root mean square errors (RMSEs).

In this paper, we propose UnOS, an unified system for unsupervised optical flow and stereo depth estimation using convolutional neural network (CNN) by taking advantages of their inherent geometrical consistency based on the rigid-scene assumption. UnOS significantly outperforms other state-of-the-art (SOTA) unsupervised approaches that treated the two tasks independently. Specifically, given two consecutive stereo image pairs from a video, UnOS estimates per-pixel stereo depth images, camera ego-motion and optical flow with three parallel CNNs. Based on these quantities, UnOS computes rigid optical flow and compares it against the optical flow estimated from the FlowNet, yielding pixels satisfying the rigid-scene assumption. Then, we encourage geometrical consistency between the two estimated flows within rigid regions, from which we derive a rigid-aware direct visual odometry (RDVO) module. We also propose rigid and occlusion-aware flow-consistency losses for the learning of UnOS. We evaluated our results on the popular KITTI dataset over 4 related tasks, \ie stereo depth, optical flow, visual odometry and motion segmentation.

The extraction of building roof planes from lidar data has become a popular research topic with random sample consensus (RANSAC) being one of the most commonly adopted algorithms. RANSAC extracts full planes, which is problematic when there are other points outside the plane boundary but within the plane space. This study proposes an improved RANSAC (I‐RANSAC) algorithm by removing points that do not belong to the roof plane. I‐RANSAC selects a random point from the extracted roof plane and then searches for its neighbours within a given threshold to identify and remove outliers. The new algorithm was tested with 14 buildings from two datasets, where quality control measures showed significant improvement over standard RANSAC.

A computational problem that arises frequently in computer vision is that of estimating the parameters of a model from data that have been contaminated by noise and outliers. More generally, any practical system that seeks to estimate quantities from noisy data measurements must have at its core some means of dealing with data contamination. The random sample consensus (RANSAC) algorithm is one of the most popular tools for robust estimation. Recent years have seen an explosion of activity in this area, leading to the development of a number of techniques that improve upon the efficiency and robustness of the basic RANSAC algorithm. In this paper, we present a comprehensive overview of recent research in RANSAC-based robust estimation by analyzing and comparing various approaches that have been explored over the years. We provide a common context for this analysis by introducing a new framework for robust estimation, which we call Universal RANSAC (USAC). USAC extends the simple hypothesize-and-verify structure of standard RANSAC to incorporate a number of important practical and computational considerations. In addition, we provide a general-purpose C++ software library that implements the USAC framework by leveraging state-of-the-art algorithms for the various modules. This implementation thus addresses many of the limitations of standard RANSAC within a single unified package. We benchmark the performance of the algorithm on a large collection of estimation problems. The implementation we provide can be used by researchers either as a stand-alone tool for robust estimation or as a benchmark for evaluating new techniques.

Optical flow estimation is a research core of computer vision. In recent years, optical flow estimation methods based on convolutional neural networks (CNNs) have achieved great success. However, most of the existing CNN-based methods are incapable of modeling long-distance dependencies successfully due to the limited receptive fields of convolutions. This may lead to poor performance of optical flow estimation in regions of large displacements and local ambiguities. Furthermore, the problem of edge-blurring remains an open challenge for CNN-based optical flow methods because the general interpolation operation tends to amplify the optical flow errors during the upsampling process. To deal with the abovementioned problems, this paper proposes a novel optical flow estimation method based on local-global modeling and visual similarity guidance. First, an efficient and simple self-attention module is adopted to improve the local-global modeling ability of the network and to extract the more representative features, which decreases the number of optical flow errors caused by large displacements. Second, based on the assumption that the visual features of the objects are more similar, the motion is more similar, and a visual similarity-guided optical flow upsampling network is constructed to guide the upsampling process. By transforming the visual similarity of features into motion similarity, the proposed upsampling scheme improves the accuracy of optical flow estimation in regions of motion boundaries. Finally, we run the proposed method on MPI-Sintel and KITTI test datasets to conduct a comprehensive comparison with some state-of-the-art methods. The experimental results indicate that the proposed method achieves top performance among the comparable methods and, in particular, gains significant developments in regions of large displacements and motion boundaries.

Road visual navigation relies on accurate road models. This study was aimed at proposing an improved scale-invariant feature transform (SIFT) algorithm for recovering depth information from farmland road images, which would provide a reliable path for visual navigation. The mean image of pixel value in five channels (R, G, B, S and V) were treated as the inspected image and the feature points of the inspected image were extracted by the Canny algorithm, for achieving precise location of the feature points and ensuring the uniformity and density of the feature points. The mean value of the pixels in 5×5 neighborhood around the feature point at an interval of 45o in eight directions was then treated as the feature vector, and the differences of the feature vectors were calculated for preliminary matching of the left and right image feature points. In order to achieve the depth information of farmland road images, the energy method of feature points was used for eliminating the mismatched points. Experiments with a binocular stereo vision system were conducted and the results showed that the matching accuracy and time consuming for depth recovery when using the improved SIFT algorithm were 96.48% and 5.6 s, respectively, with the accuracy for depth recovery of –7.17%-2.97% in a certain sight distance. The mean uniformity, time consuming and matching accuracy for all the 60 images under various climates and road conditions were 50%-70%, 5.0-6.5 s, and higher than 88%, respectively, indicating that performance for achieving the feature points (e.g., uniformity, matching accuracy, and algorithm real-time) of the improved SIFT algorithm were superior to that of conventional SIFT algorithm. This study provides an important reference for navigation technology of agricultural equipment based on machine vision. Keywords: scale-invariant feature transform (sift), feature matching, canny operator, energy method of feature point, farmland road, depth recovery, visual navigation DOI: 10.25165/j.ijabe.20191204.4821 Citation: Yao L J, Hu D, Yang Z D, Li H B, Qian M B. Depth recovery for unstructured farmland road image using an improved SIFT algorithm. Int J Agric & Biol Eng, 2019; 12(4): 141–147.

Purpose:Current systems for obtaining respiratory information at time of treatment typically require the use of additional equipment and add to patient setup time. In this study, we develop a fully automated method to track respiratory motion by tracking the motion of the diaphragm surface, making use of only current imaging technology and without the need for additional mechanical, pneumatic, or optical devices.Methods:A statistical algorithm, RANdom SAmple Consensus (RANSAC), was used for direct tracking of the diaphragm surface through kV CBCT projection images. A third order polynomial was used to model the shape of the diaphragm. Model constraints based on the diaphragm shape as well as a small motion assumption (between adjacent projections) were incorporated to constrain the model. The changing position of the diaphragm along the Superior‐Inferior direction as the patient respires then gives the respiratory trace.Results:On the patients studied, the respiratory trace can be obtained with between 5,000 and 1,000,000 iterations of the RANSAC algorithm, per projection. Visual comparison with the projection images in a cine like mode shows the computed respiratory trace matches well with the true respiratory cycle. With a low number of iterations (<10,000 per projection), the diaphragm location computation time is similar to projection image acquisition and therefore the trace can be computed in real time.Conclusion:The RANSAC algorithm is a viable method for obtaining a respiratory trace with the patient on the treatment couch. Implementing the RANSAC algorithm on a GPU should allow for a significantly larger number of iterations while maintaining the ability to acquire the respiratory trace in real time. This method of obtaining a respiratory trace should reduce costs for technology such as 4DCBCT as well as reduce patient setup times and improve patient comfort.