Road network extraction with new vectorization and pruning from high-resolution RS images

With the increasing resolution of remote sensing images, road network can be displayed as continuous and homogeneity regions with a certain width rather than traditional thin lines. Therefore, road network extraction from large scale images refers to reliable road surface detection instead of road line extraction. In this paper, a novel automatic road network detection approach based on the combination of homogram segmentation and mathematical morphology is proposed, which includes three main steps: (i) the image is classified based on homogram segmentation to roughly identify the road network regions; (ii) the morphological opening and closing is employed to fill tiny holes and filter out small road branches; and (iii) the extracted road surface is further thinned by a thinning approach, pruned by a proposed method and finally simplified with Douglas-Peucker algorithm. Lastly, the results from some QuickBird images and aerial photos demonstrate the correctness and efficiency of the proposed process.

Extraction of road lanes from high-resolution stereo aerial imagery based on maximum likelihood segmentation and texture enhancement

Accurate road lane information is crucial for advanced vehicle navigation and safety applications. With the increasing of very high resolution (VHR) imagery of astonishing quality provided by digital airborne sources, it will greatly facilitate the data acquisition and also significantly reduce the cost of data collection and updates if the road details can be automatically extracted from the aerial images. In this paper, we proposed an effective approach to detect road lanes from aerial images with employment of the image analysis procedures. This algorithm starts with constructing the (Digital Surface Model) DSM and true orthophotos from the stereo images. Next, a maximum likelihood clustering algorithm is used to separate road from other ground objects. After the detection of road surface, the road traffic and lane lines are further detected using texture enhancement and morphological operations. Finally, the generated road network is evaluated to test the performance of the proposed approach, in which the datasets provided by Queensland department of Main Roads are used. The experiment result proves the effectiveness of our approach.

Testing a tri-partite contingent model of engineering cultures : a pilot study

For some time there has been a growing awareness of organizational culture and its impact on the functioning of engineering and maintenance departments. Those wishing to implement contemporary maintenance regimes (e.g. condition based maintenance) are often encouraged to develop “appropriate cultures” to support a new method’s introduction. Unfortunately these same publications often fail to specifically articulate the cultural values required to support those efforts. In the broader literature, only a limited number of case examples document the cultural values held by engineering asset intensive firms and how they contribute to their success (or failure). Consequently a gap exists in our knowledge of what engineering cultures currently might look like, or what might constitute a best practice engineering asset culture. The findings of a pilot study investigating the perceived ideal characteristics of engineering asset cultures are reported. Engineering managers, consultants and academics (n=47), were surveyed as to what they saw were essential attributes of both engineering cultures and engineering asset personnel. Valued cultural elements included those orientated around continuous improvement, safety and quality. Valued individual attributes included openness to change, interpersonal skills and conscientiousness. The paper concludes with a discussion regarding the development of a best practice cultural framework for practitioners and engineering managers.

Off-world robotic excavation for Large-scale habitat construction and resource extraction

This paper describes technologies we have developed to perform autonomous large-scale off-world excavation. A scale dragline excavator of size similar to that required for lunar excavation was made capable of autonomous control. Systems have been put in place to allow remote operation of the machine from anywhere in the world. Algorithms have been developed for complete autonomous digging and dumping of material taking into account machine and terrain constraints and regolith variability. Experimental results are presented showing the ability to autonomously excavate and move large amounts of regolith and accurately place it at a specified location.

Fingerprint analysis using wavelet transform with application to compression and feature extraction

The main goal of this research is to design an efficient compression al~ gorithm for fingerprint images. The wavelet transform technique is the principal tool used to reduce interpixel redundancies and to obtain a parsimonious representation for these images. A specific fixed decomposition structure is designed to be used by the wavelet packet in order to save on the computation, transmission, and storage costs. This decomposition structure is based on analysis of information packing performance of several decompositions, two-dimensional power spectral density, effect of each frequency band on the reconstructed image, and the human visual sensitivities. This fixed structure is found to provide the "most" suitable representation for fingerprints, according to the chosen criteria. Different compression techniques are used for different subbands, based on their observed statistics. The decision is based on the effect of each subband on the reconstructed image according to the mean square criteria as well as the sensitivities in human vision. To design an efficient quantization algorithm, a precise model for distribution of the wavelet coefficients is developed. The model is based on the generalized Gaussian distribution. A least squares algorithm on a nonlinear function of the distribution model shape parameter is formulated to estimate the model parameters. A noise shaping bit allocation procedure is then used to assign the bit rate among subbands. To obtain high compression ratios, vector quantization is used. In this work, the lattice vector quantization (LVQ) is chosen because of its superior performance over other types of vector quantizers. The structure of a lattice quantizer is determined by its parameters known as truncation level and scaling factor. In lattice-based compression algorithms reported in the literature the lattice structure is commonly predetermined leading to a nonoptimized quantization approach. In this research, a new technique for determining the lattice parameters is proposed. In the lattice structure design, no assumption about the lattice parameters is made and no training and multi-quantizing is required. The design is based on minimizing the quantization distortion by adapting to the statistical characteristics of the source in each subimage. 11 Abstract Abstract Since LVQ is a multidimensional generalization of uniform quantizers, it produces minimum distortion for inputs with uniform distributions. In order to take advantage of the properties of LVQ and its fast implementation, while considering the i.i.d. nonuniform distribution of wavelet coefficients, the piecewise-uniform pyramid LVQ algorithm is proposed. The proposed algorithm quantizes almost all of source vectors without the need to project these on the lattice outermost shell, while it properly maintains a small codebook size. It also resolves the wedge region problem commonly encountered with sharply distributed random sources. These represent some of the drawbacks of the algorithm proposed by Barlaud [26). The proposed algorithm handles all types of lattices, not only the cubic lattices, as opposed to the algorithms developed by Fischer [29) and Jeong [42). Furthermore, no training and multiquantizing (to determine lattice parameters) is required, as opposed to Powell's algorithm [78). For coefficients with high-frequency content, the positive-negative mean algorithm is proposed to improve the resolution of reconstructed images. For coefficients with low-frequency content, a lossless predictive compression scheme is used to preserve the quality of reconstructed images. A method to reduce bit requirements of necessary side information is also introduced. Lossless entropy coding techniques are subsequently used to remove coding redundancy. The algorithms result in high quality reconstructed images with better compression ratios than other available algorithms. To evaluate the proposed algorithms their objective and subjective performance comparisons with other available techniques are presented. The quality of the reconstructed images is important for a reliable identification. Enhancement and feature extraction on the reconstructed images are also investigated in this research. A structural-based feature extraction algorithm is proposed in which the unique properties of fingerprint textures are used to enhance the images and improve the fidelity of their characteristic features. The ridges are extracted from enhanced grey-level foreground areas based on the local ridge dominant directions. The proposed ridge extraction algorithm, properly preserves the natural shape of grey-level ridges as well as precise locations of the features, as opposed to the ridge extraction algorithm in [81). Furthermore, it is fast and operates only on foreground regions, as opposed to the adaptive floating average thresholding process in [68). Spurious features are subsequently eliminated using the proposed post-processing scheme.

GYAN: A methodology for rule extraction from artificial neural networks

Artificial neural network (ANN) learning methods provide a robust and non-linear approach to approximating the target function for many classification, regression and clustering problems. ANNs have demonstrated good predictive performance in a wide variety of practical problems. However, there are strong arguments as to why ANNs are not sufficient for the general representation of knowledge. The arguments are the poor comprehensibility of the learned ANN, and the inability to represent explanation structures. The overall objective of this thesis is to address these issues by: (1) explanation of the decision process in ANNs in the form of symbolic rules (predicate rules with variables); and (2) provision of explanatory capability by mapping the general conceptual knowledge that is learned by the neural networks into a knowledge base to be used in a rule-based reasoning system. A multi-stage methodology GYAN is developed and evaluated for the task of extracting knowledge from the trained ANNs. The extracted knowledge is represented in the form of restricted first-order logic rules, and subsequently allows user interaction by interfacing with a knowledge based reasoner. The performance of GYAN is demonstrated using a number of real world and artificial data sets. The empirical results demonstrate that: (1) an equivalent symbolic interpretation is derived describing the overall behaviour of the ANN with high accuracy and fidelity, and (2) a concise explanation is given (in terms of rules, facts and predicates activated in a reasoning episode) as to why a particular instance is being classified into a certain category.

Novel PCL-based honeycomb scaffolds as drug delivery systems for rhBMP-2

This study investigated a novel drug delivery system (DDS), consisting of polycaprolactone (PCL) or polycaprolactone 20% tricalcium phosphate (PCL-TCP) biodegradable scaffolds, fibrin Tisseel sealant and recombinant bone morphogenetic protein-2 (rhBMP-2) for bone regeneration. PCL and PCL-TCP-fibrin composites displayed a loading efficiency of 70% and 43%, respectively. Fluorescence and scanning electron microscopy revealed sparse clumps of rhBMP-2 particles, non-uniformly distributed on the rods’ surface of PCL-fibrin composites. In contrast, individual rhBMP-2 particles were evident and uniformly distributed on the rods’ surface of the PCL-TCP-fibrin composites. PCL-fibrin composites loaded with 10 and 20 μg/ml rhBMP-2 demonstrated a triphasic release profile as quantified by an enzyme-linked immunosorbent assay (ELISA). This consisted of burst releases at 2 h, and days 7 and 16. A biphasic release profile was observed for PCL-TCP-fibrin composites loaded with 10 μg/ml rhBMP-2, consisting of burst releases at 2 h and day 14. PCL-TCP-fibrin composites loaded with 20 μg/ml rhBMP-2 showed a tri-phasic release profile, consisting of burst releases at 2 h, and days 10 and 21. We conclude that the addition of TCP caused a delay in rhBMP-2 release. Sodium dodecyl sulphate polyacrylamide gel electrophoresis (SDS-PAGE) and alkaline phosphatase assay verified the stability and bioactivity of eluted rhBMP-2 at all time points

A Survey of Viruses Affecting Dry Bean and Cowpea in Lebanon

A survey was conducted to identify viruses affecting dry bean (Phaseolus vulgaris) and cowpea (Vigna unguiculata) in Lebanon. Three hundred and thirty four samples exhibiting virus-like symptoms were collected from 13 different locations during the fall growing season of 1984. Samples were stored at 20 deg C until they were tested by the enzyme-linked immunosorbent assay (ELISA) for the presence of blackeye cowpea mosaic virus (B1CMV), bean yellow mosaic virus (BYMV), bean common mosaic virus (BCMV) and cucumber mosaic virus (CMV). In preliminary tests, the extraction buffer 0.1M phosphate + O.1MEDTA, pH 7.4 was found to be far better than the standard extraction buffer and, accordingly, was used for virus extraction for all field samples. Results obtained indicated that around 50% of the bean samples tested were infected with B1CMV. Incidence of BCMV, BYMV and CMV in the samples tested were 4,4 and 1.7%, respectively. B1CMV was detected in 10 locations, whereas, BYMV, BCMV and CMV were found in 1,4 and 4 locations, respectively. Mixed infections such as BCMV, BICMV, BCMV+CMV, BYMV+CMV and BICMV+BCMV+CMV were detected. In 35% of the samples assayed, the causal virus was not identified