Pub Date : 2006-02-01DOI: 10.1093/ietfec/e89-a.2.630
Chau-Yun Hsu, T. Kuo
In this paper, we propose a butterfly structure for Viterbi decoder which works for convolutional codes of all rates R = k/n. It provides an efficient way to find the inherent symmetry of trellis branches. By exploiting the symmetry, only a part of branch metric need to be computed and the others can be derived from the computed branches. Consequently, the computational complexity of Viterbi decoder can be reduced significantly with no error performance loss. In the best case, the butterfly structure can reduce the branch metric computation by a factor of 4
{"title":"A butterfly structure for rate k/n convolutional codes","authors":"Chau-Yun Hsu, T. Kuo","doi":"10.1093/ietfec/e89-a.2.630","DOIUrl":"https://doi.org/10.1093/ietfec/e89-a.2.630","url":null,"abstract":"In this paper, we propose a butterfly structure for Viterbi decoder which works for convolutional codes of all rates R = k/n. It provides an efficient way to find the inherent symmetry of trellis branches. By exploiting the symmetry, only a part of branch metric need to be computed and the others can be derived from the computed branches. Consequently, the computational complexity of Viterbi decoder can be reduced significantly with no error performance loss. In the best case, the butterfly structure can reduce the branch metric computation by a factor of 4","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126180627","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577095
A.F. Leider, E. Balster
This paper presents a method for testing the performance of different path-based coders of wavelet transformed imagery. Path-based coders are very popular techniques for compressing wavelet-transformed imagery, but there has been little knowledge formally documented on the most efficient method of path traversal for the coding process. Thus, this paper presents the findings of several performance tests using two path-based coding techniques. These techniques are used to independently code each subband of several wavelet transformed images using different coding paths in each test. The results are documented and give rise to conclusions on how to best traverse each subband in a wavelet-transformed image for most efficient coding
{"title":"Path-based encoding efficiency of wavelet-based compressed imagery","authors":"A.F. Leider, E. Balster","doi":"10.1109/ISSPIT.2005.1577095","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577095","url":null,"abstract":"This paper presents a method for testing the performance of different path-based coders of wavelet transformed imagery. Path-based coders are very popular techniques for compressing wavelet-transformed imagery, but there has been little knowledge formally documented on the most efficient method of path traversal for the coding process. Thus, this paper presents the findings of several performance tests using two path-based coding techniques. These techniques are used to independently code each subband of several wavelet transformed images using different coding paths in each test. The results are documented and give rise to conclusions on how to best traverse each subband in a wavelet-transformed image for most efficient coding","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116942897","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577070
E. Dellandréa, Hadi Harb, Liming Chen
We present in this paper audio classification schemes that we have experimented in order to perform musical genres classification. This type of classification is a part of a more general domain which is automatic semantic audio classification, the applications of which are more and more numerous in such fields as musical or multimedia databases indexing. Experimental results have shown that the feature set we have developed, based on Zipf laws, associated with a combination of classifiers organized hierarchically according to classes taxonomy allow an efficient classification
{"title":"Zipf, neural networks and SVM for musical genre classification","authors":"E. Dellandréa, Hadi Harb, Liming Chen","doi":"10.1109/ISSPIT.2005.1577070","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577070","url":null,"abstract":"We present in this paper audio classification schemes that we have experimented in order to perform musical genres classification. This type of classification is a part of a more general domain which is automatic semantic audio classification, the applications of which are more and more numerous in such fields as musical or multimedia databases indexing. Experimental results have shown that the feature set we have developed, based on Zipf laws, associated with a combination of classifiers organized hierarchically according to classes taxonomy allow an efficient classification","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127121402","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577191
Seongjai Kim
This article is concerned with a level set segmentation algorithm which hybridizes gradient-based methods and the Mumford-Shah (gradient-free) method, for an efficient and reliable segmentation. We introduce a new strategy for the complementary functions uplusmn , which is computed such that the difference between their average and the given image are able to introduce a reliable driving force for the evolution of the level set function. An effective method of background subtraction is suggested in order to improve reliability of the new model. An incomplete (linearized) alternating direction implicit (ADI) method is applied for an efficient time-stepping procedure. For a fast convergence, we also suggest effective initialization strategies for the level set function. The resulting algorithm has proved to locate the desired edges satisfactorily in 2-4 ADI iterations
{"title":"A hybrid level set approach for efficient and reliable image segmentation","authors":"Seongjai Kim","doi":"10.1109/ISSPIT.2005.1577191","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577191","url":null,"abstract":"This article is concerned with a level set segmentation algorithm which hybridizes gradient-based methods and the Mumford-Shah (gradient-free) method, for an efficient and reliable segmentation. We introduce a new strategy for the complementary functions uplusmn , which is computed such that the difference between their average and the given image are able to introduce a reliable driving force for the evolution of the level set function. An effective method of background subtraction is suggested in order to improve reliability of the new model. An incomplete (linearized) alternating direction implicit (ADI) method is applied for an efficient time-stepping procedure. For a fast convergence, we also suggest effective initialization strategies for the level set function. The resulting algorithm has proved to locate the desired edges satisfactorily in 2-4 ADI iterations","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124940708","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577123
F. Yaghmaee, M. Jamzad
Some of the most important classes of watermark detection methods in image watermarking are correlation-based algorithms. In these methods usually a pseudorandom pattern is embedded in host image. Receiver can regenerate this pattern by having a key that is the seed of a random number generator. After that if the correlation between this pattern and the image that is assumed to have the watermark is higher than a predefined threshold, this means that the watermark exists and vise versa. In this paper we showed the advantage of using the Julian set patterns as a watermark, instead of commonly used pseudorandom noisy pattern. Julian set patterns can be regenerate in receiver with few parameters such as coefficients of its function and an initial point, which can be embedded in the key. Our experiments showed that these patterns not only manipulate fewer numbers of pixels but also increase the robustness of watermark against attacks
{"title":"Using Julian set patterns for higher robustness in correlation based watermarking methods","authors":"F. Yaghmaee, M. Jamzad","doi":"10.1109/ISSPIT.2005.1577123","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577123","url":null,"abstract":"Some of the most important classes of watermark detection methods in image watermarking are correlation-based algorithms. In these methods usually a pseudorandom pattern is embedded in host image. Receiver can regenerate this pattern by having a key that is the seed of a random number generator. After that if the correlation between this pattern and the image that is assumed to have the watermark is higher than a predefined threshold, this means that the watermark exists and vise versa. In this paper we showed the advantage of using the Julian set patterns as a watermark, instead of commonly used pseudorandom noisy pattern. Julian set patterns can be regenerate in receiver with few parameters such as coefficients of its function and an initial point, which can be embedded in the key. Our experiments showed that these patterns not only manipulate fewer numbers of pixels but also increase the robustness of watermark against attacks","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123540434","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577169
S. Spinsante, Franco Chiaraluce, E. Gambi, Chiara Falasconi
The high compression efficiency ensured by the JVT H.264 video coding standard is mostly based on the adoption of a variable block-size motion estimation and mode decision. However, these advanced features imply a remarkable increase in the encoder complexity. To face the complexity issues, a number of algorithms and techniques have been developed, with the aim to speed up both the processes. In this paper, one of the algorithms proposed for fast mode decision is reviewed and evaluated, with respect to the reference software implementation, and some improvements are suggested, in order to make its behavior adaptable to the video content
{"title":"Mode decision optimization issues in H.264 video coding","authors":"S. Spinsante, Franco Chiaraluce, E. Gambi, Chiara Falasconi","doi":"10.1109/ISSPIT.2005.1577169","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577169","url":null,"abstract":"The high compression efficiency ensured by the JVT H.264 video coding standard is mostly based on the adoption of a variable block-size motion estimation and mode decision. However, these advanced features imply a remarkable increase in the encoder complexity. To face the complexity issues, a number of algorithms and techniques have been developed, with the aim to speed up both the processes. In this paper, one of the algorithms proposed for fast mode decision is reviewed and evaluated, with respect to the reference software implementation, and some improvements are suggested, in order to make its behavior adaptable to the video content","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"54 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114044783","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577192
Y. Lam, M. Mak, P. Leong
This paper presents a methodology that uses surface electromyogram (SEMG) signals recorded from the cheek and chin to synthesize speech. Simultaneously recorded speech and SEMG signals are blocked into frames and transformed into features. Linear predictive coding (LPC) and short-time Fourier transform coefficients are chosen as speech and SEMG features respectively. A neural network is applied to convert SEMG features into speech features on a frame-by-frame basis. The converted speech features are used to reconstruct the original speech. Feature selection, conversion methodology and experimental results are discussed. The results show that phoneme-based feature extraction and frame-based feature conversion could be applied to SEMG-based continuous speech synthesis
{"title":"Speech synthesis from surface electromyogram signal","authors":"Y. Lam, M. Mak, P. Leong","doi":"10.1109/ISSPIT.2005.1577192","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577192","url":null,"abstract":"This paper presents a methodology that uses surface electromyogram (SEMG) signals recorded from the cheek and chin to synthesize speech. Simultaneously recorded speech and SEMG signals are blocked into frames and transformed into features. Linear predictive coding (LPC) and short-time Fourier transform coefficients are chosen as speech and SEMG features respectively. A neural network is applied to convert SEMG features into speech features on a frame-by-frame basis. The converted speech features are used to reconstruct the original speech. Feature selection, conversion methodology and experimental results are discussed. The results show that phoneme-based feature extraction and frame-based feature conversion could be applied to SEMG-based continuous speech synthesis","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"287 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114179020","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577189
Yu-Kumg Chen, Yi-Fan Chang
Optical character recognition occupies a very important field in digital image processing. It is used extensively in daily life. If the given image does not have a bimodal intensity histogram, it would cause segmenting mistake easily for the previous bi-level algorithms. In order to solve this problem, a new algorithm is proposed in this paper. The proposed algorithm uses the theory of moving average on the histogram of the fuzzy image, and then derives the better histogram. Since use only one thresholding value cannot solve this problem completely, the edge information and the window processing are introduced in this paper for advanced thresholding. Thus, a more refine bi-level image is derived and it will result in the improvement of optical character recognition. Experiments are carried out for some samples with shading to demonstrate the computational advantage of the proposed method
{"title":"Global automatic thresholding with edge information and moving average on histogram","authors":"Yu-Kumg Chen, Yi-Fan Chang","doi":"10.1109/ISSPIT.2005.1577189","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577189","url":null,"abstract":"Optical character recognition occupies a very important field in digital image processing. It is used extensively in daily life. If the given image does not have a bimodal intensity histogram, it would cause segmenting mistake easily for the previous bi-level algorithms. In order to solve this problem, a new algorithm is proposed in this paper. The proposed algorithm uses the theory of moving average on the histogram of the fuzzy image, and then derives the better histogram. Since use only one thresholding value cannot solve this problem completely, the edge information and the window processing are introduced in this paper for advanced thresholding. Thus, a more refine bi-level image is derived and it will result in the improvement of optical character recognition. Experiments are carried out for some samples with shading to demonstrate the computational advantage of the proposed method","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122245687","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577091
Sungho Kim, Sunshin An
This paper proposes a new micro-mobility scheme using core node. This node manages routing information for a mobile host and not to generate unnecessary messages at each base station and wired node. This scheme can prevent control traffics from all networks and reduce packet loss and handover latency because these messages can be sent to only the core node. We have conducted distribution of traffic as messages which created at old BS and then disappeared at core node for maintenance of routing table. We have evaluated the performance of our micro-mobility scheme through a series of simulations using the network simulator 2 (ns-2)
{"title":"A new micro-mobility scheme using core node in all-IP-based wireless systems","authors":"Sungho Kim, Sunshin An","doi":"10.1109/ISSPIT.2005.1577091","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577091","url":null,"abstract":"This paper proposes a new micro-mobility scheme using core node. This node manages routing information for a mobile host and not to generate unnecessary messages at each base station and wired node. This scheme can prevent control traffics from all networks and reduce packet loss and handover latency because these messages can be sent to only the core node. We have conducted distribution of traffic as messages which created at old BS and then disappeared at core node for maintenance of routing table. We have evaluated the performance of our micro-mobility scheme through a series of simulations using the network simulator 2 (ns-2)","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130228263","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577069
M. Kobayashi, S. Wada
In this paper, the analysis and synthesis methods of particular emotional voice for man-machine natural interface is developed. First, the emotional voice (neutral, anger, sadness, joy, dislike) is analyzed using time-frequency representation of speech and similarity analysis. Then, based on the result of emotional analysis, a voice with neutral emotion is transformed to synthesize the particular emotional voice using time-frequency modifications. In the simulations, five types of emotion are analyzed using 50 samples of speech signals. The satisfactory average discrimination rate is achieved in the similarity analysis. Further, the synthesized emotional voice is subjectively evaluated. It is confirmed that the emotional voice is naturally generated by the proposed time-frequency based approach
{"title":"Time-frequency approach for analysis and synthesis of particular emotional voice","authors":"M. Kobayashi, S. Wada","doi":"10.1109/ISSPIT.2005.1577069","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577069","url":null,"abstract":"In this paper, the analysis and synthesis methods of particular emotional voice for man-machine natural interface is developed. First, the emotional voice (neutral, anger, sadness, joy, dislike) is analyzed using time-frequency representation of speech and similarity analysis. Then, based on the result of emotional analysis, a voice with neutral emotion is transformed to synthesize the particular emotional voice using time-frequency modifications. In the simulations, five types of emotion are analyzed using 50 samples of speech signals. The satisfactory average discrimination rate is achieved in the similarity analysis. Further, the synthesized emotional voice is subjectively evaluated. It is confirmed that the emotional voice is naturally generated by the proposed time-frequency based approach","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129404017","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
扫码关注我们
求助内容：
应助结果提醒方式：