Pub Date : 2003-10-15DOI: 10.1109/TENCON.2003.1273231
P. Jain, S. N. Merchant
An important task in most content-based image retrieval (CBIR) systems is similarity matching. Similarity matching requires feature vector distance computation for each candidate image in an image database. Conventional algorithms based on exhaustive search are highly time consuming and inefficient. With the rapid increase in database size, there is a growing need for a fast and efficient retrieval system. A multiresolution data-structure based approach provides a good solution to the problem, but there is still scope for improvement. We propose a wavelet based multiresolution data-structure algorithm for faster image searching. The proposed approach reduces computation by around 50% over the multiresolution data-structure algorithm. In the proposed approach, we reuse the information obtained at lower resolution levels for similarity matching at higher resolution levels. This algorithm also saves disk storage space by about 50% over the multiresolution data-structure approach. The proposed approach can be easily combined with existing algorithms for further performance enhancement. We use the proposed approach to match similarity between luminance histograms for image retrieval.
{"title":"Wavelet based multiresolution histogram for fast image retrieval","authors":"P. Jain, S. N. Merchant","doi":"10.1109/TENCON.2003.1273231","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273231","url":null,"abstract":"An important task in most content-based image retrieval (CBIR) systems is similarity matching. Similarity matching requires feature vector distance computation for each candidate image in an image database. Conventional algorithms based on exhaustive search are highly time consuming and inefficient. With the rapid increase in database size, there is a growing need for a fast and efficient retrieval system. A multiresolution data-structure based approach provides a good solution to the problem, but there is still scope for improvement. We propose a wavelet based multiresolution data-structure algorithm for faster image searching. The proposed approach reduces computation by around 50% over the multiresolution data-structure algorithm. In the proposed approach, we reuse the information obtained at lower resolution levels for similarity matching at higher resolution levels. This algorithm also saves disk storage space by about 50% over the multiresolution data-structure approach. The proposed approach can be easily combined with existing algorithms for further performance enhancement. We use the proposed approach to match similarity between luminance histograms for image retrieval.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"46 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":"125100747","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.1273302
A. Rangarajan, S.K. Singh, V. Sharma
We study adaptive power allocation (PA) policies for improving the performance of convolutional and turbo codes on fading channels. The transmitter has an average power constraint. The fading process can be continuous (e.g., Rayleigh distribution). Perfect channel state information at the transmitter (CSIT) and the receiver (CSIR) are assumed. For convolutional codes, we consider block (slow) fading and fast fading environments separately and propose new PA policies that reduce the BER. We do a comparative study of the proposed PA policies with commonly used policies, e.g. water filling, (truncated) channel inversion and an optimal policy proposed by J.F. Hayes (1968) for an uncoded system. For all the cases studied, we show that the proposed policies substantially outperform commonly used policies. Among existing policies, only Hayes' gives performance improvement over constant PA. We show that interleaving with PA can improve significantly the performance of coded systems on block fading channels. We also make the important observation that the improvements in BER obtained with PA increase with SNR, which is in sharp contrast to the negligible gain in channel capacity obtained with PA (Goldsmith, A.J. and Varaiya, P., 1997). Since direct optimization for turbo codes is difficult, we use the policies derived for convolutional codes on the constituent convolutional codes of turbo codes and show that significant performance improvements can be obtained.
{"title":"Power allocation policies for convolutional and turbo coded systems over fading channels","authors":"A. Rangarajan, S.K. Singh, V. Sharma","doi":"10.1109/TENCON.2003.1273302","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273302","url":null,"abstract":"We study adaptive power allocation (PA) policies for improving the performance of convolutional and turbo codes on fading channels. The transmitter has an average power constraint. The fading process can be continuous (e.g., Rayleigh distribution). Perfect channel state information at the transmitter (CSIT) and the receiver (CSIR) are assumed. For convolutional codes, we consider block (slow) fading and fast fading environments separately and propose new PA policies that reduce the BER. We do a comparative study of the proposed PA policies with commonly used policies, e.g. water filling, (truncated) channel inversion and an optimal policy proposed by J.F. Hayes (1968) for an uncoded system. For all the cases studied, we show that the proposed policies substantially outperform commonly used policies. Among existing policies, only Hayes' gives performance improvement over constant PA. We show that interleaving with PA can improve significantly the performance of coded systems on block fading channels. We also make the important observation that the improvements in BER obtained with PA increase with SNR, which is in sharp contrast to the negligible gain in channel capacity obtained with PA (Goldsmith, A.J. and Varaiya, P., 1997). Since direct optimization for turbo codes is difficult, we use the policies derived for convolutional codes on the constituent convolutional codes of turbo codes and show that significant performance improvements can be obtained.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"23 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":"125657267","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.1273118
N. B. Pasalkar, C. Joshi, M. Tasgaonkar
This paper investigates the method for "Devnagari script to speech conversion" as applied to Marathi language by developing the appropriate software. Pre-processing of the typed text is done. The neural network does the pattern matching and character recognition. Neural networks learn from examples and are fault tolerant. Output of neural network is recognized character. The dictionary of .wav files is prepared. After combining the recognised characters they are matched with the words in the .wav file. If the match occurs the success rate is 100% or otherwise the approach of forming the characters is adopted. Using sound playing functions the recognized words are played.
{"title":"Script to speech conversion for Marathi language","authors":"N. B. Pasalkar, C. Joshi, M. Tasgaonkar","doi":"10.1109/TENCON.2003.1273118","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273118","url":null,"abstract":"This paper investigates the method for \"Devnagari script to speech conversion\" as applied to Marathi language by developing the appropriate software. Pre-processing of the typed text is done. The neural network does the pattern matching and character recognition. Neural networks learn from examples and are fault tolerant. Output of neural network is recognized character. The dictionary of .wav files is prepared. After combining the recognised characters they are matched with the words in the .wav file. If the match occurs the success rate is 100% or otherwise the approach of forming the characters is adopted. Using sound playing functions the recognized words are played.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"42 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":"113940913","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.1273215
N. Nagaraj
Wavelet based lossless compression techniques have been popular for medical image compression due to a number of features, like multi-resolution representation, progressive transmission and high compression ratios. As decoding time is of paramount importance in medical applications, low complexity wavelets would be preferred for fast decoding and retrieval of data from picture archiving and communications systems (PACS) enabling quicker diagnosis and higher productivity of the physician. We propose a novel image compression system that claims extremely low complexity, in fact lower than the Haar wavelet, and at the same time providing higher compression ratios. The high pixel-to-pixel correlation inherent in medical images is first exploited by the application of differential pulse code modulation (DPCM) followed by a modified version of the Haar wavelet applied in an incomplete fashion. We report extensive results (first-order entropy estimates) on a large database of medical images.
{"title":"A very low-complexity multi-resolution prediction-based wavelet transform method for medical image compression","authors":"N. Nagaraj","doi":"10.1109/TENCON.2003.1273215","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273215","url":null,"abstract":"Wavelet based lossless compression techniques have been popular for medical image compression due to a number of features, like multi-resolution representation, progressive transmission and high compression ratios. As decoding time is of paramount importance in medical applications, low complexity wavelets would be preferred for fast decoding and retrieval of data from picture archiving and communications systems (PACS) enabling quicker diagnosis and higher productivity of the physician. We propose a novel image compression system that claims extremely low complexity, in fact lower than the Haar wavelet, and at the same time providing higher compression ratios. The high pixel-to-pixel correlation inherent in medical images is first exploited by the application of differential pulse code modulation (DPCM) followed by a modified version of the Haar wavelet applied in an incomplete fashion. We report extensive results (first-order entropy estimates) on a large database of medical images.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"164 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":"122896203","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.1273293
T.N. Bhaskar, Foo Tun Keat, S. Ranganath, Y.V. Venkatesh
A method of using frame differencing coupled with optical flow computation for eye blink detection is proposed. Frame differencing allows quick determination of possible motion regions. If they are detected, optical flow is computed within these regions. The direction and magnitude of the flow field are then used to determine whether a blink has occurred. The eyes are then tracked using the Kanade Lucas Tomasi (KLT) tracker. We obtained a success rate of 97.0% in blink detection using the proposed method, and localised the eyes automatically at an average rate of 22 frames per second.
提出了一种结合帧差光流计算的眨眼检测方法。帧差允许快速确定可能的运动区域。如果检测到这些区域，则计算这些区域内的光流。然后使用流场的方向和大小来确定是否发生了闪烁。然后使用Kanade Lucas Tomasi (KLT)跟踪器跟踪眼睛。该方法的眨眼检测成功率为97.0%，并能以平均22帧/秒的速度自动定位眼睛。
{"title":"Blink detection and eye tracking for eye localization","authors":"T.N. Bhaskar, Foo Tun Keat, S. Ranganath, Y.V. Venkatesh","doi":"10.1109/TENCON.2003.1273293","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273293","url":null,"abstract":"A method of using frame differencing coupled with optical flow computation for eye blink detection is proposed. Frame differencing allows quick determination of possible motion regions. If they are detected, optical flow is computed within these regions. The direction and magnitude of the flow field are then used to determine whether a blink has occurred. The eyes are then tracked using the Kanade Lucas Tomasi (KLT) tracker. We obtained a success rate of 97.0% in blink detection using the proposed method, and localised the eyes automatically at an average rate of 22 frames per second.","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":"131265149","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.1273129
C. Singh, J. John, Y. Singh, K. Tripathi
The increased use of portable computing and multimedia terminals in recent years has led to a growth in interest in the area of high-speed wireless digital links and local area networks (LANs). The requirement is for a communication medium that has high speed, low cost, low power consumption and high-level of security. Traditionally, radio frequency (RF) transmission is used in wireless applications. However, the RF spectrum is so congested that it is very difficult to accommodate new high-bit-rate applications. Optical infrared radiation (IR) with low implementation complexity and no spectrum license requirements can provide a possible solution. This paper presents the architecture and the design aspects of an eye-safe, high-speed optical wireless link for wireless connectivity among the stationary and mobile wireless data terminals within a room and terminals on backbone.
{"title":"A high-capacity indoor optical wireless LAN architecture","authors":"C. Singh, J. John, Y. Singh, K. Tripathi","doi":"10.1109/TENCON.2003.1273129","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273129","url":null,"abstract":"The increased use of portable computing and multimedia terminals in recent years has led to a growth in interest in the area of high-speed wireless digital links and local area networks (LANs). The requirement is for a communication medium that has high speed, low cost, low power consumption and high-level of security. Traditionally, radio frequency (RF) transmission is used in wireless applications. However, the RF spectrum is so congested that it is very difficult to accommodate new high-bit-rate applications. Optical infrared radiation (IR) with low implementation complexity and no spectrum license requirements can provide a possible solution. This paper presents the architecture and the design aspects of an eye-safe, high-speed optical wireless link for wireless connectivity among the stationary and mobile wireless data terminals within a room and terminals on backbone.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"37 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":"121852046","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.1273387
Jagadish Nayak, P. S. Bhat
This paper attempts to identify pathological disorders of larynx using wavelet analysis. Speech samples carry symptoms of disorder in the place of their origin. The speech signal is subjected to wavelet analysis, and the coefficients are used to identify disorders such as vocal fold paralysis. Multilayer artificial neural network is used for classification of normal and affected signals.
{"title":"Identification of voice disorders using speech samples","authors":"Jagadish Nayak, P. S. Bhat","doi":"10.1109/TENCON.2003.1273387","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273387","url":null,"abstract":"This paper attempts to identify pathological disorders of larynx using wavelet analysis. Speech samples carry symptoms of disorder in the place of their origin. The speech signal is subjected to wavelet analysis, and the coefficients are used to identify disorders such as vocal fold paralysis. Multilayer artificial neural network is used for classification of normal and affected signals.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"49 13","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133455236","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.1273359
M. Ashourian, R. Enteshary
We examine a new masking scheme for three-dimensional mesh watermarking in the spatial domain. The masking factor at each point is defined based an estimate of the average difference between the position of connected vertices to a vertex. We test the proposed watermarking scheme by embedding a random binary sequence and applying different attacks, such as additive random noise, compression by MPEG-4 SNHC, and mesh simplification, which shows that the proposed masking scheme can improve the robustness of the spatial domain watermarking scheme.
{"title":"A new masking method for spatial domain watermarking of three-dimensional triangle meshes","authors":"M. Ashourian, R. Enteshary","doi":"10.1109/TENCON.2003.1273359","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273359","url":null,"abstract":"We examine a new masking scheme for three-dimensional mesh watermarking in the spatial domain. The masking factor at each point is defined based an estimate of the average difference between the position of connected vertices to a vertex. We test the proposed watermarking scheme by embedding a random binary sequence and applying different attacks, such as additive random noise, compression by MPEG-4 SNHC, and mesh simplification, which shows that the proposed masking scheme can improve the robustness of the spatial domain watermarking scheme.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"81 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":"134397380","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.1273388
J. K. Gupta, S. C. Sekhar, T. Sreenivas
We address the problem of decomposing a bandpass signal into amplitude and frequency modulated components (AM and FM respectively). Several estimators have been proposed in literature, each of which works under specific assumptions. In this paper, we perform a comparative study of some popular techniques by studying their performance with changes in the modulation parameters and the tradeoffs involved. We also study their performance in the presence of bandpass white Gaussian noise.
{"title":"Performance analysis of AM-FM estimators","authors":"J. K. Gupta, S. C. Sekhar, T. Sreenivas","doi":"10.1109/TENCON.2003.1273388","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273388","url":null,"abstract":"We address the problem of decomposing a bandpass signal into amplitude and frequency modulated components (AM and FM respectively). Several estimators have been proposed in literature, each of which works under specific assumptions. In this paper, we perform a comparative study of some popular techniques by studying their performance with changes in the modulation parameters and the tradeoffs involved. We also study their performance in the presence of bandpass white Gaussian noise.","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":"134504755","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.1273162
Selvaraj Suraneni, I. Kar, R. Bhatt
A dynamic fuzzy logic based adaptive algorithm is proposed for reducing the effect of stick slip friction present in 1-DOF (one degree of freedom) mechanical mass system. The control scheme proposed is an online identification and indirect adaptive control, in which the control input is adjusted adaptively to compensate the effect of nonlinearity. Lyapunov stability analysis is used to ensure the boundedness of tracking errors, identification errors etc. The efficacy of the proposed algorithm is verified on a 1-DOF mechanical mass system with stick slip friction.
{"title":"Adaptive stick-slip friction compensation using dynamic fuzzy logic system","authors":"Selvaraj Suraneni, I. Kar, R. Bhatt","doi":"10.1109/TENCON.2003.1273162","DOIUrl":"https://doi.org/10.1109/TENCON.2003.1273162","url":null,"abstract":"A dynamic fuzzy logic based adaptive algorithm is proposed for reducing the effect of stick slip friction present in 1-DOF (one degree of freedom) mechanical mass system. The control scheme proposed is an online identification and indirect adaptive control, in which the control input is adjusted adaptively to compensate the effect of nonlinearity. Lyapunov stability analysis is used to ensure the boundedness of tracking errors, identification errors etc. The efficacy of the proposed algorithm is verified on a 1-DOF mechanical mass system with stick slip friction.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"115 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":"134454871","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
扫码关注我们
求助内容：
应助结果提醒方式：