Threatened fishes of the world: Pseudobagrus medianalis (Regan) 1904 (Bagridae)

Conservation status, identification, distribution, abundance, habitat and ecology, threats, conservation actions and recommendations of a endemic bagrid catfish, Dianchi bullhead, Pseudobagrus medianalis were introduced based on data and knowledge from a

Morphometrics, length-weight relationship and condition of Rastrineobola argentea (Pellegrin 1904) in the Winam Gulf of Lake Victoria (Kenya)

Correlation between total length (TL), fork length (FL) and standard length (SL) of Raslrineobola argentea (pellegrin 1904) in the Winam Gulf of Lake Victoria indicate that FL = 0.92 TL - 0.74 and SL = 0.90 TL - 1.74. Length-weight relationship of log-transformed data shows that the slopes of the regression lines were 3.06 to 3.22 for juveniles, 2.70 to 3.05 for males and 3.24 to 3.71 for females. The slopes were significantly different between groups at at a =0.05. The Fulton's condition factor (K) was highest in December (1.019-1.073) and March/April (1.015-1.030) but lowest in June (1:00-1.025) for all stations. Significant differences between groups demands for the use of different growth models for juveniles, males and females especially for the von Bertalanffy growth equation which uses length-weight relationship. Observed cyclic viations in condition factor suggests two peak breeding seasons for this species in the Winam Gulf. The practical lmplications of these results in stock assessment using length-based fish stock assessment methods is briefly discussed.

Synchronization of user-generated videos through trajectory correspondence and a refinement procedure

Temporal synchronization of multiple video recordings of the same dynamic event is a critical task in many computer vision applications e.g. novel view synthesis and 3D reconstruction. Typically this information is implied through the time-stamp information embedded in the video streams. User-generated videos shot using consumer grade equipment do not contain this information; hence, there is a need to temporally synchronize signals using the visual information itself. Previous work in this area has either assumed good quality data with relatively simple dynamic content or the availability of precise camera geometry. Our first contribution is a synchronization technique which tries to establish correspondence between feature trajectories across views in a novel way, and specifically targets the kind of complex content found in consumer generated sports recordings, without assuming precise knowledge of fundamental matrices or homographies. We evaluate performance using a number of real video recordings and show that our method is able to synchronize to within 1 sec, which is significantly better than previous approaches. Our second contribution is a robust and unsupervised view-invariant activity recognition descriptor that exploits recurrence plot theory on spatial tiles. The descriptor is individually shown to better characterize the activities from different views under occlusions than state-of-the-art approaches. We combine this descriptor with our proposed synchronization method and show that it can further refine the synchronization index. © 2013 ACM.

Entropy of Kaluza-Klein black hole from Kerr/CFT correspondence

We extend the recently proposed Kerr/CFT correspondence to examine the dual conformal field theory of four-dimensional Kaluza-Klein black hole in Einstein-Maxwell-Dilaton theory. For the extremal Kaluza-Klein black hole, the central charge and temperature of the dual conformal field are calculated following the approach of Guica, Hartman, Song and Strominger. Meanwhile, we show that the microscopic entropy given by the Cardy formula agrees with Bekenstein-Hawking entropy of extremal Kaluza-Klein black hole. For the non-extremal case, by studying the near-region wave equation of a neutral massless scalar field, we investigate the hidden conformal symmetry of Kaluza-Klein black hole, and find the left and right temperatures of the dual conformal field theory. Furthermore, we find that the entropy of non-extremal Kaluza-Klein black hole is reproduced by Cardy formula. (C) 2010 Elsevier B.V. All rights reserved.

A preliminary genetic map of Zhikong scallop (Chlamys farreri Jones et Preston 1904)

Zhikong scallop (Chlamys farreri Jones et Preston 1904) is one of the most important aquaculture species in China. The development of a genetic linkage map would provide a powerful tool for the genetic improvement of this species. Amplified fragment length polymorphism (AFLP) is a PCR-based technique that has proven to be powerful in genome fingerprinting and mapping, and population analysis. Genetic maps of C. farreri were constructed using AFLP markers and a full-sib family with 60 progeny. A total of 503 segregating AFLP markers were obtained, with 472 following the Mendelian segregation ratio of 1:1 and 31 markers showing significant (P< 0.05) segregation distortion. The male map contained 166 informative AFLP markers in 23 linkage groups covering 2468 cM. The average distance between markers was 14.9 cM. The female genetic map consisted of 198 markers in 25 linkage groups spanning 3130 cM with an average inter-marker spacing of 15.8 cM. DNA polymorphisms that segregated in a 3:1 ratio as well as the AFLP markers that were heterozygous in both parents were included to construct combined linkage genetic map. Five shared linkage groups, ranging from 61.1 to 162.5 cM, were identified between the male and female maps, covering 431 cM. Amplified fragment length polymorphism markers appeared to be evenly distributed within the linkage groups. Although preliminary, these maps provide a starting point for the mapping of the functional genes and quantitative trait loci in C. farreri.

An Efficient Correspondence Based Algorithm for 2D and 3D Model Based Recognition

A polynomial time algorithm (pruned correspondence search, PCS) with good average case performance for solving a wide class of geometric maximal matching problems, including the problem of recognizing 3D objects from a single 2D image, is presented. Efficient verification algorithms, based on a linear representation of location constraints, are given for the case of affine transformations among vector spaces and for the case of rigid 2D and 3D transformations with scale. Some preliminary experiments suggest that PCS is a practical algorithm. Its similarity to existing correspondence based algorithms means that a number of existing techniques for speedup can be incorporated into PCS to improve its performance.

On The Uniqueness of Correspondence Under Orthographic and Perspective Projections

The task of shape recovery from a motion sequence requires the establishment of correspondence between image points. The two processes, the matching process and the shape recovery one, are traditionally viewed as independent. Yet, information obtained during the process of shape recovery can be used to guide the matching process. This paper discusses the mutual relationship between the two processes. The paper is divided into two parts. In the first part we review the constraints imposed on the correspondence by rigid transformations and extend them to objects that undergo general affine (non rigid) transformation (including stretch and shear), as well as to rigid objects with smooth surfaces. In all these cases corresponding points lie along epipolar lines, and these lines can be recovered from a small set of corresponding points. In the second part of the paper we discuss the potential use of epipolar lines in the matching process. We present an algorithm that recovers the correspondence from three contour images. The algorithm was implemented and used to construct object models for recognition. In addition we discuss how epipolar lines can be used to solve the aperture problem.

Two-Dimensional?Three-Dimensional Correspondence in Mammography

R. Marti, C. Rubin, E. Denton and R. Zwiggelaar, '2D-3D correspondence in mammography', Cybernetics and Systems 35 (1), 85-105 (2004)

Automatic point correspondence and registration based on linear structures

R. Marti, R. Zwiggelaar, C.M.E. Rubin, 'Automatic point correspondence and registration based on linear structures', International Journal of Pattern Recognition and Artificial Intelligence 16 (3), 331-340 (2002)

The Correspondence of Iolo Morganwg, 1770-1826

Jenkins, G.; Jones, F.; and Jones, D. (Eds.). (2007). The Correspondence of Iolo Morganwg: Vols. I, II and III. Cardiff: University of Wales Press. RAE2008

Modal Matching for Correspondence and Recognition

Modal matching is a new method for establishing correspondences and computing canonical descriptions. The method is based on the idea of describing objects in terms of generalized symmetries, as defined by each object's eigenmodes. The resulting modal description is used for object recognition and categorization, where shape similarities are expressed as the amounts of modal deformation energy needed to align the two objects. In general, modes provide a global-to-local ordering of shape deformation and thus allow for selecting which types of deformations are used in object alignment and comparison. In contrast to previous techniques, which required correspondence to be computed with an initial or prototype shape, modal matching utilizes a new type of finite element formulation that allows for an object's eigenmodes to be computed directly from available image information. This improved formulation provides greater generality and accuracy, and is applicable to data of any dimensionality. Correspondence results with 2-D contour and point feature data are shown, and recognition experiments with 2-D images of hand tools and airplanes are described.

Mathematical notation in formal specification: Too difficult for the masses? [Correspondence]

The phrase “not much mathematics required” can imply a variety of skill levels. When this phrase is applied to computer scientists, software engineers, and clients in the area of formal specification, the word “much” can be widely misinterpreted with disastrous consequences. A small experiment in reading specifications revealed that students already trained in discrete mathematics and the specification notation performed very poorly; much worse than could reasonably be expected if formal methods proponents are to be believed.