Pub Date : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931432
Saad Al-Azawi, S. Boussakta, Alexandre Yakovlev
This paper introduces a low complex image compression algorithm. The proposed algorithm is a combination of pattern squeezing, moments re-quantizing, absolute moments block truncation coding (AMBTC) and a postprocessing unit. One advantage of the proposed algorithm is that it reduces and controls the higher bit rate of the AMBTC while preserving a reasonable image quality. The complexity reduction has been accomplished by utilizing only four (2×2) bit patterns rather than a 32 or 64 (4×4) pattern fitting. This proposed size of pattern fitting reduces the computation costs by reducing the time and arithmetic operations required to search for the best match plane. The four (2×2) bit planes offer the advantage of bit rate control by performing multi level bit plane reduction. This operation has been named pattern squeezing. The algorithm performance has shown good image quality with lower bit rate.
{"title":"Low complexity image compression algorithm using AMBTC and bit plane squeezing","authors":"Saad Al-Azawi, S. Boussakta, Alexandre Yakovlev","doi":"10.1109/WOSSPA.2011.5931432","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931432","url":null,"abstract":"This paper introduces a low complex image compression algorithm. The proposed algorithm is a combination of pattern squeezing, moments re-quantizing, absolute moments block truncation coding (AMBTC) and a postprocessing unit. One advantage of the proposed algorithm is that it reduces and controls the higher bit rate of the AMBTC while preserving a reasonable image quality. The complexity reduction has been accomplished by utilizing only four (2×2) bit patterns rather than a 32 or 64 (4×4) pattern fitting. This proposed size of pattern fitting reduces the computation costs by reducing the time and arithmetic operations required to search for the best match plane. The four (2×2) bit planes offer the advantage of bit rate control by performing multi level bit plane reduction. This operation has been named pattern squeezing. The algorithm performance has shown good image quality with lower bit rate.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125119372","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931512
Atef Mermoul
Among the cryptographic approaches, signal processing techniques has become recently an interesting one. Blind source separation (BSS)-based encryption schemes have been built up using the intractability of the under determined BSS problem. In this paper, we propose a new encryption method. The proposed approach is iterative and based on the subspace concept together with the use of nonlinear functions and key signals. The proposed technique presents an interesting feature: only a part of the secret key parameters used during encryption is necessary for decryption. Furthermore, the iterative encryption algorithm will provide no contents if no plain-text is fed in the input.
{"title":"An iterative speech encryption scheme based on subspace technique","authors":"Atef Mermoul","doi":"10.1109/WOSSPA.2011.5931512","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931512","url":null,"abstract":"Among the cryptographic approaches, signal processing techniques has become recently an interesting one. Blind source separation (BSS)-based encryption schemes have been built up using the intractability of the under determined BSS problem. In this paper, we propose a new encryption method. The proposed approach is iterative and based on the subspace concept together with the use of nonlinear functions and key signals. The proposed technique presents an interesting feature: only a part of the secret key parameters used during encryption is necessary for decryption. Furthermore, the iterative encryption algorithm will provide no contents if no plain-text is fed in the input.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116733629","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931461
M. Melzi, A. Ouldali, Z. Messaoudi
Tracking an unknown and time varying number of targets is a difficult issue. The Unscented Probability Hypothesis Density Filter (UKPHD) tackles this problem, moreover, it allows the estimation of both the number of targets and their states without any data association steps by considering the target states as a single global target state, its a closed-form solution for the probability hypothesis density (PHD) filter that deals with non linear systems, it propagates the first-order moment of the multitarget posterior instead of the posterior distribution itself because evaluating the multiple-target posterior distribution is currently computationally intractable for real-time applications in multiple Target tracking problems. However, targets are poorly described by a single dynamic model, in fact, they may change their kinematic model at any time which makes the tracking algorithm incapable of estimating efficiently the true trajectories. The Interacting Multiple Model (IMM) algorithm is used to address this. The IMM uses multiple models to describe targets behavior and adaptively determines which model(s) are the most appropriate at each time step. In this paper, we present a new interacting multiple model Unscented probability hypothesis density filter (IMM-UKPHD) to deal with the problem of tracking a time varying number of maneuvering targets. In our approach, a bank of Unscented probability hypothesis density filters is used in the interacting multiple model (IMM) framework for updating the state of moving targets. Simulation results show the efficiency of the proposed algorithm.
{"title":"Multiple target tracking and classification using the unscented probability hypothesis density filter","authors":"M. Melzi, A. Ouldali, Z. Messaoudi","doi":"10.1109/WOSSPA.2011.5931461","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931461","url":null,"abstract":"Tracking an unknown and time varying number of targets is a difficult issue. The Unscented Probability Hypothesis Density Filter (UKPHD) tackles this problem, moreover, it allows the estimation of both the number of targets and their states without any data association steps by considering the target states as a single global target state, its a closed-form solution for the probability hypothesis density (PHD) filter that deals with non linear systems, it propagates the first-order moment of the multitarget posterior instead of the posterior distribution itself because evaluating the multiple-target posterior distribution is currently computationally intractable for real-time applications in multiple Target tracking problems. However, targets are poorly described by a single dynamic model, in fact, they may change their kinematic model at any time which makes the tracking algorithm incapable of estimating efficiently the true trajectories. The Interacting Multiple Model (IMM) algorithm is used to address this. The IMM uses multiple models to describe targets behavior and adaptively determines which model(s) are the most appropriate at each time step. In this paper, we present a new interacting multiple model Unscented probability hypothesis density filter (IMM-UKPHD) to deal with the problem of tracking a time varying number of maneuvering targets. In our approach, a bank of Unscented probability hypothesis density filters is used in the interacting multiple model (IMM) framework for updating the state of moving targets. Simulation results show the efficiency of the proposed algorithm.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116757379","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931462
Yuan Gao, X. Ai, J. Rarity, N. Dahnoun
Obstacle detection has been one of the most critical features for reliable driving scene analysis. This paper presents an approach for an automatic obstacle detection system. The proposed system makes use of depth information generated by a 3D camera mounted on the front of a moving vehicle. Obstacles projected as line features in the V-U-Disparity map can be extracted to detect the road surface and obstacles. A Steerable Filter is employed at an early stage to dramatically lower the noise. Furthermore, a modified Hough Transform is placed to extract the straight line feature from the depth map with improved accuracy. The system is robust in dealing with fault detection caused by roadside features which is a commonly shared problem in many other obstacle detection approaches.
障碍物检测一直是可靠的驾驶场景分析的关键特征之一。本文提出了一种自动障碍物检测系统的实现方法。该系统利用安装在移动车辆前部的3D摄像机生成的深度信息。在v - u -视差图中以线特征投影的障碍物可以被提取出来检测路面和障碍物。在早期阶段采用可操纵滤波器来显著降低噪声。利用改进的霍夫变换提取深度图中的直线特征，提高了提取精度。该系统在处理由路边特征引起的故障检测方面具有鲁棒性，这是许多其他障碍物检测方法普遍存在的问题。
{"title":"Obstacle detection with 3D camera using U-V-Disparity","authors":"Yuan Gao, X. Ai, J. Rarity, N. Dahnoun","doi":"10.1109/WOSSPA.2011.5931462","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931462","url":null,"abstract":"Obstacle detection has been one of the most critical features for reliable driving scene analysis. This paper presents an approach for an automatic obstacle detection system. The proposed system makes use of depth information generated by a 3D camera mounted on the front of a moving vehicle. Obstacles projected as line features in the V-U-Disparity map can be extracted to detect the road surface and obstacles. A Steerable Filter is employed at an early stage to dramatically lower the noise. Furthermore, a modified Hough Transform is placed to extract the straight line feature from the depth map with improved accuracy. The system is robust in dealing with fault detection caused by roadside features which is a commonly shared problem in many other obstacle detection approaches.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115673272","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931464
M. Amara, Amar Siad
The idea of Elliptic Curve Cryptography (ECC), and how it's a better promise for a faster and more secure method of encryption in comparison to the current standards in the Public-Key Cryptographic algorithms of RSA is discussed in this paper. The Elliptic Curve Cryptography covers all relevant asymmetric cryptographic primitives like digital signatures and key agreement algorithms. The function used for this purpose is the scalar multiplication k.P which is the core operation of ECCs. Where k is an integer and P is a point on an elliptic curve. This article explains the role of ECC in the network security. ECC's uses with smaller keys to provide high security and high speed.
{"title":"Elliptic Curve Cryptography and its applications","authors":"M. Amara, Amar Siad","doi":"10.1109/WOSSPA.2011.5931464","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931464","url":null,"abstract":"The idea of Elliptic Curve Cryptography (ECC), and how it's a better promise for a faster and more secure method of encryption in comparison to the current standards in the Public-Key Cryptographic algorithms of RSA is discussed in this paper. The Elliptic Curve Cryptography covers all relevant asymmetric cryptographic primitives like digital signatures and key agreement algorithms. The function used for this purpose is the scalar multiplication k.P which is the core operation of ECCs. Where k is an integer and P is a point on an elliptic curve. This article explains the role of ECC in the network security. ECC's uses with smaller keys to provide high security and high speed.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114874323","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931452
A. B. Djebbar
In this paper, a new blind equalization for multiuser multi-carrier code division multiple access (MC-CDMA) systems under Rayleigh multipath fading channel is proposed. The later causes the ICI and ISI that destroy the relationship of the guard interval (GI) redundancy. Through exploiting the structural properties of MC-CDMA transmitted signal, the estimation can be resolved using least square fitting (LSF) and subspace approaches. Indeed, GI redundancy together with excess codes (EC) are used to restore the MC-CDMA properties. In addition, we propose the use of the previous algorithms in conjunction with a constant modulus algorithm (CMA) to improve the performance gain. Our simulation results show the robustness and effectiveness of the proposed algorithms.
{"title":"LSF-CMA based blind equalization algorithms for MC-CDMA systems","authors":"A. B. Djebbar","doi":"10.1109/WOSSPA.2011.5931452","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931452","url":null,"abstract":"In this paper, a new blind equalization for multiuser multi-carrier code division multiple access (MC-CDMA) systems under Rayleigh multipath fading channel is proposed. The later causes the ICI and ISI that destroy the relationship of the guard interval (GI) redundancy. Through exploiting the structural properties of MC-CDMA transmitted signal, the estimation can be resolved using least square fitting (LSF) and subspace approaches. Indeed, GI redundancy together with excess codes (EC) are used to restore the MC-CDMA properties. In addition, we propose the use of the previous algorithms in conjunction with a constant modulus algorithm (CMA) to improve the performance gain. Our simulation results show the robustness and effectiveness of the proposed algorithms.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114878917","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931440
L. Kassa-Baghdouche, L. M. Simohamed
The performance limitations due to the combined effects of frequency chirp and CD or PMD in a 40 Gbit/s optical Return-to-Zero Differential Phase-Shift-Keying (RZ-DPSK) transmission system are numerically simulated. By means of numerical simulations, we optimize the bandwidths of the optical and electrical receiver's filters. Then, the impact of the Chirp factor (C) on the Bit Error Rate (BER) performance is analyzed when the received signal is filtered by two types of optical filter (Fabry-Perot filter (FP) or Fiber Bragg Grating filter (FBG)). The optical power penalties caused by the Frequency Chirp impact at BER of 10−9 in the presence of CD or PMD are evaluated. Simulation results show that, without CD and PMD the system suffer a significant amount of power penalties due to the Chirp factor, and the optical filter has no influence on the power penalties. However, it is found that with CD or PMD, the optical filter has significant influence on the power penalty, and with CD the system which uses FBG filter always performs better than the one which uses FP filter, whereas with PMD the better performances switch from FBG filter to FP filter. This provides the basis for tradeoff between FP and FBG filter performances through careful selection of a suitable optical filter to high speed optical transmission system.
{"title":"Performance limitations of an optical RZ-DPSK transmission system affected by frequency chirp, chromatic dispersion and polarization mode dispersion","authors":"L. Kassa-Baghdouche, L. M. Simohamed","doi":"10.1109/WOSSPA.2011.5931440","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931440","url":null,"abstract":"The performance limitations due to the combined effects of frequency chirp and CD or PMD in a 40 Gbit/s optical Return-to-Zero Differential Phase-Shift-Keying (RZ-DPSK) transmission system are numerically simulated. By means of numerical simulations, we optimize the bandwidths of the optical and electrical receiver's filters. Then, the impact of the Chirp factor (C) on the Bit Error Rate (BER) performance is analyzed when the received signal is filtered by two types of optical filter (Fabry-Perot filter (FP) or Fiber Bragg Grating filter (FBG)). The optical power penalties caused by the Frequency Chirp impact at BER of 10−9 in the presence of CD or PMD are evaluated. Simulation results show that, without CD and PMD the system suffer a significant amount of power penalties due to the Chirp factor, and the optical filter has no influence on the power penalties. However, it is found that with CD or PMD, the optical filter has significant influence on the power penalty, and with CD the system which uses FBG filter always performs better than the one which uses FP filter, whereas with PMD the better performances switch from FBG filter to FP filter. This provides the basis for tradeoff between FP and FBG filter performances through careful selection of a suitable optical filter to high speed optical transmission system.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"117 31","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113945928","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931516
Asma Mejri, Laura Luzzi, G. R. Othman
“Naive Lattice Decoding” (NLD) and its low-complexity approximations such as lattice reduction-aided linear decoders represent an alternative to Maximum Likelihood lattice decoders for MIMO systems. Their diversity order has been investigated in recent works. These showed that the NLD achieves only the receive diversity and that MMSE-GDFE left preprocessing followed by NLD or its approximations achieves the maximum diversity. All the theoretical results have so far focused on the diversity order but this is not the only relevant parameter to achieve good performance and the coding gain also needs to be considered. In addition, up to now there has not been any numerical analysis of the actual performance of these techniques for the coded systems for moderate SNR. In this paper, we consider MIMO systems using high-dimensional perfect space-time codes. We show that by adding MMSE-GDFE preprocessing, the NLD has a loss of only 1.5 dB with respect to optimal decoding in the case of the Perfect Code 4×4. However, even with MMSE-GDFE preprocessing, the performance of lattice-reduction aided linear receivers is still very poor for high-dimensional lattices.
{"title":"On the diversity of the Naive Lattice Decoder","authors":"Asma Mejri, Laura Luzzi, G. R. Othman","doi":"10.1109/WOSSPA.2011.5931516","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931516","url":null,"abstract":"“Naive Lattice Decoding” (NLD) and its low-complexity approximations such as lattice reduction-aided linear decoders represent an alternative to Maximum Likelihood lattice decoders for MIMO systems. Their diversity order has been investigated in recent works. These showed that the NLD achieves only the receive diversity and that MMSE-GDFE left preprocessing followed by NLD or its approximations achieves the maximum diversity. All the theoretical results have so far focused on the diversity order but this is not the only relevant parameter to achieve good performance and the coding gain also needs to be considered. In addition, up to now there has not been any numerical analysis of the actual performance of these techniques for the coded systems for moderate SNR. In this paper, we consider MIMO systems using high-dimensional perfect space-time codes. We show that by adding MMSE-GDFE preprocessing, the NLD has a loss of only 1.5 dB with respect to optimal decoding in the case of the Perfect Code 4×4. However, even with MMSE-GDFE preprocessing, the performance of lattice-reduction aided linear receivers is still very poor for high-dimensional lattices.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129896354","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931478
G. Bouleux, Thameur Kidar, F. Guillet
The problem of estimating the frequencies of a complex signal corrupted by noise is addressed in this paper. Solving the problem by a subspace approach induce an inevitable maximum overlap between windowed observation vectors. It appears therefore that traditional second order statistics do not describe totally the second order behavior and the notion of improper random vector is recommended. Based on this, we analyze an ESPRIT and a Unitary ESPRIT-based methods established with improper random vectors assumption. Numerical simulations and a real application are brought for embellishing the discussion.
{"title":"An improper random vector approach for ESPRIT and unitary ESPRIT frequency estimation","authors":"G. Bouleux, Thameur Kidar, F. Guillet","doi":"10.1109/WOSSPA.2011.5931478","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931478","url":null,"abstract":"The problem of estimating the frequencies of a complex signal corrupted by noise is addressed in this paper. Solving the problem by a subspace approach induce an inevitable maximum overlap between windowed observation vectors. It appears therefore that traditional second order statistics do not describe totally the second order behavior and the notion of improper random vector is recommended. Based on this, we analyze an ESPRIT and a Unitary ESPRIT-based methods established with improper random vectors assumption. Numerical simulations and a real application are brought for embellishing the discussion.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129964478","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-09DOI: 10.1109/WOSSPA.2011.5931415
Nabila Brahimi, S. Bouguezel
A new fast matrix is introduced for the discrete cosine transform (DCT), an important transform that is of particular interest in image compression. For an 8-point DCT only 16 additions are required by appropriately introducing some zeros in the 8×8 Signed DCT (SDCT) matrix taking into account the orthogonality conditions. The second originality of this work is the development of a suitable quantization matrix suitable for our proposed transform matrix. This quantization matrix improves the peak signal to noise ratio (PSNR) by about 0.7 dB compared to the JPEG quantization matrix.
{"title":"An efficient fast integer DCT transform for images compression with 16 additions only","authors":"Nabila Brahimi, S. Bouguezel","doi":"10.1109/WOSSPA.2011.5931415","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931415","url":null,"abstract":"A new fast matrix is introduced for the discrete cosine transform (DCT), an important transform that is of particular interest in image compression. For an 8-point DCT only 16 additions are required by appropriately introducing some zeros in the 8×8 Signed DCT (SDCT) matrix taking into account the orthogonality conditions. The second originality of this work is the development of a suitable quantization matrix suitable for our proposed transform matrix. This quantization matrix improves the peak signal to noise ratio (PSNR) by about 0.7 dB compared to the JPEG quantization matrix.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130780867","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：