Pub Date : 2017-07-01DOI: 10.1109/ISSCS.2017.8034907
Mihai-Sorin Badea, C. Florea, L. Florea, C. Vertan
In this paper we approach the problem of scene recognition in paintings. We tackle this task with the aid of Convolutional Neural Networks and a large database consisting of around 80,000 paintings. The main purpose is to identify an efficient method to enlarge the database by domain transfer from photographic content to artistic content. Thus, we discuss the practical capabilities of a recent method of domain transfer from photographs to paintings while augmenting the employed database and aid the learning of difficult styles. We propose a set of improvements to increase the feasibility of the domain transfer in the context of large databases.
{"title":"Efficient domain adaptation for painting theme recognition","authors":"Mihai-Sorin Badea, C. Florea, L. Florea, C. Vertan","doi":"10.1109/ISSCS.2017.8034907","DOIUrl":"https://doi.org/10.1109/ISSCS.2017.8034907","url":null,"abstract":"In this paper we approach the problem of scene recognition in paintings. We tackle this task with the aid of Convolutional Neural Networks and a large database consisting of around 80,000 paintings. The main purpose is to identify an efficient method to enlarge the database by domain transfer from photographic content to artistic content. Thus, we discuss the practical capabilities of a recent method of domain transfer from photographs to paintings while augmenting the employed database and aid the learning of difficult styles. We propose a set of improvements to increase the feasibility of the domain transfer in the context of large databases.","PeriodicalId":338255,"journal":{"name":"2017 International Symposium on Signals, Circuits and Systems (ISSCS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130095778","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 : 2017-07-01DOI: 10.1109/ISSCS.2017.8034900
M. S. Feali, A. Ahmadi, A. Hamidi, M. Ahmadi
FPGAs are becoming an attractive platform for accelerating many computations including scientific applications. These applications demand high performance and high precision arithmetic. Decomposition of a matrix into lower and upper triangular matrices (LU decomposition) is a vital part of many scientific and engineering applications. This paper evaluates the accuracy of a fixed-point LU decomposition based on FPGA. Fixed-point architecture of LU decomposition is implemented on FPGA. Then several matrices with different sizes and random elements are decomposed using this architecture by various word-lengths. Using random matrices and different word-lengths, descriptive analysis of error is performed.
{"title":"Fixed-point arithmetic error analysis of sparse LU decomposition on FPGAs","authors":"M. S. Feali, A. Ahmadi, A. Hamidi, M. Ahmadi","doi":"10.1109/ISSCS.2017.8034900","DOIUrl":"https://doi.org/10.1109/ISSCS.2017.8034900","url":null,"abstract":"FPGAs are becoming an attractive platform for accelerating many computations including scientific applications. These applications demand high performance and high precision arithmetic. Decomposition of a matrix into lower and upper triangular matrices (LU decomposition) is a vital part of many scientific and engineering applications. This paper evaluates the accuracy of a fixed-point LU decomposition based on FPGA. Fixed-point architecture of LU decomposition is implemented on FPGA. Then several matrices with different sizes and random elements are decomposed using this architecture by various word-lengths. Using random matrices and different word-lengths, descriptive analysis of error is performed.","PeriodicalId":338255,"journal":{"name":"2017 International Symposium on Signals, Circuits and Systems (ISSCS)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129179682","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 : 2017-07-01DOI: 10.1109/ISSCS.2017.8034879
C. Damian, D. Coltuc, F. Garoi, M. Datcu
Spectrometry at submillimeter wavelengths (terahertz frequency range) is a promising field of applications but one which presents significant difficulties. The sources at these domains have generally low power, the measurements are noisy and the resolution of the measured spectra is limited by diffraction. We propose a method to improve the spectral resolution in Hadamard spectroscopy for the submillimeter spectral region. The method involves oversampling the spectrum using multiple shifted acquisitions and deconvolution. In order to find the most appropriate deconvolution method, several known algorithms are evaluated. They are: the Lucy-Richardson algorithm, the Maximum Entropy Method (MEM) and the Wiener filter. MEM proved to be the best one. It outperforms the other tested methods by a percentage over 16%.
{"title":"Improvement of submillimeter spectrometric measurement via deconvolution","authors":"C. Damian, D. Coltuc, F. Garoi, M. Datcu","doi":"10.1109/ISSCS.2017.8034879","DOIUrl":"https://doi.org/10.1109/ISSCS.2017.8034879","url":null,"abstract":"Spectrometry at submillimeter wavelengths (terahertz frequency range) is a promising field of applications but one which presents significant difficulties. The sources at these domains have generally low power, the measurements are noisy and the resolution of the measured spectra is limited by diffraction. We propose a method to improve the spectral resolution in Hadamard spectroscopy for the submillimeter spectral region. The method involves oversampling the spectrum using multiple shifted acquisitions and deconvolution. In order to find the most appropriate deconvolution method, several known algorithms are evaluated. They are: the Lucy-Richardson algorithm, the Maximum Entropy Method (MEM) and the Wiener filter. MEM proved to be the best one. It outperforms the other tested methods by a percentage over 16%.","PeriodicalId":338255,"journal":{"name":"2017 International Symposium on Signals, Circuits and Systems (ISSCS)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116682812","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 : 2017-07-01DOI: 10.1109/ISSCS.2017.8034887
Nicolas Hascoët, T. Zaharia
In this paper, we propose an improved image retrieval method, dedicated to images of buildings/landmarks from urban environments. Locally detected key points are binary labelled as building or no-building using a SVM-based classifier. Thereafter, only key points labelled as building are retained. In this way, the data in the database vocabulary is reduced to only the relevant one and solely the relevant features, effectively describing the targeted buildings are considered. The experimental results, carried out on the Paris6k and Oxford5k data sets show significant improvement in terms of retrieval precision.
{"title":"Local feature selection for urban image retrieval","authors":"Nicolas Hascoët, T. Zaharia","doi":"10.1109/ISSCS.2017.8034887","DOIUrl":"https://doi.org/10.1109/ISSCS.2017.8034887","url":null,"abstract":"In this paper, we propose an improved image retrieval method, dedicated to images of buildings/landmarks from urban environments. Locally detected key points are binary labelled as building or no-building using a SVM-based classifier. Thereafter, only key points labelled as building are retained. In this way, the data in the database vocabulary is reduced to only the relevant one and solely the relevant features, effectively describing the targeted buildings are considered. The experimental results, carried out on the Paris6k and Oxford5k data sets show significant improvement in terms of retrieval precision.","PeriodicalId":338255,"journal":{"name":"2017 International Symposium on Signals, Circuits and Systems (ISSCS)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121346774","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 : 2017-07-01DOI: 10.1109/ISSCS.2017.8034893
Lucian Gafencu, L. Scripcariu, I. Bogdan
Because of the nature of vehicular communications, security is a crucial aspect, involving the continuous development and analysis of the existing security architectures and punctual theoretical and practical aspects that have been proposed and are in need of continuous updates and integrations with newer technologies. But before an update, a good knowledge of the current aspects is mandatory. Identifying weaknesses and anticipating possible risks of vehicular communication networks through a failure modes and effects analysis (FMEA) represent an important aspect of the security analysis process and a valuable step in finding efficient security solutions for all kind of problems that might occur in these systems.
{"title":"An overview of security aspects and solutions in VANETs","authors":"Lucian Gafencu, L. Scripcariu, I. Bogdan","doi":"10.1109/ISSCS.2017.8034893","DOIUrl":"https://doi.org/10.1109/ISSCS.2017.8034893","url":null,"abstract":"Because of the nature of vehicular communications, security is a crucial aspect, involving the continuous development and analysis of the existing security architectures and punctual theoretical and practical aspects that have been proposed and are in need of continuous updates and integrations with newer technologies. But before an update, a good knowledge of the current aspects is mandatory. Identifying weaknesses and anticipating possible risks of vehicular communication networks through a failure modes and effects analysis (FMEA) represent an important aspect of the security analysis process and a valuable step in finding efficient security solutions for all kind of problems that might occur in these systems.","PeriodicalId":338255,"journal":{"name":"2017 International Symposium on Signals, Circuits and Systems (ISSCS)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126273106","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 : 2017-07-01DOI: 10.1109/ISSCS.2017.8034869
N. Parkalian, M. Robens, C. Grewing, S. van Waasen
A digital control loop scheme for a high speed PLL is suggested to detect amplitude errors at the output of the oscillator. Reliability specifications of the PLL are likely to be violated in case of excessive output swing in the oscillators. In addition, low amplitude swings will have negative influences on the phase noise of LC oscillators. As a result, the performance and reliability of the PLL will be reduced. The design includes a novel amplitude error detector. The amplitude error detector generates a digital word to show the situation of the amplitude error. The structure is implemented in 65nm CMOS technology. The power consumption of one amplitude error detector from 1V power supply is 0.76mW.
{"title":"Analysis and design of amplitude error detector and digital control loop to increase reliability of PLL","authors":"N. Parkalian, M. Robens, C. Grewing, S. van Waasen","doi":"10.1109/ISSCS.2017.8034869","DOIUrl":"https://doi.org/10.1109/ISSCS.2017.8034869","url":null,"abstract":"A digital control loop scheme for a high speed PLL is suggested to detect amplitude errors at the output of the oscillator. Reliability specifications of the PLL are likely to be violated in case of excessive output swing in the oscillators. In addition, low amplitude swings will have negative influences on the phase noise of LC oscillators. As a result, the performance and reliability of the PLL will be reduced. The design includes a novel amplitude error detector. The amplitude error detector generates a digital word to show the situation of the amplitude error. The structure is implemented in 65nm CMOS technology. The power consumption of one amplitude error detector from 1V power supply is 0.76mW.","PeriodicalId":338255,"journal":{"name":"2017 International Symposium on Signals, Circuits and Systems (ISSCS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126459969","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 : 2017-07-01DOI: 10.1109/ISSCS.2017.8034933
C. Stanciu, C. Anghel, M. Udrea, L. Stanciu
The classical stereophonic acoustic echo cancellation (SAEC) scheme requires the identification of four echo paths using the same number of adaptive algorithms. The SAEC setup can be reinterpreted by employing the widely linear (WL) model, which recasts the two-input/two-output system with real random variables as a single-input/single-output system with complex random variables. The WL model improves the handling and reduces the number of adaptive algorithms to only one, requiring the same computational workload. In this paper, we employ RLS-type adaptive algorithms for the SAEC configuration and we focus on the regularization problem, which is important in the presence of additive noise. Furthermore, we analyze a low complexity version of the RLS, by combining it with the dichotomous coordinate descent (DCD) iterations. We determine a regularization parameter based on the signal-to-noise ratio (SNR). Moreover, by using a suitable estimation of the SNR, we propose a low complexity variable regularized RLS algorithm. Simulations performed in the context of SAEC demonstrate the robustness of the proposed regularization method in noisy conditions, such as the double-talk scenarios.
{"title":"Variable-regularized low complexity RLS algorithm for stereophonic acoustic echo cancellation","authors":"C. Stanciu, C. Anghel, M. Udrea, L. Stanciu","doi":"10.1109/ISSCS.2017.8034933","DOIUrl":"https://doi.org/10.1109/ISSCS.2017.8034933","url":null,"abstract":"The classical stereophonic acoustic echo cancellation (SAEC) scheme requires the identification of four echo paths using the same number of adaptive algorithms. The SAEC setup can be reinterpreted by employing the widely linear (WL) model, which recasts the two-input/two-output system with real random variables as a single-input/single-output system with complex random variables. The WL model improves the handling and reduces the number of adaptive algorithms to only one, requiring the same computational workload. In this paper, we employ RLS-type adaptive algorithms for the SAEC configuration and we focus on the regularization problem, which is important in the presence of additive noise. Furthermore, we analyze a low complexity version of the RLS, by combining it with the dichotomous coordinate descent (DCD) iterations. We determine a regularization parameter based on the signal-to-noise ratio (SNR). Moreover, by using a suitable estimation of the SNR, we propose a low complexity variable regularized RLS algorithm. Simulations performed in the context of SAEC demonstrate the robustness of the proposed regularization method in noisy conditions, such as the double-talk scenarios.","PeriodicalId":338255,"journal":{"name":"2017 International Symposium on Signals, Circuits and Systems (ISSCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130614781","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 : 2017-07-01DOI: 10.1109/ISSCS.2017.8034897
O. Pastravanu, M. Matcovschi
Metzler matrices are algebraically characterized by having nonnegative off-diagonal entries and, from the dynamical point of view, define continuous-time positive systems. Our work studies polytopes of Metzler matrices and linear dynamics generated by such sets. The first part of the paper explores the algebraic properties of matrix polytopes, by focusing on the estimation of a right outer bound for all eigenvalues. The second part analyzes the dynamical properties of positive polytopic systems, by revealing connections between the estimated right outer bound and the evolution of trajectories (related to copositive Lyapunov functions and invariant sets).
{"title":"Eigenvalue right-outer bounds for polytopes of Metzler matrices and systems applications","authors":"O. Pastravanu, M. Matcovschi","doi":"10.1109/ISSCS.2017.8034897","DOIUrl":"https://doi.org/10.1109/ISSCS.2017.8034897","url":null,"abstract":"Metzler matrices are algebraically characterized by having nonnegative off-diagonal entries and, from the dynamical point of view, define continuous-time positive systems. Our work studies polytopes of Metzler matrices and linear dynamics generated by such sets. The first part of the paper explores the algebraic properties of matrix polytopes, by focusing on the estimation of a right outer bound for all eigenvalues. The second part analyzes the dynamical properties of positive polytopic systems, by revealing connections between the estimated right outer bound and the evolution of trajectories (related to copositive Lyapunov functions and invariant sets).","PeriodicalId":338255,"journal":{"name":"2017 International Symposium on Signals, Circuits and Systems (ISSCS)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132511885","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 : 2017-07-01DOI: 10.1109/ISSCS.2017.8034898
Carmine Cappetta, G. Licciardo, L. Di Benedetto
This paper presents the design of a new hardware accelerator, filtering the input data using Gabor functions and dedicated to image processing. The proposed design obtains a great reduction in terms of resources if compared to other state-of-the-art implementations. This is done exploiting the separability of Gabor filters along certain orientations and through a reorganization of the arithmetic units and the memory structures, achieved thanks to the absence of frame buffers to store the entire input image and partially processed data. All the above reported features allow the design to obtain real-time performances. The design has been targeted to a Xilinx Virtex 7 ASIC board and to CMOS 90nm std_cells, obtaining a minimum operating clock period of 5.8 ns for the FPGA implementation and of 2.9 ns for the std_cell one. The above reported results allow to process 83 and 168 1920×1080 pixels (Full-HD) frame-per-second, respectively.
{"title":"Hardware accelerator using Gabor filters for image recognition applications","authors":"Carmine Cappetta, G. Licciardo, L. Di Benedetto","doi":"10.1109/ISSCS.2017.8034898","DOIUrl":"https://doi.org/10.1109/ISSCS.2017.8034898","url":null,"abstract":"This paper presents the design of a new hardware accelerator, filtering the input data using Gabor functions and dedicated to image processing. The proposed design obtains a great reduction in terms of resources if compared to other state-of-the-art implementations. This is done exploiting the separability of Gabor filters along certain orientations and through a reorganization of the arithmetic units and the memory structures, achieved thanks to the absence of frame buffers to store the entire input image and partially processed data. All the above reported features allow the design to obtain real-time performances. The design has been targeted to a Xilinx Virtex 7 ASIC board and to CMOS 90nm std_cells, obtaining a minimum operating clock period of 5.8 ns for the FPGA implementation and of 2.9 ns for the std_cell one. The above reported results allow to process 83 and 168 1920×1080 pixels (Full-HD) frame-per-second, respectively.","PeriodicalId":338255,"journal":{"name":"2017 International Symposium on Signals, Circuits and Systems (ISSCS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123923053","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 : 2017-07-01DOI: 10.1109/ISSCS.2017.8034883
L. Trifina, Jonghoon Ryu, D. Tarniceriu
The permutation polynomial (PP) interleavers are ones of the most attractive and popular deterministic interleavers for turbo codes. Quadratic permutation polynomial (QPP) interleavers have been extensively studied since 2005. QPPs of short lengths with optimum minimum distances were given in 2006 by Rosnes and Takeshita. In this paper, we give PPs of degree 3, 4 and 5 with optimum minimum distances and lowest corresponding codeword multiplicities for turbo codes with recursive convolutional component codes from LTE standard and dual trellis termination. Then, we compare these PP interleavers in terms of truncated upper bounds (TUB) of frame error rate (FER) at high SNR for AWGN channel. We have obtained many PPs of degree 3, 4 or 5 with the smallest TUB(FER). A tradeoff between the error rate performance and implementation complexity is highlighted by means of the minimum number of LPPs from the Parallel Linear PP (PLPP) representation of PPs, so that the coefficients of linear terms of the component LPPs of PLPP are equal to one another.
{"title":"Up to five degree permutation polynomial interleavers for short length LTE turbo codes with optimum minimum distance","authors":"L. Trifina, Jonghoon Ryu, D. Tarniceriu","doi":"10.1109/ISSCS.2017.8034883","DOIUrl":"https://doi.org/10.1109/ISSCS.2017.8034883","url":null,"abstract":"The permutation polynomial (PP) interleavers are ones of the most attractive and popular deterministic interleavers for turbo codes. Quadratic permutation polynomial (QPP) interleavers have been extensively studied since 2005. QPPs of short lengths with optimum minimum distances were given in 2006 by Rosnes and Takeshita. In this paper, we give PPs of degree 3, 4 and 5 with optimum minimum distances and lowest corresponding codeword multiplicities for turbo codes with recursive convolutional component codes from LTE standard and dual trellis termination. Then, we compare these PP interleavers in terms of truncated upper bounds (TUB) of frame error rate (FER) at high SNR for AWGN channel. We have obtained many PPs of degree 3, 4 or 5 with the smallest TUB(FER). A tradeoff between the error rate performance and implementation complexity is highlighted by means of the minimum number of LPPs from the Parallel Linear PP (PLPP) representation of PPs, so that the coefficients of linear terms of the component LPPs of PLPP are equal to one another.","PeriodicalId":338255,"journal":{"name":"2017 International Symposium on Signals, Circuits and Systems (ISSCS)","volume":"181 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123960649","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
扫码关注我们
求助内容：
应助结果提醒方式：