13 research outputs found

    Vectors of Locally Aggregated Centers for Compact Video Representation

    Full text link
    We propose a novel vector aggregation technique for compact video representation, with application in accurate similarity detection within large video datasets. The current state-of-the-art in visual search is formed by the vector of locally aggregated descriptors (VLAD) of Jegou et. al. VLAD generates compact video representations based on scale-invariant feature transform (SIFT) vectors (extracted per frame) and local feature centers computed over a training set. With the aim to increase robustness to visual distortions, we propose a new approach that operates at a coarser level in the feature representation. We create vectors of locally aggregated centers (VLAC) by first clustering SIFT features to obtain local feature centers (LFCs) and then encoding the latter with respect to given centers of local feature centers (CLFCs), extracted from a training set. The sum-of-differences between the LFCs and the CLFCs are aggregated to generate an extremely-compact video description used for accurate video segment similarity detection. Experimentation using a video dataset, comprising more than 1000 minutes of content from the Open Video Project, shows that VLAC obtains substantial gains in terms of mean Average Precision (mAP) against VLAD and the hyper-pooling method of Douze et. al., under the same compaction factor and the same set of distortions.Comment: Proc. IEEE International Conference on Multimedia and Expo, ICME 2015, Torino, Ital

    Fast Desynchronization For Decentralized Multichannel Medium Access Control

    Get PDF
    Distributed desynchronization algorithms are key to wireless sensor networks as they allow for medium access control in a decentralized manner. In this paper, we view desynchronization primitives as iterative methods that solve optimization problems. In particular, by formalizing a well established desynchronization algorithm as a gradient descent method, we establish novel upper bounds on the number of iterations required to reach convergence. Moreover, by using Nesterov's accelerated gradient method, we propose a novel desynchronization primitive that provides for faster convergence to the steady state. Importantly, we propose a novel algorithm that leads to decentralized time-synchronous multichannel TDMA coordination by formulating this task as an optimization problem. Our simulations and experiments on a densely-connected IEEE 802.15.4-based wireless sensor network demonstrate that our scheme provides for faster convergence to the steady state, robustness to hidden nodes, higher network throughput and comparable power dissipation with respect to the recently standardized IEEE 802.15.4e-2012 time-synchronized channel hopping (TSCH) scheme.Comment: to appear in IEEE Transactions on Communication

    Convergence of Desynchronization Primitives in Wireless Sensor Networks: A Stochastic Modeling Approach

    Get PDF
    Desynchronization approaches in wireless sensor networks converge to time-division multiple access (TDMA) of the shared medium without requiring clock synchronization amongst the wireless sensors, or indeed the presence of a central (coordinator) node. All such methods are based on the principle of reactive listening of periodic "fire" or "pulse" broadcasts: each node updates the time of its fire message broadcasts based on received fire messages from some of the remaining nodes sharing the given spectrum. In this paper, we present a novel framework to estimate the required iterations for convergence to fair TDMA scheduling. Our estimates are fundamentally different from previous conjectures or bounds found in the literature as, for the first time, convergence to TDMA is defined in a stochastic sense. Our analytic results apply to the Desync algorithm and to pulse-coupled oscillator algorithms with inhibitory coupling. The experimental evaluation via iMote2 TinyOS nodes (based on the IEEE 802.15.4 standard) as well as via computer simulations demonstrates that, for the vast majority of settings, our stochastic model is within one standard deviation from the experimentally-observed convergence iterations. The proposed estimates are thus shown to characterize the desynchronization convergence iterations significantly better than existing conjectures or bounds. Therefore, they contribute towards the analytic understanding of how a desynchronization-based system is expected to evolve from random initial conditions to the desynchronized steady state.Comment: to appear, IEEE Transactions on Signal Processing, 201

    Perceptual video quality estimation by regression with myopic experts

    Get PDF
    Objective video quality metrics can be viewed as 'myopic' expert systems that focus on particular aspects of visual information in video, such as image edges or motion parameters. We conjecture that the combination of many such high-level metrics leads to statistically-significant improvement in the prediction of reference-based perceptual video quality in comparison to each individual metric. To examine this hypothesis in a systematic and rigorous manner, we use: (i) the LIVE and the EPFL/PoliMi databases that provide the difference mean opinion scores (DMOS) for several video sequences under encoding and packet-loss errors; (ii) ten well-known metrics that range from mean-squared error based criteria to sophisticated visual quality estimators; (iii) five variants of regression-based supervised learning. For 400 experimental trials with random (non-overlapping) estimation and prediction subsets taken from both databases, we show that the best of our regression methods: (i) leads to statistically-significant improvement against the best individual metrics for DMOS prediction for more than 97% of the experimental trials; (ii) is statistically-equivalent to the performance of humans rating the video quality for 36.75% of the experiments with the EPFL/PoliMi database. On the contrary, no single metric achieves such statistical equivalence to human raters in any of the experimental trials

    Decentralized Time-Synchronized Channel Swapping for Ad Hoc Wireless Networks

    Get PDF
    International audienceTime-synchronized channel hopping (TSCH) is currently the most efficient solution for collision-free, interferenceavoiding communications in ad hoc wireless networks, such as wireless sensor networks, vehicular networks, and networks of robots or drones. However, all variants of TSCH require some form of centralized coordination to maintain the time-frequency slotting mechanism. This leads to slow convergence to steady state and moderate time-frequency slot utilization, especially under node churn or mobility. We propose decentralized timesynchronized channel swapping (DT-SCS), a novel protocol for medium access control (MAC) in ad hoc wireless networks. Under the proposed protocol, nodes first converge to synchronous beacon packet transmissions across all available channels at the physical layer, with balanced number of nodes in each channel. This is done by the novel coupling of distributed synchronization and desynchronization mechanisms—which are based on the concept of pulse-coupled oscillators—at the MAC layer. Decentralized channel swapping can then take place via peer-to-peer swap requests/acknowledgments made between concurrent transmitters in neighboring channels. We benchmark the convergence and network throughput of DT-SCS, TSCH and the Efficient Multichannel MAC (EM-MAC) protocol (seen as the state-of-the-art in decentralized, interference-avoiding, multichannel MAC protocols) under simulated packet losses at the MAC layer. Moreover, performance results via a Contikibased deployment on TelosB motes reveal that DT-SCS comprises an excellent candidate for decentralized multichannel MAC layer coordination by providing for: quick convergence to steady state,high bandwidth utilization under interference and hidden nodes,and high connectivity

    Oral cancer treatment costs in Greece and the effect of advanced disease

    Get PDF
    BACKGROUND: The main purpose of the study was to quantify the direct costs of oral cancer treatment to the healthcare system of Greece. Another aim was to identify factors that affect costs and potential cost reduction items. More specifically, we examined the relationship between stage of disease, modality of treatment and total direct costs. METHODS: The medical records and clinic files of the Oral and Maxillofacial Clinic of the Athens General Hospital "Genimatas" were abstracted to investigate clinical treatment characteristics, including length of hospitalization, modes of treatment, stage of disease etc. Records of 95 patients with oral squamous cell carcinoma (OSSC), with at least six months of follow-up, were examined. The clinical data was then used to calculate actual direct costs, based on 2001 market values. RESULTS: The mean total direct costs for OSSC treatment estimated at euro 8,450 or approximately US$ 7,450. Costs depended on the stage of the disease, with significant increases in stages III and IV, as compared with stages I and II (p < 0.05). Multi-modality treatment applied mainly to patients in stages III and IV was the factor that affected the cost. Disease stage was also associated with the total duration of hospitalization (p < 0.05). CONCLUSIONS: The clinical management of advanced oral cancer is strongly associated with higher costs. Although the ideal would be to prevent cancer, the combination of high-risk screening, early diagnosis and early treatment seems the most efficient way to reduce costs, and most importantly, prolong life

    Oral cancer treatment costs in Greece and the effect of advanced disease

    No full text
    <p>Abstract</p> <p>Background</p> <p>The main purpose of the study was to quantify the direct costs of oral cancer treatment to the healthcare system of Greece. Another aim was to identify factors that affect costs and potential cost reduction items. More specifically, we examined the relationship between stage of disease, modality of treatment and total direct costs.</p> <p>Methods</p> <p>The medical records and clinic files of the Oral and Maxillofacial Clinic of the Athens General Hospital "Genimatas" were abstracted to investigate clinical treatment characteristics, including length of hospitalization, modes of treatment, stage of disease etc. Records of 95 patients with oral squamous cell carcinoma (OSSC), with at least six months of follow-up, were examined. The clinical data was then used to calculate actual direct costs, based on 2001 market values.</p> <p>Results</p> <p>The mean total direct costs for OSSC treatment estimated at euro 8,450 or approximately US$ 7,450. Costs depended on the stage of the disease, with significant increases in stages III and IV, as compared with stages I and II (p < 0.05). Multi-modality treatment applied mainly to patients in stages III and IV was the factor that affected the cost. Disease stage was also associated with the total duration of hospitalization (p < 0.05).</p> <p>Conclusions</p> <p>The clinical management of advanced oral cancer is strongly associated with higher costs. Although the ideal would be to prevent cancer, the combination of high-risk screening, early diagnosis and early treatment seems the most efficient way to reduce costs, and most importantly, prolong life.</p

    Decentralized time-synchronized channel swapping

    No full text
    corecore