Accurate point matching based on multi-objective Genetic Algorithm for multi-sensor satellite imagery

This paper investigates a novel approach for point matching of multi-sensor satellite imagery. The feature (corner) points extracted using an improved version of the Harris Corner Detector (HCD) is matched using multi-objective optimization based on a Genetic Algorithm (GA). An objective switching approach to optimization that incorporates an angle criterion, distance condition and point matching condition in the multi-objective fitness function is applied to match corresponding corner-points between the reference image and the sensed image. The matched points obtained in this way are used to align the sensed image with a reference image by applying an affine transformation. From the results obtained, the performance of the image registration is evaluated and compared with existing methods, namely Nearest Neighbor-Random SAmple Consensus (NN-Ran-SAC) and multi-objective Discrete Particle Swarm Optimization (DPSO). From the performed experiments it can be concluded that the proposed approach is an accurate method for registration of multi-sensor satellite imagery. (C) 2014 Elsevier Inc. All rights reserved.

Reduced Look Ahead Orthogonal Matching Pursuit

Compressed Sensing (CS) is an elegant technique to acquire signals and reconstruct them efficiently by solving a system of under-determined linear equations. The excitement in this field stems from the fact that we can sample at a rate way below the Nyquist rate and still reconstruct the signal provided some conditions are met. Some of the popular greedy reconstruction algorithms are the Orthogonal Matching Pursuit (OMP), the Subspace Pursuit (SP) and the Look Ahead Orthogonal Matching Pursuit (LAOMP). The LAOMP performs better than the OMP. However, when compared to the SP and the OMP, the computational complexity of LAOMP is higher. We introduce a modified version of the LAOMP termed as Reduced Look Ahead Orthogonal Matching Pursuit (Reduced LAOMP). Reduced LAOMP uses prior information from the results of the OMP and the SP in the quest to speedup the look ahead strategy in the LAOMP. Monte Carlo simulations of this algorithm deliver promising results.

Mechanism to synthesize a `moving optical mark' at solid-ambient interface for the estimation of thermal diffusivity of solid

supporting unsteady heat flow with its ambient-humidity; invokes phase transformation of water-vapour molecule and synthesize a `moving optical-mark' at sample-ambient-interface. Under tailored condition, optical-mark exhibits a characteristic macro-scale translatory motion governed by thermal diffusivity of solid. For various step-temperature inputs via cooling, position-dependent velocities of moving optical-mark are measured at a fixed distance. A new approach is proposed. `Product of velocity of optical-mark and distance' versus `non-dimensional velocity' is plotted. The slope reveals thermal diffusivity of solid at ambient-temperature; preliminary results obtained for Quartz-glass is closely matching with literature. (C) 2016 Author(s). All article content, except where otherwise noted, is licensed under a Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).

A coupled discriminative dictionary and transformation learning approach with applications to cross domain matching

Cross domain and cross-modal matching has many applications in the field of computer vision and pattern recognition. A few examples are heterogeneous face recognition, cross view action recognition, etc. This is a very challenging task since the data in two domains can differ significantly. In this work, we propose a coupled dictionary and transformation learning approach that models the relationship between the data in both domains. The approach learns a pair of transformation matrices that map the data in the two domains in such a manner that they share common sparse representations with respect to their own dictionaries in the transformed space. The dictionaries for the two domains are learnt in a coupled manner with an additional discriminative term to ensure improved recognition performance. The dictionaries and the transformation matrices are jointly updated in an iterative manner. The applicability of the proposed approach is illustrated by evaluating its performance on different challenging tasks: face recognition across pose, illumination and resolution, heterogeneous face recognition and cross view action recognition. Extensive experiments on five datasets namely, CMU-PIE, Multi-PIE, ChokePoint, HFB and IXMAS datasets and comparisons with several state-of-the-art approaches show the effectiveness of the proposed approach. (C) 2015 Elsevier B.V. All rights reserved.

A coupled discriminative dictionary and transformation learning approach with applications to cross domain matching

Cross domain and cross-modal matching has many applications in the field of computer vision and pattern recognition. A few examples are heterogeneous face recognition, cross view action recognition, etc. This is a very challenging task since the data in two domains can differ significantly. In this work, we propose a coupled dictionary and transformation learning approach that models the relationship between the data in both domains. The approach learns a pair of transformation matrices that map the data in the two domains in such a manner that they share common sparse representations with respect to their own dictionaries in the transformed space. The dictionaries for the two domains are learnt in a coupled manner with an additional discriminative term to ensure improved recognition performance. The dictionaries and the transformation matrices are jointly updated in an iterative manner. The applicability of the proposed approach is illustrated by evaluating its performance on different challenging tasks: face recognition across pose, illumination and resolution, heterogeneous face recognition and cross view action recognition. Extensive experiments on five datasets namely, CMU-PIE, Multi-PIE, ChokePoint, HFB and IXMAS datasets and comparisons with several state-of-the-art approaches show the effectiveness of the proposed approach. (C) 2015 Elsevier B.V. All rights reserved.

Storage life of silverbelly (Leiognathus sp.) with delayed icing

Silver belly (leiognathus splendens) caught in September spoiled faster than the fish caught in May. This could be due to seasonal changes. For silver belly, Total Volatile Base (TVB) value could be used as a measure of spoilage. At the beginning of spoilage TVB value is between 30-40 mg. N/100g sample. The main spoilage for silver belly appears to start between 6 and 8 hours (at 28° C-30°C) after landing on board. Therefore it is not necessary to ice silverbelly immediately; it seems to be sufficient if icing can be done within 6 hours of landing on board.

Preservation of Sardinella longiceps in iced and chilled seawater. Part 1 - Changes during storage with particular reference to bacterial load and nitrogenous compounds

Oil sardines in prime condition were subjected to onboard chilling. Two lots were chilled in CSW (samples C and CI), a third lot was chilled in crushed ice (sample I) and a fourth lot left not iced on deck (Sample AI). Upon landing sample AI was iced and sample CI was removed from the CSW and iced. All the four samples were kept in a chilled room for storage studies. The fish chilled and stored in CSW recorded the least, and the fish subjected to delayed icing, the highest values for all the indices of spoilage namely, free amino nitrogen, trimethylamine (TMA) and total volatile base nitrogen (TVBN). The total psychrophilic bacterial number also showed a similar trend. The organoleptic assessment of the cooked samples revealed C I, CI, AI to be the order of preference throughout the storage. This assessment was found to hold good for the rest of the parameters as well. The CSW held fishes were found to be distinctly superior to the iced ones for the first five days of storage. Such a marked prevalence in quality for five days would suffice for the fish to fetch a premium in the market over other landings of the same fish whether chilled or not chilled. Chilling on board in CSW and icing the same after landings, did not show encouraging results.

Improvements to Concrete Column Detection in Live Video

The automated detection of structural elements (e.g. concrete columns) in visual data is useful in many construction and maintenance applications. The research in this area is under initial investigation. The authors previously presented a concrete column detection method that utilized boundary and color information as detection cues. However, the method is sensitive to parameter selection, which reduces its ability to robustly detect concrete columns in live videos. Compared against the previous method, the new method presented in this paper reduces the reliance of parameter settings mainly in three aspects. First, edges are located using color information. Secondly, the orientation information of edge points is considered in constructing column boundaries. Thirdly, an artificial neural network for concrete material classification is developed to replace concrete sample matching. The method is tested using live videos, and results are compared with the results obtained with the previous method to demonstrate the new method improvements.

Distribution matching for transduction

Many transductive inference algorithms assume that distributions over training and test estimates should be related, e.g. by providing a large margin of separation on both sets. We use this idea to design a transduction algorithm which can be used without modification for classification, regression, and structured estimation. At its heart we exploit the fact that for a good learner the distributions over the outputs on training and test sets should match. This is a classical two-sample problem which can be solved efficiently in its most general form by using distance measures in Hilbert Space. It turns out that a number of existing heuristics can be viewed as special cases of our approach.

Matching an oscillator model to a phase response curve

The Phase Response Curve (PRC) has proven a useful tool for the reduction of complex oscillator models. It is also an information often experimentally available to the biologist. This paper introduces a numerical tool based on the sensitivity analysis of the PRC to adapt initial model parameters in order to match a particular PRC shape. We illustrate the approach on a simple biochemical model of circadian oscillator. © 2011 IEEE.

Probability-Matching Predictors for Extreme Extremes

A location- and scale-invariant predictor is constructed which exhibits good probability matching for extreme predictions outside the span of data drawn from a variety of (stationary) general distributions. It is constructed via the three-parameter {\mu, \sigma, \xi} Generalized Pareto Distribution (GPD). The predictor is designed to provide matching probability exactly for the GPD in both the extreme heavy-tailed limit and the extreme bounded-tail limit, whilst giving a good approximation to probability matching at all intermediate values of the tail parameter \xi. The predictor is valid even for small sample sizes N, even as small as N = 3. The main purpose of this paper is to present the somewhat lengthy derivations which draw heavily on the theory of hypergeometric functions, particularly the Lauricella functions. Whilst the construction is inspired by the Bayesian approach to the prediction problem, it considers the case of vague prior information about both parameters and model, and all derivations are undertaken using sampling theory.

Output feedback H2 model matching for decentralized systems with delays

This paper gives a new solution to the output feedback H2 model matching problem for a large class of delayed information sharing patterns. Existing methods for similar problems typically reduce the decentralized problem to a centralized problem of higher state dimension. In contrast, this paper demonstrates that the decentralized model matching solution can be constructed from the original centralized solution via quadratic programming. © 2013 AACC American Automatic Control Council.

Rapid bioassay as indicator of potentially harmful effects for dioxin-like compounds in sample of Ya-Er Lake, China: Requirements for clean-up and comparison to chemical analysis

A rapid bioassay was established measuring the extracts of wildlife samples which were taken from Ya-Er Lake area, China. In extracts of these samples containing PCDD/Fs and PCBs, bioassay and chemically derived TCDD-equivalents (TEQs) were nearly identical. Our results indicate this bioassay is an excellent complement to chemical residue analysis and a useful tool in understanding the complex interactions of halogenated hydrocarbons. However, it must be mentioned that the proper prior clean-up method is very important for using the bioassay.