Time filter

Source Type

Basu S.,National University of Singapore | Kulikova M.,University Pierre and Marie Curie | Zhizhina E.,Institute of Information Transmission Problems | Ooi W.T.,National University of Singapore | And 2 more authors.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2013

Tubular structures are frequently encountered in bio-medical images. The center-lines of these tubules provide an accurate representation of the topology of the structures. We introduce a stochastic Marked Point Process framework for fully automatic extraction of tubular structures requiring no user interaction or seed points for initialization. Our Marked Point Process model enables unsupervised network extraction by fitting a configuration of objects with globally optimal associated energy to the centreline of the arbors. For this purpose we propose special configurations of marked objects and an energy function well adapted for detection of 3D tubular branches. The optimization of the energy function is achieved by a stochastic, discrete-time multiple birth and death dynamics. Our method finds the centreline, local width and orientation of neuronal arbors and identifies critical nodes like bifurcations and terminals. The proposed model is tested on 3D light microscopy images from the DIADEM data set with promising results. © 2013 Springer-Verlag.


Basu S.,National University of Singapore | Kulikova M.,University Pierre and Marie Curie | Zhizhina E.,Institute of Information Transmission Problems | Ooi W.T.,National University of Singapore | Racoceanu D.,University Pierre and Marie Curie
Medical image computing and computer-assisted intervention : MICCAI ... International Conference on Medical Image Computing and Computer-Assisted Intervention | Year: 2013

Tubular structures are frequently encountered in bio-medical images. The center-lines of these tubules provide an accurate representation of the topology of the structures. We introduce a stochastic Marked Point Process framework for fully automatic extraction of tubular structures requiring no user interaction or seed points for initialization. Our Marked Point Process model enables unsupervised network extraction by fitting a configuration of objects with globally optimal associated energy to the centreline of the arbors. For this purpose we propose special configurations of marked objects and an energy function well adapted for detection of 3D tubular branches. The optimization of the energy function is achieved by a stochastic, discrete-time multiple birth and death dynamics. Our method finds the centreline, local width and orientation of neuronal arbors and identifies critical nodes like bifurcations and terminals. The proposed model is tested on 3D light microscopy images from the DIADEM data set with promising results.


Ershov E.,Institute of Information Transmission Problems | Karnaukhov V.,Institute of Information Transmission Problems | Mozerov M.,Institute of Information Transmission Problems
Optical Engineering | Year: 2016

Two consecutive frames of a lateral navigation camera video sequence can be considered as an appropriate approximation to epipolar stereo. To overcome edge-aware inaccuracy caused by occlusion, we propose a model that matches the current frame to the next and to the previous ones. The positive disparity of matching to the previous frame has its symmetric negative disparity to the next frame. The proposed algorithm performs probabilistic choice for each matched pixel between the positive disparity and its symmetric disparity cost. A disparity map obtained by optimization over the cost volume composed of the proposed probabilistic choice is more accurate than the traditional left-to-right and right-to-left disparity maps cross-check. Also, our algorithm needs two times less computational operations per pixel than the cross-check technique. The effectiveness of our approach is demonstrated on synthetic data and real video sequences, with ground-truth value. © 2016 Society of Photo-Optical Instrumentation Engineers (SPIE).


Blinovsky V.,Institute of Information Transmission Problems | Litsyn S.,Tel Aviv University
Discrete and Computational Geometry | Year: 2011

Using lower bounds on components of the distance spectrum of a code on the Euclidean sphere obtained by linear programming, we derive new, better than known, upper bounds on the size of multiple packings of spherical caps on the surface of the sphere. © 2011 Springer Science+Business Media, LLC.


Veretennikov A.Y.,University of Leeds | Veretennikov A.Y.,Institute of Information Transmission Problems
Queueing Systems | Year: 2014

Polynomial convergence rates in total variation are established in Erlang-Sevastyanov type problems with an infinite number of servers and a general distribution of service under assumptions on the intensity of service. © 2014 Springer Science+Business Media New York.


Blinovsky V.,Institute of Information Transmission Problems | Erez U.,Tel Aviv University | Litsyn S.,Tel Aviv University
Designs, Codes, and Cryptography | Year: 2010

A simple method is proposed for the calculation of moments of the weight function of a random linear code. Applying this method we compute the exact expression for the third-order covariance of the weight function. The results are also extended to random coset codes. © 2009 Springer Science+Business Media, LLC.


Blinovsky V.,Institute of Information Transmission Problems
IEEE International Symposium on Information Theory - Proceedings | Year: 2011

We complete the derivation of the formula for the reliability function of q-ary symmetric channel under list decoding for zero rate. © 2011 IEEE.

Loading Institute of Information Transmission Problems collaborators
Loading Institute of Information Transmission Problems collaborators