Pub Date : 2003-10-15DOI: 10.1109/TENCON.2003.1273348
M. Yamaguchi, Y. Tadokoro
A new pitch estimation method for song sounds using twelve comb filters and singular value decomposition (SVD) processing is presented. This method is based on the ability of a comb filter, corresponding to one tone, to eliminate the fundamental frequency and other harmonic frequencies, and also on the relationship between the number of singular values obtained from the SVD and the number of the signal harmonic components. The pitches can be estimated by using a set of twelve comb filters connected in parallel to eliminate one tone in the input, and by identifying outputs with a smaller number of singular values. Pitch estimation results for a duet and a trio with this method are presented.
{"title":"Pitch estimation of polyphonic songs using comb filters and singular value decomposition","authors":"M. Yamaguchi, Y. Tadokoro","doi":"10.1109/TENCON.2003.1273348","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273348","url":null,"abstract":"A new pitch estimation method for song sounds using twelve comb filters and singular value decomposition (SVD) processing is presented. This method is based on the ability of a comb filter, corresponding to one tone, to eliminate the fundamental frequency and other harmonic frequencies, and also on the relationship between the number of singular values obtained from the SVD and the number of the signal harmonic components. The pitches can be estimated by using a set of twelve comb filters connected in parallel to eliminate one tone in the input, and by identifying outputs with a smaller number of singular values. Pitch estimation results for a duet and a trio with this method are presented.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130194867","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 : 2003-10-15DOI: 10.1109/TENCON.2003.1273183
S. Venkatesan, P. Vanaja Ranjan, D. Ashokaraju
The parameters of lightning impulse (LI) can be determined as per IEC-60/IEEE-4 standard, if the shape of the impulse is smooth. However, difficulties arise if the oscillations or overshoot are superimposed on the waveform. If the frequency of such oscillation is greater than 0.5 MHz or the duration of overshoot is less than 1 /spl mu/sec, it is essential to determine the mean curve for evaluating LI Parameters. In this work, two approaches in evaluating the mean curve are extensively analyzed. The first approach is based on multiresolution signal decomposition. This technique uses the wavelet transform, where a dyadic-orthonormal function decomposes the signal into a smooth and detailed version of the original signal. After removing high frequency components from detailed signal, the mean curve of the impulse waveform can be reconstructed. The second approach is based on mathematical curve fitting where smooth or oscillating impulse is represented by a non-linear impulse waveform equation, representing a double exponential function with sine and cosine terms and Levenberg-Marquardt algorithm is used to minimize least mean square error. The merits and demerits of the above two methods are compared and analyzed. Case studies involving the standard lightning impulse (SLI), lighting impulse with front oscillations (LIFO), with peak oscillations (LIPO), impulse with long duration overshoot (LILDO), impulse with front as well as peak oscillations (LlFPO) and impulse with noise (LIN) have been considered. Based on the above analysis, a conclusion is arrived.
{"title":"A comparative study on methods for evaluation of lightning impulse parameters","authors":"S. Venkatesan, P. Vanaja Ranjan, D. Ashokaraju","doi":"10.1109/TENCON.2003.1273183","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273183","url":null,"abstract":"The parameters of lightning impulse (LI) can be determined as per IEC-60/IEEE-4 standard, if the shape of the impulse is smooth. However, difficulties arise if the oscillations or overshoot are superimposed on the waveform. If the frequency of such oscillation is greater than 0.5 MHz or the duration of overshoot is less than 1 /spl mu/sec, it is essential to determine the mean curve for evaluating LI Parameters. In this work, two approaches in evaluating the mean curve are extensively analyzed. The first approach is based on multiresolution signal decomposition. This technique uses the wavelet transform, where a dyadic-orthonormal function decomposes the signal into a smooth and detailed version of the original signal. After removing high frequency components from detailed signal, the mean curve of the impulse waveform can be reconstructed. The second approach is based on mathematical curve fitting where smooth or oscillating impulse is represented by a non-linear impulse waveform equation, representing a double exponential function with sine and cosine terms and Levenberg-Marquardt algorithm is used to minimize least mean square error. The merits and demerits of the above two methods are compared and analyzed. Case studies involving the standard lightning impulse (SLI), lighting impulse with front oscillations (LIFO), with peak oscillations (LIPO), impulse with long duration overshoot (LILDO), impulse with front as well as peak oscillations (LlFPO) and impulse with noise (LIN) have been considered. Based on the above analysis, a conclusion is arrived.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130211779","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 : 2003-10-15DOI: 10.1109/TENCON.2003.1273226
W. Hui, N. Kulathuramaiyer, Wang Yin Chai, Ahdelhamid Abdessalam
The representation of spatial features is important for color-spatial based image retrieval systems for producing results that conform to human perception. The paper discusses the performance of the spiral representation of the spatial feature as proposed by Wang Hui Hui et al. (First Regional Malaysia-France Workshop on Image Processing in Vision Systems and Multimedia Commun., 2003). This novel approach addresses the issues of rotation and scaling invariance overcoming limitations of existing works.
{"title":"Performance and analysis of the spiral representation of spatial feature for color-spatial image retrieval","authors":"W. Hui, N. Kulathuramaiyer, Wang Yin Chai, Ahdelhamid Abdessalam","doi":"10.1109/TENCON.2003.1273226","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273226","url":null,"abstract":"The representation of spatial features is important for color-spatial based image retrieval systems for producing results that conform to human perception. The paper discusses the performance of the spiral representation of the spatial feature as proposed by Wang Hui Hui et al. (First Regional Malaysia-France Workshop on Image Processing in Vision Systems and Multimedia Commun., 2003). This novel approach addresses the issues of rotation and scaling invariance overcoming limitations of existing works.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130171115","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 : 2003-10-15DOI: 10.1109/TENCON.2003.1273193
S.M. Aziz, M. Michel
This paper presents the hardware design of a forward discrete wavelet transform (FDWT) processor using VHDL. The design is based on the JPEG2000 standard and utilises the lossless features of FDWT. This is a reversible algorithm, which means there is no loss of information while compressing and transmitting the image information. This paper presents the hardware architecture of the processor as well ns the design of its constituent components in VHDL. The architecture does not comprise any hardware multiplier unit and therefore suitable for development of high-performance image processors. Simulations show that one block of an image can be transformed up to 5 levels of computation using this FDWT processor.
{"title":"VHDL based design of an FDWT processor","authors":"S.M. Aziz, M. Michel","doi":"10.1109/TENCON.2003.1273193","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273193","url":null,"abstract":"This paper presents the hardware design of a forward discrete wavelet transform (FDWT) processor using VHDL. The design is based on the JPEG2000 standard and utilises the lossless features of FDWT. This is a reversible algorithm, which means there is no loss of information while compressing and transmitting the image information. This paper presents the hardware architecture of the processor as well ns the design of its constituent components in VHDL. The architecture does not comprise any hardware multiplier unit and therefore suitable for development of high-performance image processors. Simulations show that one block of an image can be transformed up to 5 levels of computation using this FDWT processor.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"228 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113992610","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 : 2003-10-15DOI: 10.1109/TENCON.2003.1273178
K. Keshav, P. Venkataram
This paper proposes IIP (intelligent Internet protocol) which effectively addresses the issues involved in wireless communication at network layer such as support for mobility, frequent loss of connection clue to fading, hand-offs and security. We have chosen to use intelligent agent technology for our architecture of IIP because it provides desirable properties such as speed-up and efficiency, robustness and reliability, scalability and flexibility, development and re-usability. We make use of four intelligent agents namely principal agent (PA), agent for address resolution and mobility support (AARMS), agent for error handling and recovery (AEHR), agent for network security (ANS) and design each agent based on BDI (belief-desire-intention) architecture. A variant of blackboard architecture is used for inter-agent communication. Special care has been taken to make the proposed IP compatible with existing networks. The proposed work has been simulated and verified for its operational effectiveness.
本文提出的智能互联网协议(IIP, intelligent Internet protocol)有效地解决了网络层无线通信所涉及的诸如支持移动性、频繁丢失连接线索、切换和安全性等问题。我们选择在IIP架构中使用智能代理技术，因为它提供了诸如加速和效率、健壮性和可靠性、可伸缩性和灵活性、开发和可重用性等理想属性。我们使用了4个智能代理，分别是:委托代理(PA)、地址解析和移动支持代理(AARMS)、错误处理和恢复代理(AEHR)、网络安全代理(ANS)，并基于BDI (belief-desire-intention)架构设计了每个代理。代理间通信采用了黑板架构的一种变体。已特别注意使拟议的IP与现有网络兼容。所提出的工作已被模拟并验证了其操作有效性。
{"title":"IIP for wireless communication","authors":"K. Keshav, P. Venkataram","doi":"10.1109/TENCON.2003.1273178","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273178","url":null,"abstract":"This paper proposes IIP (intelligent Internet protocol) which effectively addresses the issues involved in wireless communication at network layer such as support for mobility, frequent loss of connection clue to fading, hand-offs and security. We have chosen to use intelligent agent technology for our architecture of IIP because it provides desirable properties such as speed-up and efficiency, robustness and reliability, scalability and flexibility, development and re-usability. We make use of four intelligent agents namely principal agent (PA), agent for address resolution and mobility support (AARMS), agent for error handling and recovery (AEHR), agent for network security (ANS) and design each agent based on BDI (belief-desire-intention) architecture. A variant of blackboard architecture is used for inter-agent communication. Special care has been taken to make the proposed IP compatible with existing networks. The proposed work has been simulated and verified for its operational effectiveness.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127801762","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 : 2003-10-15DOI: 10.1109/TENCON.2003.1273268
Amruta Joshi, Sapna Todwal
The Internet is an extensive source of information and searching it exhaustively is inefficient in terms of time complexity. Web search is one of the most universal and influential applications on the Internet. A new search mechanism called SmartSeek is introduced. Inspired by machine learning concepts, this new technique employs a genetic algorithm (GA) for adapting to the user's interests. The system accepts user feedback for fitness evaluation. The mutation operation involved in the process ensures that the search is not confined to a limited domain.
{"title":"Evolutionary machine learning for Web mining","authors":"Amruta Joshi, Sapna Todwal","doi":"10.1109/TENCON.2003.1273268","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273268","url":null,"abstract":"The Internet is an extensive source of information and searching it exhaustively is inefficient in terms of time complexity. Web search is one of the most universal and influential applications on the Internet. A new search mechanism called SmartSeek is introduced. Inspired by machine learning concepts, this new technique employs a genetic algorithm (GA) for adapting to the user's interests. The system accepts user feedback for fitness evaluation. The mutation operation involved in the process ensures that the search is not confined to a limited domain.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129343025","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 : 2003-10-15DOI: 10.1109/TENCON.2003.1273440
N. Swamy, F. L. Lewis
In this paper, the authors investigate hierarchical interconnection networks. A novel interconnection mesh network is presented. This network is made hierarchical by proper choice of node placements. Routing within this network is made very logical by basing it on a specific node numbering convention. The proposed algorithm is very intuitive and remains the same over all the layers of the hierarchy. Failure recovery is incorporated into the network at a structural level by restricting the number of links connecting different nodes at each hierarchical level, and at the routing algorithm level by switching in the unused links in case of failure.
{"title":"Routing algorithms in hierarchical mesh networks with failure recovery","authors":"N. Swamy, F. L. Lewis","doi":"10.1109/TENCON.2003.1273440","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273440","url":null,"abstract":"In this paper, the authors investigate hierarchical interconnection networks. A novel interconnection mesh network is presented. This network is made hierarchical by proper choice of node placements. Routing within this network is made very logical by basing it on a specific node numbering convention. The proposed algorithm is very intuitive and remains the same over all the layers of the hierarchy. Failure recovery is incorporated into the network at a structural level by restricting the number of links connecting different nodes at each hierarchical level, and at the routing algorithm level by switching in the unused links in case of failure.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128652912","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 : 2003-10-15DOI: 10.1109/TENCON.2003.1273365
K. Chitte, K. Swarup
A new formulation of the power system state estimation problem and a new solution technique is presented. The formulation allows for inequality constraints such as generator VAr limits and transformer tap ratio limits. The solution technique uses a logarithmic barrier function to treat inequality constraints. Non-quadratic criteria for power system state estimation have to facilitate bad data detection and identification. The weighted least absolute value criteria have the desired bad data rejection property. This paper shows that the logarithmic barrier function can accommodate inequality constraints, and then applying the Newton method to solve the KKT equation leads to a problem structure which is identical to that of the non-linear least square problem. The number of iterations needed for convergence does not increase linearly with problem size, unlike the LP algorithm.
{"title":"Power system state estimation using IP barrier method","authors":"K. Chitte, K. Swarup","doi":"10.1109/TENCON.2003.1273365","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273365","url":null,"abstract":"A new formulation of the power system state estimation problem and a new solution technique is presented. The formulation allows for inequality constraints such as generator VAr limits and transformer tap ratio limits. The solution technique uses a logarithmic barrier function to treat inequality constraints. Non-quadratic criteria for power system state estimation have to facilitate bad data detection and identification. The weighted least absolute value criteria have the desired bad data rejection property. This paper shows that the logarithmic barrier function can accommodate inequality constraints, and then applying the Newton method to solve the KKT equation leads to a problem structure which is identical to that of the non-linear least square problem. The number of iterations needed for convergence does not increase linearly with problem size, unlike the LP algorithm.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115938841","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 : 2003-10-15DOI: 10.1109/TENCON.2003.1273334
O. V. Ramana Murthy, A. Panda, S. Mukherjee, I. Kar
A Stewart platform, in its most general form, is a parallel manipulator with six linear actuators, connected to the base and the end-effector with spherical joints. The concept of massively parallel binary system (MPBS) is realized by using legs consisting of a very large number of binary actuators. Current focus is on the design of the one-dimensional MPBS where a set of actuators is connected in parallel to a body along the x-axis only. The paper presents the robustness of a control algorithm for 1D MPBS under the fault condition. It was possible to track a specified trajectory with acceptable performance when some actuators stop functioning in mid-process.
{"title":"Fault tolerant operation of one dimensional MPBS","authors":"O. V. Ramana Murthy, A. Panda, S. Mukherjee, I. Kar","doi":"10.1109/TENCON.2003.1273334","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273334","url":null,"abstract":"A Stewart platform, in its most general form, is a parallel manipulator with six linear actuators, connected to the base and the end-effector with spherical joints. The concept of massively parallel binary system (MPBS) is realized by using legs consisting of a very large number of binary actuators. Current focus is on the design of the one-dimensional MPBS where a set of actuators is connected in parallel to a body along the x-axis only. The paper presents the robustness of a control algorithm for 1D MPBS under the fault condition. It was possible to track a specified trajectory with acceptable performance when some actuators stop functioning in mid-process.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116846526","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 : 2003-10-15DOI: 10.1109/TENCON.2003.1273437
S. Narasimhan, S. Pavanalatha
This paper proposes a new estimator for evolutionary spectrum (ES) based on short time Fourier transform (STFT) and modified group delay (MGD). Here, the STFT enables cross term suppression and the MOD preserves the frequency resolution of the rectangular window. It is applicable to deterministic and random signals generated by time varying systems. The proposed method provides signal to noise ratio enhancement due to the use of MGD. The results indicate that for linear chirp signals and for time varying random process, its frequency resolution is close to that of WVD and better than evolutionary periodogram (EP) and STFT. Further, its noise immunity is better than those of EP and STFT.
{"title":"Estimation of evolutionary spectrum based on STFT and modified group delay","authors":"S. Narasimhan, S. Pavanalatha","doi":"10.1109/TENCON.2003.1273437","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273437","url":null,"abstract":"This paper proposes a new estimator for evolutionary spectrum (ES) based on short time Fourier transform (STFT) and modified group delay (MGD). Here, the STFT enables cross term suppression and the MOD preserves the frequency resolution of the rectangular window. It is applicable to deterministic and random signals generated by time varying systems. The proposed method provides signal to noise ratio enhancement due to the use of MGD. The results indicate that for linear chirp signals and for time varying random process, its frequency resolution is close to that of WVD and better than evolutionary periodogram (EP) and STFT. Further, its noise immunity is better than those of EP and STFT.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117157594","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
扫码关注我们
求助内容：
应助结果提醒方式：