Detection and Tracking of Traffic Signs Using a Recursive Bayesian Decision Framework

In this paper we propose a new method for the automatic detection and tracking of road traffic signs using an on-board single camera. This method aims to increase the reliability of the detections such that it can boost the performance of any traffic sign recognition scheme. The proposed approach exploits a combination of different features, such as color, appearance, and tracking information. This information is introduced into a recursive Bayesian decision framework, in which prior probabilities are dynamically adapted to tracking results. This decision scheme obtains a number of candidate regions in the image, according to their HS (Hue-Saturation). Finally, a Kalman filter with an adaptive noise tuning provides the required time and spatial coherence to the estimates. Results have shown that the proposed method achieves high detection rates in challenging scenarios, including illumination changes, rapid motion and significant perspective distortion

IDT-3D: Identification and tracking in controlled environments using a 3D unified user interface

Identification and tracking of objects in specific environments such as harbors or security areas is a matter of great importance nowadays. With this purpose, numerous systems based on different technologies have been developed, resulting in a great amount of gathered data displayed through a variety of interfaces. Such amount of information has to be evaluated by human operators in order to take the correct decisions, sometimes under highly critical situations demanding both speed and accuracy. In order to face this problem we describe IDT-3D, a platform for identification and tracking of vessels in a harbour environment able to represent fused information in real time using a Virtual Reality application. The effectiveness of using IDT-3D as an integrated surveillance system is currently under evaluation. Preliminary results point to a significant decrease in the times of reaction and decision making of operators facing up a critical situation. Although the current application focus of IDT-3D is quite specific, the results of this research could be extended to the identification and tracking of targets in other controlled environments of interest as coastlines, borders or even urban areas.

An Efficient Multiple Object Detection and Tracking Framework for Automatic Counting and Video Surveillance Applications

Automatic visual object counting and video surveillance have important applications for home and business environments, such as security and management of access points. However, in order to obtain a satisfactory performance these technologies need professional and expensive hardware, complex installations and setups, and the supervision of qualified workers. In this paper, an efficient visual detection and tracking framework is proposed for the tasks of object counting and surveillance, which meets the requirements of the consumer electronics: off-the-shelf equipment, easy installation and configuration, and unsupervised working conditions. This is accomplished by a novel Bayesian tracking model that can manage multimodal distributions without explicitly computing the association between tracked objects and detections. In addition, it is robust to erroneous, distorted and missing detections. The proposed algorithm is compared with a recent work, also focused on consumer electronics, proving its superior performance.

Two-layer particle filter for multiple target detection and tracking

This paper deals with the detection and tracking of an unknown number of targets using a Bayesian hierarchical model with target labels. To approximate the posterior probability density function, we develop a two-layer particle filter. One deals with track initiation, and the other with track maintenance. In addition, the parallel partition method is proposed to sample the states of the surviving targets.

Subcellular localization and tissue specific expression of amidase 1 from Arabidopsis thaliana

Amidase 1 (AMI1) from Arabidopsis thaliana converts indole-3-acetamide (IAM), into indole-3-acetic acid (IAA). AMI1 is part of a small isogene family comprising seven members in A. thaliana encoding proteins which share a conserved glycine- and serine-rich amidase-signature. One member of this family has been characterized as an N-acylethanolamine-cleaving fatty acid amidohydrolase (FAAH) and two other members are part of the preprotein translocon of the outer envelope of chloroplasts (Toc complex) or mitochondria (Tom complex) and presumably lack enzymatic activity. Among the hitherto characterized proteins of this family, AMI1 is the only member with indole-3-acetamide hydrolase activity, and IAM is the preferred substrate while N-acylethanolamines and oleamide are not hydrolyzed significantly, thus suggesting a role of AMI1 in auxin biosynthesis. Whereas the enzymatic function of AMI1 has been determined in vitro, the subcellular localization of the enzyme remained unclear. By using different GFP-fusion constructs and an A. thaliana transient expression system, we show a cytoplasmic localization of AMI1. In addition, RT-PCR and anti-amidase antisera were used to examine tissue specific expression of AMI1 at the transcriptional and translational level, respectively. AMI1-expression is strongest in places of highest IAA content in the plant. Thus, it is concluded that AMI1 may be involved in de novo IAA synthesis in A. thaliana.

Distributed collaborative processing in wireless sensor networks with application to target localization and beamforming

Abstract The proliferation of wireless sensor networks and the variety of envisioned applications associated with them has motivated the development of distributed algorithms for collaborative processing over networked systems. One of the applications that has attracted the attention of the researchers is that of target localization where the nodes of the network try to estimate the position of an unknown target that lies within its coverage area. Particularly challenging is the problem of estimating the target’s position when we use received signal strength indicator (RSSI) due to the nonlinear relationship between the measured signal and the true position of the target. Many of the existing approaches suffer either from high computational complexity (e.g., particle filters) or lack of accuracy. Further, many of the proposed solutions are centralized which make their application to a sensor network questionable. Depending on the application at hand and, from a practical perspective it could be convenient to find a balance between localization accuracy and complexity. Into this direction we approach the maximum likelihood location estimation problem by solving a suboptimal (and more tractable) problem. One of the main advantages of the proposed scheme is that it allows for a decentralized implementation using distributed processing tools (e.g., consensus and convex optimization) and therefore, it is very suitable to be implemented in real sensor networks. If further accuracy is needed an additional refinement step could be performed around the found solution. Under the assumption of independent noise among the nodes such local search can be done in a fully distributed way using a distributed version of the Gauss-Newton method based on consensus. Regardless of the underlying application or function of the sensor network it is al¬ways necessary to have a mechanism for data reporting. While some approaches use a special kind of nodes (called sink nodes) for data harvesting and forwarding to the outside world, there are however some scenarios where such an approach is impractical or even impossible to deploy. Further, such sink nodes become a bottleneck in terms of traffic flow and power consumption. To overcome these issues instead of using sink nodes for data reporting one could use collaborative beamforming techniques to forward directly the generated data to a base station or gateway to the outside world. In a dis-tributed environment like a sensor network nodes cooperate in order to form a virtual antenna array that can exploit the benefits of multi-antenna communications. In col-laborative beamforming nodes synchronize their phases in order to add constructively at the receiver. Some of the inconveniences associated with collaborative beamforming techniques is that there is no control over the radiation pattern since it is treated as a random quantity. This may cause interference to other coexisting systems and fast bat-tery depletion at the nodes. Since energy-efficiency is a major design issue we consider the development of a distributed collaborative beamforming scheme that maximizes the network lifetime while meeting some quality of service (QoS) requirement at the re¬ceiver side. Using local information about battery status and channel conditions we find distributed algorithms that converge to the optimal centralized beamformer. While in the first part we consider only battery depletion due to communications beamforming, we extend the model to account for more realistic scenarios by the introduction of an additional random energy consumption. It is shown how the new problem generalizes the original one and under which conditions it is easily solvable. By formulating the problem under the energy-efficiency perspective the network’s lifetime is significantly improved. Resumen La proliferación de las redes inalámbricas de sensores junto con la gran variedad de posi¬bles aplicaciones relacionadas, han motivado el desarrollo de herramientas y algoritmos necesarios para el procesado cooperativo en sistemas distribuidos. Una de las aplicaciones que suscitado mayor interés entre la comunidad científica es la de localization, donde el conjunto de nodos de la red intenta estimar la posición de un blanco localizado dentro de su área de cobertura. El problema de la localization es especialmente desafiante cuando se usan niveles de energía de la seal recibida (RSSI por sus siglas en inglés) como medida para la localization. El principal inconveniente reside en el hecho que el nivel de señal recibida no sigue una relación lineal con la posición del blanco. Muchas de las soluciones actuales al problema de localization usando RSSI se basan en complejos esquemas centralizados como filtros de partículas, mientas que en otras se basan en esquemas mucho más simples pero con menor precisión. Además, en muchos casos las estrategias son centralizadas lo que resulta poco prácticos para su implementación en redes de sensores. Desde un punto de vista práctico y de implementation, es conveniente, para ciertos escenarios y aplicaciones, el desarrollo de alternativas que ofrezcan un compromiso entre complejidad y precisión. En esta línea, en lugar de abordar directamente el problema de la estimación de la posición del blanco bajo el criterio de máxima verosimilitud, proponemos usar una formulación subóptima del problema más manejable analíticamente y que ofrece la ventaja de permitir en¬contrar la solución al problema de localization de una forma totalmente distribuida, convirtiéndola así en una solución atractiva dentro del contexto de redes inalámbricas de sensores. Para ello, se usan herramientas de procesado distribuido como los algorit¬mos de consenso y de optimización convexa en sistemas distribuidos. Para aplicaciones donde se requiera de un mayor grado de precisión se propone una estrategia que con¬siste en la optimización local de la función de verosimilitud entorno a la estimación inicialmente obtenida. Esta optimización se puede realizar de forma descentralizada usando una versión basada en consenso del método de Gauss-Newton siempre y cuando asumamos independencia de los ruidos de medida en los diferentes nodos. Independientemente de la aplicación subyacente de la red de sensores, es necesario tener un mecanismo que permita recopilar los datos provenientes de la red de sensores. Una forma de hacerlo es mediante el uso de uno o varios nodos especiales, llamados nodos “sumidero”, (sink en inglés) que actúen como centros recolectores de información y que estarán equipados con hardware adicional que les permita la interacción con el exterior de la red. La principal desventaja de esta estrategia es que dichos nodos se convierten en cuellos de botella en cuanto a tráfico y capacidad de cálculo. Como alter¬nativa se pueden usar técnicas cooperativas de conformación de haz (beamforming en inglés) de manera que el conjunto de la red puede verse como un único sistema virtual de múltiples antenas y, por tanto, que exploten los beneficios que ofrecen las comu¬nicaciones con múltiples antenas. Para ello, los distintos nodos de la red sincronizan sus transmisiones de manera que se produce una interferencia constructiva en el recep¬tor. No obstante, las actuales técnicas se basan en resultados promedios y asintóticos, cuando el número de nodos es muy grande. Para una configuración específica se pierde el control sobre el diagrama de radiación causando posibles interferencias sobre sis¬temas coexistentes o gastando más potencia de la requerida. La eficiencia energética es una cuestión capital en las redes inalámbricas de sensores ya que los nodos están equipados con baterías. Es por tanto muy importante preservar la batería evitando cambios innecesarios y el consecuente aumento de costes. Bajo estas consideraciones, se propone un esquema de conformación de haz que maximice el tiempo de vida útil de la red, entendiendo como tal el máximo tiempo que la red puede estar operativa garantizando unos requisitos de calidad de servicio (QoS por sus siglas en inglés) que permitan una decodificación fiable de la señal recibida en la estación base. Se proponen además algoritmos distribuidos que convergen a la solución centralizada. Inicialmente se considera que la única causa de consumo energético se debe a las comunicaciones con la estación base. Este modelo de consumo energético es modificado para tener en cuenta otras formas de consumo de energía derivadas de procesos inherentes al funcionamiento de la red como la adquisición y procesado de datos, las comunicaciones locales entre nodos, etc. Dicho consumo adicional de energía se modela como una variable aleatoria en cada nodo. Se cambia por tanto, a un escenario probabilístico que generaliza el caso determinista y se proporcionan condiciones bajo las cuales el problema se puede resolver de forma eficiente. Se demuestra que el tiempo de vida de la red mejora de forma significativa usando el criterio propuesto de eficiencia energética.

Damage localization and failure locus under biaxial loading in glass-fiber nonwoven felts

The pattern of damage localization and fracture under uniaxial and biaxial tension was studied in glass–fiber nonwoven felts. The analyses were carried out within the framework of the finite-element simulation of plain and notched specimens in which the microstructure of the felt, made up of fiber bundles connected at the cross point through an organic binder, was explicitly represented. Following previous experimental observations, fracture by interbundle decohesion and energy dissipation by frictional sliding between the bundles were included in the model. It was found that the failure path in these materials was controlled by the maximum applied normal stress, regardless of the loading path, and that the failure locus under biaxial tension was well represented by the von Mises failure criteria. The notch sensitivity of the nonwoven felts was limited and the presence of a notch did not modify the failure path.

Architecture for Text Sign Localization and Recognition

This paper describes a low complexity strategy for detecting and recognizing text signs automatically. Traditional approaches use large image algorithms for detecting the text sign, followed by the application of an Optical Character Recognition (OCR) algorithm in the previously identified areas. This paper proposes a new architecture that applies the OCR to a whole lightly treated image and then carries out the text detection process of the OCR output. The strategy presented in this paper significantly reduces the processing time required for text localization in an image, while guaranteeing a high recognition rate. This strategy will facilitate the incorporation of video processing-based applications into the automatic detection of text sign similar to that of a smartphone. These applications will increase the autonomy of visually impaired people in their daily life.

Multi-resolution model-based traffic sign detection and tracking

In this paper we propose an innovative approach to tackle the problem of traffic sign detection using a computer vision algorithm and taking into account real-time operation constraints, trying to establish intelligent strategies to simplify as much as possible the algorithm complexity and to speed up the process. Firstly, a set of candidates is generated according to a color segmentation stage, followed by a region analysis strategy, where spatial characteristic of previously detected objects are taken into account. Finally, temporal coherence is introduced by means of a tracking scheme, performed using a Kalman filter for each potential candidate. Taking into consideration time constraints, efficiency is achieved two-fold: on the one side, a multi-resolution strategy is adopted for segmentation, where global operation will be applied only to low-resolution images, increasing the resolution to the maximum only when a potential road sign is being tracked. On the other side, we take advantage of the expected spacing between traffic signs. Namely, the tracking of objects of interest allows to generate inhibition areas, which are those ones where no new traffic signs are expected to appear due to the existence of a TS in the neighborhood. The proposed solution has been tested with real sequences in both urban areas and highways, and proved to achieve higher computational efficiency, especially as a result of the multi-resolution approach.

Traffic sign detection and tracking using robust 3D analysis

In this paper we present an innovative technique to tackle the problem of automatic road sign detection and tracking using an on-board stereo camera. It involves a continuous 3D analysis of the road sign during the whole tracking process. Firstly, a color and appearance based model is applied to generate road sign candidates in both stereo images. A sparse disparity map between the left and right images is then created for each candidate by using contour-based and SURF-based matching in the far and short range, respectively. Once the map has been computed, the correspondences are back-projected to generate a cloud of 3D points, and the best-fit plane is computed through RANSAC, ensuring robustness to outliers. Temporal consistency is enforced by means of a Kalman filter, which exploits the intrinsic smoothness of the 3D camera motion in traffic environments. Additionally, the estimation of the plane allows to correct deformations due to perspective, thus easing further sign classification.

Efficient hybrid monocular-stereo approach to on-board, video-based traffic sign detection and tracking

In this paper we propose an innovative method for the automatic detection and tracking of road traffic signs using an onboard stereo camera. It involves a combination of monocular and stereo analysis strategies to increase the reliability of the detections such that it can boost the performance of any traffic sign recognition scheme. Firstly, an adaptive color and appearance based detection is applied at single camera level to generate a set of traffic sign hypotheses. In turn, stereo information allows for sparse 3D reconstruction of potential traffic signs through a SURF-based matching strategy. Namely, the plane that best fits the cloud of 3D points traced back from feature matches is estimated using a RANSAC based approach to improve robustness to outliers. Temporal consistency of the 3D information is ensured through a Kalman-based tracking stage. This also allows for the generation of a predicted 3D traffic sign model, which is in turn used to enhance the previously mentioned color-based detector through a feedback loop, thus improving detection accuracy. The proposed solution has been tested with real sequences under several illumination conditions and in both urban areas and highways, achieving very high detection rates in challenging environments, including rapid motion and significant perspective distortion

The 3′-untranslated region of CaMKIIα is a cis-acting signal for the localization and translation of mRNA in dendrites

Neuronal signaling requires that synaptic proteins be appropriately localized within the cell and regulated there. In mammalian neurons, polyribosomes are found not just in the cell body, but also in dendrites where they are concentrated within or beneath the dendritic spine. The α subunit of Ca2+-calmodulin-dependent protein kinase II (CaMKIIα) is one of only five mRNAs known to be present within the dendrites, as well as in the soma of neurons. This targeted subcellular localization of the mRNA for CaMKIIα provides a possible cell biological mechanism both for controlling the distribution of the cognate protein and for regulating independently the level of protein expression in individual dendritic spines. To characterize the cis-acting elements involved in the localization of dendritic mRNA we have produced two lines of transgenic mice in which the CaMKIIα promoter is used to drive the expression of a lacZ transcript, which either contains or lacks the 3′-untranslated region of the CaMKIIα gene. Although both lines of mice show expression in forebrain neurons that parallels the expression of the endogenous CaMKIIα gene, only the lacZ transcripts bearing the 3′-untranslated region are localized to dendrites. The β-galactosidase protein shows a variable level of expression along the dendritic shaft and within dendritic spines, which suggests that neurons can control the local biochemistry of the dendrite either through differential localization of the mRNA or variations in the translational efficiency at different sites along the dendrite.

Localization and activity of lysyl oxidase within nuclei of fibrogenic cells

Lysyl oxidase (EC 1.4.3.13) oxidizes peptidyl lysine to peptidyl aldehyde residues within collagen and elastin, thus initiating formation of the covalent cross-linkages that insolubilize these extracellular proteins. Recent findings raise the possibility that this enzyme may also function intracellularly. The present study provides evidence by immunocytochemical confocal microscopy, Western blot analysis, enzyme assays, and chemical analyses for lysyl oxidase reaction products that this enzyme is present and active within rat vascular smooth muscle cell nuclei. Confocal microscopy indicates its presence within nuclei of 3T3 fibroblasts, as well.

Presentation of peptide antigens by mouse CD1 requires endosomal localization and protein antigen processing

Mouse CD1(mCD1) molecules have been reported to present two types of antigens: peptides or proteins and the glycolipid α-galactosylceramide. Here, we demonstrate that a protein antigen, chicken ovalbumin (Ova), must be processed to generate peptides presented by mCD1 to CD8+ T cells. The processing and mCD1-mediated presentation of chicken Ova depend on endosomal localization because inhibitors of endosomal acidification and endosomal recycling pathways block T cell reactivity. Furthermore, a cytoplasmic tail mutant of mCD1, which disrupts endosomal localization, has a greatly reduced capacity to present Ova to mCD1 restricted cells. Newly synthesized mCD1 molecules, however, are not required for Ova presentation, suggesting that molecules recycling from the cell surface are needed. Because of these data showing that mCD1 trafficks to endosomes, where it can bind peptides derived from exogenous proteins, we conclude that peptide antigen presentation by mCD1 is likely to be a naturally occurring phenomenon. In competition assays, α-galactosylceramide did not inhibit Ova presentation, and presentation of the glycolipid was not inhibited by excess Ova or the peptide epitope derived from it. This suggests that, although both lipid and peptide presentation may occur naturally, mCD1 may interact differently with these two types of antigens.

Cannabinoid CB1 receptors and ligands in vertebrate retina: Localization and function of an endogenous signaling system

CB1, a cannabinoid receptor enriched in neuronal tissue, was found in high concentration in retinas of rhesus monkey, mouse, rat, chick, goldfish, and tiger salamander by using a subtype-specific polyclonal antibody. Immunolabeling was detected in the two synaptic layers of the retina, the inner and outer plexiform layers, of all six species examined. In the outer plexiform layer, CB1 was located in and/or on cone pedicles and rod spherules. Labeling was detected in some amacrine cells of all species and in the ganglion cells and ganglion cell axons of all species except fish. In addition, sparse labeling was found in the inner and/or outer segments of the photoreceptors of monkey, mouse, rat, and chick. Using GC/MS to detect possible endogenous cannabinoids, we found 3 nmol of 2-arachidonylglycerol per g of tissue, but no anandamide was detectable. Cannabinoid receptor agonists induced a dramatic reduction in the amplitude of voltage-gated L-type calcium channel currents in identified retinal bipolar cells. The presence and distribution of the CB1 receptor, the large amounts of 2-arachidonylglycerol found, and the effects of cannabinoids on calcium channel activity in bipolar cells suggest a substantive role for an endogenous cannabinoid signaling system in retinal physiology, and perhaps vision in general.