A Smart Mathematic Morphology Method for Recognition and Understanding of Airfield

A method used for recognition and understanding of airfield based on mathematical morphology is proposed in this paper. The new approach can he divided into three steps. First, to extract the typical geometric structure features of airfield, a segmentation method called recursive Otsu algorithm is employed on an airfield image. Second, thinning and shrinking algorithms are utilized to obtain the contour of airfield with single pixel and to remove diffused small particles. Finally, Radon transform is adopted to extract two typical and important components, primary and secondary runways of airfield exactly. At the same time, region growing algorithm is exploited to get the other components such as parking apron and garages. The experimental results demonstrate that the proposed method gives good performance.

A fast and effective fuzzy clustering algorithm for color image segmentation

A fast and effective fuzzy clustering algorithm is proposed. The algorithm splits an image into n × n blocks, and uses block variance to judge whether the block region is homogeneous. Mean and center pixel of each homogeneous block are extracted for feature. Each inhomogeneous block is split into separate pixels and the mean of neighboring pixels within a window around each pixel and pixel value are extracted for feature. Then cluster of homogeneous blocks and cluster of separate pixels from inhomogeneous blocks are carried out respectively according to different membership functions. In fuzzy clustering stage, the center pixel and center number of the initial clustering are calculated based on histogram by using mean feature. Then different membership functions according to comparative result of block variance are computed. Finally, modified fuzzy c-means with spatial information to complete image segmentation axe used. Experimental results show that the proposed method can achieve better segmental results and has shorter executive time than many well-known methods.

A REVIEW ON ARTERY WALL SEGMENTATION TECHNIQUES AND INTIMA-MEDIA THICKNESS MEASUREMENT FOR CAROTID ULTRASOUND IMAGES

Stroke and heart attack,which could be led by a kind of cerebrovascular and cardiovascular disease named as atherosclerosis,would seriously cause human morbidity and mortality.It is important for the early stage diagnosis and monitoring medical intervention of the atherosclerosis.Carotid stenosis is a classical atherosclerotic lesion with vessel wall narrowing down and accumulating plaques burden.The carotid artery of intima-media thickness(IMT)is a key indicator to the disease.With the development of computer assisted diagnosis technology,the imaging techniques,segmentation algorithms,measurement methods,and evaluation tools have made considerable progress.Ultrasound imaging,being real-time,economic,reliable,and safe,now seems to become a standard in vascular assessment methodology especially for the measurement of IMT.This review firstly attempts to discuss the clinical relevance of measurements in clinical practice at first,and then followed by the challenges that one has to face when approaching the segmentation of ultrasound images.Secondly,the commonly used methods for the IMT segmentation and measurement are presented.Thirdly,discussion and evaluation of different segmentation techniques are performed.An overview of summary and future perspectives is given finally.

Draft Consensus Building in Hall for Workshop of Meta-Synthetic Engineering

This paper discusses that there are two sorts of group consensus in Hall for Workshop of Meta-synthetic Engineering： draft consensus and decisive consensus, which are respectively formed in the two synchronous stages in the process of ＂synchronous stages 1- asynchronous stages- synchronous stages 2＂, and focuses on the concept of draft consensus. Then proposes a draft consensus building model and its solution method called Consensus Building Graph, by which claim concern value, claim support value, claim authority value and claim consensus value can be calculated real time for reaching a consensus, and designs a computer aided consensus building system called Internet based Group Discussion Environment. The model follows the methodology of meta-synthesis from qualitative to quantitative analysis in which computers and humans are combined to solve complex problems.

Autonomous optical navigation for interplanetary exploration based on information of earth-moon

The image elements of earth-center and moon-center are obtained by processing the images of earthand moon, these image elements in combination with the inertial attitude information and the moon ephemerisare utilized to obtain the probe initial position relative to earth, and the Levenberg-Marquardt algorithm is usedto determine the accurate probe position relative to earth, and the probe orbit relative to earth is estimated by u-sing the extended Kalman filter. The autonomous optical navigation algorithm is validated using the digital simu-lation.

3D multipath planning for UAV based on network graph

According to the characteristic and the requirement of multipath planning, a new multipath planning method is proposed based on network. This method includes two steps： the construction of network and multipath searching. The construction of network proceeds in three phases： the skeleton extraction of the configuration space, the judgment of the cross points in the skeleton and how to link the cross points to form a network. Multipath searching makes use of the network and iterative penalty method （IPM） to plan multi-paths, and adjusts the planar paths to satisfy the requirement of maneuverability of unmanned aerial vehicle （UAV）. In addition, a new height planning method is proposed to deal with the height planning of 3D route. The proposed algorithm can find multiple paths automatically according to distribution of terrain and threat areas with high efficiency. The height planning can make 3D route following the terrain. The simulation experiment illustrates the feasibility of the proposed method.

Image matching navigation based on fuzzy information

In conventional image matching methods, the image matching process is mostly based on image statistic information. One aspect neglected by all these methods is that there is much fuzzy information contained in these images. A new fuzzy matching algorithm based on fuzzy similarity for navigation is presented in this paper. Because the fuzzy theory is of the ability of making good description of the fuzzy information contained in images, the image matching method based on fuzzy similarity would look forward to producing good performance results. Experimental results using matching algorithm based on fuzzy information also demonstrate its reliability and practicability.

Remote sensing image compression for deep space based on region of interest

A major limitation for deep space communication is the limited bandwidths available. The downlinkrate using X-band with an L2 halo orbit is estimated to be of only 5.35 GB/d. However, the Next GenerationSpace Telescope (NGST) will produce about 600 GB/d. Clearly the volume of data to downlink must be re-duced by at least a factor of 100. One of the resolutions is to encode the data using very low bit rate image com-pression techniques. An very low bit rate image compression method based on region of interest(ROI) has beenproposed for deep space image. The conventional image compression algorithms which encode the original datawithout any data analysis can maintain very good details and haven' t high compression rate while the modernimage compressions with semantic organization can have high compression rate even to be hundred and can' tmaintain too much details. The algorithms based on region of interest inheriting from the two previews algorithmshave good semantic features and high fidelity, and is therefore suitable for applications at a low bit rate. Theproposed method extracts the region of interest by texture analysis after wavelet transform and gains optimal localquality with bit rate control. The Result shows that our method can maintain more details in ROI than generalimage compression algorithm(SPIHT) under the condition of sacrificing the quality of other uninterested areas.

基于目标区域特性的海面小目标检测快速算法

A fast object detection method based on object region dissimilarity and 1-D AGADM(one dimensional average gray absolute difference maximum) between object and background isproposed for real-time defection of small offshore targets. Then computational complexity, antinoiseperformance, the signal-to-noise ratio (SNR) gain between original images and their results as afunction of SNR of original images and receiver operating characteristic (ROC) curve are analyzed andcompared with those existing methods of small target detection such as two dimensional average grayabsolute difference maximum (2-D AGADM), median contrast filter algorithm and multi-level filteralgorithm. Experimental results and theoretical analysis have shown that the proposed method hasfaster speed and more adaptability to small object shape and also yields improved SNR performance.

Image Denoising Using Local Adaptive Least Squares Support Vector Regression

Rather than attempting to separate signal from noise in the spatial domain, it is often advantageous to work in a transform domain. Building on previous work, a novel denoising method based on local adaptive least squares support vector regression is proposed. Investigation on real images contaminated by Gaussian noise has demonstrated that the proposed method can achieve an acceptable trade off between the noise removal and smoothing of the edges and details.

Sensor fault-tolerant observer applied in satellite attitude control

The observing failure and feedback instability might happen when the partial sensors of a satellite attitude control sys- tem （SACS） go wrong. A fault diagnosis and isolation （FDI） method based on a fault observer is introduced to detect and isolate the fault sensor at first. Based on the FDI result, the object system state-space equation is transformed and divided into a correspon- sive triangular canonical form to decouple the normal subsystem from the fault subsystem. And then the KX fault-tolerant observers of the system in different modes are designed and embedded into online monitoring. The outputs of all KX fault-tolerant observers are selected by the control switch process. That can make sense that the SACS is part-observed and in stable when the partial sen- sors break down. Simulation results demonstrate the effectiveness and superiority of the proposed method.

Feature Selection Based on Adaptive Fuzzy Membership Functions

Neuro-fuzzy(NF)networks are adaptive fuzzy inference systems(FIS)and have been applied to feature selection by some researchers.However,their rule number will grow exponentially as the data dimension increases.On the other hand,feature selection algorithms with artificial neural networks(ANN)usually require normalization of input data,which will probably change some characteristics of original data that are important for classification.To overcome the problems mentioned above,this paper combines the fuzzification layer of the neuro-fuzzy system with the multi-layer perceptron(MLP)to form a new artificial neural network.Furthermore,fuzzification strategy and feature measurement based on membership space are proposed for feature selection. Finally,experiments with both natural and artificial data are carried out to compare with other methods,and the results approve the validity of the algorithm.

Network Traffic Anomaly Detection Method Based on a Feature of Catastrophe Theory

For the existing problems of current network traffic anomaly detection, the behavior of the network traffic anomaly will show nonlinearity, non-stationarity and complexity according to the network traffic often driven by the control of multiple factors. Owing to the characteristic that the internal evolution equation will lead to dynamical structure catastrophe, the phase space reconstruction method and the statistical physics method can be used to compute the macro feature values of the network traffic. By choosing some of the feature values which can obviously retlect the unusual change in the network traffic volume as control variables, a network traffic anomaly detection method based on the catastrophe series theory model is developed. Many experimental results show that the proposed network traffic anomaly detection method has a low false alarm rate under the same condition of detection rate.

Education Knowledge System Combination Model Based on the Components

Resources are the base and core of education information, but current web education resources have no structure and it is still difficult to reuse them and make them can be self assembled and developed continually. According to the knowledge structure of course and text, the relation among knowledge points, knowledge units from three levels of media material, we can build education resource components, and build TKCM （Teaching Knowledge Combination Model） based on resource components. Builders can build and assemble knowledge system structure and make knowledge units can be self assembled, thus we can develop and consummate them continually. Users can make knowledge units can be self assembled and renewed, and build education knowledge system to satisfy users＇ demand under the form of education knowledge system.

Indirect building localization based on a prominent solid landmark from a forward-looking infrared imagery

A novel indirect building localization technique based on a prominent solid landmark from a forward- looking infrared imagery is proposed to localize low, deeply buried, or carefully camouflaged buildings in dense urban areas. First, the widely used effective methods are applied to detect and localize the solid landmark. The building target is then precisely indirectly localized by perspective transformation according to the imaging parameters and the space constraint relations between the building target and the solid landmark. Experimental results demonstrate this technique can indirectly localize buildings in dense urban areas effectively.

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.

Combining clustering and classification for remote-sensing images using unlabeled data

A joint clustering and classification approach is proposed. This approach exploits unlabeled data for efficient clustering, which is applied in the classification with support vector machine （SVM） in the case of small-size training samples. The proposed method requires no prior information on data labels, and yields better cluster structures, Through cluster assumption and the notions of support vectors, the most confident k cluster centers and data points near the cluster boundaries are labeled and used to train a reliable SVM classifier. Our method gains better estimation of data distributions and mitigates the unrepresentative problem of small-size training samples. The data set collected from Landsat Thematic Mapper （Landsat TM-5） validates the effectiveness of the proposed approach.