Pub Date : 2007-04-15DOI: 10.1093/ietfec/e90-a.4.764
Yang Song, Zhenyu Liu, T. Ikenaga, S. Goto
This paper present a simple and effective method to further reduce the search points in the multilevel successive elimination algorithm (MSEA). Because the sea values for most of the best matching search positions are much smaller than the current minimum SAD, we can simply increase the calculated sea value to increase the elimination ratio without much affecting the coding efficiency. Compared with the MSEA algorithm, experiments show that the proposed strict MSEA algorithm (SMSEA) can provides almost 6.5 times speedup with stable image quality, which is better than diamond search (DS). In practice, the proposed technique can also be used in the fine granularity SEA (FGSE) algorithm and the calculation process can be traced by analogy
{"title":"Lossy Strict Multilevel Successive Elimination Algorithm for Fast Motion Estimation","authors":"Yang Song, Zhenyu Liu, T. Ikenaga, S. Goto","doi":"10.1093/ietfec/e90-a.4.764","DOIUrl":"https://doi.org/10.1093/ietfec/e90-a.4.764","url":null,"abstract":"This paper present a simple and effective method to further reduce the search points in the multilevel successive elimination algorithm (MSEA). Because the sea values for most of the best matching search positions are much smaller than the current minimum SAD, we can simply increase the calculated sea value to increase the elimination ratio without much affecting the coding efficiency. Compared with the MSEA algorithm, experiments show that the proposed strict MSEA algorithm (SMSEA) can provides almost 6.5 times speedup with stable image quality, which is better than diamond search (DS). In practice, the proposed technique can also be used in the fine granularity SEA (FGSE) algorithm and the calculation process can be traced by analogy","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129010786","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 : 2006-12-01DOI: 10.1109/ISPACS.2006.364753
Y. Sakaguchi, M. Kurosaki, Hiroshi Ochi, Hanae Sadamichit, Atsushi Shimizu, Kaihei Kuwata
We investigated channel estimation with scattered pilots (SPs) in digital terrestrial television broadcasting (DTTB) and the performance of a receiver with a two-dimensional (2D) filter. High-accuracy interpolation is necessary because we perform channel equalization with SPs, which are inserted in transmit signals nonrectangularly. This interpolation is performed with a 2D filter that has a nonrectangular spectrum. However, the generation of the 2D filter involves heavy computational complexity. We propose a method of reducing the computational complexity by designing separable 2D filters. In addition, we present simulation results that compare our method with some conventional methods and show its effectiveness
{"title":"Design of Interpolated Two-Dimensional Filters with Nonrectangular Lattice for Digital Terrestrial Television Broadcasting","authors":"Y. Sakaguchi, M. Kurosaki, Hiroshi Ochi, Hanae Sadamichit, Atsushi Shimizu, Kaihei Kuwata","doi":"10.1109/ISPACS.2006.364753","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364753","url":null,"abstract":"We investigated channel estimation with scattered pilots (SPs) in digital terrestrial television broadcasting (DTTB) and the performance of a receiver with a two-dimensional (2D) filter. High-accuracy interpolation is necessary because we perform channel equalization with SPs, which are inserted in transmit signals nonrectangularly. This interpolation is performed with a 2D filter that has a nonrectangular spectrum. However, the generation of the 2D filter involves heavy computational complexity. We propose a method of reducing the computational complexity by designing separable 2D filters. In addition, we present simulation results that compare our method with some conventional methods and show its effectiveness","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115442100","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 : 2006-12-01DOI: 10.1109/ISPACS.2006.364863
Yasutomo Kawashima, S. Sasaki, H. Kikuchi
This paper proposes fractionally spaced selective Rake (FSRake) receiver for M-ary bi-orthogonal keying based direct sequence ultra wideband (MBOK DS-UWB) wireless systems. Conventional Rake receiver combines resolved matched filter outputs by sampling with pulse duration. In the proposed FSRake reception, matched filter output is sampled by the fractional duration of pulse. A certain number of strongest paths are combined among these sampled outputs. This proposed FSRake receiver provides more energy capture than conventional Rake receiver. Simulation results show that the proposed FSRake reception provides more than 8 dB SNR gain at the 10-5 bit error rate in comparison with the conventional Rake reception in 2BOK
{"title":"Fractionally Spaced Selective Rake Reception for MBOK DS-UWB Systems","authors":"Yasutomo Kawashima, S. Sasaki, H. Kikuchi","doi":"10.1109/ISPACS.2006.364863","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364863","url":null,"abstract":"This paper proposes fractionally spaced selective Rake (FSRake) receiver for M-ary bi-orthogonal keying based direct sequence ultra wideband (MBOK DS-UWB) wireless systems. Conventional Rake receiver combines resolved matched filter outputs by sampling with pulse duration. In the proposed FSRake reception, matched filter output is sampled by the fractional duration of pulse. A certain number of strongest paths are combined among these sampled outputs. This proposed FSRake receiver provides more energy capture than conventional Rake receiver. Simulation results show that the proposed FSRake reception provides more than 8 dB SNR gain at the 10-5 bit error rate in comparison with the conventional Rake reception in 2BOK","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116776694","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 : 2006-12-01DOI: 10.1109/ISPACS.2006.364858
M. Nakamoto, S. Fujimoto, A. Doi, T. Hinamoto
We treat a digital watermarking in digital still image based on discrete wavelet transform (DWT). For copyright protection, ID is embedded in DWT domain by using key sequence. For security, it is desirable to be hard to counterfeit the key and ID. In this work, we propose a watermarking method with new key sequence in the DWT domain. By using the proposed method, it is difficult to counterfeit the key and ID. Additionally, we show how to design the key sequence so that the robustness of the watermark is strong. Finally, we show the robustness against jpeg attack on the proposed watermarking method by computer simulation
{"title":"Wavelet-Based Watermarking with New Key Sequence in Still Images","authors":"M. Nakamoto, S. Fujimoto, A. Doi, T. Hinamoto","doi":"10.1109/ISPACS.2006.364858","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364858","url":null,"abstract":"We treat a digital watermarking in digital still image based on discrete wavelet transform (DWT). For copyright protection, ID is embedded in DWT domain by using key sequence. For security, it is desirable to be hard to counterfeit the key and ID. In this work, we propose a watermarking method with new key sequence in the DWT domain. By using the proposed method, it is difficult to counterfeit the key and ID. Additionally, we show how to design the key sequence so that the robustness of the watermark is strong. Finally, we show the robustness against jpeg attack on the proposed watermarking method by computer simulation","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127185710","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 : 2006-12-01DOI: 10.1109/ISPACS.2006.364802
M. Elsabrouty, M. Bouchard, T. Aboulnasr
A new algorithm for blind signal separation that does not require pre-whitening is proposed in this paper. The algorithm is based on an iterative inversion of the mixing matrix. The algorithm is capable of working on-line and provides improved convergence speed and steady state error compared to the popular natural gradient algorithm, with a low additional computational cost
{"title":"An RLS-Iterative Inversion Approach for Blind Signal Separation","authors":"M. Elsabrouty, M. Bouchard, T. Aboulnasr","doi":"10.1109/ISPACS.2006.364802","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364802","url":null,"abstract":"A new algorithm for blind signal separation that does not require pre-whitening is proposed in this paper. The algorithm is based on an iterative inversion of the mixing matrix. The algorithm is capable of working on-line and provides improved convergence speed and steady state error compared to the popular natural gradient algorithm, with a low additional computational cost","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124923495","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 : 2006-12-01DOI: 10.1109/ISPACS.2006.364739
Wen-Thong Chang, Chia-Wei Chang
An adaptive subcarrier assignment and bit loading strategy for multiple users in an orthogonal-frequency division multiplexing-based wireless system is considered. Based on the channel condition for each user, the algorithm minimizes the system total transmit power while satisfying each user's transmission rate constraint under a given bit error rate requirement. The minimization is attained by an optimal weighting for each user during the compete for the subcarrier. The problem of joint allocation is divided into two steps. First subcarrier assignment based on channel condition is performed. After that, the modulation level on each subcarrier is determined. Both the carrier assignment and bit allocation are iteratively adjusted by properly adjusting the weighting factor for each user until all the transmit constraints for all the users are satisfied. The purpose of such iteration is to ensure that total system power is minimized. During the iterative search, efficient estimation of the weighting factor is proposed.
{"title":"Computationally Efficient Algorithm For Sub-carrier, Bit, and Power Allocation","authors":"Wen-Thong Chang, Chia-Wei Chang","doi":"10.1109/ISPACS.2006.364739","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364739","url":null,"abstract":"An adaptive subcarrier assignment and bit loading strategy for multiple users in an orthogonal-frequency division multiplexing-based wireless system is considered. Based on the channel condition for each user, the algorithm minimizes the system total transmit power while satisfying each user's transmission rate constraint under a given bit error rate requirement. The minimization is attained by an optimal weighting for each user during the compete for the subcarrier. The problem of joint allocation is divided into two steps. First subcarrier assignment based on channel condition is performed. After that, the modulation level on each subcarrier is determined. Both the carrier assignment and bit allocation are iteratively adjusted by properly adjusting the weighting factor for each user until all the transmit constraints for all the users are satisfied. The purpose of such iteration is to ensure that total system power is minimized. During the iterative search, efficient estimation of the weighting factor is proposed.","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125284894","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 : 2006-12-01DOI: 10.1109/ISPACS.2006.364723
K. Choeychuen, P. Kumhom, K. Chamnongthai
An independent visual objects tracking is less reliable than the data association of visual objects tracking. This paper describes a tracking method based on the nearest neighbor (NN) data association, which serves lower computational than do the multiple hypothesis tracking (MHT) or the joint probabilistic data association filter (JPDAF) but gives low reliability, if the number of targets is increased. This reliability can be increased by selecting appropriate visual object model. To obtain low computation while capable of handling non-rigid object, we propose an object model which combines the threshold of accumulated object region and the object bounding box. The elements of the association matrix are the distance function that is proposed as a mixture of object models of distance function. The combinations of object models of distance function are important mechanism for determining appropriate state of object correspondence which can be divided into six groups: updated track, missing track, newly track, grouped track, merged track and complex track. The missing track is solved by the track life time criterion while the grouping, the merged and the complex track are resolved by using the proposed NN algorithm again. The experimental results are correctly shown on various situations of correspondence problem from surveillance image sequences
{"title":"An Efficient Implementation of the Nearest Neighbor Based Visual Objects Tracking","authors":"K. Choeychuen, P. Kumhom, K. Chamnongthai","doi":"10.1109/ISPACS.2006.364723","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364723","url":null,"abstract":"An independent visual objects tracking is less reliable than the data association of visual objects tracking. This paper describes a tracking method based on the nearest neighbor (NN) data association, which serves lower computational than do the multiple hypothesis tracking (MHT) or the joint probabilistic data association filter (JPDAF) but gives low reliability, if the number of targets is increased. This reliability can be increased by selecting appropriate visual object model. To obtain low computation while capable of handling non-rigid object, we propose an object model which combines the threshold of accumulated object region and the object bounding box. The elements of the association matrix are the distance function that is proposed as a mixture of object models of distance function. The combinations of object models of distance function are important mechanism for determining appropriate state of object correspondence which can be divided into six groups: updated track, missing track, newly track, grouped track, merged track and complex track. The missing track is solved by the track life time criterion while the grouping, the merged and the complex track are resolved by using the proposed NN algorithm again. The experimental results are correctly shown on various situations of correspondence problem from surveillance image sequences","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125509264","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 : 2006-12-01DOI: 10.1109/ISPACS.2006.364794
David Wu, D. Tan, Henry Wu, D. Tan, Hong Ren Wu
A method of encoding digital medical mammograms is presented in this paper. Based on the JPEG2000 coding framework and embedded with an advanced perceptual distortion measure, the proposed coder identifies and removes visually insignificant/irrelevant information, so as to achieve perceptually lossless quality. Compared with the state-of-the-art JPEG compliant LOCO lossless coder and JPEG2000 lossless coder, current results have shown compression ratio gains in bit-rate without any loss of visual fidelity
{"title":"Perceptually Lossless Image Coding of Digital Medical Mammograms with Arithmetic Visual Pruning","authors":"David Wu, D. Tan, Henry Wu, D. Tan, Hong Ren Wu","doi":"10.1109/ISPACS.2006.364794","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364794","url":null,"abstract":"A method of encoding digital medical mammograms is presented in this paper. Based on the JPEG2000 coding framework and embedded with an advanced perceptual distortion measure, the proposed coder identifies and removes visually insignificant/irrelevant information, so as to achieve perceptually lossless quality. Compared with the state-of-the-art JPEG compliant LOCO lossless coder and JPEG2000 lossless coder, current results have shown compression ratio gains in bit-rate without any loss of visual fidelity","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116245592","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 : 2006-12-01DOI: 10.1109/ISPACS.2006.364852
T. Hattori, K. Ichige
This paper presents a high-speed procedure of intra prediction mode decision in H.264/AVC using DCT coefficients. Intra prediction mode is one of the techniques that are newly introduced in H.264/AVC. This technique can enhance compression efficiency in an intra frame, however a large computational cost is often needed for the prediction. Recalling that DCT bases are well-related to intra prediction modes, we develop a novel approach of intra prediction mode decision using DCT coefficients. The proposed technique is evaluated in comparison of some conventional techniques through computer simulation
{"title":"Intra Prediction Mode Decision in H.264/AVC Using DCT Coefficients","authors":"T. Hattori, K. Ichige","doi":"10.1109/ISPACS.2006.364852","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364852","url":null,"abstract":"This paper presents a high-speed procedure of intra prediction mode decision in H.264/AVC using DCT coefficients. Intra prediction mode is one of the techniques that are newly introduced in H.264/AVC. This technique can enhance compression efficiency in an intra frame, however a large computational cost is often needed for the prediction. Recalling that DCT bases are well-related to intra prediction modes, we develop a novel approach of intra prediction mode decision using DCT coefficients. The proposed technique is evaluated in comparison of some conventional techniques through computer simulation","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116851660","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 : 2006-12-01DOI: 10.1109/ISPACS.2006.364729
Cheng-Tung Ku, K. Hung, Huan-Sheng Wang, Yao-Shan Hung
In this paper, a novel ECG data compression method based on the reversible round-off non-recursive 1-D discrete periodized wavelet transform (1-D NRDPWT) is proposed. The reversible round-off 1-D NRDPWT can perform overall stages decomposition with minimum register word length and resist quantization error propagation. A non-linear word length reduction algorithm is developed to have high compression ratio (CR). This algorithm supplies high and low octaves coefficients with small and large decimal quantization scales, respectively. Using the MIT-BIH arrhythmia database, the experimental results show that this novel approach obtains much better compression performance than the SPIHT scheme, especially in high CR situation
{"title":"A Novel ECG Data Compression Based On Reversible Round-Off 1-D NRDPWT","authors":"Cheng-Tung Ku, K. Hung, Huan-Sheng Wang, Yao-Shan Hung","doi":"10.1109/ISPACS.2006.364729","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364729","url":null,"abstract":"In this paper, a novel ECG data compression method based on the reversible round-off non-recursive 1-D discrete periodized wavelet transform (1-D NRDPWT) is proposed. The reversible round-off 1-D NRDPWT can perform overall stages decomposition with minimum register word length and resist quantization error propagation. A non-linear word length reduction algorithm is developed to have high compression ratio (CR). This algorithm supplies high and low octaves coefficients with small and large decimal quantization scales, respectively. Using the MIT-BIH arrhythmia database, the experimental results show that this novel approach obtains much better compression performance than the SPIHT scheme, especially in high CR situation","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129565041","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
扫码关注我们
求助内容：
应助结果提醒方式：