A COMPARATIVE STUDY OF HEURISTIC OPTIMIZATION ALGORITHMS

Heuristic optimization algorithms are of great importance for reaching solutions to various real world problems. These algorithms have a wide range of applications such as cost reduction, artificial intelligence, and medicine. By the term cost, one could imply that that cost is associated with, for instance, the value of a function of several independent variables. Often, when dealing with engineering problems, we want to minimize the value of a function in order to achieve an optimum, or to maximize another parameter which increases with a decrease in the cost (the value of this function). The heuristic cost reduction algorithms work by finding the optimum values of the independent variables for which the value of the function (the “cost”) is the minimum. There is an abundance of heuristic cost reduction algorithms to choose from. We will start with a discussion of various optimization algorithms such as Memetic algorithms, force-directed placement, and evolution-based algorithms. Following this initial discussion, we will take up the working of three algorithms and implement the same in MATLAB. The focus of this report is to provide detailed information on the working of three different heuristic optimization algorithms, and conclude with a comparative study on the performance of these algorithms when implemented in MATLAB. In this report, the three algorithms we will take in to consideration will be the non-adaptive simulated annealing algorithm, the adaptive simulated annealing algorithm, and random restart hill climbing algorithm. The algorithms are heuristic in nature, that is, the solution these achieve may not be the best of all the solutions but provide a means to reach a quick solution that may be a reasonably good solution without taking an indefinite time to implement.

GPI-specific phospholipase D (GPI-PLD) is expressed during mouse development and is localized to the extracellular matrix of the developing mouse skeleton

Glycosylphosphatidylinositol-specific phospholipase D (GPI-PLD) is abundant in serum and has a well-characterized biochemistry; however, its physiological role is completely unknown. Previous investigations into GPI-PLD have focused on the adult animal or on in vitro systems and a putative role in development has been neither proposed nor investigated. We describe the first evidence of GPI-PLD expression during mouse embryonic ossification. GPI-PLD expression was detected predominantly at sites of skeletal development, increasing during the course of gestation. GPI-PLD was observed during both intramembraneous and endochondral ossification and localized predominantly to the extracellular matrix of chondrocytes and to primary trabeculae of the skeleton. In addition, the mouse chondrocyte cell line ATDC5 expressed GPI-PLD after experimental induction of differentiation. These results implicate GPI-PLD in the process of bone formation during mouse embryogenesis.

Evaluation of Binocular Eye Trackers and Algorithms for 3D Gaze Interaction in Virtual Reality Environments

Tracking user’s visual attention is a fundamental aspect in novel human-computer interaction paradigms found in Virtual Reality. For example, multimodal interfaces or dialogue-based communications with virtual and real agents greatly benefit from the analysis of the user’s visual attention as a vital source for deictic references or turn-taking signals. Current approaches to determine visual attention rely primarily on monocular eye trackers. Hence they are restricted to the interpretation of two-dimensional fixations relative to a defined area of projection. The study presented in this article compares precision, accuracy and application performance of two binocular eye tracking devices. Two algorithms are compared which derive depth information as required for visual attention-based 3D interfaces. This information is further applied to an improved VR selection task in which a binocular eye tracker and an adaptive neural network algorithm is used during the disambiguation of partly occluded objects.

Algorithms For Automatic And Robust Registration Of 3D Head Scans

wo methods for registering laser-scans of human heads and transforming them to a new semantically consistent topology defined by a user-provided template mesh are described. Both algorithms are stated within the Iterative Closest Point framework. The first method is based on finding landmark correspondences by iteratively registering the vicinity of a landmark with a re-weighted error function. Thin-plate spline interpolation is then used to deform the template mesh and finally the scan is resampled in the topology of the deformed template. The second algorithm employs a morphable shape model, which can be computed from a database of laser-scans using the first algorithm. It directly optimizes pose and shape of the morphable model. The use of the algorithm with PCA mixture models, where the shape is split up into regions each described by an individual subspace, is addressed. Mixture models require either blending or regularization strategies, both of which are described in detail. For both algorithms, strategies for filling in missing geometry for incomplete laser-scans are described. While an interpolation-based approach can be used to fill in small or smooth regions, the model-driven algorithm is capable of fitting a plausible complete head mesh to arbitrarily small geometry, which is known as "shape completion". The importance of regularization in the case of extreme shape completion is shown.

A Video Database for the Development of Stereo-3D Post-Production Algorithms

This paper introduces a database of freely available stereo-3D content designed to facilitate research in stereo post-production. It describes the structure and content of the database and provides some details about how the material was gathered. The database includes examples of many of the scenarios characteristic to broadcast footage. Material was gathered at different locations including a studio with controlled lighting and both indoor and outdoor on-location sites with more restricted lighting control. The database also includes video sequences with accompanying 3D audio data recorded in an Ambisonics format. An intended consequence of gathering the material is that the database contains examples of degradations that would be commonly present in real-world scenarios. This paper describes one such artefact caused by uneven exposure in the stereo views, causing saturation in the over-exposed view. An algorithm for the restoration of this artefact is proposed in order to highlight the usefuiness of the database.

Characterization of the macromolecule baseline in localized (1)H-MR spectra of human brain

Short-echo-time magnetic resonance spectra of human brain contain broad contributions from macromolecules. As they are a priori of unknown shape and intensity, they pose a problem if one wants to quantitate the overlying spectral features from low-molecular-weight metabolites. On the other hand, the macromolecular contributions may provide relevant clinical information themselves, if properly evaluated. Several methods, based on T(1), T(2), or spectral shape, have previously been suggested to suppress or edit the macromolecule contributions. Here, a method is presented based on a series of saturation recovery scans and that allows for simultaneous recording of the macromolecular baseline and the fully relaxed metabolite spectrum. In comparison to an inversion recovery technique aimed at nulling signals from long-T(1) components, the saturation recovery method is less susceptible to T(1) differences inherent in signals from different metabolites or introduced by pathology. The saturation recovery method was used to quantitate the macromolecular baseline in white and/or gray matter locations of the human brain in 40 subjects. It was found that the content and composition of MR visible macromolecules depends on cerebral location, as well as the age of the investigated subject, while no gender dependence could be found.

Localized amyloid light-chain amyloidosis and extramedullary plasmacytoma of the mitral valve

An unusual case of localized amyloid light-chain (AL) amyloidosis and extramedullary plasmacytoma of the mitral valve is described. The worsening of a mitral regurgitation led to investigations and surgery. The valve presented marked distortion and thickening by type AL amyloid associated with a monotypic CD138+ immunoglobulin lambda plasma cell proliferation. Systemic staging showed a normal bone marrow and no evidence of amyloid deposition in other localizations. The patient's outcome after mitral valve replacement was excellent. To our knowledge, this is the first description of a localized AL amyloidosis as well as of a primary extramedullary plasmacytoma of the mitral valve.

Searching for the majority: algorithms of voluntary control.

Voluntary control of information processing is crucial to allocate resources and prioritize the processes that are most important under a given situation; the algorithms underlying such control, however, are often not clear. We investigated possible algorithms of control for the performance of the majority function, in which participants searched for and identified one of two alternative categories (left or right pointing arrows) as composing the majority in each stimulus set. We manipulated the amount (set size of 1, 3, and 5) and content (ratio of left and right pointing arrows within a set) of the inputs to test competing hypotheses regarding mental operations for information processing. Using a novel measure based on computational load, we found that reaction time was best predicted by a grouping search algorithm as compared to alternative algorithms (i.e., exhaustive or self-terminating search). The grouping search algorithm involves sampling and resampling of the inputs before a decision is reached. These findings highlight the importance of investigating the implications of voluntary control via algorithms of mental operations.