The intrinsic deficiencies of traditional client-server networks lead that P2P networks become scalable successors for video streaming in today networks. However, the performance of P2P networks is deeply dependable o...
详细信息
The intrinsic deficiencies of traditional client-server networks lead that P2P networks become scalable successors for video streaming in today networks. However, the performance of P2P networks is deeply dependable on the contribution of peers. In fact, some peers only consume services but provide little or nothing into the network; this phenomenon which is called free riding seriously affects the performance of P2P networks. In order to motivate peers to contribute their resources into the P2P networks, using incentive mechanisms is compulsory. In this paper we designed and proposed an incentive mechanism for mesh based P2P video streaming. The proposed approach includes two parts. In the first part, the contribution of the peers in the P2P network is measured and maintained in a distributed fashion, and in the second part, differentiated service is provided for the peers based on their contribution. We simulated the proposed approach and the results show the efficiency of the proposed mechanism to improve the overall quality of the perceived video in the group.
A method of reversible video image regions of interest anonymization for applications in video surveillance systems is described. A short introduction to the anonymization procedures is presented together with the exp...
详细信息
A method of reversible video image regions of interest anonymization for applications in video surveillance systems is described. A short introduction to the anonymization procedures is presented together with the explanation of its relation to visual surveillance. A short review of state of the art of sensitive data protection in media is included. An approach to reversible Region of Interest (ROI) hiding in video is presented, utilizing a new relocation algorithm for hashing and a watermarking technique for extra data embedding. Implemented application is described, and results obtained using it are reported. Future work and possible improvements to introduced algorithms are discussed.
This paper proposes a novel scheme, based on progressive fountain codes, for broadcasting JPEG 2000 multimedia. In such a broadcast scheme, progressive resolution levels of images/video have been unequally protected w...
详细信息
This paper proposes a novel scheme, based on progressive fountain codes, for broadcasting JPEG 2000 multimedia. In such a broadcast scheme, progressive resolution levels of images/video have been unequally protected when transmitted using the proposed progressive fountain codes. With progressive fountain codes applied in the broadcast scheme, the resolutions of images (JPEG 2000) or videos (MJPEG 2000) received by different users can be automatically adaptive to their channel qualities, i.e. the users with good channel qualities are possible to receive the high resolution images/vedio while the users with bad channel qualities may receive low resolution images/vedio. Finally, the performance of the proposed scheme is evaluated with the MJPEG 2000 broadcast prototype.
Compression of depth maps is important for “texture plus depth” format of multiview images, which enables synthesis of novel intermediate views via depth-image-based rendering (DIBR) at decoder. Previous depth map c...
详细信息
Compression of depth maps is important for “texture plus depth” format of multiview images, which enables synthesis of novel intermediate views via depth-image-based rendering (DIBR) at decoder. Previous depth map coding schemes exploit unique depth data characteristics to compactly and faithfully reproduce the original signal. In contrast, since depth map is only a means to the end of view synthesis and not itself viewed, in this paper we explicitly manipulate depth values, without causing severe synthesized view distortion, in order to maximize representation sparsity in the transform domain for compression gain - we call this process transform domain spar-sification (TDS). Specifically, for each pixel in the depth map, we first define a quadratic penalty function, with minimum at ground truth depth value, based on synthesized view's distortion sensitivity to the pixel's depth value during DIBR. We then define an objective for a depth signal in a block as a weighted sum of: i) signal's sparsity in the transform domain, and ii) per-pixel synthesized view distortion penalties for the chosen signal. Given that sparsity (l 0 -norm) is non-convex and difficult to optimize, we replace the l 0 -norm in the objective with a computationally inexpensive weighted l 2 -norm; the optimization is then an unconstrained quadratic program, solvable via a set of linear equations. For the weighted l 2 -norm to promote sparsity, we solve the optimization iteratively, where at each iteration weights are readjusted to mimic sparsity-promoting l τ -norm, 0 ≤ τ ≤ 1. Using JPEG as an example transform codec, we show that our TDS approach gained up to 1.7dB in rate-distortion performance for the interpolated view over compression of unaltered depth maps.
Recent metrics to objectively evaluate image quality based on measuring structural changes, and not on measuring the error, have led to improvements in evaluation with respect to the human vision system. Various analy...
详细信息
Recent metrics to objectively evaluate image quality based on measuring structural changes, and not on measuring the error, have led to improvements in evaluation with respect to the human vision system. Various analyses based on calculating the correlation between values obtained from subjective experiments and those obtained objectively have shown this, and variations and improvements have been gained compared to the original proposal. However, the introduction of constants to the calculations, although they improve the stability of the measurements, also reduces their dynamic range, which in turn affects the correlation with HVS. On the other hand, this metric and its improvements have also been used for video quality assessment, usually through an average of each frame. However, in many cases, the computing costs increase considerably, which limits their use in systems with high resolution and with video applications. In this work, we show how to compensate for this reduction in the dynamic range in the SSIM calculation, which could improve the correlation with the SSIM of HVS without increasing the computing cost.
Error tolerance is evolving into a new computing paradigm with further technology scaling, cost constraint, system scalability and emerging applications. Distinguished from defect tolerance and fault tolerance, error ...
详细信息
Error tolerance is evolving into a new computing paradigm with further technology scaling, cost constraint, system scalability and emerging applications. Distinguished from defect tolerance and fault tolerance, error tolerance is based on application characteristics and relaxes the constraint of 100 percent functional correctness. From the viewpoint of error tolerance, this paper proposes a framework across multiple layers for fault criticality evaluation. Furthermore, taking an H.264/AVC decoder as an example, fault injection experiments demonstrate that for different functional modules, the faults in them bear different fault criticalities because of their unbalanced effects on applications, the faults in the same module also have diverse fault criticalities. The information that which faults are most critical can aid in test for yield and design for cost-effective fault tolerance. Error control techniques can be used to suppress error propagation and make more faults acceptable.
In this paper we present a new algorithm to detect digital image forgery based on cellular automata and data embedding in spatial domain. The original JPEG image will be partitioned into some regions. We use region-ba...
详细信息
In this paper we present a new algorithm to detect digital image forgery based on cellular automata and data embedding in spatial domain. The original JPEG image will be partitioned into some regions. We use region-based segmentation to specifying the desired regions of interest from the input image. First we extract the visual attributes of the original image and achieve the statistical information for the selected region. Then we apply linear cellular automata rules to create a robust cipher key from these values. We embed the cipher key into the spatial domain to authenticate and validate the original image. The proposed algorithm is applied on 100 numbers of grayscale images (size 800 × 600). The results have demonstrated the robustness and stable time complexity of the proposed method.
A new image compression technique is proposed, based on the affine transformations (ATs) that define an iterated function system. Previous related research in the field has shown that an image may be approximated by i...
详细信息
A new image compression technique is proposed, based on the affine transformations (ATs) that define an iterated function system. Previous related research in the field has shown that an image may be approximated by iteratively subjecting a set of sub-regions to a group of ATs. In this case, it suffices to save the AT coefficients at issue and the corners of the regions; despite this advantage, the technique is computationally intensive, because both the sub-regions and the corresponding ATs have to be looked for. Here, a new form of similarity is proposed, based on the successive points generated by the iteration of affine transformations. By understanding an AT as a discrete dynamical system, with each image point represented by an iteration of the AT, the method captures similarities between these points, namely, those with the same color in the image; by saving the starting point and the transformations' coefficients, the points can be iterated back, to reconstruct the original image. This results in lighter computational effort, and promising results, since the comparison is made point by point, instead of region by region.
In this paper ,a new shape descriptor for object recognition which is invariant to translation ,rotation,scale and mirror mapping is proposed. According to the results obtained by a edge detector , the distance betwee...
详细信息
In this paper ,a new shape descriptor for object recognition which is invariant to translation ,rotation,scale and mirror mapping is proposed. According to the results obtained by a edge detector , the distance between the edge points and the centroid of the object is calculated, and a series of standardization are cited by which the new shape descriptor was established. The experiment demostrated that the new method achieves a significant performance comparing to the Fourier descriptor and moment invariants.
In this paper, feedforward neural network trained with the backpropagation algorithm is proposed to compress grayscale medical images. In this new method, a three hidden layer feedforward network (FFN) is applied dire...
详细信息
In this paper, feedforward neural network trained with the backpropagation algorithm is proposed to compress grayscale medical images. In this new method, a three hidden layer feedforward network (FFN) is applied directly as the main compression algorithm to compress an MRI image. After training with sufficient sample images, the compression process will be carried out on the target image. The coupling weights and activation values of each neuron in the hidden layer will be stored after training. Compression is then achieved by using smaller number of hidden neurons as compare to the number of image pixels due to lesser information being stored. Experimental results show that the FFN is able to achieve comparable compression performance to popular existing medical image compression schemes such as JPEG2000 and JPEG-LS.
暂无评论