9 resultados para self-adaptive


Relevância:

60.00% 60.00%

Publicador:

Resumo:

This paper proposes a novel image denoising technique based on the normal inverse Gaussian (NIG) density model using an extended non-negative sparse coding (NNSC) algorithm proposed by us. This algorithm can converge to feature basis vectors, which behave in the locality and orientation in spatial and frequency domain. Here, we demonstrate that the NIG density provides a very good fitness to the non-negative sparse data. In the denoising process, by exploiting a NIG-based maximum a posteriori estimator (MAP) of an image corrupted by additive Gaussian noise, the noise can be reduced successfully. This shrinkage technique, also referred to as the NNSC shrinkage technique, is self-adaptive to the statistical properties of image data. This denoising method is evaluated by values of the normalized signal to noise rate (SNR). Experimental results show that the NNSC shrinkage approach is indeed efficient and effective in denoising. Otherwise, we also compare the effectiveness of the NNSC shrinkage method with methods of standard sparse coding shrinkage, wavelet-based shrinkage and the Wiener filter. The simulation results show that our method outperforms the three kinds of denoising approaches mentioned above.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

In a decision feedback equalizer (DFE), the structural parameters, including the decision delay, the feedforward filter (FFF), and feedback filter (FBF) lengths, must be carefully chosen, as they greatly influence the performance. Although the FBF length can be set as the channel memory, there is no closed-form expression for the FFF length and decision delay. In this letter, first we analytically show that the two-dimensional search for the optimum FFF length and decision delay can be simplified to a one-dimensional search and then describe a new adaptive DFE where the optimum structural parameters can he self-adapted.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Abstract Adaptability to changing circumstances is a key feature of living creatures. Understanding such adaptive processes is central to developing successful autonomous artifacts. In this paper two perspectives are brought to bear on the issue of adaptability. The first is a short term perspective which looks at adaptability in terms of the interactions between the agent and the environment. The second perspective involves a hierarchical evolutionary model which seeks to identify higher-order forms of adaptability based on the concept of adaptive meta-constructs. Task orientated and agent-centered models of adaptive processes in artifacts are considered from these two perspectives. The former isrepresented by the fitness function approach found in evolutionary learning, and the latter in terms of the concepts of empowerment and homeokinesis found in models derived from the self-organizing systems approach. A meta-construct approach to adaptability based on the identification of higher level meta-metrics is also outlined. 2009 Published by Elsevier B.V.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Shape Memory Alloy (SMA) actuators, which have the ability to return to a predetermined shape when heated, have many potential applications such as aeronautics, surgical tools, robotics and so on. Although the conventional PID controller can be used with slow response systems, there has been limited success in precise motion control of SMA actuators, since the systems are disturbed by unknown factors beside their inherent nonlinear hysteresis and changes in the surrounding environment of the systems. This paper presents a new development of a SMA position control system by using a self-tuning fuzzy PID controller. This control algorithm is used by tuning the parameters of the PID controller thereby integrating fuzzy inference and producing a fuzzy adaptive PID controller, which can then be used to improve the control performance of nonlinear systems. The experimental results of position control of SMA actuators using conventional and self-tuning fuzzy PID controllers are both included in this paper.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

In this paper we present an Orientation Free Adaptive Step Detection (OFASD) algorithm for deployment in a smart phone for the purposes of physical activity monitoring. The OFASD algorithm detects individual steps and measures a user’s step counts using the smart phone’s in-built accelerometer. The algorithm considers both the variance of an individual’s walking pattern and the orientation of the smart phone. Experimental validation of the algorithm involved the collection of data from 10 participants using five phones (worn at five different body positions) whilst walking on a treadmill at a controlled speed for periods of 5 min. Results indicated that, for steps detected by the OFASD algorithm, there were no significant differences between where the phones were placed on the body (p > 0.05). The mean step detection accuracies ranged from 93.4 % to 96.4 %. Compared to measurements acquired using existing dedicated commercial devices, the results demonstrated that using a smart phone for monitoring physical activity is promising, as it adds value to an accepted everyday accessory, whilst imposing minimum interaction from the user. The algorithm can be used as the underlying component within an application deployed within a smart phone designed to promote self-management of chronic disease where activity measurement is a significant factor, as it provides a practical solution, with minimal requirements for user intervention and less constraints than current solutions.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

We present a fully-distributed self-healing algorithm DEX, that maintains a constant degree expander network in a dynamic setting. To the best of our knowledge, our algorithm provides the first efficient distributed construction of expanders - whose expansion properties hold deterministically - that works even under an all-powerful adaptive adversary that controls the dynamic changes to the network (the adversary has unlimited computational power and knowledge of the entire network state, can decide which nodes join and leave and at what time, and knows the past random choices made by the algorithm). Previous distributed expander constructions typically provide only probabilistic guarantees on the network expansion which rapidly degrade in a dynamic setting, in particular, the expansion properties can degrade even more rapidly under adversarial insertions and deletions. Our algorithm provides efficient maintenance and incurs a low overhead per insertion/deletion by an adaptive adversary: only O(log n) rounds and O(log n) messages are needed with high probability (n is the number of nodes currently in the network). The algorithm requires only a constant number of topology changes. Moreover, our algorithm allows for an efficient implementation and maintenance of a distributed hash table (DHT) on top of DEX, with only a constant additional overhead. Our results are a step towards implementing efficient self-healing networks that have guaranteed properties (constant bounded degree and expansion) despite dynamic changes.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

We present a fully-distributed self-healing algorithm dex that maintains a constant degree expander network in a dynamic setting. To the best of our knowledge, our algorithm provides the first efficient distributed construction of expanders—whose expansion properties holddeterministically—that works even under an all-powerful adaptive adversary that controls the dynamic changes to the network (the adversary has unlimited computational power and knowledge of the entire network state, can decide which nodes join and leave and at what time, and knows the past random choices made by the algorithm). Previous distributed expander constructions typically provide only probabilistic guarantees on the network expansion whichrapidly degrade in a dynamic setting; in particular, the expansion properties can degrade even more rapidly under adversarial insertions and deletions. Our algorithm provides efficient maintenance and incurs a low overhead per insertion/deletion by an adaptive adversary: only O(logn)O(log⁡n) rounds and O(logn)O(log⁡n) messages are needed with high probability (n is the number of nodes currently in the network). The algorithm requires only a constant number of topology changes. Moreover, our algorithm allows for an efficient implementation and maintenance of a distributed hash table on top of dex  with only a constant additional overhead. Our results are a step towards implementing efficient self-healing networks that have guaranteed properties (constant bounded degree and expansion) despite dynamic changes.

Gopal Pandurangan has been supported in part by Nanyang Technological University Grant M58110000, Singapore Ministry of Education (MOE) Academic Research Fund (AcRF) Tier 2 Grant MOE2010-T2-2-082, MOE AcRF Tier 1 Grant MOE2012-T1-001-094, and the United States-Israel Binational Science Foundation (BSF) Grant 2008348. Peter Robinson has been supported by Grant MOE2011-T2-2-042 “Fault-tolerant Communication Complexity in Wireless Networks” from the Singapore MoE AcRF-2. Work done in part while the author was at the Nanyang Technological University and at the National University of Singapore. Amitabh Trehan has been supported by the Israeli Centers of Research Excellence (I-CORE) program (Center No. 4/11). Work done in part while the author was at Hebrew University of Jerusalem and at the Technion and supported by a Technion fellowship.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

OBJECTIVE: To compare visual and refractive outcomes between self-refracting spectacles (Adaptive Eyecare, Ltd, Oxford, UK), noncycloplegic autorefraction, and cycloplegic subjective refraction. DESIGN: Cross-sectional study. PARTICIPANTS: Chinese school-children aged 12 to 17 years. METHODS: Children with uncorrected visual acuity ≤ 6/12 in either eye underwent measurement of the logarithm of the minimum angle of resolution visual acuity, habitual correction, self-refraction without cycloplegia, autorefraction with and without cycloplegia, and subjective refraction with cycloplegia. MAIN OUTCOME MEASURES: Proportion of children achieving corrected visual acuity ≥ 6/7.5 with each modality; difference in spherical equivalent refractive error between each of the modalities and cycloplegic subjective refractive error. RESULTS: Among 556 eligible children of consenting parents, 554 (99.6%) completed self-refraction (mean age, 13.8 years; 59.7% girls; 54.0% currently wearing glasses). The proportion of children with visual acuity ≥ 6/7.5 in the better eye with habitual correction, self-refraction, noncycloplegic autorefraction, and cycloplegic subjective refraction were 34.8%, 92.4%, 99.5% and 99.8%, respectively (self-refraction versus cycloplegic subjective refraction, P<0.001). The mean difference between cycloplegic subjective refraction and noncycloplegic autorefraction (which was more myopic) was significant (-0.328 diopter [D]; Wilcoxon signed-rank test P<0.001), whereas cycloplegic subjective refraction and self-refraction did not differ significantly (-0.009 D; Wilcoxon signed-rank test P = 0.33). Spherical equivalent differed by ≥ 1.0 D in either direction from cycloplegic subjective refraction more frequently among right eyes for self-refraction (11.2%) than noncycloplegic autorefraction (6.0%; P = 0.002). Self-refraction power that differed by ≥ 1.0 D from cycloplegic subjective refractive error (11.2%) was significantly associated with presenting without spectacles (P = 0.011) and with greater absolute power of both spherical (P = 0.025) and cylindrical (P = 0.022) refractive error. CONCLUSIONS: Self-refraction seems to be less prone to accommodative inaccuracy than noncycloplegic autorefraction, another modality appropriate for use in areas where access to eye care providers is limited. Visual results seem to be comparable. Greater cylindrical power is associated with less accurate results; the adjustable glasses used in this study cannot correct astigmatism. Further studies of the practical applications of this modality are warranted. FINANCIAL DISCLOSURE(S): Proprietary or commercial disclosure may be found after the references.