Randomized distributed shortest paths algorithms
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A technical introduction to digital video
A technical introduction to digital video
Efficient scheduling of arbitrary task graphs to multiprocessors using a parallel genetic algorithm
Journal of Parallel and Distributed Computing - Special issue on parallel evolutionary computing
IP routing protocols: RIP, OSPF, BGP, PNNI and Cisco routing protocols
IP routing protocols: RIP, OSPF, BGP, PNNI and Cisco routing protocols
Generalized Multiple Description Vector Quantization
DCC '99 Proceedings of the Conference on Data Compression
A recursive random search algorithm for network parameter optimization
ACM SIGMETRICS Performance Evaluation Review
Local Discriminant Wavelet Packet Coordinates for Face Recognition
The Journal of Machine Learning Research
Robust packet image transmission by wavelet coefficient dispersement
ICASSP '01 Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03
A genetic algorithm for energy-efficient based multicast routing on MANETs
Computer Communications
On shortest path representation
IEEE/ACM Transactions on Networking (TON)
Solving shortest path problem using particle swarm optimization
Applied Soft Computing
Distributed media rate allocation in multipath networks
Image Communication
Handbook of Parametric and Nonparametric Statistical Procedures
Handbook of Parametric and Nonparametric Statistical Procedures
Nonsubsampled higher-density discrete wavelet transform for image denoising
ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
Design of Qos Anycast Network Cluster Balance Based on Genetic Algorithm
ICSPS '09 Proceedings of the 2009 International Conference on Signal Processing Systems
Differential evolution using a neighborhood-based mutation operator
IEEE Transactions on Evolutionary Computation
JADE: adaptive differential evolution with optional external archive
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Multi-objective Ant Colony Optimization Algorithm for Shortest Route Problem
MVHI '10 Proceedings of the 2010 International Conference on Machine Vision and Human-machine Interface
Applying an evolutionary algorithm to telecommunication networkdesign
IEEE Transactions on Evolutionary Computation
A genetic algorithm for shortest path routing problem and the sizing of populations
IEEE Transactions on Evolutionary Computation
A genetic algorithm for designing distributed computer networktopologies
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Multiple description coding in networks with congestion problem
IEEE Transactions on Information Theory
Multiple description coding with many channels
IEEE Transactions on Information Theory
Rainbow Network Flow of Multiple Description Codes
IEEE Transactions on Information Theory
Design of multiple description scalar quantizers
IEEE Transactions on Information Theory
Permuted smoothed descriptions and refinement coding for images
IEEE Journal on Selected Areas in Communications
Multiple description wavelet based image coding
IEEE Transactions on Image Processing
A new, fast, and efficient image codec based on set partitioning in hierarchical trees
IEEE Transactions on Circuits and Systems for Video Technology
Efficient Multiple-Description Image Coding Using Directional Lifting-Based Transform
IEEE Transactions on Circuits and Systems for Video Technology
| Hi-index | 0.00 |
Optimal multipath selection to maximize the received multiple description coding (MDCs) in a lossy network model is proposed. Multiple description scalar quantization (MDSQ) has been applied to the wavelet coefficients of a color image to generate the MDCs which are combating transmission loss over lossy networks. In the networks, each received description raises the reconstruction quality of an MDC-coded signal (image, audio or video). In terms of maximizing the received descriptions, a greater number of optimal routings between source and destination must be obtained. The rainbow network flow (RNF) collaborated with effective meta-heuristic algorithms is a good approach to resolve it. Two meta-heuristic algorithms which are genetic algorithm (GA) and particle swarm optimization (PSO) have been utilized to solve the multi-objective optimization routing problem for finding optimal routings each of which is assigned as a distinct color by RNF to maximize the coded descriptions in a network model. By employing a local search based priority encoding method, each individual in GA and particle in PSO is represented as a potential solution. The proposed algorithms are compared with the multipath Dijkstra algorithm (MDA) for both finding optimal paths and providing reliable multimedia communication. The simulations run over various random network topologies and the results show that the PSO algorithm finds optimal routings effectively and maximizes the received MDCs with assistance of RNF, leading to reduce packet loss and increase throughput.