Pub Date : 2012-04-18DOI: 10.1109/SIU.2012.6204548
Edmond Nurellari, E. Ince
In this work, a concatenated forward error correction (FEC) scheme together with Orthogonal Frequency Division Multiplexing (OFDM) have been used for effective transmission of data/images over additive and fading channels. With a Bose Chaudhuri Hocquenghem (BCH) code as the outer code and a Low Density Parity Check (LDPC) code as the inner code, the transmission has been simulated over both the Gilbert-Elliot and ITU Rayleigh fading channels. The FEC parameters assumed throughout the simulations were obtained from the DVB-T2 standard and the Base Band (BB) frames were created by making use of shortening and zero-padding concepts. The results which have been presented in terms of BER and psycho-visual performances show the resilience of the FEC schemes and OFDM to channel impairments. The BER performances attained over the Gilbert-Elliot Channel (a channel that introduces burst errors when in the bad state) using LDPC only and BCH-LDPC concatenated coding indicated that the outer BCH coding will start to achieve a much lower BER after an SNR of 5 dB. Over the ITU-A Rayleigh fading channel it was observed that the performance increment due to the outer BCH encoder only become apparent after 6 dB when compared to the rate ¼ LDPC only coded system BER performance. Over the Gilbert-Elliot channel a BCH-LDPC coded QPSK-OFDM system would provide a BER of 3×10-4 at 6 dB while the same BER for the ITU Vehicular-A channel was possible at 6.6 dB.
{"title":"Image transmission over Gilbert-Elliot and ITU fading channels using DVB-T2 channel coding and QPSK-OFDM","authors":"Edmond Nurellari, E. Ince","doi":"10.1109/SIU.2012.6204548","DOIUrl":"https://doi.org/10.1109/SIU.2012.6204548","url":null,"abstract":"In this work, a concatenated forward error correction (FEC) scheme together with Orthogonal Frequency Division Multiplexing (OFDM) have been used for effective transmission of data/images over additive and fading channels. With a Bose Chaudhuri Hocquenghem (BCH) code as the outer code and a Low Density Parity Check (LDPC) code as the inner code, the transmission has been simulated over both the Gilbert-Elliot and ITU Rayleigh fading channels. The FEC parameters assumed throughout the simulations were obtained from the DVB-T2 standard and the Base Band (BB) frames were created by making use of shortening and zero-padding concepts. The results which have been presented in terms of BER and psycho-visual performances show the resilience of the FEC schemes and OFDM to channel impairments. The BER performances attained over the Gilbert-Elliot Channel (a channel that introduces burst errors when in the bad state) using LDPC only and BCH-LDPC concatenated coding indicated that the outer BCH coding will start to achieve a much lower BER after an SNR of 5 dB. Over the ITU-A Rayleigh fading channel it was observed that the performance increment due to the outer BCH encoder only become apparent after 6 dB when compared to the rate ¼ LDPC only coded system BER performance. Over the Gilbert-Elliot channel a BCH-LDPC coded QPSK-OFDM system would provide a BER of 3×10-4 at 6 dB while the same BER for the ITU Vehicular-A channel was possible at 6.6 dB.","PeriodicalId":256154,"journal":{"name":"2012 20th Signal Processing and Communications Applications Conference (SIU)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116857928","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 : 2012-04-18DOI: 10.1109/SIU.2012.6204714
Hakan Kaya, E. Öztürk
In this work, the error performance of the distributed Turbo coded cooperative systems in a multi-relay environment is investigated based on the number of relays and relay selection. First, one of two selected relays having best paths among M relays uses Amplify and Forward (AF) protocol, and the other one uses Decode and Forward (DF) protocol. Then, the component codes of the distributed parallel concatenated (Turbo) code are sent to receiver by these two relays. This type of a system is called Distributed Turbo Coded Cooperative Systems (DTCS). In addition, this system is compared with another system having a similar structure but only uses convolutional codes. Numerical results show that the DTSC outperforms the system including only convolutional code, with the increment of the total number of relays. On the other hand, the use of DF protocol rather than AF for the better relay among the two best relays gives a better performance in the DTSC system.
{"title":"Effects of opportunistic relay selection on the performance of distributed Turbo coded cooperative systems","authors":"Hakan Kaya, E. Öztürk","doi":"10.1109/SIU.2012.6204714","DOIUrl":"https://doi.org/10.1109/SIU.2012.6204714","url":null,"abstract":"In this work, the error performance of the distributed Turbo coded cooperative systems in a multi-relay environment is investigated based on the number of relays and relay selection. First, one of two selected relays having best paths among M relays uses Amplify and Forward (AF) protocol, and the other one uses Decode and Forward (DF) protocol. Then, the component codes of the distributed parallel concatenated (Turbo) code are sent to receiver by these two relays. This type of a system is called Distributed Turbo Coded Cooperative Systems (DTCS). In addition, this system is compared with another system having a similar structure but only uses convolutional codes. Numerical results show that the DTSC outperforms the system including only convolutional code, with the increment of the total number of relays. On the other hand, the use of DF protocol rather than AF for the better relay among the two best relays gives a better performance in the DTSC system.","PeriodicalId":256154,"journal":{"name":"2012 20th Signal Processing and Communications Applications Conference (SIU)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115247149","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 : 2012-04-18DOI: 10.1109/SIU.2012.6204553
S. Mousavi, S. Aksu, Günes Karabulut-Kurt
There are many application areas for wireless sensor networks, such as security, health, and emergency. Recent research studies show that, voice over wireless sensor network applications are possible especially for emergency and rescue missions. In this study, by using 6.3 kbps G.723.1 codec, voice over ZigBee wireless sensor networks experiments are made. The results are examined based on packet loss and MOS voice quality metrics. It is shown that, acceptable quality voice over ZigBee networks is possible in an indoor linear mesh topology wireless sensor network containing up to 4 hops, which are between 10-80 meters. In an outdoor single hop network topology, ranging between 10-80 meters, acceptable voice quality is observed up to 60 meters.
{"title":"Voice over ZigBee wireless sensor network applications","authors":"S. Mousavi, S. Aksu, Günes Karabulut-Kurt","doi":"10.1109/SIU.2012.6204553","DOIUrl":"https://doi.org/10.1109/SIU.2012.6204553","url":null,"abstract":"There are many application areas for wireless sensor networks, such as security, health, and emergency. Recent research studies show that, voice over wireless sensor network applications are possible especially for emergency and rescue missions. In this study, by using 6.3 kbps G.723.1 codec, voice over ZigBee wireless sensor networks experiments are made. The results are examined based on packet loss and MOS voice quality metrics. It is shown that, acceptable quality voice over ZigBee networks is possible in an indoor linear mesh topology wireless sensor network containing up to 4 hops, which are between 10-80 meters. In an outdoor single hop network topology, ranging between 10-80 meters, acceptable voice quality is observed up to 60 meters.","PeriodicalId":256154,"journal":{"name":"2012 20th Signal Processing and Communications Applications Conference (SIU)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115675208","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 : 2012-04-18DOI: 10.1109/SIU.2012.6204750
G. M. Güvensen, Y. Tanik, A. O. Yılmaz
In this paper, a receiver architecture with reduced complexity is proposed for spread spectrum type communication with M-ary quasi orthogonal signaling. The proposed structure comprises of the channel and code matched filtering (MF) concatenated with a reduced state maximum likelihood sequence estimation (MLSE) type processing at symbol rate. MLSE, which takes the interference caused by nonideal cross- and autocorrelations of the spreading codes and multi-path channel into account, is directly applied to the unwhitenedmatched filter outputs. The hypothetical matched filter bound (MFB) is achieved by the proposed structure with the use of a reasonable number of states. By using the proposed reduced state Ungerboeck type MLSE based receiver, it is seen that M-ary quasi orthogonal signaling is an effective spread spectrum type modulation technique for multi-path channels with large delay spread at low power.
{"title":"Robust spread spectrum type communication with M-ary quasi orthogonal signaling for wireless fading channels","authors":"G. M. Güvensen, Y. Tanik, A. O. Yılmaz","doi":"10.1109/SIU.2012.6204750","DOIUrl":"https://doi.org/10.1109/SIU.2012.6204750","url":null,"abstract":"In this paper, a receiver architecture with reduced complexity is proposed for spread spectrum type communication with M-ary quasi orthogonal signaling. The proposed structure comprises of the channel and code matched filtering (MF) concatenated with a reduced state maximum likelihood sequence estimation (MLSE) type processing at symbol rate. MLSE, which takes the interference caused by nonideal cross- and autocorrelations of the spreading codes and multi-path channel into account, is directly applied to the unwhitenedmatched filter outputs. The hypothetical matched filter bound (MFB) is achieved by the proposed structure with the use of a reasonable number of states. By using the proposed reduced state Ungerboeck type MLSE based receiver, it is seen that M-ary quasi orthogonal signaling is an effective spread spectrum type modulation technique for multi-path channels with large delay spread at low power.","PeriodicalId":256154,"journal":{"name":"2012 20th Signal Processing and Communications Applications Conference (SIU)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123490705","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 : 2012-04-18DOI: 10.1109/SIU.2012.6204712
Osman Günay, B. U. Töreyin, Kivanç Köse, A. Cetin
In this paper, an entropy functional based online adaptive decision fusion framework is developed for image analysis and computer vision applications. In this framework, it is assumed that the compound algorithm consists of several sub-algorithms, each of which yields its own decision as a real number centered around zero, representing the confidence level of that particular sub-algorithm. Decision values are linearly combined with weights which are updated online according to an active fusion method based on performing entropic projections onto convex sets describing sub-algorithms. It is assumed that there is an oracle, who is usually a human operator, providing feedback to the decision fusion method. A video based wildfire detection system was developed to evaluate the performance of the decision fusion algorithm.
{"title":"Entropy functional based adaptive decision fusion framework","authors":"Osman Günay, B. U. Töreyin, Kivanç Köse, A. Cetin","doi":"10.1109/SIU.2012.6204712","DOIUrl":"https://doi.org/10.1109/SIU.2012.6204712","url":null,"abstract":"In this paper, an entropy functional based online adaptive decision fusion framework is developed for image analysis and computer vision applications. In this framework, it is assumed that the compound algorithm consists of several sub-algorithms, each of which yields its own decision as a real number centered around zero, representing the confidence level of that particular sub-algorithm. Decision values are linearly combined with weights which are updated online according to an active fusion method based on performing entropic projections onto convex sets describing sub-algorithms. It is assumed that there is an oracle, who is usually a human operator, providing feedback to the decision fusion method. A video based wildfire detection system was developed to evaluate the performance of the decision fusion algorithm.","PeriodicalId":256154,"journal":{"name":"2012 20th Signal Processing and Communications Applications Conference (SIU)","volume":"12 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120834860","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 : 2012-04-18DOI: 10.1109/SIU.2012.6204746
M. Altınkaya, E. Kuruoğlu
Chemical Langevin Equation (CLE) describes a useful approximation in stochastic modeling of chemical reactions. CLE-based τ-leaping algorithm updates the quantities of every molecule in a reaction system with a period of τ, firing every reaction in the system so many times that the concentration of each molecule can be assumed to remain in the current concentration state. Substituting the Brownian motion in the CLE with a Levy flight, one might expect the CLE to converge more rapidly. This work shows that alpha (Levy)-stable increments can be used in τ-leaping, demonstrating it with the example of a detailed kinetic model describing the enzymatic transgalactosylation reaction during lactulose hydrolysis.
{"title":"Modeling enzymatic reactions via chemical Langevin-Levy equation","authors":"M. Altınkaya, E. Kuruoğlu","doi":"10.1109/SIU.2012.6204746","DOIUrl":"https://doi.org/10.1109/SIU.2012.6204746","url":null,"abstract":"Chemical Langevin Equation (CLE) describes a useful approximation in stochastic modeling of chemical reactions. CLE-based τ-leaping algorithm updates the quantities of every molecule in a reaction system with a period of τ, firing every reaction in the system so many times that the concentration of each molecule can be assumed to remain in the current concentration state. Substituting the Brownian motion in the CLE with a Levy flight, one might expect the CLE to converge more rapidly. This work shows that alpha (Levy)-stable increments can be used in τ-leaping, demonstrating it with the example of a detailed kinetic model describing the enzymatic transgalactosylation reaction during lactulose hydrolysis.","PeriodicalId":256154,"journal":{"name":"2012 20th Signal Processing and Communications Applications Conference (SIU)","volume":"31 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128565647","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 : 2012-04-18DOI: 10.1109/SIU.2012.6204766
M. S. Sapaz, F. Arıkan, T. Gulyaeva
In this study, the effects of height of the ionospheric thin shell, neighboring stations and satellite positions on the ionospheric pierce points are investigated by using the data obtained from TNPGN-Active GPS TRIMBLE receivers in Turkey and North Cyprus. For this purpose, Total Electron Content (TEC) value along the path between receiver and satellite, Slant Ray Total Electron Content (STEC) are examined for each satellite and receiver pair. Hence, the data obtained from GPS stations is processed and ionospheric pierce points along the way between receiver and satellite are calculated by considering geographical coordinates of GPS stations. In order to determine the appropriate sampling intervals in the STEC model specific to Turkey, the distance between pierce points are investigated. At the ionospheric heights between 200 km and 450 km, the arc lengths between pierce points are reasonable and proportional to the distance between neighborhoods. Depending on these results, the distance between pierce points represents appropriate sampling intervals for the stations in Turkey.
{"title":"Investigation of ionospheric pierce points for TNPGN-active network","authors":"M. S. Sapaz, F. Arıkan, T. Gulyaeva","doi":"10.1109/SIU.2012.6204766","DOIUrl":"https://doi.org/10.1109/SIU.2012.6204766","url":null,"abstract":"In this study, the effects of height of the ionospheric thin shell, neighboring stations and satellite positions on the ionospheric pierce points are investigated by using the data obtained from TNPGN-Active GPS TRIMBLE receivers in Turkey and North Cyprus. For this purpose, Total Electron Content (TEC) value along the path between receiver and satellite, Slant Ray Total Electron Content (STEC) are examined for each satellite and receiver pair. Hence, the data obtained from GPS stations is processed and ionospheric pierce points along the way between receiver and satellite are calculated by considering geographical coordinates of GPS stations. In order to determine the appropriate sampling intervals in the STEC model specific to Turkey, the distance between pierce points are investigated. At the ionospheric heights between 200 km and 450 km, the arc lengths between pierce points are reasonable and proportional to the distance between neighborhoods. Depending on these results, the distance between pierce points represents appropriate sampling intervals for the stations in Turkey.","PeriodicalId":256154,"journal":{"name":"2012 20th Signal Processing and Communications Applications Conference (SIU)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129416400","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 : 2012-04-18DOI: 10.1109/SIU.2012.6204569
Mary Agoyi, Devrim Seral
As the use of multimedia technology increases, its copyright protection and content authentication has become an issue to be addressed. Watermarking is a known technology that can help protect multimedia contents from illegal copying and access protection. Multimedia Watermarking based on discrete wavelet transform, which has been the most widespread technology for securing multimedia, is not shift invariant. This study introduces multimedia watermarking scheme based a nearly shift invariant double density dual-Tree discrete wavelet transform (DD-DT-DWT), in combination with singular value decomposition (SVD). The experimental results shows that multimedia watermarking based on DD-DT-DWT-SVD is more robust as compared to watermarking based on DWT, DWT-SVD, and DD-DT-DWT.
{"title":"A Multimedia Watermark scheme based on double density dual-Tree discrete wavelet transform and singular value decomposition","authors":"Mary Agoyi, Devrim Seral","doi":"10.1109/SIU.2012.6204569","DOIUrl":"https://doi.org/10.1109/SIU.2012.6204569","url":null,"abstract":"As the use of multimedia technology increases, its copyright protection and content authentication has become an issue to be addressed. Watermarking is a known technology that can help protect multimedia contents from illegal copying and access protection. Multimedia Watermarking based on discrete wavelet transform, which has been the most widespread technology for securing multimedia, is not shift invariant. This study introduces multimedia watermarking scheme based a nearly shift invariant double density dual-Tree discrete wavelet transform (DD-DT-DWT), in combination with singular value decomposition (SVD). The experimental results shows that multimedia watermarking based on DD-DT-DWT-SVD is more robust as compared to watermarking based on DWT, DWT-SVD, and DD-DT-DWT.","PeriodicalId":256154,"journal":{"name":"2012 20th Signal Processing and Communications Applications Conference (SIU)","volume":"29 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129444543","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 : 2012-04-18DOI: 10.1109/SIU.2012.6204492
M. Toycan, Ademola Kaka, V. Bashiry, S. Abbasoğlu
In this paper, the combination of concentric square loop and the Koch curve fractal geometries based microstrip antenna design for ultra wideband (UWB) applications is presented. This fractal structure is implemented on a empty square. Three progressively concentric square loop is applied inside the empty square and a full square is applied to the center for the first iteration. Then, a Koch curve fractal is applied to the lines of the first iteration. The proposed antenna is miniaturized (44 × 43 mm2) and has multi-band characteristics. Simulation results show that the presented antenna has a reflection coefficient characteristic <; -15dB, 80% radiation efficiency, 4-6dBi antenna gain and omni-directional radiation pattern properties over the full UWB bandwidth (3.1 - 10.6 GHz) while showing the band-rejection performance in the frequency band of 4.75-6.75 GHz.
{"title":"Multi-band and miniaturized antenna design for ultra wide band applications with band rejection characteristic","authors":"M. Toycan, Ademola Kaka, V. Bashiry, S. Abbasoğlu","doi":"10.1109/SIU.2012.6204492","DOIUrl":"https://doi.org/10.1109/SIU.2012.6204492","url":null,"abstract":"In this paper, the combination of concentric square loop and the Koch curve fractal geometries based microstrip antenna design for ultra wideband (UWB) applications is presented. This fractal structure is implemented on a empty square. Three progressively concentric square loop is applied inside the empty square and a full square is applied to the center for the first iteration. Then, a Koch curve fractal is applied to the lines of the first iteration. The proposed antenna is miniaturized (44 × 43 mm2) and has multi-band characteristics. Simulation results show that the presented antenna has a reflection coefficient characteristic <; -15dB, 80% radiation efficiency, 4-6dBi antenna gain and omni-directional radiation pattern properties over the full UWB bandwidth (3.1 - 10.6 GHz) while showing the band-rejection performance in the frequency band of 4.75-6.75 GHz.","PeriodicalId":256154,"journal":{"name":"2012 20th Signal Processing and Communications Applications Conference (SIU)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129766306","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 : 2012-04-18DOI: 10.1109/SIU.2012.6204732
Burak Benligiray, C. Topal, C. Akinlar
Gathering statistical and geometrical information by processing the shape contours is the common way of feature extraction on object detection and recognition studies. Compactness is an important shape descriptor which specifies the similarity between a shape and a circle. In this study, we propose a new compactness measure based on examining the distribution of the contour moments with respect to the shape's centroid. First, the contours are extracted with the Edge Drawing algorithm from the image. Then, the contours moments are computed and their distributions are examined. As a result, detection of the circular shapes among the extracted closed contours with a desired circular similarity becomes possible. With its high accuracy and low complexity, the proposed method is a convenient for realtime applications.
{"title":"Realtime circular object detection based on the statistical compactness estimation","authors":"Burak Benligiray, C. Topal, C. Akinlar","doi":"10.1109/SIU.2012.6204732","DOIUrl":"https://doi.org/10.1109/SIU.2012.6204732","url":null,"abstract":"Gathering statistical and geometrical information by processing the shape contours is the common way of feature extraction on object detection and recognition studies. Compactness is an important shape descriptor which specifies the similarity between a shape and a circle. In this study, we propose a new compactness measure based on examining the distribution of the contour moments with respect to the shape's centroid. First, the contours are extracted with the Edge Drawing algorithm from the image. Then, the contours moments are computed and their distributions are examined. As a result, detection of the circular shapes among the extracted closed contours with a desired circular similarity becomes possible. With its high accuracy and low complexity, the proposed method is a convenient for realtime applications.","PeriodicalId":256154,"journal":{"name":"2012 20th Signal Processing and Communications Applications Conference (SIU)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130631981","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
扫码关注我们
求助内容：
应助结果提醒方式：