Geometric and colorimetric error compensation for multi-view images

In general, excessive colorimetric and geometric errors in multi-view images induce visual fatigue to users. Various works have been proposed to reduce these errors, but conventional works have only been available for stereoscopic images while requiring cumbersome additional tasks, and often showing unstable results. In this paper, we propose an effective multi-view image refinement algorithm. The proposed algorithm analyzes such errors in multi-view images from sparse correspondences and compensates them automatically. While the conventional works transform every view to compensate geometric errors, the proposed method transforms only the source views with consideration of a reference view. Therefore this approach can be extended regardless of the number of views. In addition, we also employ uniform view intervals to provide consistent depth perception among views. We correct color inconsistency among views from the correspondences by considering importance and channel properties. Various experimental results show that the proposed algorithm outperforms conventional approaches and generates more visually comfortable multi-view images.     

Performance evaluation of input and output queueing techniques inATM switching systems

Modeling alternatives for a fast packet switching system are analyzed. A nonblocking switch fabric that runs at the same speed as the input/output links is considered. The performance of the considered approaches are derived by theoretical analysis and computer simulations. Performance comparison between input queueing approaches with different selection policies are presented. Novel input and output queueing techniques are also proposed. In particular it is shown that, depending on the implementation, the input queueing approach studied in this paper achieves the same performance as the optimum (output) queueing alternative, without resorting to a faster packet switch fabric     

Un modèle générique multi-niveaux pour la recherche d’image par le contenu

In this paper we propose a generic model for content image modelling. The model is based on several levels of information. Each level is called view and relates to a class of information. We distinguish three types of views: the concept, relation and interpretation views. The view concept or relation makes it possible to define respectively the concepts or the calculable relations automatically that do not require any particular interpretation. The view interpretation relates to the interpretation of the contents of the image. The number, the nature and the contents of each view are adaptable and can vary according to the type of application. The operational model is based on the nested conceptual graphs which we extended. The model is implemented and operational and the results obtained are very encouraging.     

Various density light field image coding based on distortion minimization interpolation

In recent years, the light field (LF) as a new imaging modality has attracted wide interest. The large data volume of LF images poses great challenge to LF image coding, and the LF images captured by different devices show significant differences in angular domain. In this paper we propose a view prediction framework to handle LF image coding with various sampling density. All LF images are represented as view arrays. We first partition the views into reference view (RV) set and intermediate view (IV) set. The RVs are rearranged into a pseudo sequence and directly compressed by a video encoder. Other views are then predicted by the RVs. To exploit the four dimensional signal structure, we propose the linear approximation prior (LAP) to reveal the correlation among LF views and efficiently remove the LF data redundancy. Based on the LAP, a distortion minimization interpolation (DMI) method is used to predict IVs. To robustly handle the LF images with different sampling density, we propose an Iteratively Updating depth image based rendering (IU-DIBR) method to extend our DMI. Some auxiliary views are generated to cover the target region and then the DMI calculates reconstruction coefficients for the IVs. Different view partition patterns are also explored. Extensive experiments on different types LF images also valid the efficiency of the proposed method.     

A topology-independent wireless fair queueing model in ad hoc networks

Fair queueing of rate and delay-sensitive packet flows in a shared-medium, multihop wireless network is challenging due to the unique design issues. These issues include: 1) spatial contention among transmitting flows in a spatial locality, as well as spatial reuse of bandwidth through concurrent flow transmissions in different network locations; 2) conflicts between ensuring fairness and maximizing spatial channel reuse; and 3) the distributed nature of ad hoc fair queueing. In this paper, we propose a new topology-independent fair queueing model for a shared-medium ad hoc network. Our fairness model ensures coordinated fair channel access among spatially contending flows, while seeking to maximize spatial reuse of bandwidth. We describe packetized algorithms that realize the fluid fairness model with analytical performance bounds. We further design a distributed implementation which approximates the ideal centralized algorithm. We present simulations and analysis on the performance of our proposed algorithms.     

Analysis of Traffic Distribution and Blocking Probability in Future Wireless Networks

Future wireless networks are envisioned to provide good quality multimedia services to mobile users anywhere at anytime. Traditional analysis of teletraffic in such networks assumes that call arrivals follow a Poisson process, as each cell is being modeled as an M/G/c/c queueing system. This does not reflect the real situation since handoff traffic arrivals are not generally Poissonian. In this paper, we propose to model each cell in future wireless networks as a G/G/c/c queueing system. As such a model has not been explicitly addressed in the literature, our main contribution is to propose a solution which enables to evaluate both traffic distribution and blocking probability within each cell of the service area. Result analysis reveals that coefficient of variation of call arrivals has more impact on the network performance than coefficient of variation of channel holding time.     

An efficient solution technique for discrete-time queues fed by heterogeneous traffic

During the past couple of years, a lot of effort has been put into solving all kinds of Markov modulated discrete-time queueing models, which occur, almost in a natural way, in the performance analysis of slotted systems, such as asynchronous transfer mode (ATM) multiplexers and switching elements. However, in most cases, the practical application of such solutions is limited, because of the large state space that is usually involved. In this paper we try to take a first step towards obtaining approximate solutions for a discrete-time multiserver queueing model with a general heterogeneous Markove modulated cell arrival process, which allows accurate predictions concerning the behaviour of the buffer occupancy in such a model and still remains tractable, both from an analytical and a computational point of view. We first introduce a solution technique which leads to a closed-form expression for the joint probability generating function of the buffer occupancy and the state of the arrival process, from which an expression for V(z), the probability generating function of the buffer occupancy is easily derived. On the basis of this result we propose an approximation for the boundary probabilities, which reduces all calculations to an absolute minimum. In addition, we show how accurate data for the distribution of the buffer occupancy can be obtained, by using multiple poles of V(z) in the geometric-tail approximation of the distribution. ©1997 by John Wiley & Sons, Ltd.     

Incentive analysis for cooperative interactive multiview video streaming

In interactive multiview video streaming (IMVS), users can periodically select one out of many captured views available for observation. In single-view video streaming, cooperative strategies where peers share received packets of the same video have proven to be effective in reducing server׳s upload burden, and incentive mechanisms are designed to stimulate user cooperation. However, exploiting user cooperation in higher dimensional IMVS is difficult, since users watching different views makes it difficult to establish partnership, and users switching views frequently and independently makes it difficult to maintain partnership over time. In this paper, we use a multiview video frame structure for IMVS to support cooperative view-switching, where peers may help each other even if they are observing different views. We then model peers׳ interaction as an indirect reciprocity game, where each user is assigned a reputation level. To gain a higher reputation level, users help others, which in turn leads to a higher likelihood to receive others׳ help later. In this work, we focus on how view switching, the key feature of IMVS, affects user cooperation. By modeling users׳ decision making as a Markov decision process, our analysis shows that users tend to cooperate at some views but not others: given peers can predict their future view navigation paths probabilistically, for a peer who is likely to enter a view-switching path not requiring others׳ help, he also has less incentive to cooperate. Furthermore, we observe that the game may have multiple Nash Equilibria corresponding to different cooperation levels, e.g., users cooperate at all views in the full cooperation equilibrium, while users only cooperate at certain views in the partial cooperation equilibrium. The particular equilibrium the game will converge to depends on the initial cooperation level of the game. To stimulate user cooperation at all views, we propose a Pay-for-Cooperation (PfC) scheme at the beginning of the game to drive the game to the full cooperation equilibrium to improve system efficiency. Our simulation results show the effectiveness of PfC.     

The effect of multiple time scales and subexponentiality in MPEGvideo streams on queueing behavior

Guided by the empirical observation that real-time MPEG video streams exhibit both multiple time scale and subexponential characteristics, we construct a video model that captures both of these characteristics and is amenable to queueing analysis. We investigate two fundamental approaches for extracting the model parameters: using sample path and second-order statistics-based methods. The model exhibits the following two canonical queueing behaviors. When strict stability conditions are satisfied, i.e., the conditional mean of each scene is smaller than the capacity of the server, precise modeling of the interscene dynamics (long-term dependency) is not essential for the accurate prediction of small to moderately large queue sizes. In this case, the queue length distribution is determined using quasistationary (perturbation theory) analysis. When weak stability conditions are satisfied, i.e., the conditional mean of at least one scene type is greater than the capacity of the server, the dominant effect for building a large queue size is the subexponential (long-tailed) scene length distribution. In this case, precise modeling of intrascene statistics is of secondary importance for predicting the large queueing behavior. A fluid model, whose arrival process is obtained from the video data by replacing scene statistics with their means, is shown to asymptotically converge to the exact queue distribution. Using the transition scenario of moving from one stability region to the other by a change in the value of the server capacity, we synthesize recent queueing theoretic advances and ad hoc results in video modeling, and unify a broad range of seemingly contradictory experimental observations found in the literature. As a word of caution for the widespread usage of second-order statistics modeling methods, we construct two processes with the same second-order statistics that produce distinctly different queueing behaviors     

B-spline wavelets for signal denoising and image compression

In this paper we propose to develop novel techniques for signal/image decomposition, and reconstruction based on the B-spline mathematical functions. Our proposed B-spline based multiscale/resolution representation is based upon a perfect reconstruction analysis/synthesis point of view. Our proposed B-spline analysis can be utilized for different signal/imaging applications such as compression, prediction, and denoising. We also present a straightforward computationally efficient approach for B-spline basis calculations that is based upon matrix multiplication and avoids any extra generated basis. Then we propose a novel technique for enhanced B-spline based compression for different image coders by preprocessing the image prior to the decomposition stage in any image coder. This would reduce the amount of data correlation and would allow for more compression, as will be shown with our correlation metric. Extensive simulations that have been carried on the well-known SPIHT image coder with and without the proposed correlation removal methodology are presented. Finally, we utilized our proposed B-spline basis for denoising and estimation applications. Illustrative results that demonstrate the efficiency of the proposed approaches are presented.     

Burst transmission algorithm to improve packet level performance in contention-free slotted OBS networks

In contention-free slotted optical burst switching (SOBS) networks, controllers are utilized in order to manage the time-slot assignment, avoiding congestions among multiple burst transmissions. In this network, bursts are never lost at intermediate nodes but packets are lost at an ingress edge node due to a burst transmission algorithm. In addition, packet transmission delay increases depending on the algorithm. In order to improve packet level performance, in this paper, we propose a new burst transmission algorithm. In this method, two different thresholds are used; one is used to send a control packet to a controller and the other is used to assemble a burst. With these thresholds, a time slot can be assigned to a burst in advance and packet level performance can be improved. In order to evaluate its packet level performance and investigate the impact of thresholds, we also propose a queueing model of a finite buffer where a batch of packets are served in a slot of a constant length. Numerical results show that our proposed method can decrease packet loss probability and transmission delay with two thresholds. In addition, we show that our analysis results are effective to investigate the performance of the proposed method when the number of wavelengths is large.     

Efficient Packet Scheduling Using Channel Adaptive Fair Queueing in Distributed Mobile Computing Systems

In a distributed mobile computing system, an efficient packet scheduling policy is a crucial component to achieve a high utilization of the precious bandwidth resources while satisfying users' QoS (quality of service) demands. An important class of scheduling techniques, namely, the wireless fair queueing algorithms, have been extensively studied recently. However, a major drawback in existing approaches is that the channel model is overly simplified – a two-state channel (good or bad) is assumed. While it is relatively easy to analyze the system using such a simple model, the algorithms so designed are of a limited applicability in a practical environment, in which the level of burst errors is time-varying and can be exploited by using channel adaptive coding and modulation techniques. In this paper, we first argue that the existing algorithms cannot cater for a more realistic channel model and the traditional notion of fairness is not suitable. We then propose a new notion of fairness, which bounds the actual throughput normalized by channel capacity of any two data connections. Using the new fairness definition, we propose a new fair queueing algorithm called CAFQ (Channel Adaptive Fair Queueing), which, as indicated in our numerical studies, outperforms other algorithms in terms of overall system throughput and fairness among error prone connections.     

Key views for visualizing large spaces

Image is a dominant medium among video, 3D model, and other media for visualizing environment and creating virtual access on the Internet. The location of image capture is, however, subjective and has relied on the esthetic sense of photographers up until this point. In this paper, we will not only visualize areas with images, but also propose a general framework to determine where the most distinct viewpoints should be located. Starting from elevation data, we present spatial and content information in ground-based images such that (1) a given number of images can have maximum coverage on informative scenes; (2) a set of key views can be selected with certain continuity for representing the most distinct views. According to the scene visibility, continuity, and data redundancy, we evaluate viewpoints numerically with an object-emitting illumination model. Our key view exploration may eventually reduce the visual data to transmit, facilitate image acquisition, indexing and interaction, and enhance perception of spaces. Real sample images are captured based on planned positions to form a visual network to index the area.     

Semantics-aware transformer for 3D reconstruction from binocular images

Existing multi-view three-dimensional (3D) reconstruction methods can only capture single type of feature from input view, failing to obtain fine-grained semantics for reconstructing the complex shapes. They rarely explore the semantic association between input views, leading to a rough 3D shape. To address these challenges, we propose a semantics-aware transformer (SATF) for 3D reconstruction. It is composed of two parallel view transformer encoders and a point cloud transformer decoder, and takes two red, green and blue (RGB) images as input and outputs a dense point cloud with richer details. Each view transformer encoder can learn a multi-level feature, facilitating characterizing fine-grained semantics from input view. The point cloud transformer decoder explores a semantically-associated feature by aligning the semantics of two input views, which describes the semantic association between views. Furthermore, it can generate a sparse point cloud using the semantically-associated feature. At last, the decoder enriches the sparse point cloud for producing a dense point cloud with richer details. Extensive experiments on the ShapeNet dataset show that our SATF outperforms the state-of-the-art methods.     

Towards the formation of comprehensive SLAs between heterogeneous wireless DiffServ domains

Traffic patterns generated by multimedia services are different from traditional Poisson traffic. It has been shown in numerous studies that multimedia network traffic exhibits self-similarity and burstiness over a large range of time-scales. The area of wireless IP traffic modeling for the purpose of providing assured QoS to the end-user is still immature and the majority of existing work is based on characterization of wireless IP traffic without any coupling of the behaviour of queueing systems under such traffic conditions. Work in this area has either been limited to simplified models of FIFO queueing systems which do not accurately reflect likely queueing system implementations or the results have been limited to simplified numerical analysis studies. In this paper, we advance the knowledge of queueing systems by example of traffic engineering of different UMTS service classes. Specifically, we examine QoS mapping using three common queueing disciplines; Priority Queuing (PQ), Low Latency Queuing (LLQ) and Custom Queueing (CQ), which are likely to be used in future all-IP based packet transport networks. The present study is based on a long-range dependent traffic model, which is second order self-similar. We consider three different classes of self-similar traffic fed into a G/M/1 queueing system and construct analytical models on the basis of non-preemptive priority, low-latency queueing and custom queueing respectively. In each case, expressions are derived for the expected waiting times and packet loss rates of different traffic classes. We have developed a comprehensive discrete-event simulator for a G/M/1 queueing system in order to understand and evaluate the QoS behaviour of self-similar traffic and carried out performance evaluations of multiple classes of input traffic in terms of expected queue length, packet delay and packet loss rate. Furthermore, we have developed a traffic generator based on the self-similar traffic model and fed the generated traffic through a CISCO router-based test bed. The results obtained from the three different queueing schemes (PQ, CQ and LLQ) are then compared with the simulation results in order to validate our analytical models.     

Blocking Probability Based Hierarchical Storage Design in VoD Systems

1　ＩｎｔｒｏｄｕｃｔｉｏｎＶｉｄｅｏ ｏｎ ｄｅｍａｎｄｉｓｂｅｃｏｍｉｎｇｉｎｃｒｅａｓｉｎｇｌｙｉｍ ｐｏｒｔａｎｔｉｎｅｎｔｅｒｔａｉｎｍｅｎｔ[1～2 ] ,ｅｄｕｃａｔｉｏｎ[3～ 4] ａｎｄｎｅｗｓｄｉｓｔｒｉｂｕｔｉｏｎ[5～6] .Ｉｎｓｕｃｈａｐｐｌｉｃａｔｉｏｎｓ,ａｌａｒｇｅ ｓｉｚｅｖｉｄｅｏｂａｓｅｉｓｏｆｔｅｎｄｅｓｉｒｅｄ .Ｍａｇｎｅｔｉｃｄｉｓｋｓａｒｅｃｏｍｍｏｎｌｙｕｓｅｄｉｎｖｉｄｅｏｓｅｒｖｅｒｓｔｏｓｔｏｒｅｖｉｄｅｏｆｉｌｅｓ.Ｈｏｗｅｖｅｒ,ａｌｔｈｏｕｇｈｍａｇｎｅｔｉ…     

Camera constraint-free view-based 3-D object retrieval

Recently, extensive research efforts have been dedicated to view-based methods for 3-D object retrieval due to the highly discriminative property of multiviews for 3-D object representation. However, most of state-of-the-art approaches highly depend on their own camera array settings for capturing views of 3-D objects. In order to move toward a general framework for 3-D object retrieval without the limitation of camera array restriction, a camera constraint-free view-based (CCFV) 3-D object retrieval algorithm is proposed in this paper. In this framework, each object is represented by a free set of views, which means that these views can be captured from any direction without camera constraint. For each query object, we first cluster all query views to generate the view clusters, which are then used to build the query models. For a more accurate 3-D object comparison, a positive matching model and a negative matching model are individually trained using positive and negative matched samples, respectively. The CCFV model is generated on the basis of the query Gaussian models by combining the positive matching model and the negative matching model. The CCFV removes the constraint of static camera array settings for view capturing and can be applied to any view-based 3-D object database. We conduct experiments on the National Taiwan University 3-D model database and the ETH 3-D object database. Experimental results show that the proposed scheme can achieve better performance than state-of-the-art methods.     

一种支持服务类别的无线公平调度算法

本文提出了一种支持服务类别的无线公平调度算法:CoSB－WFS(基于服务类别的无线公平调度).算法区分不同的服务类别并可根据其业务需要进行不同的调度.考虑到无线信道的特殊性,算法引入了补偿和再分配模式.在仿真工具OPNET上模拟了算法并得到了性能改良的结果.     

ATM优先级队列的质量控制

在ＡＴＭ队列中可以采用恰当的优先级方案对具有不同ＱＯＳ指标的业务进行适当的控制。本文提出了一种综合的ＡＴＭ队列管理方案，建立了相应的系统模型，并给出了理论分析和模拟结果，表明这种方案对ＡＴＭ业务的质量控制是有效的。