Pub Date : 2008-08-08DOI: 10.1109/ICNNSP.2008.4590432
W. Siu, Y. Kam, W. Hui, W. H. Wong, Lili Wang, C. Kok
For homogeneous transcoding, we usually transfer a compressed video into a lower bit-rate and/or video with a smaller size. In this paper we introduce the general architecture of a downing sizing transcoder and propose some novel techniques for its practical realization, including motion vector re-estimation, sub-pixel motion re-estimation, mode re-decision, etc. We then generalize the idea of transcoding to video enlargement and propose a simple framework for its re-encoding. The paper ends with some useful remarks on the formation of super-resolution videos via the transcoder frame work.
{"title":"On the architecture of H.264 to H.264 homogeneous transcoding platform","authors":"W. Siu, Y. Kam, W. Hui, W. H. Wong, Lili Wang, C. Kok","doi":"10.1109/ICNNSP.2008.4590432","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590432","url":null,"abstract":"For homogeneous transcoding, we usually transfer a compressed video into a lower bit-rate and/or video with a smaller size. In this paper we introduce the general architecture of a downing sizing transcoder and propose some novel techniques for its practical realization, including motion vector re-estimation, sub-pixel motion re-estimation, mode re-decision, etc. We then generalize the idea of transcoding to video enlargement and propose a simple framework for its re-encoding. The paper ends with some useful remarks on the formation of super-resolution videos via the transcoder frame work.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131341229","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 : 2008-06-07DOI: 10.1109/ICNNSP.2008.4590380
Gu Mingliang, Xia Yuguo
This paper presents a novel Chinese dialect identification method to solve the poor decision ability existed in most dialect identification system. The new method firstly uses Gaussian mixture models and n-gram language models to produce a global language feature, and makes decision using clustered support vector machine. The experimental results show that the new method not only raises correct identification rate greatly, but also improves the robust of the system.
{"title":"Chinese dialect identification using clustered support vector machine","authors":"Gu Mingliang, Xia Yuguo","doi":"10.1109/ICNNSP.2008.4590380","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590380","url":null,"abstract":"This paper presents a novel Chinese dialect identification method to solve the poor decision ability existed in most dialect identification system. The new method firstly uses Gaussian mixture models and n-gram language models to produce a global language feature, and makes decision using clustered support vector machine. The experimental results show that the new method not only raises correct identification rate greatly, but also improves the robust of the system.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126766463","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 : 2008-06-07DOI: 10.1109/ICNNSP.2008.4590437
Hoi-Kok Cheung, W. Siu, D. Feng, Zhiyong Wan
In this paper, we propose a DCT based binary matching approach for fast motion estimation. The proposed approach is suitable to be applied to our previously proposed retinex based coding system which is characterized with fast motion estimation and the capability of accurately estimating motions for sequences having inter-frame brightness variations. We propose to apply the DCT techniques to the transformation of images to the binary bit plane and to the scaled retinex domain, which is more computationally efficient compared to the conventional convolution based bit transformation approach. Experimental results show that our proposed DCT based bit transform has a very close prediction quality performance(less than 0.1dB drop) to that of the convolution based approach while our system can avoid the extra convolution procedure.
{"title":"Constrained one-bit transform for retinex based motion estimation for sequences with brightness variations","authors":"Hoi-Kok Cheung, W. Siu, D. Feng, Zhiyong Wan","doi":"10.1109/ICNNSP.2008.4590437","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590437","url":null,"abstract":"In this paper, we propose a DCT based binary matching approach for fast motion estimation. The proposed approach is suitable to be applied to our previously proposed retinex based coding system which is characterized with fast motion estimation and the capability of accurately estimating motions for sequences having inter-frame brightness variations. We propose to apply the DCT techniques to the transformation of images to the binary bit plane and to the scaled retinex domain, which is more computationally efficient compared to the conventional convolution based bit transformation approach. Experimental results show that our proposed DCT based bit transform has a very close prediction quality performance(less than 0.1dB drop) to that of the convolution based approach while our system can avoid the extra convolution procedure.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122747239","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 : 2008-06-07DOI: 10.1109/ICNNSP.2008.4590383
Xuelong Hu, Yingcheng Tang, Zheng-Ben Zhang
SIFT (scale invariant feature transform) is used to solve visual tracking problem, where the appearances of the tracked object and scene background change during tracking. The implementation of this algorithm has five major stages: scale-space extrema detection; keypoint localization; orientation assignment; keypoint descriptor; keypoint matching. From the beginning frame, object is selected as the template, its SIFT features are computed. Then in the following frames, the SIFT features are computed. Euclidean distance between the object's SIFT features and the frames' SIFT features can be used to compute the accurate position of the matched object. The experimental results on real video sequences demonstrate the effectiveness of this approach and show this algorithm is of higher robustness and real-time performance. It can solve the matching problem with translation, rotation and affine distortion between images. It plays an important role in video object tracking and video object retrieval.
{"title":"Video object matching based on SIFT algorithm","authors":"Xuelong Hu, Yingcheng Tang, Zheng-Ben Zhang","doi":"10.1109/ICNNSP.2008.4590383","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590383","url":null,"abstract":"SIFT (scale invariant feature transform) is used to solve visual tracking problem, where the appearances of the tracked object and scene background change during tracking. The implementation of this algorithm has five major stages: scale-space extrema detection; keypoint localization; orientation assignment; keypoint descriptor; keypoint matching. From the beginning frame, object is selected as the template, its SIFT features are computed. Then in the following frames, the SIFT features are computed. Euclidean distance between the object's SIFT features and the frames' SIFT features can be used to compute the accurate position of the matched object. The experimental results on real video sequences demonstrate the effectiveness of this approach and show this algorithm is of higher robustness and real-time performance. It can solve the matching problem with translation, rotation and affine distortion between images. It plays an important role in video object tracking and video object retrieval.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122816594","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 : 2008-06-07DOI: 10.1109/ICNNSP.2008.4590299
Feng Wan, Weiping Zhu, M. Swamy
Semi-blind channel estimation as a combination of the training-based or pilot-assisted method and a pure blind approach is considered to be a feasible solution for practical wireless systems due to its better estimation accuracy as well as spectral efficiency. However, in the existing semi-blind channel estimation techniques, the weighting factor employed to trade off the training-based and the blind criteria has not been appropriately determined. In this paper, a closed-form solution is developed for semi-blind channel estimation of MIMO-OFDM systems. An appealing scheme for the computation of the weighting factor is proposed, leading to an analytical expression for the weighting factor in terms the MSE (mean square error) of the training-based criterion and that of the blind part. A number of computer simulation-based experiments are conducted, confirming the effectiveness of the derived semi-blind solution.
{"title":"A closed-form semi-blind solution to MIMO-OFDM channel estimation","authors":"Feng Wan, Weiping Zhu, M. Swamy","doi":"10.1109/ICNNSP.2008.4590299","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590299","url":null,"abstract":"Semi-blind channel estimation as a combination of the training-based or pilot-assisted method and a pure blind approach is considered to be a feasible solution for practical wireless systems due to its better estimation accuracy as well as spectral efficiency. However, in the existing semi-blind channel estimation techniques, the weighting factor employed to trade off the training-based and the blind criteria has not been appropriately determined. In this paper, a closed-form solution is developed for semi-blind channel estimation of MIMO-OFDM systems. An appealing scheme for the computation of the weighting factor is proposed, leading to an analytical expression for the weighting factor in terms the MSE (mean square error) of the training-based criterion and that of the blind part. A number of computer simulation-based experiments are conducted, confirming the effectiveness of the derived semi-blind solution.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128688169","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 : 2008-06-07DOI: 10.1109/ICNNSP.2008.4590391
Jian Huang, Jooheung Lee, Yimin Ge
In this paper, we propose an array-based architecture for DCT computation with high scalability. The scalable architecture can perform DCT computations for 15 different zones and 8 different precisions to achieve quality scalability for DCT coefficients. Due to the quantization process in video coding, the quality can still be retained for larger quantization parameter. We show the detailed comparisons between the quality scalability and the tradeoff factors, i.e., throughput, hardware resources, clock frequencies, and power consumptions.
{"title":"An array-based scalable architecture for DCT computations in video coding","authors":"Jian Huang, Jooheung Lee, Yimin Ge","doi":"10.1109/ICNNSP.2008.4590391","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590391","url":null,"abstract":"In this paper, we propose an array-based architecture for DCT computation with high scalability. The scalable architecture can perform DCT computations for 15 different zones and 8 different precisions to achieve quality scalability for DCT coefficients. Due to the quantization process in video coding, the quality can still be retained for larger quantization parameter. We show the detailed comparisons between the quality scalability and the tradeoff factors, i.e., throughput, hardware resources, clock frequencies, and power consumptions.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"198 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128700448","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 : 2008-06-07DOI: 10.1109/ICNNSP.2008.4590301
Yi Shen, Wenjiang Pei, Tao Li, Jiming Liu, Lei Yang, Shao-ping Wang, Zhenya He
By defining community recursive coefficient M, we propose a new efficient algorithm called filtration split algorithm for discovering community structure in complex networks. By optimizing the M of child-networks based on dynamic recursive principle, the local communities are discovered automatically. Theoretical analysis and experiment results show that the algorithm can filtrate more than one edge once and make the networks split in parallel. For a network with n vertices, m edges, and c communities, the computation complexity is less than O((c+1)m+(c+1)). For many real-world networks are sparse m~n and c+1 Ltn, our algorithm can run in essentially linear time O((c+1)n).
{"title":"Research on finding community structure based on filtration network model","authors":"Yi Shen, Wenjiang Pei, Tao Li, Jiming Liu, Lei Yang, Shao-ping Wang, Zhenya He","doi":"10.1109/ICNNSP.2008.4590301","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590301","url":null,"abstract":"By defining community recursive coefficient M, we propose a new efficient algorithm called filtration split algorithm for discovering community structure in complex networks. By optimizing the M of child-networks based on dynamic recursive principle, the local communities are discovered automatically. Theoretical analysis and experiment results show that the algorithm can filtrate more than one edge once and make the networks split in parallel. For a network with n vertices, m edges, and c communities, the computation complexity is less than O((c+1)m+(c+1)). For many real-world networks are sparse m~n and c+1 Ltn, our algorithm can run in essentially linear time O((c+1)n).","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128989340","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 : 2008-06-07DOI: 10.1109/ICNNSP.2008.4590325
Canyan Zhu, Lihua Zhang
Chien et al proposed an efficient and practical remote authentication using smart cards. In 2004, Ku et al pointed out that Chien et alpsilas scheme is insecure, and proposed an improved password-based remote user authentication scheme. In this paper, the security of Kupsilas scheme is analyzed. It is demonstrated that Kupsilas scheme still has some weaknesses: it cannot withstand against the parallel session attack; it is vulnerable to the password guessing attacks and another new attack; it cannot resist on changing time stamp attack. It is then concluded that Kupsilas scheme cannot achieve the security requirements as their claims. Based on the analysis, we find all the attacks are happened because of the simple computation of h(ci oplus Tj) in all the phases of remote authentication, thus we develop a hyper-complex chaotic hash scheme. It is evidently shown that the security of the improved remote user authentication scheme is efficiently enhanced.
{"title":"Security analysis of a remote user authentication scheme using smart card","authors":"Canyan Zhu, Lihua Zhang","doi":"10.1109/ICNNSP.2008.4590325","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590325","url":null,"abstract":"Chien et al proposed an efficient and practical remote authentication using smart cards. In 2004, Ku et al pointed out that Chien et alpsilas scheme is insecure, and proposed an improved password-based remote user authentication scheme. In this paper, the security of Kupsilas scheme is analyzed. It is demonstrated that Kupsilas scheme still has some weaknesses: it cannot withstand against the parallel session attack; it is vulnerable to the password guessing attacks and another new attack; it cannot resist on changing time stamp attack. It is then concluded that Kupsilas scheme cannot achieve the security requirements as their claims. Based on the analysis, we find all the attacks are happened because of the simple computation of h(ci oplus Tj) in all the phases of remote authentication, thus we develop a hyper-complex chaotic hash scheme. It is evidently shown that the security of the improved remote user authentication scheme is efficiently enhanced.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127700139","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 : 2008-06-07DOI: 10.1109/ICNNSP.2008.4590328
Wanli Lv, Yu-tang Guo, Jixin Ma, B. Luo
In this paper, a novel watermarking scheme based on relationship of Tchebichef moments is proposed. Firstly, the image is divided into blocks; then the Tchebichef momentpsilas relationship of each block is computed, which is computed rapidly with the help of the look-up-table; finally, the Tchebichef moments of each block are modified to embed watermark. The watermark extraction is the reverse procedure of the watermark embedding and the original image is not necessary in the watermark detection. Experimental results demonstrate that the proposed watermarking technique is robustness to attacks such as JPEG compress, noises, luminance and contrast enhancement and low pass filtering.
{"title":"A novel watermarking scheme based on relationship of Tchebichef Moments","authors":"Wanli Lv, Yu-tang Guo, Jixin Ma, B. Luo","doi":"10.1109/ICNNSP.2008.4590328","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590328","url":null,"abstract":"In this paper, a novel watermarking scheme based on relationship of Tchebichef moments is proposed. Firstly, the image is divided into blocks; then the Tchebichef momentpsilas relationship of each block is computed, which is computed rapidly with the help of the look-up-table; finally, the Tchebichef moments of each block are modified to embed watermark. The watermark extraction is the reverse procedure of the watermark embedding and the original image is not necessary in the watermark detection. Experimental results demonstrate that the proposed watermarking technique is robustness to attacks such as JPEG compress, noises, luminance and contrast enhancement and low pass filtering.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121936788","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 : 2008-06-07DOI: 10.1109/ICNNSP.2008.4590304
Kai Wang, Wenjiang Pei, Hai-sen Xia, Zhenya He
The idea of using chaotic signals in the field of communication attracts the attention of researchers as well as engineers. The aim of this paper is to develop data transmission schemes in which the demodulation process is merged with SVD based noise estimation method utilizing CMLs. Because the estimation method of SVD only utilizes the symbol vector sequence and does not care the practical value, our modulation-demodulation scheme based on the estimation method of SVD can be expected to give accurate estimates for information symbol vector at low SNR.
{"title":"Symbolic vector dynamics for processing chaotic signals I: Communication","authors":"Kai Wang, Wenjiang Pei, Hai-sen Xia, Zhenya He","doi":"10.1109/ICNNSP.2008.4590304","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590304","url":null,"abstract":"The idea of using chaotic signals in the field of communication attracts the attention of researchers as well as engineers. The aim of this paper is to develop data transmission schemes in which the demodulation process is merged with SVD based noise estimation method utilizing CMLs. Because the estimation method of SVD only utilizes the symbol vector sequence and does not care the practical value, our modulation-demodulation scheme based on the estimation method of SVD can be expected to give accurate estimates for information symbol vector at low SNR.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121778172","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
扫码关注我们
求助内容：
应助结果提醒方式：