Analytical study of computer vision-based pavement crack quantification using machine learning techniques

Image-based techniques are a promising non-destructive approach for road pavement condition evaluation. The main objective of this study is to extract, quantify and evaluate important surface defects, such as cracks, using an automated computer vision-based system to provide a better understanding of the pavement deterioration process. To achieve this objective, an automated crack-recognition software was developed, employing a series of image processing algorithms of crack extraction, crack grouping, and crack detection. Bottom-hat morphological technique was used to remove the random background of pavement images and extract cracks, selectively based on their shapes, sizes, and intensities using a relatively small number of user-defined parameters. A technical challenge with crack extraction algorithms, including the Bottom-hat transform, is that extracted crack pixels are usually fragmented along crack paths. For de-fragmenting those crack pixels, a novel crack-grouping algorithm is proposed as an image segmentation method, so called MorphLink-C. Statistical validation of this method using flexible pavement images indicated that MorphLink-C not only improves crack-detection accuracy but also reduces crack detection time. Crack characterization was performed by analysing imagerial features of the extracted crack image components. A comprehensive statistical analysis was conducted using filter feature subset selection (FSS) methods, including Fischer score, Gini index, information gain, ReliefF, mRmR, and FCBF to understand the statistical characteristics of cracks in different deterioration stages. Statistical significance of crack features was ranked based on their relevancy and redundancy. The statistical method used in this study can be employed to avoid subjective crack rating based on human visual inspection. Moreover, the statistical information can be used as fundamental data to justify rehabilitation policies in pavement maintenance. Finally, the application of four classification algorithms, including Artificial Neural Network (ANN), Decision Tree (DT), k-Nearest Neighbours (kNN) and Adaptive Neuro-Fuzzy Inference System (ANFIS) is investigated for the crack detection framework. The classifiers were evaluated in the following five criteria: 1) prediction performance, 2) computation time, 3) stability of results for highly imbalanced datasets in which, the number of crack objects are significantly smaller than the number of non-crack objects, 4) stability of the classifiers performance for pavements in different deterioration stages, and 5) interpretability of results and clarity of the procedure. Comparison results indicate the advantages of white-box classification methods for computer vision based pavement evaluation. Although black-box methods, such as ANN provide superior classification performance, white-box methods, such as ANFIS, provide useful information about the logic of classification and the effect of feature values on detection results. Such information can provide further insight for the image-based pavement crack detection application

A salient edges detection algorithm of multi-sensor images and its rapid calculation based on PFCM kernel clustering

AbstractMulti-sensor image matching based on salient edges has broad prospect in applications, but it is difficult to extract salient edges of real multi-sensor images with noises fast and accurately by using common algorithms. According to the analysis of the features of salient edges, a novel salient edges detection algorithm and its rapid calculation are proposed based on possibility fuzzy C-means (PFCM) kernel clustering using two-dimensional vectors composed of the values of gray and texture. PFCM clustering can overcome the shortcomings that fuzzy C-means (FCM) clustering is sensitive to noises and possibility C-means (PCM) clustering tends to find identical clusters. On this basis, a method is proposed to improve real-time performance by compressing data sets based on the idea of data reduction in the field of mathematical analysis. In addition, the idea that kernel-space is linearly separable is used to enhance robustness further. Experimental results show that this method extracts salient edges for real multi-sensor images with noises more accurately than the algorithm based on force fields and the FCM algorithm; and the proposed method is on average about 56 times faster than the PFCM algorithm in real time and has better robustness

Effects of discrete wavelet compression on automated mammographic shape recognition

At present early detection is critical for the cure of breast cancer. Mammography is a breast screening technique which can detect breast cancer at the earliest possible stage. Mammographic lesions are typically classified into three shape classes, namely round, nodular and stellate. Presently this classification is done by experienced radiologists. In order to increase the speed and decrease the cost of diagnosis, automated recognition systems are being developed. This study analyses an automated classification procedure and its sensitivity to wavelet based image compression; In this study, the mammographic shape images are compressed using discrete wavelet compression and then classified using statistical classification methods. First, one dimensional compression is done on the radial distance measure and the shape features are extracted. Second, linear discriminant analysis is used to compute the weightings of the features. Third, a minimum distance Euclidean classifier and the leave-one-out test method is used for classification. Lastly, a two dimensional compression is performed on the images, and the above process of feature extraction and classification is repeated. The results are compared with those obtained with uncompressed mammographic images

TEXTURAL ANALYSIS AND STATISTICAL INVESTIGATION OF PATTERNS IN SYNTHETIC APERTURE SONAR IMAGES

Textural analysis and statistical investigation of patterns in synthetic aperture sonar (SAS) images is useful for oceanographic purposes such as biological habitat mapping or bottom type identification for offshore construction. Seafloor classification also has many tactical benefits for the U.S. Navy in terms of mine identification and undersea warfare. Common methods of texture analysis rely on statistical moments of image intensity, or more generally, the probability density function of the scene. One of the most common techniques uses Haralick’s Grey Level Co-occurrence Matrix (GLCM) to calculate image features used in the applications listed above. Although widely used, seafloor classification and segmentation are difficult using Haralick features. Typically, these features are calculated at a single scale. Improvements based on the understanding that patterns are multiscale was compared with this baseline, with a goal of improving seafloor classification. Synthetic aperture sonar (SAS) data was provided by the Norwegian Research Defense Establishment for this work, and was labeled into six distinct seafloor classes, with 757 total examples. We analyze the feature importance determined by neighborhood component analysis as a function of scale and direction to determine which spatial scale and azimuthal direction is most informative for good classification performance.Office of Naval Research, Arlington, VA , 22217Lieutenant, United States NavyApproved for public release. Distribution is unlimited

Computerized Analysis of Magnetic Resonance Images to Study Cerebral Anatomy in Developing Neonates

The study of cerebral anatomy in developing neonates is of great importance for the understanding of brain development during the early period of life. This dissertation therefore focuses on three challenges in the modelling of cerebral anatomy in neonates during brain development. The methods that have been developed all use Magnetic Resonance Images (MRI) as source data. To facilitate study of vascular development in the neonatal period, a set of image analysis algorithms are developed to automatically extract and model cerebral vessel trees. The whole process consists of cerebral vessel tracking from automatically placed seed points, vessel tree generation, and vasculature registration and matching. These algorithms have been tested on clinical Time-of- Flight (TOF) MR angiographic datasets. To facilitate study of the neonatal cortex a complete cerebral cortex segmentation and reconstruction pipeline has been developed. Segmentation of the neonatal cortex is not effectively done by existing algorithms designed for the adult brain because the contrast between grey and white matter is reversed. This causes pixels containing tissue mixtures to be incorrectly labelled by conventional methods. The neonatal cortical segmentation method that has been developed is based on a novel expectation-maximization (EM) method with explicit correction for mislabelled partial volume voxels. Based on the resulting cortical segmentation, an implicit surface evolution technique is adopted for the reconstruction of the cortex in neonates. The performance of the method is investigated by performing a detailed landmark study. To facilitate study of cortical development, a cortical surface registration algorithm for aligning the cortical surface is developed. The method first inflates extracted cortical surfaces and then performs a non-rigid surface registration using free-form deformations (FFDs) to remove residual alignment. Validation experiments using data labelled by an expert observer demonstrate that the method can capture local changes and follow the growth of specific sulcus

A novel automated approach of multi-modality retinal image registration and fusion

Biomedical image registration and fusion are usually scene dependent, and require intensive computational effort. A novel automated approach of feature-based control point detection and area-based registration and fusion of retinal images has been successfully designed and developed. The new algorithm, which is reliable and time-efficient, has an automatic adaptation from frame to frame with few tunable threshold parameters. The reference and the to-be-registered images are from two different modalities, i.e. angiogram grayscale images and fundus color images. The relative study of retinal images enhances the information on the fundus image by superimposing information contained in the angiogram image. Through the thesis research, two new contributions have been made to the biomedical image registration and fusion area. The first contribution is the automatic control point detection at the global direction change pixels using adaptive exploratory algorithm. Shape similarity criteria are employed to match the control points. The second contribution is the heuristic optimization algorithm that maximizes Mutual-Pixel-Count (MPC) objective function. The initially selected control points are adjusted during the optimization at the sub-pixel level. A global maxima equivalent result is achieved by calculating MPC local maxima with an efficient computation cost. The iteration stops either when MPC reaches the maximum value, or when the maximum allowable loop count is reached. To our knowledge, it is the first time that the MPC concept has been introduced into biomedical image fusion area as the measurement criteria for fusion accuracy. The fusion image is generated based on the current control point coordinates when the iteration stops. The comparative study of the presented automatic registration and fusion scheme against Centerline Control Point Detection Algorithm, Genetic Algorithm, RMSE objective function, and other existing data fusion approaches has shown the advantage of the new approach in terms of accuracy, efficiency, and novelty