Segment-based Scheme Research Articles

Fuzzy Filtering-Based Segment Grouping for User-Centered Multimedia Streaming Service in P2P Distribution Mobile Networks

Segment-based proxy caching schemes are recently proposed to provide direct services of required media objects from the proxy without the help of media servers in P2P distribution mobile networks. These segment-based schemes, however, have such problems as jitter latency, congestion, interference, and re-transmission due to large data size, startup latency, and continuous synchronization of media objects. Thus this paper proposes a new FFSG (Fuzzy Filtering-based Segment Grouping) scheme for user-centered media streaming services to solve problems. The proposed scheme manages media objects in segments of FPRB (Fixed Partition Reference Block) or VPRB (Variable Partition Reference Block). Media objects are grouped as blocks of same fixed size in FPRB and as blocks of variable size in VPRB. The proposed scheme used semantic relationship for the grouping of divided media objects and used fuzzy relevance to filter out less relevant segments. The simulation result showed the improvements in average response ratio, cache hit ratio, startup latency rate, and service quality of streaming service.

Intelligent p-Cycle Protection for Dynamic Multicast Sessions in WDM Networks

In WDM networks, it is important to maintain the survivability of communication sessions when link failure occurs due to the high bandwidth provided by a fiber link. Link failures have more serious impact on multicast sessions than on unicast sessions since a link used by a multicast session may carry traffic to multiple destinations. Thus, it is more critical to protect multicast sessions against single link failures. Researchers have proposed various protection schemes for multicast sessions, including tree-based, path-based, and segment-based schemes. Tree-based schemes suffer excessive use of network capacity, whereas path-based and segment-based schemes require long restoration times. In this paper, we propose a new p-cycle-based dynamic multicast protection scheme named IpC, which achieves both fast restoration and high capacity efficiency. The main feature of IpC is that it computes high efficiency p-cycles on demand to protect dynamic multicast sessions as they arrive. Extensive simulations have been conducted to evaluate the proposed IpC scheme, and the results show that it outperforms an existing p-cycle-based scheme.

Stone detection in MRCP images using controlled region growing

Stones in the biliary tract are routinely identified using MRCP (magnetic resonance cholangiopancreatography). The noisy nature of the images, as well as varying intensity, size and location of the stones, defeat most automatic detection algorithms, making computer-aided diagnosis difficult. This paper proposes a multi-stage segment-based scheme for semi-automated detection of choledocholithiasis and cholelithiasis in the MRCP images, producing good performance in tests, differentiating them from “normal” MRCP images. With the high success rate of over 90%, refinement of the scheme could be applicable in the clinical environment as a tool in aiding diagnosis, with possible applications in telemedicine.