Search

Patch level-based noise level estimation (NLE) is often inaccurate and inefficient because of the harsh criteria required to select a small number of homogeneous patches. In this paper, a fast image NLE method based on a global search for similar pixels is proposed to solve the above problem. Specifically, the mean square distance (MSD) is first expressed in the form of the standard deviation (std) and mean value of image patches. Afterward, the two values, std and mean, are calculated and stored in advance. Then, a 2D statistical histogram and summed area table are adopted to speed up the search for similar patches. Further, the most similar pixels are selected from similar patches to obtain an initial estimation. Finally, we correct the deviation of the initial estimation by re-injecting noise for secondary estimation. Experimental results show that the proposed method outperforms the state-of-the-art techniques in fast NLE and guided denoising. [ABSTRACT FROM AUTHOR]

Outliers significantly impact the accuracy of geometric model fitting. Previous approaches to handling outliers have involved threshold selection and scale estimation. However, many scale estimators assume that the inlier distribution follows a Gaussian model, which often does not accurately represent cases in geometric model fitting. Outliers, defined as points with large residuals to all true models, exhibit similar characteristics to high values in quantized residual preferences, thus causing outliers to cluster away from inliers in quantized residual preference space. In this paper, we leverage this consensus among outliers in quantized residual preference space by extending energy minimization to combine model error and spatial smoothness for outlier detection. The outlier detection process based on energy minimization follows an alternate sampling and labeling framework. Subsequently, an ordinary energy minimization method is employed to optimize inlier labels, thereby following the alternate sampling and labeling framework. Experimental results demonstrate that the energy minimization-based outlier detection method effectively identifies most outliers in the data. Additionally, the proposed energy minimization-based inlier segmentation accurately segments inliers into different models. Overall, the performance of the proposed method surpasses that of most state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Parameter setting and information redundancy are essential issues for the non-local means (NLM) algorithm. This paper introduces a new factor based on the Hessian matrix to adapt the smoothing parameter. Then, a strategy is proposed to implement the NLM by representing patches in terms of features, which uses the 2D histogram and summed-area table. Compared with other methods, the metric for patch similarity in this paper is based on statistical features of patches instead of Euclidean distance. More importantly, not many predefined thresholds are needed. Experimental results show that the proposed algorithm obtains better visual quality and numerical results, especially for images with rich contents and high noise. [ABSTRACT FROM AUTHOR]

Featured Application: The proposed DLRSD-based segmentation method can be applied for other industrial products, such as glass, fabric, LCD and AMOLED. Surface defect segmentation supports real-time surface defect detection system of steel sheet by reducing redundant information and highlighting the critical defect regions for high-level image understanding. Existing defect segmentation methods usually lack adaptiveness to different shape, size and scale of the defect object. Based on the observation that the defective area can be regarded as the salient part of image, a saliency detection model using double low-rank and sparse decomposition (DLRSD) is proposed for surface defect segmentation. The proposed method adopts a low-rank assumption which characterizes the defective sub-regions and defect-free background sub-regions respectively. In addition, DLRSD model uses sparse constrains for background sub-regions so as to improve the robustness to noise and uneven illumination simultaneously. Then the Laplacian regularization among spatially adjacent sub-regions is incorporated into the DLRSD model in order to uniformly highlight the defect object. Our proposed DLRSD-based segmentation method consists of three steps: firstly, using DLRSD model to obtain the defect foreground image; then, enhancing the foreground image to establish the good foundation for segmentation; finally, the Otsu's method is used to choose an optimal threshold automatically for segmentation. Experimental results demonstrate that the proposed method outperforms state-of-the-art approaches in terms of both subjective and objective tests. Meanwhile, the proposed method is applicable to industrial detection with limited computational resources. [ABSTRACT FROM AUTHOR]

Pose estimation is a particularly important link in the task of robotic bin-picking. Its purpose is to obtain the 6D pose (3D position and 3D posture) of the target object. In real bin-picking scenarios, noise, overlap, and occlusion affect accuracy of pose estimation and lead to failure in robot grasping. In this paper, a new point-pair feature (PPF) descriptor is proposed, in which curvature information of point-pairs is introduced to strengthen feature description, and improves the point cloud matching rate. The proposed method also introduces an effective point cloud preprocessing, which extracts candidate targets in complex scenarios, and, thus, improves the overall computational efficiency. By combining with the curvature distribution, a weighted voting scheme is presented to further improve the accuracy of pose estimation. The experimental results performed on public data set and real scenarios show that the accuracy of the proposed method is much higher than that of the existing PPF method, and it is more efficient than the PPF method. The proposed method can be used for robotic bin-picking in real industrial scenarios. [ABSTRACT FROM AUTHOR]

Weighted least-squares (WLS) phase unwrapping is widely used in optical engineering. However, this technique still has issues in coping with discontinuity as well as noise. In this paper, a new WLS phase unwrapping algorithm based on the least-squares orientation estimator (LSOE) is proposed to improve phase unwrapping robustness. Specifically, the proposed LSOE employs a quadratic error norm to constrain the distance between gradients and orientation vectors. The estimated orientation is then used to indicate the wrapped phase quality, which is in terms of a weight mask. The weight mask is calculated by post-processing, including a bilateral filter, STDS, and numerical relabeling. Simulation results show that the proposed method can work in a scenario in which the noise variance is 1.5. Comparisons with the four WLS phase unwrapping methods indicate that the proposed method provides the best accuracy in terms of segmentation mean error under the noisy patterns. [ABSTRACT FROM AUTHOR]

Feature point detection is the basis of computer vision, and the detection methods with geometric invariance and illumination invariance are the key and difficult problem in the field of feature detection. This paper proposes an illumination-invariant feature point detection method based on neighborhood information. The method can be summarized into two steps. Firstly, the feature points are divided into eight types according to the number of connected neighbors. Secondly, each type of feature points is classified again according to the position distribution of neighboring pixels. The theoretical deduction proves that the proposed method has lower computational complexity than other methods. The experimental results indicate that, when the photometric variation of the two images is very large, the feature-based detection methods are usually inferior, while the learning-based detection methods performs better. However, our method performs better than the learning-based detection method in terms of the number of feature points, the number of matching points, and the repeatability rate stability. The experimental results demonstrate that the proposed method has the best illumination robustness among state-of-the-art feature detection methods. [ABSTRACT FROM AUTHOR]

Capturing high-quality images via mobile devices in low-light or backlighting conditions is very challenging. In this paper, a new, single image brightening algorithm is proposed to enhance an image captured in low-light conditions. Two virtual images with larger exposure times are generated to increase brightness and enhance fine details of the underexposed regions. In order to reduce the brightness change, the virtual images are generated via intensity mapping functions (IMFs) which are computed using available camera response functions (CRFs). To avoid possible color distortion in the virtual image due to one-to-many mapping, a least square minimization problem is formulated to determine brightening factors for all pixels in the underexposed regions. In addition, an edge-preserving smoothing technique is adopted to avoid noise in the underexposed regions from being amplified in the virtual images. The final brightened image is obtained by fusing the original image and two virtual images via a gradient domain guided image filtering (GGIF) based multiscale exposure fusion (MEF) with properly defined weights for all the images. Experimental results show that the relative brightness and color are preserved better by the proposed algorithm. The details in bright regions are also preserved well in the final image. The proposed algorithm is expected to be useful for computational photography on smart phones. [ABSTRACT FROM AUTHOR]

Geometric model fitting is a fundamental issue in computer vision, and the fitting accuracy is affected by outliers. In order to eliminate the impact of the outliers, the inlier threshold or scale estimator is usually adopted. However, a single inlier threshold cannot satisfy multiple models in the data, and scale estimators with a certain noise distribution model work poorly in geometric model fitting. It can be observed that the residuals of outliers are big for all true models in the data, which makes the consensus of the outliers. Based on this observation, we propose a preference analysis method based on residual histograms to study the outlier consensus for outlier detection in this paper. We have found that the outlier consensus makes the outliers gather away from the inliers on the designed residual histogram preference space, which is quite convenient to separate outliers from inliers through linkage clustering. After the outliers are detected and removed, a linkage clustering with permutation preference is introduced to segment the inliers. In addition, in order to make the linkage clustering process stable and robust, an alternative sampling and clustering framework is proposed in both the outlier detection and inlier segmentation processes. The experimental results also show that the outlier detection scheme based on residual histogram preference can detect most of the outliers in the data sets, and the fitting results are better than most of the state-of-the-art methods in geometric multi-model fitting. [ABSTRACT FROM AUTHOR]

Calibration is a critical step for the phase measuring deflectometry system. Existing calibration methods are mainly optimizing the calibration parameters with respect to the 2D re-projection error criterion. However, such a procedure cannot reduce metric errors in the practical application. Therefore, an accurate and practical calibration method is proposed. In which, conventional calibration means is first applied for the primary calibration. Then, a precise square planar mirror is used for the optimization of system calibration parameters. All the intrinsic and extrinsic parameters are considered as a global multi-objective optimization problem. Three metric error criteria are introduced to evaluate the 3D reconstruction accuracy of the reference mirror. Compared with classical calibration means, which apply the parameter optimization in 2D image space to minimize the re-projection errors, the proposed optimization approach is executed in 3D space directly. An experiment and comparison are conducted to verify that the proposed optimal calibration approach can effectively reduce the system deviation and to improve the system measurement accuracy. [ABSTRACT FROM AUTHOR]

Estimating the Direction of Arrival (DOA) is a basic and crucial problem in array signal processing. The existing DOA methods fail to obtain reliable and accurate results when noise and reverberation occur in real applications. In this paper, an accurate and robust estimation method for estimating the DOA of sources signal is proposed. Incorporating the Estimating Signal Parameters via Rotational Invariance Techniques (ESPRIT) algorithm with the RANdom SAmple Consensus (RANSAC) algorithm gives rise to the RAN-ESPRIT method, which removes outliers automatically in noise-corrupted environments. In this work, a uniform circular array (UCA) is converted into a virtual uniform linear array (ULA) to begin with. Then, the covariance matrix of the received signals of the virtual linear array is reconstructed, and the ESPRIT algorithm is deployed to estimate initial DOA of the source signal. Finally, the modified RANSAC method with automatically selected thresholds is used to fit the source signal to obtain accurate DOA. The proposed method can remove the unreliable DOA feature data and leads to more accuracy of DOA estimation of source signals in reverberation environments. Experimental results demonstrate that the proposed method is more robust and efficient compared to the traditional methods (i.e., ESPRIT, TLS-ESPRIT). [ABSTRACT FROM AUTHOR]