Image enhancement with MatLab algorithms

Nowadays, a lot of applications use digital images. For example in face recognition to detect and tag persons in photograph, for security control, and a lot of applications that can be found in smart cities, as speed control in roads or highways and cameras in traffic lights to detect drivers ignoring red light. Also in medicine digital images are used, such as x-ray, scanners, etc. These applications depend on the quality of the image obtained. A good camera is expensive, and the image obtained depends also on external factor as light. To make these applications work properly, image enhancement is as important as, for example, a good face detection algorithm. Image enhancement also can be used in normal photograph, for pictures done in bad light conditions, or just to improve the contrast of an image. There are some applications for smartphones that allow users apply filters or change the bright, colour or contrast on the pictures. This project compares four different techniques to use in image enhancement. After applying one of these techniques to an image, it will use better the whole available dynamic range. Some of the algorithms are designed for grey scale images and others for colour images. It is used Matlab software to develop and present the final results. These algorithms are Successive Means Quantization Transform (SMQT), Histogram Equalization, using Matlab function and own implemented function, and V transform. Finally, as conclusions, we can prove that Histogram equalization algorithm is the simplest of all, it has a wide variability of grey levels and it is not suitable for colour images. V transform algorithm is a good option for colour images. The algorithm is linear and requires low computational power. SMQT algorithm is non-linear, insensitive to gain and bias and it can extract structure of the data. RESUMEN. Hoy en día incontable número de aplicaciones usan imágenes digitales. Por ejemplo, para el control de la seguridad se usa el reconocimiento de rostros para detectar y etiquetar personas en fotografías o vídeos, para distintos usos de las ciudades inteligentes, como control de velocidad en carreteras o autopistas, cámaras en los semáforos para detectar a conductores haciendo caso omiso de un semáforo en rojo, etc. También en la medicina se utilizan imágenes digitales, como por ejemplo, rayos X, escáneres, etc. Todas estas aplicaciones dependen de la calidad de la imagen obtenida. Una buena cámara es cara, y la imagen obtenida depende también de factores externos como la luz. Para hacer que estas aplicaciones funciones correctamente, el tratamiento de imagen es tan importante como, por ejemplo, un buen algoritmo de detección de rostros. La mejora de la imagen también se puede utilizar en la fotografía no profesional o de consumo, para las fotos realizadas en malas condiciones de luz, o simplemente para mejorar el contraste de una imagen. Existen aplicaciones para teléfonos móviles que permiten a los usuarios aplicar filtros y cambiar el brillo, el color o el contraste en las imágenes. Este proyecto compara cuatro técnicas diferentes para utilizar el tratamiento de imagen. Se utiliza la herramienta de software matemático Matlab para desarrollar y presentar los resultados finales. Estos algoritmos son Successive Means Quantization Transform (SMQT), Ecualización del histograma, usando la propia función de Matlab y una nueva función que se desarrolla en este proyecto y, por último, una función de transformada V. Finalmente, como conclusión, podemos comprobar que el algoritmo de Ecualización del histograma es el más simple de todos, tiene una amplia variabilidad de niveles de gris y no es adecuado para imágenes en color. El algoritmo de transformada V es una buena opción para imágenes en color, es lineal y requiere baja potencia de cálculo. El algoritmo SMQT no es lineal, insensible a la ganancia y polarización y, gracias a él, se puede extraer la estructura de los datos.

Voltage dependence of the pattern and frequency of discrete Ca2+ release events after brief repriming in frog skeletal muscle

Applying a brief repolarizing pre-pulse to a depolarized frog skeletal muscle fiber restores a small fraction of the transverse tubule membrane voltage sensors from the inactivated state. During a subsequent depolarizing test pulse we detected brief, highly localized elevations of myoplasmic Ca2+ concentration (Ca2+ “sparks”) initiated by restored voltage sensors in individual triads at all test pulse voltages. The latency histogram of these events gives the gating pattern of the sarcoplasmic reticulum (SR) calcium release channels controlled by the restored voltage sensors. Both event frequency and clustering of events near the start of the test pulse increase with test pulse depolarization. The macroscopic SR calcium release waveform, obtained from the spark latency histogram and the estimated open time of the channel or channels underlying a spark, exhibits an early peak and rapid marked decline during large depolarizations. For smaller depolarizations, the release waveform exhibits a smaller peak and a slower decline. However, the mean use time and mean amplitude of the individual sparks are quite similar at all test depolarizations and at all times during a given depolarization, indicating that the channel open times and conductances underlying sparks are essentially independent of voltage. Thus, the voltage dependence of SR Ca2+ release is due to changes in the frequency and pattern of occurrence of individual, voltage-independent, discrete release events.

Sleep modifies retinal ganglion cell responses in the normal rat

Recordings were obtained from the visual system of rats as they cycled normally between waking (W), slow-wave sleep (SWS), and rapid eye movement (REM) sleep. Responses to flashes delivered by a light-emitting diode attached permanently to the skull were recorded through electrodes implanted on the cornea, in the chiasm, and on the cortex. The chiasm response reveals the temporal order in which the activated ganglion cell population exits the eyeball; as reported, this triphasic event is invariably short in latency (5–10 ms) and around 300 ms in duration, called the histogram. Here we describe the differences in the histograms recorded during W, SWS, and REM. SWS histograms are always larger than W histograms, and an REM histogram can resemble either. In other words, the optic nerve response to a given stimulus is labile; its configuration depends on whether the rat is asleep or awake. We link this physiological information with the anatomical fact that the brain dorsal raphe region, which is known to have a sleep regulatory role, sends fibers to the rat retina and receives fibers from it. At the cortical electrode, the visual cortical response amplitudes also vary, being largest during SWS. This well known phenomenon often is explained by changes taking place at the thalamic level. However, in the rat, the labile cortical response covaries with the labile optic nerve response, which suggests the cortical response enhancement during SWS is determined more by what happens in the retina than by what happens in the thalamus.

How are close residues of protein structures distributed in primary sequence?

Structurally neighboring residues are categorized according to their separation in the primary sequence as proximal (1-4 positions apart) and otherwise distal, which in turn is divided into near (5-20 positions), far (21-50 positions), very far ( > 50 positions), and interchain (from different chains of the same structure). These categories describe the linear distance histogram (LDH) for three-dimensional neighboring residue types. Among the main results are the following: (i) nearest-neighbor hydrophobic residues tend to be increasingly distally separated in the linear sequence, thus most often connecting distinct secondary structure units. (ii) The LDHs of oppositely charged nearest-neighbors emphasize proximal positions with a subsidiary maximum for very far positions. (iii) Cysteine-cysteine structural interactions rarely involve proximal positions. (iv) The greatest numbers of interchain specific nearest-neighbors in protein structures are composed of oppositely charged residues. (v) The largest fraction of side-chain neighboring residues from beta-strands involves near positions, emphasizing associations between consecutive strands. (vi) Exposed residue pairs are predominantly located in proximal linear positions, while buried residue pairs principally correspond to far or very far distal positions. The results are principally invariant to protein sizes, amino acid usages, linear distance normalizations, and over- and underrepresentations among nearest-neighbor types. Interpretations and hypotheses concerning the LDHs, particularly those of hydrophobic and charged pairings, are discussed with respect to protein stability and functionality. The pronounced occurrence of oppositely charged interchain contacts is consistent with many observations on protein complexes where multichain stabilization is facilitated by electrostatic interactions.

Very-long-baseline radio interferometry surveys of the compact structure in active galactic nuclei.

Very-long-baseline radio interferometry (VLBI) imaging surveys have been undertaken since the late 1970s. The sample sizes were initially limited to a few tens of objects but the snapshot technique has now allowed samples containing almost 200 sources to be studied. The overwhelming majority of powerful compact sources are asymmetric corejects of one form or another, most of which exhibit apparent superluminal motion. However 5-10% of powerful flat-spectrum sources are 100-parsec (pc)-scale compact symmetric objects; these appear to form a continuum with the 1-kpc-scale double-lobed compact steep-spectrum sources, which make up 15-20% of lower frequency samples. It is likely that these sub-galactic-size symmetric sources are the precursors to the large-scale classical double sources. There is a surprising peak around 90 degrees in the histogram of misalignments between the dominant source axes on parsec and kiloparsec scales; this seems to be associated with sources exhibiting a high degree of relativistic beaming. VLBI snapshot surveys have great cosmological potential via measurements of both proper motion and angular size vs. redshift as well as searches for gravitational "millilensing."

Human Motion Analysis Based on Sequential Modeling of Radar Signal and Stereo Image Features

Falls are one of the greatest threats to elderly health in their daily living routines and activities. Therefore, it is very important to detect falls of an elderly in a timely and accurate manner, so that immediate response and proper care can be provided, by sending fall alarms to caregivers. Radar is an effective non-intrusive sensing modality which is well suited for this purpose, which can detect human motions in all types of environments, penetrate walls and fabrics, preserve privacy, and is insensitive to lighting conditions. Micro-Doppler features are utilized in radar signal corresponding to human body motions and gait to detect falls using a narrowband pulse-Doppler radar. Human motions cause time-varying Doppler signatures, which are analyzed using time-frequency representations and matching pursuit decomposition (MPD) for feature extraction and fall detection. The extracted features include MPD features and the principal components of the time-frequency signal representations. To analyze the sequential characteristics of typical falls, the extracted features are used for training and testing hidden Markov models (HMM) in different falling scenarios. Experimental results demonstrate that the proposed algorithm and method achieve fast and accurate fall detections. The risk of falls increases sharply when the elderly or patients try to exit beds. Thus, if a bed exit can be detected at an early stage of this motion, the related injuries can be prevented with a high probability. To detect bed exit for fall prevention, the trajectory of head movements is used for recognize such human motion. A head detector is trained using the histogram of oriented gradient (HOG) features of the head and shoulder areas from recorded bed exit images. A data association algorithm is applied on the head detection results to eliminate head detection false alarms. Then the three dimensional (3D) head trajectories are constructed by matching scale-invariant feature transform (SIFT) keypoints in the detected head areas from both the left and right stereo images. The extracted 3D head trajectories are used for training and testing an HMM based classifier for recognizing bed exit activities. The results of the classifier are presented and discussed in the thesis, which demonstrates the effectiveness of the proposed stereo vision based bed exit detection approach.

Calibration of the length of a chain of single gold atoms

Using a scanning tunnelling microscope or mechanically controllable break junction it has been shown that it is possible to control the formation of a wire made of single gold atoms. In these experiments an interatomic distance between atoms in the chain of ∼3.6 Å was reported which is not consistent with recent theoretical calculations. Here, using precise calibration procedures for both techniques, we measure the length of the atomic chains. Based on the distance between the peaks observed in the chain length histogram we find the mean value of the interatomic distance before chain rupture to be 2.5±0.2 Å. This value agrees with the theoretical calculations for the bond length. The discrepancy with the previous experimental measurements was due to the presence of He gas, that was used to promote the thermal contact, and which affects the value of the work function that is commonly used to calibrate distances in scanning tunnelling microscopy and mechanically controllable break junctions at low temperatures.

Comparing the distribution of the electronic gap of an organic molecule with its photoluminescence spectrum

The electronic gap structure of the organic molecule N,N′-diphenyl-N,N′-bis(3-methylphenyl)-(1,1′-biphenyl)-4,4′-diamine, also known as TPD, has been studied by means of a Scanning Tunneling Microscope (STM) and by Photoluminescence (PL) analysis. Hundreds of current-voltage characteristics measured at different spots of the sample show the typical behavior of a semiconductor. The analysis of the curves allows to construct a gap distribution histogram which reassembles the PL spectrum of this compound. This analysis demonstrates that STM can give relevant information, not only related to the expected value of a semiconductor gap but also on its distribution which affects its physical properties such as its PL.

MOREMATA: Stata module (Mata) to provide various functions

This package includes various Mata functions. kern(): various kernel functions; kint(): kernel integral functions; kdel0(): canonical bandwidth of kernel; quantile(): quantile function; median(): median; iqrange(): inter-quartile range; ecdf(): cumulative distribution function; relrank(): grade transformation; ranks(): ranks/cumulative frequencies; freq(): compute frequency counts; histogram(): produce histogram data; mgof(): multinomial goodness-of-fit tests; collapse(): summary statistics by subgroups; _collapse(): summary statistics by subgroups; gini(): Gini coefficient; sample(): draw random sample; srswr(): SRS with replacement; srswor(): SRS without replacement; upswr(): UPS with replacement; upswor(): UPS without replacement; bs(): bootstrap estimation; bs2(): bootstrap estimation; bs_report(): report bootstrap results; jk(): jackknife estimation; jk_report(): report jackknife results; subset(): obtain subsets, one at a time; composition(): obtain compositions, one by one; ncompositions(): determine number of compositions; partition(): obtain partitions, one at a time; npartitionss(): determine number of partitions; rsubset(): draw random subset; rcomposition(): draw random composition; colvar(): variance, by column; meancolvar(): mean and variance, by column; variance0(): population variance; meanvariance0(): mean and population variance; mse(): mean squared error; colmse(): mean squared error, by column; sse(): sum of squared errors; colsse(): sum of squared errors, by column; benford(): Benford distribution; cauchy(): cumulative Cauchy-Lorentz dist.; cauchyden(): Cauchy-Lorentz density; cauchytail(): reverse cumulative Cauchy-Lorentz; invcauchy(): inverse cumulative Cauchy-Lorentz; rbinomial(): generate binomial random numbers; cebinomial(): cond. expect. of binomial r.v.; root(): Brent's univariate zero finder; nrroot(): Newton-Raphson zero finder; finvert(): univariate function inverter; integrate_sr(): univariate function integration (Simpson's rule); integrate_38(): univariate function integration (Simpson's 3/8 rule); ipolate(): linear interpolation; polint(): polynomial inter-/extrapolation; plot(): Draw twoway plot; _plot(): Draw twoway plot; panels(): identify nested panel structure; _panels(): identify panel sizes; npanels(): identify number of panels; nunique(): count number of distinct values; nuniqrows(): count number of unique rows; isconstant(): whether matrix is constant; nobs(): number of observations; colrunsum(): running sum of each column; linbin(): linear binning; fastlinbin(): fast linear binning; exactbin(): exact binning; makegrid(): equally spaced grid points; cut(): categorize data vector; posof(): find element in vector; which(): positions of nonzero elements; locate(): search an ordered vector; hunt(): consecutive search; cond(): matrix conditional operator; expand(): duplicate single rows/columns; _expand(): duplicate rows/columns in place; repeat(): duplicate contents as a whole; _repeat(): duplicate contents in place; unorder2(): stable version of unorder(); jumble2(): stable version of jumble(); _jumble2(): stable version of _jumble(); pieces(): break string into pieces; npieces(): count number of pieces; _npieces(): count number of pieces; invtokens(): reverse of tokens(); realofstr(): convert string into real; strexpand(): expand string argument; matlist(): display a (real) matrix; insheet(): read spreadsheet file; infile(): read free-format file; outsheet(): write spreadsheet file; callf(): pass optional args to function; callf_setup(): setup for mm_callf().

A discussion of cases in the 2001 RCPA-AQAP chemical pathology case report comments program

Aim: We present a descriptive analysis of the 10 case reports distributed in the Royal College of Pathologists of Australasia (RCPA) and the Australasian Association of Clinical Biochemists (AACB) Chemical Pathology Patient Report Comments Program to assess the quality of interpretative commenting in clinical biochemistry in 2001. Method: Participants were asked to comment on a given set of biochemistry results attached with brief clinical details. All responses received were translated into key phrases and graphically presented on a histogram. An expert panel was asked to evaluate the appropriateness of the key phrases and to propose a suggested composite comment. Results: While the majority of comments received were felt to be acceptable by the expert panel, some comments were felt to be inappropriate or misleading. As comments on laboratory reports may affect clinical management of patients, it is important that these comments reflect accepted practice and current guidelines. Conclusion: The Patient Report Comments Program may play an important role in continuing education and possibly in quality assurance of interpretative commenting.

Summarizing level-two topological relations in large spatial datasets

Summarizing topological relations is fundamental to many spatial applications including spatial query optimization. In this article, we present several novel techniques to effectively construct cell density based spatial histograms for range (window) summarizations restricted to the four most important level-two topological relations: contains, contained, overlap, and disjoint. We first present a novel framework to construct a multiscale Euler histogram in 2D space with the guarantee of the exact summarization results for aligned windows in constant time. To minimize the storage space in such a multiscale Euler histogram, an approximate algorithm with the approximate ratio 19/12 is presented, while the problem is shown NP-hard generally. To conform to a limited storage space where a multiscale histogram may be allowed to have only k Euler histograms, an effective algorithm is presented to construct multiscale histograms to achieve high accuracy in approximately summarizing aligned windows. Then, we present a new approximate algorithm to query an Euler histogram that cannot guarantee the exact answers; it runs in constant time. We also investigate the problem of nonaligned windows and the problem of effectively partitioning the data space to support nonaligned window queries. Finally, we extend our techniques to 3D space. Our extensive experiments against both synthetic and real world datasets demonstrate that the approximate multiscale histogram techniques may improve the accuracy of the existing techniques by several orders of magnitude while retaining the cost efficiency, and the exact multiscale histogram technique requires only a storage space linearly proportional to the number of cells for many popular real datasets.

Toward efficient multifeature query processing

In many advanced applications, data are described by multiple high-dimensional features. Moreover, different queries may weight these features differently; some may not even specify all the features. In this paper, we propose our solution to support efficient query processing in these applications. We devise a novel representation that compactly captures f features into two components: The first component is a 2D vector that reflects a distance range ( minimum and maximum values) of the f features with respect to a reference point ( the center of the space) in a metric space and the second component is a bit signature, with two bits per dimension, obtained by analyzing each feature's descending energy histogram. This representation enables two levels of filtering: The first component prunes away points that do not share similar distance ranges, while the bit signature filters away points based on the dimensions of the relevant features. Moreover, the representation facilitates the use of a single index structure to further speed up processing. We employ the classical B+-tree for this purpose. We also propose a KNN search algorithm that exploits the access orders of critical dimensions of highly selective features and partial distances to prune the search space more effectively. Our extensive experiments on both real-life and synthetic data sets show that the proposed solution offers significant performance advantages over sequential scan and retrieval methods using single and multiple VA-files.

Multiphoton high-resolution 3D imaging of Langerhans cells and keratinocytes in the mouse skin model adopted for epidermal powdered immunization

Langerhans cells (LCs) can be targeted with DNA-coated gold micro-projectiles ("Gene Gun") to induce potent cellular and humoral immune responses. It is likely that the relative volumetric distribution of LCs and keratinocytes within the epidermis impacts on the efficacy of Gene Gun immunization protocols. This study quantified the three-dimensional (3D) distribution of LCs and keratinocytes in the mouse skin model with a near-infrared multiphoton laser-scanning microscope (NIR-MPLSM). Stratum corneum (SC) and viable epidermal thickness measured with MPLSM was found in close agreement with conventional histology. LCs were located in the vertical plane at a mean depth of 14.9 mum, less than 3 mum above the dermo-epidermal boundary and with a normal histogram distribution. This likely corresponds to the fact that LCs reside in the suprabasal layer (stratum germinativum). The nuclear volume of keratinocytes was found to be approximately 1.4 times larger than that of resident LCs (88.6 mum3). Importantly, the ratio of LCs to keratinocytes in mouse ear skin (1:15) is more than three times higher than that reported for human breast skin (1:53). Accordingly, cross-presentation may be more significant in clinical Gene Gun applications than in pre-clinical mouse studies. These interspecies differences should be considered in pre-clinical trials using mouse models.

A neural network based technique for automatic classification of road cracks

This paper presents a neural network based technique for the classification of segments of road images into cracks and normal images. The density and histogram features are extracted. The features are passed to a neural network for the classification of images into images with and without cracks. Once images are classified into cracks and non-cracks, they are passed to another neural network for the classification of a crack type after segmentation. Some experiments were conducted and promising results were obtained. The selected results and a comparative analysis are included in this paper.

Playing in continuous spaces: Some analysis and extension of population-based incremental learning

As an alternative to traditional evolutionary algorithms (EAs), population-based incremental learning (PBIL) maintains a probabilistic model of the best individual(s). Originally, PBIL was applied in binary search spaces. Recently, some work has been done to extend it to continuous spaces. In this paper, we review two such extensions of PBIL. An improved version of the PBIL based on Gaussian model is proposed that combines two main features: a new updating rule that takes into account all the individuals and their fitness values and a self-adaptive learning rate parameter. Furthermore, a new continuous PBIL employing a histogram probabilistic model is proposed. Some experiments results are presented that highlight the features of the new algorithms.