Pub Date : 2013-07-11DOI: 10.1109/ISSCS.2013.6651188
Ionut Mironica, B. Ionescu, C. Rasche, P. Lambert
In this paper we investigate the performance of visual features in the context of video genre classification. We propose a late-fusion framework that employs color, texture, structural and salient region information. Experimental validation was carried out in the context of the MediaEval 2012 Genre Tagging Task using a large data set of more than 2,000 hours of footage and 26 video genres. Results show that the proposed approach significantly improves genre classification performance outperforming other existing approaches. Furthermore, we prove that our approach can help improving the performance of the more efficient text-based approaches.
{"title":"A visual-based late-fusion framework for video genre classification","authors":"Ionut Mironica, B. Ionescu, C. Rasche, P. Lambert","doi":"10.1109/ISSCS.2013.6651188","DOIUrl":"https://doi.org/10.1109/ISSCS.2013.6651188","url":null,"abstract":"In this paper we investigate the performance of visual features in the context of video genre classification. We propose a late-fusion framework that employs color, texture, structural and salient region information. Experimental validation was carried out in the context of the MediaEval 2012 Genre Tagging Task using a large data set of more than 2,000 hours of footage and 26 video genres. Results show that the proposed approach significantly improves genre classification performance outperforming other existing approaches. Furthermore, we prove that our approach can help improving the performance of the more efficient text-based approaches.","PeriodicalId":260263,"journal":{"name":"International Symposium on Signals, Circuits and Systems ISSCS2013","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123270263","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 : 2013-07-11DOI: 10.1109/ISSCS.2013.6651189
A. Savin, L. Trifina
In this paper, we present a scheme combining a parallel turbo code and a space-time block code for multiple input multiple output (MIMO) systems. The space-time block code is represented by the full rate Golden code characterized by the Golden number -1+√5/2. The turbo code consists of the parallel concatenation of two recursive systematic convolutional codes and an interleaver. For the purpose of demonstrating the interleavers efficiency and importance, three different types of interleavers were used. Compared with the similar scheme that uses a nonrecursive non-systematic convolutional code instead of the turbo code for BER=10-4 a 3dB coding gain is obtained.
{"title":"Scheme combining a turbo code and a golden space-time block code with different interleavers","authors":"A. Savin, L. Trifina","doi":"10.1109/ISSCS.2013.6651189","DOIUrl":"https://doi.org/10.1109/ISSCS.2013.6651189","url":null,"abstract":"In this paper, we present a scheme combining a parallel turbo code and a space-time block code for multiple input multiple output (MIMO) systems. The space-time block code is represented by the full rate Golden code characterized by the Golden number -1+√5/2. The turbo code consists of the parallel concatenation of two recursive systematic convolutional codes and an interleaver. For the purpose of demonstrating the interleavers efficiency and importance, three different types of interleavers were used. Compared with the similar scheme that uses a nonrecursive non-systematic convolutional code instead of the turbo code for BER=10-4 a 3dB coding gain is obtained.","PeriodicalId":260263,"journal":{"name":"International Symposium on Signals, Circuits and Systems ISSCS2013","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128431566","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 : 2013-07-11DOI: 10.1109/ISSCS.2013.6651254
D. Tarniceriu, V. Munteanu, G. Zaharia
In this paper we consider the class of generalized anti-uniform Huffman (AUH) codes for sources with infinite alphabet and geometric distribution. This distribution leads to infinite anti-uniform sources for some ranges of its parameters. Huffman coding of these sources results in AUH codes. We perform a generalization of binary Huffman encoding, using a, M-letter code alphabet and prove that as a result of this encoding, sources with memory are obtained. For these sources we attach the graph and derive the transition probabilities between states, as well as the state probabilities. The entropy and the average cost for AUH codes are derived.
{"title":"M-ary anti-uniform Huffman codes for infinite sources with geometric distribution","authors":"D. Tarniceriu, V. Munteanu, G. Zaharia","doi":"10.1109/ISSCS.2013.6651254","DOIUrl":"https://doi.org/10.1109/ISSCS.2013.6651254","url":null,"abstract":"In this paper we consider the class of generalized anti-uniform Huffman (AUH) codes for sources with infinite alphabet and geometric distribution. This distribution leads to infinite anti-uniform sources for some ranges of its parameters. Huffman coding of these sources results in AUH codes. We perform a generalization of binary Huffman encoding, using a, M-letter code alphabet and prove that as a result of this encoding, sources with memory are obtained. For these sources we attach the graph and derive the transition probabilities between states, as well as the state probabilities. The entropy and the average cost for AUH codes are derived.","PeriodicalId":260263,"journal":{"name":"International Symposium on Signals, Circuits and Systems ISSCS2013","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131878540","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 : 2013-07-11DOI: 10.1109/ISSCS.2013.6651220
T. Culda, Victor Popa, D. Stanomir, C. Negrescu
Measuring the audio impulse response is a very common and important operation in every characterization of acoustic systems and sound fields. For the past decade, sine sweeps are the most employed signals for achieving this goal both by researchers and the audio industry. When the application requires a huge number of impulse responses to be measured, every second that can be saved for a single measurement counts. This article proposes and implements an artifice in the method suited for reducing the time of measurement.
{"title":"Reducing time in acoustic impulse response measurements using exponential sine sweeps","authors":"T. Culda, Victor Popa, D. Stanomir, C. Negrescu","doi":"10.1109/ISSCS.2013.6651220","DOIUrl":"https://doi.org/10.1109/ISSCS.2013.6651220","url":null,"abstract":"Measuring the audio impulse response is a very common and important operation in every characterization of acoustic systems and sound fields. For the past decade, sine sweeps are the most employed signals for achieving this goal both by researchers and the audio industry. When the application requires a huge number of impulse responses to be measured, every second that can be saved for a single measurement counts. This article proposes and implements an artifice in the method suited for reducing the time of measurement.","PeriodicalId":260263,"journal":{"name":"International Symposium on Signals, Circuits and Systems ISSCS2013","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134235637","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 : 2013-07-11DOI: 10.1109/ISSCS.2013.6651247
Nicolae Cleju
This paper introduces a generalized sparsity model that extends synthesis and analysis sparsity. The generalized model asserts that a signal has a sparse representation in a dictionary, which is at the same time orthogonal to a part of the dictionary's null space. Alternatively, analyzing the signal with an analysis operator yields an output vector that can be represented as the sum between a sparse vector and a vector from a low-dimensional subspace. We show that the proposed model allows recovery of sparse signals from few incoherent measurements, with algorithms that are similar to the familiar algorithms of the synthesis and analysis sparsity models.
{"title":"A generalization of analysis and synthesis sparsity","authors":"Nicolae Cleju","doi":"10.1109/ISSCS.2013.6651247","DOIUrl":"https://doi.org/10.1109/ISSCS.2013.6651247","url":null,"abstract":"This paper introduces a generalized sparsity model that extends synthesis and analysis sparsity. The generalized model asserts that a signal has a sparse representation in a dictionary, which is at the same time orthogonal to a part of the dictionary's null space. Alternatively, analyzing the signal with an analysis operator yields an output vector that can be represented as the sum between a sparse vector and a vector from a low-dimensional subspace. We show that the proposed model allows recovery of sparse signals from few incoherent measurements, with algorithms that are similar to the familiar algorithms of the synthesis and analysis sparsity models.","PeriodicalId":260263,"journal":{"name":"International Symposium on Signals, Circuits and Systems ISSCS2013","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134312613","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 : 2013-07-11DOI: 10.1109/ISSCS.2013.6651210
Nicolae Pampu, Raul Vicente, R. Muresan, V. Priesemann, Felix Siebenhuhner, M. Wibral
Detecting interactions in complex networks can be very challenging, especially when using model based approaches, due to the dependency on model assumptions. To bypass this challenge, recently a model-free information-theoretic approach, transfer entropy (TE) was introduced. TE functional is capable of detecting linear as well as non-linear directed interactions. However, a full understanding of the network function also requires knowledge on interaction delays. Here we present an extension of TE which also estimates unknown interaction delays. In detail, we show that this TE functional becomes maximal if the interaction delay parameter in our TE functional equals the true interaction delay. Accordingly, in simulations of finite data the difference between estimated and true interaction delay was always within one sample. For the first time we applied this method to reconstruct intra-cerebral interaction delays from noninvasive Magnetoencephalography (MEG) recordings, and obtained biologically plausible values, suggesting a potential diagnostic use of the method.
{"title":"Transfer entropy as a tool for reconstructing interaction delays in neural signals","authors":"Nicolae Pampu, Raul Vicente, R. Muresan, V. Priesemann, Felix Siebenhuhner, M. Wibral","doi":"10.1109/ISSCS.2013.6651210","DOIUrl":"https://doi.org/10.1109/ISSCS.2013.6651210","url":null,"abstract":"Detecting interactions in complex networks can be very challenging, especially when using model based approaches, due to the dependency on model assumptions. To bypass this challenge, recently a model-free information-theoretic approach, transfer entropy (TE) was introduced. TE functional is capable of detecting linear as well as non-linear directed interactions. However, a full understanding of the network function also requires knowledge on interaction delays. Here we present an extension of TE which also estimates unknown interaction delays. In detail, we show that this TE functional becomes maximal if the interaction delay parameter in our TE functional equals the true interaction delay. Accordingly, in simulations of finite data the difference between estimated and true interaction delay was always within one sample. For the first time we applied this method to reconstruct intra-cerebral interaction delays from noninvasive Magnetoencephalography (MEG) recordings, and obtained biologically plausible values, suggesting a potential diagnostic use of the method.","PeriodicalId":260263,"journal":{"name":"International Symposium on Signals, Circuits and Systems ISSCS2013","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122685319","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 : 2013-07-11DOI: 10.1109/ISSCS.2013.6651199
M. Andriychuk, P. Savenko, M. Tkach
The synthesis problem of the plane aperture and array according to a prescribed power directivity pattern (DP) is considered. Variational statement of the synthesis problem is used. The functional representing a mean-square deviation of the prescribed and received power DPs is minimized. The modeling results are presented.
{"title":"Synthesis of plane antenna systems according to a given power directivity pattern","authors":"M. Andriychuk, P. Savenko, M. Tkach","doi":"10.1109/ISSCS.2013.6651199","DOIUrl":"https://doi.org/10.1109/ISSCS.2013.6651199","url":null,"abstract":"The synthesis problem of the plane aperture and array according to a prescribed power directivity pattern (DP) is considered. Variational statement of the synthesis problem is used. The functional representing a mean-square deviation of the prescribed and received power DPs is minimized. The modeling results are presented.","PeriodicalId":260263,"journal":{"name":"International Symposium on Signals, Circuits and Systems ISSCS2013","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115417831","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 : 2013-07-11DOI: 10.1109/ISSCS.2013.6651257
E. Ovreiu, Alina Sultana, Juan Gabriel Riveros, L. Florez-Valencia
In this paper we present a triangular mesh simplification algorithm which produces accurate approximations of the original models. The simplification is realized using iterative edge contractions. The accuracy is obtained using a symmetric error metric and generating sample points over the simplified mesh. The sample points are generated using iterative 1 : 4 subdivisions of each triangle. The number of subdivisions for each triangle depends on the area of the triangle.
{"title":"Triangular mesh simplification using an adaptive subdivision","authors":"E. Ovreiu, Alina Sultana, Juan Gabriel Riveros, L. Florez-Valencia","doi":"10.1109/ISSCS.2013.6651257","DOIUrl":"https://doi.org/10.1109/ISSCS.2013.6651257","url":null,"abstract":"In this paper we present a triangular mesh simplification algorithm which produces accurate approximations of the original models. The simplification is realized using iterative edge contractions. The accuracy is obtained using a symmetric error metric and generating sample points over the simplified mesh. The sample points are generated using iterative 1 : 4 subdivisions of each triangle. The number of subdivisions for each triangle depends on the area of the triangle.","PeriodicalId":260263,"journal":{"name":"International Symposium on Signals, Circuits and Systems ISSCS2013","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114279908","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 : 2013-07-11DOI: 10.1109/ISSCS.2013.6651262
M. Pfost, T. Zawischka, Michael Ebli
DMOS transistors are often subject to large power dissipation and thus substantial self-heating. This can lead to extremely high device temperatures, thermal runaway, and device failure. Because of this, the safe operating area of the DMOS is limited by its peak temperature. Therefore, it has been suggested to lower the peak temperature by shifting the heat generation from the hotter to the cooler parts of the device. In this paper a simple approach to redistribute the power dissipation density in DMOS transistors will be presented that can be used to reduce the peak temperature significantly. The proposed approach can easily be applied to integrated and discrete power MOSFETs. Layout modifications are usually sufficient, no process changes are required. The impact on the electrical characteristics of the DMOS will be evaluated and explained. The presented approach can effectively lower the peak temperature in typical DMOS transistors as will be demonstrated by measurements and numerical simulations.
{"title":"A simple approach to reduce peak temperatures in integrated and discrete power mosfets","authors":"M. Pfost, T. Zawischka, Michael Ebli","doi":"10.1109/ISSCS.2013.6651262","DOIUrl":"https://doi.org/10.1109/ISSCS.2013.6651262","url":null,"abstract":"DMOS transistors are often subject to large power dissipation and thus substantial self-heating. This can lead to extremely high device temperatures, thermal runaway, and device failure. Because of this, the safe operating area of the DMOS is limited by its peak temperature. Therefore, it has been suggested to lower the peak temperature by shifting the heat generation from the hotter to the cooler parts of the device. In this paper a simple approach to redistribute the power dissipation density in DMOS transistors will be presented that can be used to reduce the peak temperature significantly. The proposed approach can easily be applied to integrated and discrete power MOSFETs. Layout modifications are usually sufficient, no process changes are required. The impact on the electrical characteristics of the DMOS will be evaluated and explained. The presented approach can effectively lower the peak temperature in typical DMOS transistors as will be demonstrated by measurements and numerical simulations.","PeriodicalId":260263,"journal":{"name":"International Symposium on Signals, Circuits and Systems ISSCS2013","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114467115","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 : 2013-07-11DOI: 10.1109/ISSCS.2013.6651214
F. Rotaru, S. Bejinariu, C. Nita, R. Luca
The paper proposes an improved optic disc localisation method in color retinal images. First, the optic disc area in retinal images of any dimensions is identified. Then the method iteratively extracts the optic disc edges and obtains a circular optic disc boundary approximation by a Hough transform. However this is a first step of a retinal image analysis project which will be completed later with other tasks. The final goal is to detect in early stages signs of ophthalmic pathologies by successive analysis of ophthalmoscopy images.
{"title":"New optic disc localization method for retinal images","authors":"F. Rotaru, S. Bejinariu, C. Nita, R. Luca","doi":"10.1109/ISSCS.2013.6651214","DOIUrl":"https://doi.org/10.1109/ISSCS.2013.6651214","url":null,"abstract":"The paper proposes an improved optic disc localisation method in color retinal images. First, the optic disc area in retinal images of any dimensions is identified. Then the method iteratively extracts the optic disc edges and obtains a circular optic disc boundary approximation by a Hough transform. However this is a first step of a retinal image analysis project which will be completed later with other tasks. The final goal is to detect in early stages signs of ophthalmic pathologies by successive analysis of ophthalmoscopy images.","PeriodicalId":260263,"journal":{"name":"International Symposium on Signals, Circuits and Systems ISSCS2013","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122166481","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
扫码关注我们
求助内容：
应助结果提醒方式：