Semantic Discriminant mapping for classification and browsing of remote sensing textures and objects

We present a new approach based on Discriminant Analysis to map a high dimensional image feature space onto a subspace which has the following advantages: 1. each dimension corresponds to a semantic likelihood, 2. an efficient and simple multiclass classifier is proposed and 3. it is low dimensional. This mapping is learnt from a given set of labeled images with a class groundtruth. In the new space a classifier is naturally derived which performs as well as a linear SVM. We will show that projecting images in this new space provides a database browsing tool which is meaningful to the user. Results are presented on a remote sensing database with eight classes, made available online. The output semantic space is a low dimensional feature space which opens perspectives for other recognition tasks. © 2005 IEEE.

The role of human orbitofrontal cortex in value comparison for incommensurable objects.

The human orbitofrontal cortex is strongly implicated in appetitive valuation. Whether its role extends to support comparative valuation necessary to explain probabilistic choice patterns for incommensurable goods is unknown. Using a binary choice paradigm, we derived the subjective values of different bundles of goods, under conditions of both gain and loss. We demonstrate that orbitofrontal activation reflects the difference in subjective value between available options, an effect evident across valuation for both gains and losses. In contrast, activation in dorsal striatum and supplementary motor areas reflects subjects' choice probabilities. These findings indicate that orbitofrontal cortex plays a pivotal role in valuation for incommensurable goods, a critical component process in human decision making.

A shortest path algorithm for moving objects in spatial network databases

One of the most important kinds of queries in Spatial Network Databases (SNDB) to support location-based services (LBS) is the shortest path query. Given an object in a network, e.g. a location of a car on a road network, and a set of objects of interests, e.g. hotels,gas station, and car, the shortest path query returns the shortest path from the query object to interested objects. The studies of shortest path query have two kinds of ways, online processing and preprocessing. The studies of preprocessing suppose that the interest objects are static. This paper proposes a shortest path algorithm with a set of index structures to support the situation of moving objects. This algorithm can transform a dynamic problem to a static problem. In this paper we focus on road networks. However, our algorithms do not use any domain specific information, and therefore can be applied to any network. This algorithm’s complexity is O(klog2 i), and traditional Dijkstra’s complexity is O((i + k)2).

a shortest path algorithm for moving objects in spatial network databases

中国计算机学会

Topological objects in the O(3) nonlinear sigma model

We study the topological defects in the nonlinear O(3) sigma model in terms of the decomposition of U(1) gauge potential. Time-dependent baby skyrmions are discussed in the (2 + 1)-dimensional spacetime with the CP1 field. Furthermore, we show that there are three kinds of topological defects-vortex lines, point defects and knot exist in the (3 + 1)-dimensional model, and their topological charges, locations and motions are determined by the phi-mapping topological current theory.

Topological objects in two-gap superconductor

We discuss the non-Abelian topological objects, in particular the non-Abrikosov vortex and the magnetic knot made of the twisted non-Abrikosov vortex, in two-gap superconductor. We show that there are two types of non-Abrikosov vortex in Ginzburg-Landau theory of two-gap superconductor, the D-type which has no concentration of the condensate at the core and the N-type which has a non-trivial profile of the condensate at the core, under a wide class of realistic interaction potential. We prove that these non-Abrikosov vortices can have either integral or fractional magnetic flux, depending on the interaction potential. We show that they are described by the non-Abelian topology pi(2)(S-2) and pi(1)(S-1), in addition to the well-known Abelian topology pi(1)(S-1). Furthermore, we discuss the possibility to construct a stable magnetic knot in two-gap superconductor by twisting the non-Abrikosov vortex and connecting two periodic ends together, whose knot topology pi(3)(S-2) is described by the Chern-Simon index of the electromagnetic potential. We argue that similar topological objects may exist in multi-gap or multi-layer superconductors and multi-component Bose-Einstein condensates and superfluids, and discuss how these topological objects can be constructed in MgB2, Sr2RuO4, He-3, and liquid metallic hydrogen.

adaptive location update mechanism for network-constrained moving objects in changeful traffic conditions

Natl Chiao Tung Univ, Dept Comp Sci

Computer Perception of Three-Dimensional Objects

We first pose the following problem: to develop a program which takes line-drawings as input and constructs three-dimensional objects as output, such that the output objects are the same as the ones we see when we look at the input line-drawing. We then introduce the principle of minimum standard-deviation of angles (MSDA) and discuss a program based on MSDA. We present the results of testing this program with a variety of line- drawings and show that the program constitutes a solution to the stated problem over the range of line-drawings tested. Finally, we relate this work to its historical antecedents in the psychological and computer-vision literature.

Stimulus Familiarity Determines Recognition Strategy for Novel 3-D Objects

We describe a psychophysical investigation of the effects of object complexity and familiarity on the variation of recognition time and recognition accuracy over different views of novel 3D objects. Our findings indicate that with practice the response times for different views become more uniform and the initially orderly dependency of the response time on the distance to a "good" view disappears. One possible interpretation of our results is in terms of a tradeoff between memory needed for storing specific-view representations of objects and time spent in recognizing the objects.