ppxscal/embedding_network huggingface dataset:
Multiple hypothesis tracking in microscopy images
Authors: Nicolas Chenouard, Isabelle Bloch, Jean-Christophe Olivo-Marin
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

Multiple hypothesis tracking (MHT) is a preferred technique for solving the data association problem in modern multiple target tracking systems. However in bioimaging applications, its use has long been thought impossible due to the prohibitive cost induced by the high number of objects that need to be tracked and the poor quality of images. We show in this paper that this broadly accepted view should change. We propose a MHT algorithm (fMHT) that is fast even when dealing with very noisy images of very numerous targets. We have applied the method to the analysis of two sets of real microscopy images that contain thousands of biological targets. By doing so we prove the benefits of the approach when tracking in very noisy environments such as low-light level fluorescent microscopy images.
Analysis of nerve activity and optical signals from mouse brain stem to identify cells generating respiratory rhythms
Authors: G. Tsechpenakis, J. Eugenin, J. G. Nicholls, K. J. Muller
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

Optical recording of the activity of hundreds of individual neurons simultaneously within the functioning brain is now possible with calcium sensitive dyes. This offers a major advance over the limitations of single-unit recording with arrays of microelectrodes, or with functional MRI. However, the analysis of optical activity to understand neuronal interactions and circuitry underlying physiological functions requires new computational approaches. Recently it has been possible to record optically from the distributed population of neurons in the brain stem generating the respiratory rhythm, breath by breath, using the compact brain stem and spinal cord preparation of the fetal mouse stained in vitro with calcium-sensitive dye. The simultaneous electrical activity of phrenic motoneurons that innervate the diaphragm measures the timing of inspiratory breaths. In the present work, fluorescence micrographs taken at 4 - 100Hz over 20 - 40sec have been analyzed with the simultaneously recorded electrical signal from the phrenic nerve, in a Conditional Random Field framework. This computational analysis will be a useful tool for understanding the cellular circuitry in the living brain controlling fundamental physiological processes.
Novel bounds on the capacity of binary channels with deletions and substitutions
Authors: Dario Fertonani, Tolga M. Duman
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

We present novel bounds on the capacity of binary channels with independent and identically distributed deletions and substitutions. The proposed bounds are obtained by exploiting an auxiliary system where the channel is the same as in the system of interest, but the receiver is provided with (partial) genie-aided information on the deletion/substitution process. In the case of the deletion channel, that is, when no substitutions occur, the proposed upper bound improves the existing ones for most values of the deletion probability, while the proposed lower bound does not. On the other hand, when the channel model also includes substitution errors, both proposed bounds improve the existing ones, significantly narrowing the region to which the actual capacity can belong.
A new forensic model and its application to the collection, extraction and long term storage of screen content off a memory dump
Authors: Stefan Kiltz, Tobias Hoppe, Jana Dittmann
Venue: Proceedings of the 16th international conference on Digital Signal Processing (2009)

In this paper we show how to extract graphics content within a memory dump of a Windows-based system. This includes the assurance of integrity and authenticity of evidence gathered this way using cryptographic mechanisms. We introduce a forensic data model and investigate different forensic analysis steps within a phase-oriented manner to classify potential forensic methods. Furthermore we discuss approaches for long term preservation for the forensic data aquired from the memory dumps to ensure authenticity and integrity.
A multichannel MAC protocol to solve exposed terminal problem in multihop wireless networks
Authors: Xiaoqin Xing, Kai Liu, Hongsheng Lu
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

A novel multichannel MAC protocol to solve exposed terminal problem is presented for efficient channel sharing in multihop wireless networks. It employs request-to-send and clear-to-send (RTS/CTS) dialogue on a common channel and flexibly selects conflict-free traffic channel to transmit data packet based on a novel channel selection scheme. The acknowledgment (ACK) packet is transmitted over another common channel, which effectively eliminates the influence of exposed terminal problem. Finally, simulation results show that the proposed protocol outperforms the CAM-MAC protocol on multiple access performance.
Cooperative relay-broadcast channels with causal channel state information
Authors: Reza Khosravi-Farsani, Bahareh Akhbari, Mahtab Mirrnohseni, Mohammad Reza Aref
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2 (2009)

In this paper, we consider partially and fully cooperative state-dependent relay broadcast channels with perfect causal Channel State Information (CSI). For these two channels, we study three different situations: 1) both the source and the relay nodes have access to perfect CSI, 2) perfect CSI is only known to the relay nodes, 3) perfect CSI is only available at the source node. In each situation we obtain the capacity region for a degraded version of the channel. Our work subsumes previously obtained results for the degraded broadcast and relay channels with perfect causal CSI.
On linear balancing sets
Authors: Arya Mazumdar, Ron M. Roth, Pascal O. Vontobel
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

Let n be an even positive integer and F be the field GF(2). A word in Fn is called balanced if its Hamming weight is n/2. A subset C ⊆ Fn is called a balancing set if for every word y ∈ Fn there is a word x ∈ C such that y + x is balanced. It is shown that most linear subspaces of Fn of dimension slightly larger than 3/2 log2 n are balancing sets. An application of linear balancing sets is presented for designing efficient error-correcting coding schemes in which the codewords are balanced.
Latent capacity region: a case study on symmetric broadcast with common messages
Authors: Chao Tian
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

We consider the problem of broadcast with common messages, and focus on the case that the common message rate RA, i.e., the rate of the message intended for all the receivers in the set A, is the same for all the set A of the same cardinality. Instead of attempting to characterize the capacity region of general broadcast channels, we consider the structure of the capacity region that any broadcast channel should bear. The notion of latent capacity region is required to capture these underlining constraints, and we provide a complete characterization of the latent capacity region for the symmetric broadcast problem. The converse proof of this tight characterization relies on a deterministic broadcast channel model. The achievability proof generalizes the familiar rate transfer argument to include more involved erasure protection coding among messages, thus revealing an inherent connection between broadcast with common message and erasure correction codes.
Mass mobility signaling congestion avoidance mechanism using randomized time distribution of cell reselections
Authors: Tomasz Mach, Rahim Tafazolli
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

This paper presents a novel mechanism which avoids wireless cellular radio access network congestion caused by signaling traffic simultaneously generated by many mobile phones. It applies to the Mobility Management (MM) signaling of the Radio Resource Management (RRM) protocol (cell update procedure). It uses a cell reselection algorithm which decides on which cell UE is camped on when in idle mode (there is no active radio connection with a mobile network). By using a randomized delay of the cell reselection process in different mobile phones, the mechanism improves the overall performance of the Mobility Management protocol in hotspot cell scenarios. A potential benefit of the proposed method is estimated based on a mathematical model with some examples.
Orthogonal multicarrier transmission with modal channel estimation
Authors: Giovanni Garbo, Stefano Mangione, Vincenzo Maniscalco
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

A novel multi-carrier orthogonal transmission scheme is presented. While being simpler to implement, it has a spectral efficiency and design parameters similar to those of Orthogonal Frequency Division Multiplexing based on Offset Quadrature Amplitude Modulation (OFDM/OQAM). A parametric channel estimation technique is subsequently reported. The proposed technique is based on an algorithm obtained from classic Multiple Signal Classification (MUSIC) by relaxation of the hypothesis on the number of measurements with respect to the number of sensors. Numerical simulations show that our proposal outperforms previous works in this field.
Interactive level set segmentation for image-guided therapy
Authors: Nir Ben-Zadok, Tammy Riklin-Raviv, Nahum Kiryati
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

Image-guided therapy procedures require the patient to remain still throughout the image acquisition, data analysis and therapy. This imposes a tight time constraint on the overall process. Automatic extraction of the pathological regions prior to the therapy can be faster than the customary manual segmentation performed by the physician. However, the image data alone is usually not sufficient for reliable and unambiguous computerized segmentation. Thus, the oversight of an experienced physician remains mandatory. We present a novel segmentation framework, that allows user feedback. A few mouse-clicks of the user, discrete in nature, are represented as a continuous energy term that is incorporated into a level-set functional. We demonstrate the proposed method on MR scans of uterine fibroids acquired prior to focused ultrasound ablation treatment. The experiments show that with a minimal user input, automatic segmentation results become practically identical to manual expert segmentation.
Removal of ballistocardiogram artifact from electroencephalograms exploiting heart rate variability
Authors: A. Kosma, K. Nazarpour, S. Sanei
Venue: Proceedings of the 16th international conference on Digital Signal Processing (2009)

An approach for eliminating the cardiac pulsation (ballistocardiogram, BCG) effect from electroencephalograms (EEG) is proposed. The artifact results from functional magnetic resonance imaging (fMRI) scanner during simultaneous EEG-fMRI recordings. The BCG artifact exhibits similar periodic physiological structure. The proposed blind source extraction (BSE) algorithm employs second order statistics to exploit the heart rate variability and focuses on the contaminated EEG segments. This method is compared with some previously developed, well-known algorithms such as FastICA, SOBI and JADE, and a qualitative comparison is given. The methods are examined for both synthetic and real data.
Leveraging social media for training object detectors
Authors: E. Chatzilari, S. Nikolopoulos, I. Kompatsiaris, E. Giannakidou, A. Vakali
Venue: Proceedings of the 16th international conference on Digital Signal Processing (2009)

The fact that most users tend to tag images emotionally rather than realistically makes social datasets inherently flawed from a computer vision perspective. On the other hand they can be particularly useful due to their social context and their potential to grow arbitrary big. Our work shows how a combination of techniques operating on both tag and visual information spaces, manages to leverage the associated weak annotations and produce region-detail training samples. In this direction we make some theoretical observations relating the robustness of the resulting models, the accuracy of the analysis algorithms and the amount of processed data. Experimental evaluation performed against manually trained object detectors reveals the strengths and weaknesses of our approach.
Local detectors for high-resolution spectral analysis: Algorithms and performance
Authors: Morteza Shahram, Peyman Milanfar
Venue: Digital Signal Processing (2005)

This paper develops local signal detection strategies for spectral resolution of frequencies of nearby tones. The problem of interest is to decide whether a received noise-corrupted and discrete signal is a single-frequency sinusoid or a double-frequency sinusoid. This paper presents an extension to M. Shahram and P. Milanfar (On the resolvability of sinusoids with nearby frequencies in the presence of noise, IEEE Trans. Signal Process., to appear, available at http://www.soe.ucsc.edu/~milanfar) the case where the noise variance is unknown. A general signal model is considered where the frequencies, amplitudes, phases and also the level of the noise variance is unknown to the detector. We derive a fundamental trade-off between SNR and the minimum detectable difference between the frequencies of two tones, for any desired decision error rate. We also demonstrate that the algorithm, when implemented in a practical scenario, yields significantly better performance compared to the standard subspace-based methods like MUSIC. It is also observed that the performance for the case where the noise variance is unknown, is very close to that when the noise variance is known to the detector. r.
A universal interpolative filter for low-pass and bandpass signals---CSINC interpolator
Authors: Y. Wu
Venue: Digital Signal Processing (2005)

A FIR csinc interpolative filter design for bandpass signals is presented in this paper. The filter coefficients are calculated from the covariance of basis functions for the bandpass function space. They are invariant with respect to the samples of the input signals. The csinc model also works for low-pass signals as one of the design parameters approaches zero. The performance of the csinc filter is analyzed from the perspectives of accuracy, stability, and adaptation to noise in the samples. Comparisons are made between the csinc model and the existing interpolation models in the literature.
Capacity of relay channels with ISI and colored Gaussian noise
Authors: Chiranjib Choudhuri, Urbashi Mitra
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1 (2009)

The capacity of a degraded relay channel with inter-symbol interference and additive colored Gaussian noise is examined under an input power constraint. Using the classical methodology, a related channel and signal model is developed - the circular degraded relay channel - the capacity of which is shown to be equivalent to that of the channel of interest in the limit of infinite block length. The capacity of circular relay channel is, in turn, determined by the decomposition into parallel degraded relay channels whose individual capacities are given by prior results. Two case studies based on the degraded relay channel with memory and white noise are examined: Common transmission bandwidths on each link and different effective transmission bandwidth over each link.
Monte Carlo simulation with error classification for multipath Rayleigh fading channel
Authors: Liang Dong, Wang Wenbo, Li Yonghua
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

Evaluation of bit error rate (BER) of a digital communication system is usually done via simulation using Monte Carlo (MC) method. For low BER, MC method requires huge sample sizes to achieve certain efficiency. To overcome this limitation, many variance reduction techniques such as importance sampling (IS) have been proposed. In this paper, we put forward a novel simulation method - Monte Carlo simulation with error classification (EC-MC). This method can reduce the estimation variance through dividing the total errors into many subcategories and optimizing the simulation samples for each sub-category. We apply this method in simulations of both single-path Rayleigh fading channel and muitipath Rayleigh fading channel with Orthogonal Space-Time Block Coded MIMO systems. The simulation results demonstrate EC-MC method can achieve the same accuracy at smalier sample sizes and shorter simulation runtime, comparing with both conventional MC and IS methods, especially at high signal to noise ratios.
Improved delay estimates for a queueing model for random linear coding for unicast
Authors: Mohammad Ravanbakhsh, Ángela I. Barbero, Øyvind Ytrehus
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2 (2009)

Consider a lossy communication channel for unicast with zero-delay feedback. For this communication scenario, a simple retransmission scheme is optimum with respect to delay. An alternative approach is to use random linear coding in automatic repeat-request (ARQ) mode. We extend the work of Shrader and Ephremides in [1], by deriving an expression for the delay of random linear coding over a field of infinite size. Simulation results for various field sizes are also provided.
A novel multiple particle tracking algorithm for noisy in vivo data by minimal path optimization within the spatio-temporal volume
Authors: Quan Xue, Mark C. Leake
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

Automated tracking of fluorescent particles in living cells is vital for subcellular stoichoimetry analysis [1, 2]. Here, a new automatic tracking algorithm is described to track multiple particles, based on minimal path optimization. After linking feature points frame-by-frame, spatio-temporal data from time-lapse microscopy are combined together to construct a transformed 3D volume. The trajectories are then generated from the minimal energy path as defined by the solution of the time-dependent partial differential equation using a gray weighted distance transform dynamic programming method. Results from simulated and experimental data demonstrate that our novel automatic method gives sub-pixel accuracy even for very noisy images.
Dynamic QoS aware route optimization for networks with mobility agents
Authors: A. Dev Pragad, Paul Pangalos, Vasilis Friderikos, A. Hamid Aghvami
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

To minimize the large handover delays associated with Mobile IPv6 numerous micro-mobility protocols were proposed. In this paper, we consider the Mobility Agent (MA) based family of micro-mobility protocols such as Hierarchical Mobile IPv6 and Proxy Mobile IPv6 and focus on the issue of the bottlenecks that MAs can lead up to under high network load. We propose a Dynamic QoS aware Route Optimization with the aim of reducing the bottlenecks around MAs. We exploit the fact that not all classes of IP traffic require low handover latency support; for example, P2P traffic, web browsing, etc. do not require high QoS and are delay tolerant. Hence, such traffic classes can be forced to establish a direct connection with the CN and the routing policies at edge routers can ensure these traffic classes bypass the MA. The number of traffic classes that are to bypass the MA increases dynamically according to the congestion of the network. Results show that by implementing the dynamic route optimization the network utilization increases and the average packet delay in the network are reduced.
Recovering a code's length and synchronization from a noisy intercepted bitstream
Authors: Mathieu Cluzeau, Matthieu Finiasz
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

We focus on the problem of recovering the length and synchronization of a linear block code from an intercepted bitstream. We place ourselves in an operational context where the intercepted bitstream contains a realistic noise level. We present two algorithms, one due to Valembois and the other one brand new. They are both useful in different contexts, able to verify if a given length/synchronization is correct. Using them, we were able to practically recover the synchronization of several codes.
A ticket based digital rights management model
Authors: Ming-Kung Sun, Chi-Sung Laih, Hong-Yi Yen, Jyun-Rong Kuo
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

The term Digital Rights Management (DRM) generally refers to a set of policies and techniques that guide the proper use of digital content. Due to the nature of digital content, it is easily modified and distributed. DRM is already progressive in many industries and has received a fair amount of attention in recent years. To prevent multimedia content from being usurped, there is much research which focuses on how to build a reliable DRM system. In this paper, we propose a DRM model to provide improvements for several existing research issues. We use a "ticket" to achieve anonymous consumption and design a protocol to protect against malicious servers. A solution is proposed which addresses these issues and brings more functionality to users.
Service composition in service-oriented wireless sensor networks with persistent queries
Authors: Xiumin Wang, Jianping Wang, Zeyu Zheng, Yinlong Xu, Mei Yang
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Service-oriented wireless sensor network (WSN) has been recently proposed as an architecture to rapidly develop applications in WSNs. In WSNs, a query task may require a set of services and may be carried out repetitively with a given frequency during its lifetime. A service composition solution shall be provided for each execution of such a persistent query task. Due to the energy saving strategy, some sensors may be scheduled to be in sleep mode periodically. Thus, a service composition solution may not always be valid during the lifetime of a persistent query. When a query task needs to be conducted over a new service composition solution, a routing update procedure is involved which consumes energy. In this paper, we study service composition design which minimizes the number of service composition solutions during the lifetime of a persistent query. We also aim to minimize the total service composition cost when the minimum number of required service composition solutions is derived. A greedy algorithm and a dynamic programming algorithm are proposed to complete these two objectives respectively. The optimality of both algorithms provides the service composition solutions for a persistent query with minimum energy consumption.