A parametric method of retrieving ocean wave spectra from synthetic aperture radar images

A parametric method that extracts the ocean wave directional spectra from synthetic aperture radar (SAR) image is presented. The 180 degrees ambiguity of SAR image and the loss of information beyond the azimuthal cutoff can be overcome with this method. The ocean wave spectra can be obtained from SAR image directly by using iteration inversion mapping method with forward nonlinear mapping. Some numerical experiments have been made by using ERS-1 satellite SAR imagette data. The ocean wave direction retrieved from SAR imagette data is in agreement with the wind direction from the scatterometer data.

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.

Supermedia User Interface for Scanning Probe Microscopy

当利用扫描隧道显微镜(SPM)作为一种纳米操作工具时,由于其缺乏实时的传感器信息反馈,而大大阻碍了它的广泛应用.利用超媒体人机交互接口可以解决这个问题.在纳米操作过程中,超媒体接口不但可以为操作者提供可实时更新的仿真操作场景,还可以通过力反馈手柄让操作者实时地感受到探针受到的三维纳米操作力.除此之外,操作者还可以通过该手柄直接控制探针的三维运动.最后在聚碳酸酯上进行了超媒体人机接口的纳米刻画实验.实验结果验证了该系统的有效性和效率.

The Behavior Language; User's Guide

The Behavior Language is a rule-based real-time parallel robot programming language originally based on ideas from [Brooks 86], [Connell 89], and [Maes 89]. It compiles into a modified and extended version of the subsumption architecture [Brooks 86] and thus has backends for a number of processors including the Motorola 68000 and 68HCll, the Hitachi 6301, and Common Lisp. Behaviors are groups of rules which are activatable by a number of different schemes. There are no shared data structures across behaviors, but instead all communication is by explicit message passing. All rules are assumed to run in parallel and asynchronously. It includes the earlier notions of inhibition and suppression, along with a number of mechanisms for spreading of activation.

Multiple-User Quantum Optical Communication

A fundamental understanding of the information carrying capacity of optical channels requires the signal and physical channel to be modeled quantum mechanically. This thesis considers the problems of distributing multi-party quantum entanglement to distant users in a quantum communication system and determining the ability of quantum optical channels to reliably transmit information. A recent proposal for a quantum communication architecture that realizes long-distance, high-fidelity qubit teleportation is reviewed. Previous work on this communication architecture is extended in two primary ways. First, models are developed for assessing the effects of amplitude, phase, and frequency errors in the entanglement source of polarization-entangled photons, as well as fiber loss and imperfect polarization restoration, on the throughput and fidelity of the system. Second, an error model is derived for an extension of this communication architecture that allows for the production and storage of three-party entangled Greenberger-Horne-Zeilinger states. A performance analysis of the quantum communication architecture in qubit teleportation and quantum secret sharing communication protocols is presented. Recent work on determining the channel capacity of optical channels is extended in several ways. Classical capacity is derived for a class of Gaussian Bosonic channels representing the quantum version of classical colored Gaussian-noise channels. The proof is strongly mo- tivated by the standard technique of whitening Gaussian noise used in classical information theory. Minimum output entropy problems related to these channel capacity derivations are also studied. These single-user Bosonic capacity results are extended to a multi-user scenario by deriving capacity regions for single-mode and wideband coherent-state multiple access channels. An even larger capacity region is obtained when the transmitters use non- classical Gaussian states, and an outer bound on the ultimate capacity region is presented

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.