{"title":"High-speed human detection in top-view images by feature scaling for informed filters","authors":"R. Miyamoto, Shuhei Aoki, T. Oki","doi":"10.1109/ISCMI.2017.8279609","DOIUrl":"https://doi.org/10.1109/ISCMI.2017.8279609","url":null,"abstract":"To monitor vital signs in real-time during exercise, a novel routing scheme called “image assisted routing” is proposed, for which high-speed and accurate human detection executed on embedded systems is indispensable. We propose feature scaling for informed filters with the aim of speeding up of human detection without degrading accuracy. Experimental results obtained by using a CG-based dataset show that the computation speed becomes about 2.77 times faster with the proposed feature scaling.","PeriodicalId":119111,"journal":{"name":"2017 IEEE 4th International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"198 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114352107","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}
{"title":"Improvement algorithms of perceptually important point identification for time series data mining","authors":"Tak-Chung Fu, Y. Hung, F. Chung","doi":"10.1109/ISCMI.2017.8279589","DOIUrl":"https://doi.org/10.1109/ISCMI.2017.8279589","url":null,"abstract":"In the field of time series data mining, the concept of the Perceptually Important Point (PIP) identification process is proposed for financial time series pattern matching and it is then found suitable for time series dimensionality reduction and representation. Its strength is on preserving the overall shape of the time series by identifying the salient points in it. With the rise of Big Data, time series data contributes a major proportion, especially on the data which generates by sensors in the Internet of Things (IoT) environment. According to the nature of PIP identification and the successful applications in the past years, it is worth to further explore the opportunity to apply PIP in time series “Big Data”. However, the performance of PIP identification is always considered as the limitation when dealing with “Big” time series data. In this paper, two improvement algorithms namely Caching and Splitting algorithms are proposed. Significant improvement in term of speed is obtained by these improvement algorithms.","PeriodicalId":119111,"journal":{"name":"2017 IEEE 4th International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132372360","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}
{"title":"Robust median background subtraction for embedded vision platforms","authors":"B. Cyganek","doi":"10.1109/ISCMI.2017.8279608","DOIUrl":"https://doi.org/10.1109/ISCMI.2017.8279608","url":null,"abstract":"In this paper two modification to the standard median background subtraction algorithm are proposed, which allows for higher accuracy, real-time performance and entirely integer arithmetic implementation. First, instead of a single pixel intensity, cumulative sums of intensities in patches of various size around each pixel are computed. Thanks to this the method is less sensitive to spurious variations in video and, in result, it is more insensitive to false positives. The second modification is the background detection inference rule, which we propose to base on the modified median absolute variation analysis. This rule further avoids false positives and does not depend on sensitive thresholds. We show that the proposed method has better accuracy than the classical median method, as well as it favorably compares to the group of subspace based background subtraction methods. The proposed method also allows real-time operation on HD video streams.","PeriodicalId":119111,"journal":{"name":"2017 IEEE 4th International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129286573","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}
R. Martinez, M. Iturrondobeitia, P. Jimbert, J. Ibarretxe
{"title":"Tensile strength prediction of rubber blends using linear regression techniques","authors":"R. Martinez, M. Iturrondobeitia, P. Jimbert, J. Ibarretxe","doi":"10.1109/ISCMI.2017.8279624","DOIUrl":"https://doi.org/10.1109/ISCMI.2017.8279624","url":null,"abstract":"A wide range of mechanical properties of carbon-black reinforced rubber blends are usually studied to evaluate their performance according to the initial material composition. Different amount of each composition element generate rubber blends with different mechanical properties, subsequently model the relationship between composition and mechanical properties could contribute useful information and could also save manufacturer industries significant amounts of capital. This study models tensile strength property using linear regression techniques and low errors were obtained in comparison with the values obtained from real experiments. Linear regression and generalized linear regression techniques, simple and enhanced with Gradient Boosting techniques, were used to create linear models with RMSE errors of approximately 25.33% in tensile strength prediction.","PeriodicalId":119111,"journal":{"name":"2017 IEEE 4th International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128806900","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}
{"title":"Accessibility and search engine optimization on scalable vector graphics","authors":"Reinaldo Ferraz","doi":"10.1109/ISCMI.2017.8279605","DOIUrl":"https://doi.org/10.1109/ISCMI.2017.8279605","url":null,"abstract":"The purpose of this paper was to carry out a study about techniques for description of images in Scalable Vector Graphics (SVG), and also assess the way in which search engines index this content. The study addressed the importance of the description of images, how this description has an impact on the web accessibility for screen reader users, and the way in which this content is indexed by search engines. The execution of the study involved a process of empirical observation, which represented a typical environment for the publication of a SVG code on a Web page. The base of the experiment was the publication of content within SVG elements, on a HTML5 (HyperText Markup Language version 5) webpage. After indexing by search engines, an investigation was carried out to see which elements were indexed. We observed the behaviour of the elements <title>, <desc>, <text>, and also the aria-label attribute, as well as support by browsers and assistive technology, and its indexing by search engines. The hypothesis behind this work is that some elements and attributes that are important for accessibility of the SVG content are also useful for indexing the content by search engines. The conclusion of this study has shown that elements such as <desc> and <text> are indexed by search engines, and their combination with other elements and attributes may expand the accessibility of the page and also contribute for the indexing by search engines.","PeriodicalId":119111,"journal":{"name":"2017 IEEE 4th International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126426630","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}
{"title":"Design of a compact 2-DOF joint with belt driven actuators","authors":"Lukáš Bláha","doi":"10.1109/ISCMI.2017.8279626","DOIUrl":"https://doi.org/10.1109/ISCMI.2017.8279626","url":null,"abstract":"This paper deals with the design of a new compact 2 degree of freedom joint as a key part of a hyper-redundant robotic manipulator used for nondestructive inspections. The compactness is reached using a genuine belt driven actuator together with special architecture based on the principle of universal joint. The placement of belt and pulleys is analytically solved to ensure highest torque for given joint dimensions and adequate belt tension in the whole range of joint tilt angles. The problem with belt loosening is minimized.","PeriodicalId":119111,"journal":{"name":"2017 IEEE 4th International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116250643","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}
{"title":"Community detection in networks using atom stabilization algorithm","authors":"A. Biswas, Sakshi Khandelwal, Bhaskar Biswas","doi":"10.1109/ISCMI.2017.8279604","DOIUrl":"https://doi.org/10.1109/ISCMI.2017.8279604","url":null,"abstract":"Community detection problem has great importance for better understanding of the relationships among the nodes as well as the overall network. In this paper, Atom Stabilization Algorithm (ASA) is considered for identifying communities. Modified Isolability is used as an objective function. Isolability measures the ability of group of nodes to isolate them from rest of the network. The results are compared with four other methods in terms of five quality and five accuracy metrics. The experimental results show the competency of proposed approach.","PeriodicalId":119111,"journal":{"name":"2017 IEEE 4th International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122645657","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}
M. Mouriño-García, Roberto Pérez-Rodríguez, L. Anido-Rifón
{"title":"Leveraging wikipedia knowledge to cross-language classify textual news","authors":"M. Mouriño-García, Roberto Pérez-Rodríguez, L. Anido-Rifón","doi":"10.1109/ISCMI.2017.8279619","DOIUrl":"https://doi.org/10.1109/ISCMI.2017.8279619","url":null,"abstract":"This paper presents a first attempt of leveraging Wikipedia knowledge to represent textual news stories as vectors of Wikipedia concepts, and analysis its suitability for creating a cross-language classifier of textual news stories written in Spanish when it is trained only with English ones. We describe two approaches. The first one is based only on Wikipedia concepts to represent the news stories (WikiBoC-CLCM). The second approach (Hybrid-WikiBoC) combines the WikiBoC-CLCM classifier with the state-of-the-art approach based on the bag of words model along with machine translation techniques (BoW-MT). To evaluate the approaches proposed we present a dataset composed of news written in English and Spanish, extracted from several online newspapers and news agencies such as Reuters and Europa Press. The results obtained show that the purely based on concepts WikiBoC-CLCM approach offers the highest classification performance, achieving increases up to 55.07% over the state-of-the-art BoW-MT approach. The Hybrid-WikiBoC approach also outperforms the BoW-MT model, achieving performance increases up to 2.34% We conclude that leveraging Wikipedia knowledge is of great advantage in tasks of cross-language classification of textual news stories.","PeriodicalId":119111,"journal":{"name":"2017 IEEE 4th International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124229471","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}
{"title":"Fast algorithm for isolated words recognition based on Hidden Markov model stationary distribution","authors":"Pavel Paramonov","doi":"10.1109/ISCMI.2017.8279612","DOIUrl":"https://doi.org/10.1109/ISCMI.2017.8279612","url":null,"abstract":"Over the last few decades Hidden Markov models (HMM) became core technology in automatic speech recognition (ASR). Contemporary HMM approach is based on usage of Gaussian mixture models (GMM) as acoustic models that are capable of statistical inference of speech variability. Deep neural networks (DNN) applied to ASR as acoustic models outperformed GMM in large vocabulary speech recognition. However, conventional approaches to ASR are very computationally expensive, what makes it impossible to apply them in voice control systems on low power devices. This paper focuses on the approach to isolated words recognition with reduced computational costs, what makes it feasible for in-place recognition on low computational resources devices. All components of the isolated words recognizer are described. Quantized Mel-frequency cepstral coefficients are used as speech features. The fast algorithm of isolated words recognition is described. It is based on a stationary distribution of Hidden Markov model and has linear computational complexity. Another important feature of the proposed approach is that it requires significantly less memory to store model parameters comparing to HMM-GMM and DNN models. Algorithm performance is evaluated on TIMIT isolated words dataset. The proposed method performance is compared with the results, that showed conventional forward algorithm, HMM-GMM approach and Self-Adjustable Neural Network. Only HMM-GMM outperformed proposed stationary distribution approach.","PeriodicalId":119111,"journal":{"name":"2017 IEEE 4th International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133651043","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}
{"title":"Automatic identification of wake vortex traverse by transport aircraft using fuzzy logic","authors":"Aziz Al-Mahadin, F. Bouslama","doi":"10.1109/ISCMI.2017.8279613","DOIUrl":"https://doi.org/10.1109/ISCMI.2017.8279613","url":null,"abstract":"Aircraft trailing vortices result sometimes in significant disturbance to following aircraft. Separation standards between leading and following aircraft are sometimes over estimated, hence reducing airport capacity. An important contribution to the formation and revision of vortex separations lies in the recognition of wake vortex traverse by pilot reports together with a manual analysis of the flight data routinely recorded by flight data recorders (FDRs). This process has many disadvantages and, therefore, it is desirable to have an automatic identification technique, which can save time, and is both accurate and simple to implement. In this paper, fuzzy logic (FL) is used to model and identify vortex encounters. FL tolerates data imprecision and cope well with complexities in modeling the vortex encounters. Fuzzy linguistic variables are used to model FDR data. Fuzzy rules are derived from a collection of 54 pilot reports of vortex encounters and 210 flight records from FDRs. FL identification models are analyzed and the fuzzy rule base is optimized. An average success rate of identification of 83.7% is obtained. This automatic identification system should enable the aviation authorities to review regularly the appropriateness of wake vortex separation criteria to enhance safety and increase airport capacities.","PeriodicalId":119111,"journal":{"name":"2017 IEEE 4th International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117209240","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}