Underwater topography detection of Shuangzi Reefs with SAR images acquired in different time

Imaging mechanism of underwater topography by SAR and a underwater topography SAR detection model built on the theory of underwater topography detection with SAR image presented by Yuan Yeli are used to detect the underwater topography of Shuangzi Reefs in the Nansha Islands with three scenes of SAR images acquired in different time. Detection results of three SAR images are compared with the chart topography and the detection errors are analyzed. Underwater topography detection experiments of Shuangzi Reefs show that the detection model is practicable. The detection results indicate that SAR images acquired in different time also can be used to detect the underwater topography, and the detection results are affected by the ocean conditions in the SAR acquiring time.

A new method for the estimation of oceanic mixed-layer depth using shipboard X-band radar images

Shipboard X-band radar images acquired on 24 June 2009 are used to study nonlinear internal wave characteristics in the northeastern South China Sea. The studied images show three nonlinear internal waves in a packet. A method based on the Radon Transform technique is introduced to calculate internal wave parameters such as the direction of propagation and internal wave velocity from backscatter images. Assuming that the ocean is a two-layer finite depth system, we can derive the mixed-layer depth by applying the internal wave velocity to the mixed-layer depth formula. Results show reasonably good agreement with in-situ thermistor chain and conductivity-temperature-depth data sets.

Wind-vector estimation for RADARSAT-1 SAR images: Validation of wind-direction estimates based upon geometry diversity

In this letter, a new wind-vector algorithm is presented that uses radar backscatter sigma(0) measurements at two adjacent subscenes of RADARSAT-1 synthetic aperture radar (SAR) images, with each subscene having slightly different geometry. Resultant wind vectors are validated using in situ buoy measurements and compared with wind vectors determined from a hybrid wind-retrieval model using wind directions determined by spectral analysis of wind-induced image streaks and observed by colocated QuikSCAT measurements. The hybrid wind-retrieval model consists of CMOD-IFR2 [applicable to C-band vertical-vertical (W) polarization] and a C-band copolarization ratio according to Kirchhoff scattering. The new algorithm displays improved skill in wind-vector estimation for RADARSAT-1 SAR data when compared to conventional wind-retrieval methodology. In addition, unlike conventional methods, the present method is applicable to RADARSAT-1 images both with and without visible streaks. However, this method requires ancillary data such as buoy measurements to resolve the ambiguity in retrieved wind direction.

Modeling gross primary production of alpine ecosystems in the Tibetan Plateau using MODIS images and climate data

The eddy covariance technique provides measurements of net ecosystem exchange (NEE) Of CO2 between the atmosphere and terrestrial ecosystems, which is widely used to estimate ecosystem respiration and gross primary production (GPP) at a number Of CO2 eddy flux tower sites. In this paper, canopy-level maximum light use efficiency, a key parameter in the satellite-based Vegetation Photosynthesis Model (VPM), was estimated by using the observed CO2 flux data and photosynthetically active radiation (PAR) data from eddy flux tower sites in an alpine swamp ecosystem, an alpine shrub ecosystem and an alpine meadow ecosystem in Qinghai-Tibetan Plateau, China. The VPM model uses two improved vegetation indices (Enhanced Vegetation Index (EVI), Land Surface Water Index (LSWI)) derived from the Moderate Resolution Imaging Spectral radiometer (MODIS) data and climate data at the flux tower sites, and estimated the seasonal dynamics of GPP of the three alpine grassland ecosystems in Qinghai-Tibetan Plateau. The seasonal dynamics of GPP predicted by the VPM model agreed well with estimated GPP from eddy flux towers. These results demonstrated the potential of the satellite-driven VPM model for scaling-up GPP of alpine grassland ecosystems, a key component for the study of the carbon cycle at regional and global scales. (c) 2006 Elsevier Inc. All rights reserved.

用改进的ART-2网络建立移动机器人环境模型的研究

本文应用自适应共振理论中ART-2神经网络进行移动机器人环境障碍模式识别。ART-2神经网络在处理单方向渐变的模式输入时具有模式漂移的特点，机器人在静态环境中运动依赖这种特点，但在动态环境中模式漂移的特点却会对机器人的安全造成威胁。为此，设计了一种改进的ART-2神经网络，使得移动机器人同时适应在静态和动态环境中安全运动。

Distance Metric Between 3D Models and 3D Images for Recognition and Classification

Similarity measurements between 3D objects and 2D images are useful for the tasks of object recognition and classification. We distinguish between two types of similarity metrics: metrics computed in image-space (image metrics) and metrics computed in transformation-space (transformation metrics). Existing methods typically use image and the nearest view of the object. Example for such a measure is the Euclidean distance between feature points in the image and corresponding points in the nearest view. (Computing this measure is equivalent to solving the exterior orientation calibration problem.) In this paper we introduce a different type of metrics: transformation metrics. These metrics penalize for the deformatoins applied to the object to produce the observed image. We present a transformation metric that optimally penalizes for "affine deformations" under weak-perspective. A closed-form solution, together with the nearest view according to this metric, are derived. The metric is shown to be equivalent to the Euclidean image metric, in the sense that they bound each other from both above and below. For Euclidean image metric we offier a sub-optimal closed-form solution and an iterative scheme to compute the exact solution.

Vectorizing Face Images by Interpreting Shape and Texture Computations

The correspondence problem in computer vision is basically a matching task between two or more sets of features. In this paper, we introduce a vectorized image representation, which is a feature-based representation where correspondence has been established with respect to a reference image. This representation has two components: (1) shape, or (x, y) feature locations, and (2) texture, defined as the image grey levels mapped onto the standard reference image. This paper explores an automatic technique for "vectorizing" face images. Our face vectorizer alternates back and forth between computation steps for shape and texture, and a key idea is to structure the two computations so that each one uses the output of the other. A hierarchical coarse-to-fine implementation is discussed, and applications are presented to the problems of facial feature detection and registration of two arbitrary faces.

Extracting Salient Curves from Images: An Analysis of the Saliency Network

The Saliency Network proposed by Shashua and Ullman is a well-known approach to the problem of extracting salient curves from images while performing gap completion. This paper analyzes the Saliency Network. The Saliency Network is attractive for several reasons. First, the network generally prefers long and smooth curves over short or wiggly ones. While computing saliencies, the network also fills in gaps with smooth completions and tolerates noise. Finally, the network is locally connected, and its size is proportional to the size of the image. Nevertheless, our analysis reveals certain weaknesses with the method. In particular, we show cases in which the most salient element does not lie on the perceptually most salient curve. Furthermore, in some cases the saliency measure changes its preferences when curves are scaled uniformly. Also, we show that for certain fragmented curves the measure prefers large gaps over a few small gaps of the same total size. In addition, we analyze the time complexity required by the method. We show that the number of steps required for convergence in serial implementations is quadratic in the size of the network, and in parallel implementations is linear in the size of the network. We discuss problems due to coarse sampling of the range of possible orientations. We show that with proper sampling the complexity of the network becomes cubic in the size of the network. Finally, we consider the possibility of using the Saliency Network for grouping. We show that the Saliency Network recovers the most salient curve efficiently, but it has problems with identifying any salient curve other than the most salient one.

Recovery of Three-Dimensional Objects from Single Perspective Images

Any three-dimensional wire-frame object constructed out of parallelograms can be recovered from a single perspective two-dimensional image. A procedure for performing the recovery is given.

Separating Reflections from Images Using Independent Components Analysis

The image of an object can vary dramatically depending on lighting, specularities/reflections and shadows. It is often advantageous to separate these incidental variations from the intrinsic aspects of an image. Along these lines this paper describes a method for photographing objects behind glass and digitally removing the reflections off the glass leaving the image of the objects behind the glass intact. We describe the details of this method which employs simple optical techniques and independent components analysis (ICA) and show its efficacy with several examples.

Recovering Intrinsic Images from a Single Image

We present an algorithm that uses multiple cues to recover shading and reflectance intrinsic images from a single image. Using both color information and a classifier trained to recognize gray-scale patterns, each image derivative is classified as being caused by shading or a change in the surface's reflectance. Generalized Belief Propagation is then used to propagate information from areas where the correct classification is clear to areas where it is ambiguous. We also show results on real images.

Automatically Recovering Geometry and Texture from Large Sets of Calibrated Images

Three-dimensional models which contain both geometry and texture have numerous applications such as urban planning, physical simulation, and virtual environments. A major focus of computer vision (and recently graphics) research is the automatic recovery of three-dimensional models from two-dimensional images. After many years of research this goal is yet to be achieved. Most practical modeling systems require substantial human input and unlike automatic systems are not scalable. This thesis presents a novel method for automatically recovering dense surface patches using large sets (1000's) of calibrated images taken from arbitrary positions within the scene. Physical instruments, such as Global Positioning System (GPS), inertial sensors, and inclinometers, are used to estimate the position and orientation of each image. Essentially, the problem is to find corresponding points in each of the images. Once a correspondence has been established, calculating its three-dimensional position is simply a matter of geometry. Long baseline images improve the accuracy. Short baseline images and the large number of images greatly simplifies the correspondence problem. The initial stage of the algorithm is completely local and scales linearly with the number of images. Subsequent stages are global in nature, exploit geometric constraints, and scale quadratically with the complexity of the underlying scene. We describe techniques for: 1) detecting and localizing surface patches; 2) refining camera calibration estimates and rejecting false positive surfels; and 3) grouping surface patches into surfaces and growing the surface along a two-dimensional manifold. We also discuss a method for producing high quality, textured three-dimensional models from these surfaces. Some of the most important characteristics of this approach are that it: 1) uses and refines noisy calibration estimates; 2) compensates for large variations in illumination; 3) tolerates significant soft occlusion (e.g. tree branches); and 4) associates, at a fundamental level, an estimated normal (i.e. no frontal-planar assumption) and texture with each surface patch.

Recognizing 3-D Objects Using 2-D Images

We discuss a strategy for visual recognition by forming groups of salient image features, and then using these groups to index into a data base to find all of the matching groups of model features. We discuss the most space efficient possible method of representing 3-D models for indexing from 2-D data, and show how to account for sensing error when indexing. We also present a convex grouping method that is robust and efficient, both theoretically and in practice. Finally, we combine these modules into a complete recognition system, and test its performance on many real images.

Finding Edges and Lines in Images

The problem of detecting intensity changes in images is canonical in vision. Edge detection operators are typically designed to optimally estimate first or second derivative over some (usually small) support. Other criteria such as output signal to noise ratio or bandwidth have also been argued for. This thesis is an attempt to formulate a set of edge detection criteria that capture as directly as possible the desirable properties of an edge operator. Variational techniques are used to find a solution over the space of all linear shift invariant operators. The first criterion is that the detector have low probability of error i.e. failing to mark edges or falsely marking non-edges. The second is that the marked points should be as close as possible to the centre of the true edge. The third criterion is that there should be low probability of more than one response to a single edge. The technique is used to find optimal operators for step edges and for extended impulse profiles (ridges or valleys in two dimensions). The extension of the one dimensional operators to two dimentions is then discussed. The result is a set of operators of varying width, length and orientation. The problem of combining these outputs into a single description is discussed, and a set of heuristics for the integration are given.