A terrain risk assessment method for military surveillance applications for mobile assets

This study proposes an analytical and flexible terrain risk assessment method for military surveillance applications for mobile assets. Considering the risk as the degree of possibility of insurgent presence, the assessment method offers an efficient evaluation of risk in the surrounding terrain for military combat operating posts or observation posts. The method is designed for unmanned aerial vehicles as the surveillance assets of choice to improve the effectiveness of their use. Starting with the area map and geographical data, the target terrain is first digitized for space representation. Then the data of nine geographical parameters are used to formulate five contributing risk factors. These factors are incorporated in an analytical framework to generate a composite map with risk scores that reveal the potential high-risk spots in the terrain. The proposed method is also applied to a real-life case study of COP Kahler in Afghanistan, which was a target for insurgent attacks in 2008. The results confirm that when evaluated with the developed method, the region that the insurgents used to approach COP Kahler has high concentration of high-risk cells.     

ECISER: Efficient Clip-art Image SEgmentation by Re-rasterization

Clip-art image segmentation is widely used as an essential step to solve many vision problems such as colorization and vectorization. Many of these applications not only demand accurate segmentation results, but also have little tolerance for time cost, which leads to the main challenge of this kind of segmentation. However, most existing segmentation techniques are found not sufficient for this purpose due to either their high computation cost or low accuracy. To address such issues, we propose a novel segmentation approach, ECISER, which is well-suited in this context. The basic idea of ECISER is to take advantage of the particular nature of cartoon images and connect image segmentation with aliased rasterization. Based on such relationship, a clip-art image can be quickly segmented into regions by re-rasterization of the original image and several other computationally efficient techniques developed in this paper. Experimental results show that our method achieves dramatic computational speedups over the current state-of-the-art approaches, while preserving almost the same quality of results.     

Stereo matching cost computation based on nonsubsampled contourlet transform

A new matching cost computation method based on nonsubsampled contourlet transform (NSCT) for stereo image matching is proposed in this paper. Firstly, stereo image is decomposed into high frequency sub-band images at different scales and along different directions by NSCT. Secondly, by utilizing coefficients in high frequency domain and grayscales in RGB color space, the computation model of weighted matching cost between two pixels is designed based on the gestalt laws. Lastly, two types of experiments are carried out with standard stereopairs in the Middlebury benchmark. One of the experiments is to confirm optimum values of NSCT scale and direction parameters, and the other is to compare proposed matching cost with nine known matching costs. Experimental results show that the optimum values of scale and direction parameters are respectively 2 and 3, and the matching accuracy of the proposed matching cost is twice higher than that of traditional NCC cost.     

Food recognition using neural network classifier and multiple hypotheses image segmentation

ABSTRACT

This paper proposes the multiple-hypotheses image segmentation and feed-forward neural network classifier for food recognition to improve the performance. Initially, the food or meal image is given as input. Then, the segmentation is applied to identify the regions, where a particular food item is located using salient region detection, multi-scale segmentation, and fast rejection. Then, the features of every food item are extracted by the global feature and local feature extraction. After the features are obtained, the classification is performed for each segmented region using a feed-forward neural network model. Finally, the calorie value is computed with the aid of (i) food volume and (ii) calorie and nutrition measure based on mass value. The experimental results and performance evaluation are validated. The outcome of the proposed method attains 0.947 for Macro Average Accuracy (MAA) and 0.959 for Standard Accuracy (SA), which provides better classification performance.     

利用AutoCAD编制电气CAD

介绍如何利用AutoCAD开发适合电气专业使用的CAD系统，通过编制电气CAD的功能菜单，构造电气元件库，增强CAD的专业性能。编制电气CAD可以有效地统一本单位电气制图标准，方便电气工程师使用CAD进行专业设计。     

基于主体外部轮廓的照片分割算法

在实际应用中常常需要将人像从照片的背景中有效地分割出来，通常的做法是通过提取照片中人像各部分特征来实现分割，其缺陷是计算复杂度较大，分割效果受各种干扰因素影响很大。现提出了一种基于主体外部轮廓信息的照片分割算法，通过梯度锐化、边缘保护、临近像素点相似度比较来确定图像的边界，该算法对于具有相对均匀背景的照片具有较高的计算效率。     

利用信息融合方法的三维特征提取

本文提出了一种基于信息融合的物体三维特征的提取方法，该方法利用两幅互相配准的三维测距图像和灰度图像，来提取多面体的三维特征。首先，通过分析灰度图像中的灰度变化及测距图像中的测距值变化，分别求取各自图像中物体的特征点及特征边；然后，利用两配准图像之间的对应关系，求得所有特征点、面与多边形在三维测距图像中的三维表示；接着，通过分析三维测距图像中所测得的各候选平面上特定点与边处的曲率及法向，验证候选平面     

Management of multidimensional discrete data

Spatial database management involves two main categories of data: vector and raster data. The former has received a lot of in-depth investigation; the latter still lacks a sound framework. Current DBMSs either regard raster data as pure byte sequences where the DBMS has no knowledge about the underlying semantics, or they do not complement array structures with storage mechanisms suitable for huge arrays, or they are designed as specialized systems with sophisticated imaging functionality, but no general database capabilities (e.g., a query language). Many types of array data will require database support in the future, notably 2-D images, audio data and general signal-time series (1-D), animations (3-D), static or time-variant voxel fields (3-D and 4-D), and the ISO/IEC PIKS (Programmer's Imaging Kernel System) BasicImage type (5-D). In this article, we propose a comprehensive support ofmultidimensional discrete data (MDD) in databases, including operations on arrays of arbitrary size over arbitrary data types. A set of requirements is developed, a small set of language constructs is proposed (based on a formal algebraic semantics), and a novel MDD architecture is outlined to provide the basis for efficient MDD query evaluation.     

A semantic modeling approach for image retrieval by content

We introduce a semantic data model to capture the hierarchical, spatial, temporal, and evolutionary semantics of images in pictorial databases. This model mimics the user's conceptual view of the image content, providing the framework and guidelines for preprocessing to extract image features. Based on the model constructs, a spatial evolutionary query language (SEQL), which provides direct image object manipulation capabilities, is presented. With semantic information captured in the model, spatial evolutionary queries are answered efficiently. Using an object-oriented platform, a prototype medical-image management system was implemented at UCLA to demonstrate the feasibility of the proposed approach.     

Image processing using cellular neural networks based on multi-valued and universal binary neurons

Multi-valued and universal binary neurons (MVN and UBN) are the neural processing elements with the complex-valued weights and high functionality. It is possible to implement an arbitrary mapping described by partially defined multiple-valued function on the single MVN. An arbitrary mapping described by partially defined or fully defined Boolean function, which can be non-threshold, may be implemented on the single UBN. The quickly converging learning algorithms exist for both types of neurons. Such features of the MVN and UBN may be used for solving the different problems. One of the most successful applications of the MVN and UBN is their usage as basic neurons in the Cellular Neural Networks (CNN). It opens the new effective opportunities in nonlinear image filtering and its applications to noise reduction, edge detection and solving of the super resolution problem. A number of experimental results are presented to illustrate the performance of the proposed algorithms.An erratum to this article can be found at