A carregar...
60 resultados
Resultados da pesquisa
A mostrar 1 - 10 de 60
- On ECG Signal Compression With 1-D Multiscale Recurrent Patterns Allied to Preprocessing TechniquesPublication . Filho, E.B.L.; Rodrigues, N.M.M.; Silva, E.A.B. da; Carvalho, M.B. de; Faria, S.M.M. de; Silva, V.M.M. da; M. M. Rodrigues, Nuno; Faria, SergioThis paper presents the results of a multiscale pattern-matching-based ECG encoder, which employs simple preprocessing techniques for adapting the input signal. Experiments carried out with records from the Massachusetts Institute of Technology-Beth Israel Hospital database show that the proposed scheme is effective, outperforming some state-of-the-art schemes described in the literature.
- Improving multiscale recurrent pattern image coding with least-squares prediction modePublication . Graziosi, Danillo B.; Rodrigues, Nuno M. M.; Silva, Eduardo A. B. da; Faria, Sérgio M. M. de; Carvalho, Murilo B. de; Faria, Sergio; M. M. Rodrigues, Nuno;The Multidimensional Multiscale Parser-based (MMP) image coding algorithm, when combined with flexible partitioning and predictive coding techniques (MMP-FP), provides state-of-the-art performance. In this paper we investigate the use of adaptive least-squares prediction in MMP. The linear prediction coefficients implicitly embed the local texture characteristics, and are computed based on a block’s causal neighborhood (composed of already reconstructed data). Thus, the intra prediction mode is adaptively adjusted according to the local context and no extra overhead is needed for signaling the coefficients. We add this new context-adaptive linear prediction mode to the other MMP prediction modes, that are based on the ones used in H.264/AVC; the best mode is chosen through rate-distortion optimization. Simulation results show that least-squares prediction is able to significantly increase MMP-FPs rate-distortion performance for smooth images, leading to better results than the ones of state-of-theart, transform-based methods. Yet with the addition of least-squares prediction MMP-FP presents no performance loss when used for encoding non-smooth images, such as text and graphics.
- Video transcoding from H.264/AVC to MPEG-2 with reduced computational complexityPublication . Moiron, Sandro; Faria, Sergio; Navarro, António; Silva, Vitor; Assunção, PedroThis paper addresses video transcoding from H.264/AVC into MPEG-2 with reduced complexity and high rate-distortion efficiency. While the overall concept is based on a cascaded decoder-encoder, the novel adaptation methods developed in this work have the advantage of providing very good performance in H.264/AVC to MPEG-2 transcoding. The proposed approach exploits the similarities between the coding tools used in both standards, with the objective of obtaining a computationally efficient transcoder without penalising the signal quality. Fast and efficient methods are devised for conversion of macroblock coding modes and translation of motion information in order to compute the MPEG-2 coding format with a reduced number of operations, by reusing the corresponding data embedded in the incoming H.264/AVC coded stream. In comparison with a cascaded decoder-encoder, the fast transcoder achieves computational complexity savings up to 60% with slightly better peak signal-to-noise ratio (PSNR) at the same bitrate.
- Light field HEVC-based image coding using locally linear embedding and self-similarity compensated predictionPublication . Monteiro, Ricardo; Lucas, Luis; Conti, Caroline; Nunes, Paulo; M. M. Rodrigues, Nuno; Faria, Sergio; Pagliari, Carla; Silva, Eduardo da; Soares, LuisLight field imaging is a promising new technology that allows the user not only to change the focus and perspective after taking a picture, as well as to generate 3D content, among other applications. However, light field images are characterized by large amounts of data and there is a lack of coding tools to efficiently encode this type of content. Therefore, this paper proposes the addition of two new prediction tools to the HEVC framework, to improve its coding efficiency. The first tool is based on the local linear embedding-based prediction and the second one is based on the self-similarity compensated prediction. Experimental results show improvements over JPEG and HEVC in terms of average bitrate savings of 71.44% and 31.87%, and average PSNR gains of 4.73dB and 0.89dB, respectively.
- Image Coding Using Generalized Predictors Based on Sparsity and Geometric TransformationsPublication . Lucas, Luís F. R.; M. M. Rodrigues, Nuno; Silva, Eduardo A. B. da; Pagliari, Carla L.; Faria, Sergio
- Optimized Reference Picture Selection for Light Field Image CodingPublication . Monteiro, J. S. Ricardo; Nunes, J. L. Paulo; M. M. Rodrigues, Nuno; Faria, SergioThis paper proposes a new reference picture selection method for light field image coding using the pseudovideo sequence (PVS) format. State-of-the-art solutions to encode light field images using the PVS format rely on video coding standards to exploit the inter-view redundancy between each sub-aperture image (SAI) that composes the light field. However, the PVS scanning order is not usually considered by the video codec. The proposed solution signals the PVS scanning order to the decoder, enabling implicit optimized reference picture selection for each specific scanning order. With the proposed method each reference picture is selected by minimizing the Euclidean distance to the current SAI being encoded. Experimental results show that, for the same PVS scanning order, the proposed optimized reference picture selection codec outperforms HEVC video coding standard for light field image coding, up to 50% in terms of bitrate savings
- Reconstruction of lost depth data in multiview video-plus-depth communications using geometric transformsPublication . Marcelino, Sylvain; Soares, Salviano; Faria, Sergio; Assunção, PedroThis paper addresses depth data recovery in multiview video-plus-depth communications affected by transmission errors and/or packet loss. The novel aspects of the proposed method rely on the use of geometric transforms and warping vectors, capable of capturing complex motion and view-dependent deformations, which are not efficiently handled by traditional motion and/or disparity compensation methods. By exploiting the geometric nature of depth information, a region matching approach combined with depth contour reconstruction is devised to achieve accurate interpolation of arbitrary shapes within lost regions of depth maps. The simulation results show that, for different packet loss rates, up to 20%, the depth maps recovered by the proposed method produce virtual views with better quality than existing methods based on motion information and spatial interpolation. An average PSNR gain of 1.48 dB is obtained in virtual views synthesised from depth maps using the proposed method.
- Light Field Image Coding Based on Hybrid Data RepresentationPublication . Monteiro, Ricardo J. S.; Rodrigues, Nuno M. M.; Faria, Sérgio M.M.; Nunes, Paulo J. L.This paper proposes a novel efficient light field coding approach based on a hybrid data representation. Current state-of-the-art light field coding solutions either operate on micro-images or sub-aperture images. Consequently, the intrinsic redundancy that exists in light field images is not fully exploited, as is demonstrated. This novel hybrid data representation approach allows to simultaneously exploit four types of redundancies: i) sub-aperture image intra spatial redundancy, ii) sub-aperture image inter-view redundancy, iii) intra-micro-image redundancy, and iv) inter-micro-image redundancy between neighboring micro-images. The proposed light field coding solution allows flexibility for several types of baselines, by adaptively exploiting the most predominant type of redundancy on a coding block basis. To demonstrate the efficiency of using a hybrid representation, this paper proposes a set of efficient pixel prediction methods combined with a pseudo-video sequence coding approach, based on the HEVC standard. Experimental results show consistent average bitrate savings when the proposed codec is compared to relevant state-ofthe-art benchmarks. For lenslet light field content, the proposed coding algorithm outperforms the HEVCbased pseudo-video sequence coding benchmark by an average bitrate savings of 23%. It is shown for the same light field content that the proposed solution outperforms JPEG Pleno verification models MuLE and WaSP, as these codecs are only able to achieve 11% and −14% bitrate savings over the same HEVC-based benchmark, respectively. The performance of the proposed coding approach is also validated for light fields with wider baselines, captured with high-density camera arrays, being able to outperform both the HEVCbased benchmark, as well as MuLE and WaSP.
- Frame loss concealment for 3D video decoders based on disparity-compensated motion fieldPublication . Carreira, J.; Assunção, P.; Rodrigues, N.; Faria, S.This paper addresses the problem of frame loss concealment in 3D video decoders capable of handling stereoscopic views compliant with H.264/MVC. A joint motion-disparity compensation method is proposed to fully recover an estimated motion field for the lost frame in stereoscopic video, by using a combination of inter-view disparity-compensated motion vectors and intra-view motion extrapolation. The overall motion field is estimated from both the motion information of the co-located view, through disparity compensation, and neighboring frames of the same view, through motion vector extrapolation. The results show that the proposed method outperforms currently used methods such as frame-copy and motion-copy. In video sequences, average PSNR gains up to 1.6 dB are obtained over motion-copy, while for individual frames a maximum of 5 dB is achieved.
- Computational complexity reduction methods for multiscale recurrent pattern algorithmsPublication . Francisco, Nelson C.; M. M. Rodrigues, Nuno; Silva, Eduardo A. B. da; Carvalho, Murilo B. de; Faria, SergioThe Multidimensional Multiscale Parser algorithm was originally proposed as a generic lossy data compression algorithm. An high degree of adaptivity and versatility allowed it to outperform state-of-the-art transform-based compression methods for a wide range of applications, from still images, compound documents, or even ECG's, just to name a few. However, as other pattern matching algorithms, it presents a high computational complexity. In this paper, we investigated several techniques that allowed to considerably reduce both the encoder's and the decoder's computational complexity, with marginal R-D performance losses. The most important reduction was achieved on the decoder, that reduced up to 95% the time required by the previous method. These improvements contribute to affirm MMP as an alternative to traditional transform-based encoders, approaching its computational complexity with that of transform-based algorithms.