发布求助
文献互助 智能选刊 最新文献

2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing最新文献

筛选
英文 中文
Image retrieval by comparison between complete oriented graphs of fuzzy regions 模糊区域完全有向图间比较的图像检索
2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing Pub Date : 2012-11-26 DOI: 10.1109/ICCP.2012.6356182
A. Gallas, W. Barhoumi, E. Zagrouba
{"title":"Image retrieval by comparison between complete oriented graphs of fuzzy regions","authors":"A. Gallas, W. Barhoumi, E. Zagrouba","doi":"10.1109/ICCP.2012.6356182","DOIUrl":"https://doi.org/10.1109/ICCP.2012.6356182","url":null,"abstract":"Images comparison is the most critical step in the content-based image retrieval process. Therefore, we propose in this paper our approach of comparison based on image modeling by complete oriented graph. This structure encompasses low-level region descriptors in nodes and coarse spatial disposition in edges. Each node is characterized by its wavelet transformation high frequency sub-band weighted by the region importance. Similarity degree between two images is identified thereafter by comparing their graphs using heuristics to guarantee low computational overhead and to resolve the NP-hard matching problem between graphs. The experimental results and comparison made with similar image retrieval engines indicate the robustness of the proposed approach for Wang dataset and prove the applied heuristics.","PeriodicalId":406461,"journal":{"name":"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122204808","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}
引用次数: 4
A membrane computing inspired packing solution and its application to service center workload distribution 膜计算启发的包装方案及其在服务中心工作负载分配中的应用
2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing Pub Date : 2012-11-26 DOI: 10.1109/ICCP.2012.6356200
D. Moldovan, G. Copil, I. Salomie, I. Anghel, T. Cioara
{"title":"A membrane computing inspired packing solution and its application to service center workload distribution","authors":"D. Moldovan, G. Copil, I. Salomie, I. Anghel, T. Cioara","doi":"10.1109/ICCP.2012.6356200","DOIUrl":"https://doi.org/10.1109/ICCP.2012.6356200","url":null,"abstract":"This paper presents a bio-inspired system based on membrane computing for solving packing problems in complex dynamic systems where the characteristics of the packed items change continuously. For representing such systems, a bio-inspired model is defined, having as core entities cells and molecules, the packing problem translating into the problem of matching molecules to cells. A symbiotic relationship involving a mutual exchange of chemicals and energy between cells and molecules is defined and used to control the matching process. The system is evaluated in the context of workload distribution in service centers, having as goal the reduction of service center energy consumption by minimizing the number of used servers without affecting the workload resource requirements.","PeriodicalId":406461,"journal":{"name":"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121113978","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}
引用次数: 0
Optimizing the Census Transform on CUDA enabled GPUs 在支持CUDA的gpu上优化普查变换
2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing Pub Date : 2012-11-26 DOI: 10.1109/ICCP.2012.6356186
C. Pantilie, S. Nedevschi
{"title":"Optimizing the Census Transform on CUDA enabled GPUs","authors":"C. Pantilie, S. Nedevschi","doi":"10.1109/ICCP.2012.6356186","DOIUrl":"https://doi.org/10.1109/ICCP.2012.6356186","url":null,"abstract":"The Census Transform is one of the most widely used matching metrics in problems that involve correspondence search such as stereo reconstruction and optical flow. Graphic processing units (GPUs) have become popular platforms for such computation intensive applications that expose a high degree of data parallelism. Their evolution as a platform for general purpose computing by continuously adding new hardware features has improved performance for many applications but it has also expanded the set of possible implementations choices up to the point where guidelines alone are not sufficient for optimum performance. What is the best implementation in the case of the Census Transform? This paper will answer that question by benchmarking all major possible implementations. Its aim is to provide an optimal implementation of the Census Transform on a current generation graphics processing unit using the Compute Unified Device Architecture (CUDA). The results have value reaching far beyond the Census Transform and provide insight for applications where non-separable 2D convolutions are present.","PeriodicalId":406461,"journal":{"name":"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129675967","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}
引用次数: 7
A new type of hybrid features for human detection 一种用于人体检测的新型混合特征
2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing Pub Date : 2012-11-26 DOI: 10.1109/ICCP.2012.6356191
A. Mozafari, M. Jamzad
{"title":"A new type of hybrid features for human detection","authors":"A. Mozafari, M. Jamzad","doi":"10.1109/ICCP.2012.6356191","DOIUrl":"https://doi.org/10.1109/ICCP.2012.6356191","url":null,"abstract":"Human detection is one of the hard problems in object detection field. There are many challenges like variation in human pose, different clothes, non-uniform illumination, cluttered background and occlusion which make this problem much harder than other object detection problems. Defining good features, which can be robust to this wide range of variations, is still an open issue in this field. To overcome this challenge, in this paper we proposed a new set of hybrid features. We combined the Histogram of Oriented Gradient (HOG) with the new features called Histogram of Small Edges (HOSE) which is introduced in this paper. These two kinds of features have two different approaches for extracting features and have the complementary role for each other. Our experimental results on INRIA dataset showed that using the proposed hybrid features provides better detection rate in comparison with state of the art features.","PeriodicalId":406461,"journal":{"name":"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123768588","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}
引用次数: 2
Random Network Coding based solution for resource efficient data dissemination 基于随机网络编码的资源高效数据分发解决方案
2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing Pub Date : 2012-11-26 DOI: 10.1109/ICCP.2012.6356207
Z. Kiss, Z. Polgar
{"title":"Random Network Coding based solution for resource efficient data dissemination","authors":"Z. Kiss, Z. Polgar","doi":"10.1109/ICCP.2012.6356207","DOIUrl":"https://doi.org/10.1109/ICCP.2012.6356207","url":null,"abstract":"The paper proposes a Random Network Coding based solution for data dissemination applications involving multiple unicast or multicast transmissions between a source and several destinations. The solution proposed is based on a mathematical framework derived from the theory of Random Network Coding employed in multicast transmissions. This framework specifies the conditions allowing to each destination to decode only the flows of interest, when the total rate of the source flows is larger than the capacity of the network. A testbed, shortly described in the paper, was implemented for proof of concept and the performances of the coded transmissions were compared to that of uncoded transmissions. The results show the improvement brought by our solution in what concerns the packet loss rate obtained for different ratios between the source flows rates and the transfer rates of the test topology's bottleneck links.","PeriodicalId":406461,"journal":{"name":"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126161050","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}
引用次数: 0
Hybrid genetic algorithm for selecting the optimal or near-optimal solution in semantic Web service composition 用于选择语义Web服务组合中最优或接近最优解决方案的混合遗传算法
2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing Pub Date : 2012-11-26 DOI: 10.1109/ICCP.2012.6356161
C. Pop, V. Chifu, I. Salomie, A. Negrean, Horatiu Jeflea
{"title":"Hybrid genetic algorithm for selecting the optimal or near-optimal solution in semantic Web service composition","authors":"C. Pop, V. Chifu, I. Salomie, A. Negrean, Horatiu Jeflea","doi":"10.1109/ICCP.2012.6356161","DOIUrl":"https://doi.org/10.1109/ICCP.2012.6356161","url":null,"abstract":"This paper presents a hybrid bio-inspired algorithm that selects the optimal or a near-optimal solution in semantic Web service composition. The proposed algorithm combines principles from evolutionary computing, tabu search and monkey search to optimize the selection process in terms of execution time and explored search space. In our approach, the search space is modeled as an Enhanced Planning Graph structure which encodes all the possible composition solutions for a given user request. To establish whether a solution is optimal, the QoS attributes of the services involved in the composition as well as the semantic similarity between them are considered as evaluation criteria. The proposed selection algorithm has been integrated in an experimental framework and a set of experiments has been carried out on different Enhanced Planning Graph topologies. The performance evaluation of the proposed algorithm has been done using the fitness graph and population diversity evolutionary measures.","PeriodicalId":406461,"journal":{"name":"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128033921","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}
引用次数: 3
SUP: A service oriented framework for semantic user profile extraction and representation SUP:用于语义用户概要提取和表示的面向服务的框架
2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing Pub Date : 2012-11-26 DOI: 10.1109/ICCP.2012.6356168
Emanuela Boros, A. Gînsca, S. Buraga, L. Alboaie
{"title":"SUP: A service oriented framework for semantic user profile extraction and representation","authors":"Emanuela Boros, A. Gînsca, S. Buraga, L. Alboaie","doi":"10.1109/ICCP.2012.6356168","DOIUrl":"https://doi.org/10.1109/ICCP.2012.6356168","url":null,"abstract":"In this paper, we present a new way of delivering social network information about a certain user, solving the intersections that may occur between different accounts that he/she owns and creating a semantic model of the profile in RDF format. The novelty consists in developing a social profile that includes not only personal data and his/her activity in social networks but also information about their influence within their group of friends and the ability of accessing the data by exposed services via SPARQL queries. Also, a web application was designed to provide a graphical interface so users can preview their social graph, the friends with the most relevant topics for them found by performing the semantic similarity between topics and other relevant data of their activity in certain time frames.","PeriodicalId":406461,"journal":{"name":"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115288236","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}
引用次数: 0
Image segmentation based on active contours without edges 基于无边缘活动轮廓的图像分割
2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing Pub Date : 2012-11-26 DOI: 10.1109/ICCP.2012.6356188
A. Morar, F. Moldoveanu, E. Groller
{"title":"Image segmentation based on active contours without edges","authors":"A. Morar, F. Moldoveanu, E. Groller","doi":"10.1109/ICCP.2012.6356188","DOIUrl":"https://doi.org/10.1109/ICCP.2012.6356188","url":null,"abstract":"There are a lot of image segmentation techniques that try to differentiate between background and object pixels, but many of them fail to discriminate between different objects that are close to each other. Some image characteristics like low contrast between background and foreground or inhomogeneity within the objects increase the difficulty of correctly segmenting images. We designed a new segmentation algorithm based on active contours without edges. We also used other image processing techniques such as nonlinear anisotropic diffusion and adaptive thresholding in order to overcome the images' problems stated above. Our algorithm was tested on very noisy images, and the results were compared to those obtained with known methods, like segmentation using active contours without edges and graph cuts. The new technique led to very good results, but the time complexity was a drawback. However, this drawback was significantly reduced with the use of graphical programming. Our segmentation method has been successfully integrated in a software application whose aim is to segment the bones from CT datasets, extract the femur and produce personalized prostheses in hip arthroplasty.","PeriodicalId":406461,"journal":{"name":"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115791838","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}
引用次数: 51
Applying mathematical models in software design 数学模型在软件设计中的应用
2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing Pub Date : 2012-11-26 DOI: 10.1109/ICCP.2012.6356166
A. Andreica, D. Stuparu, C. Miu
{"title":"Applying mathematical models in software design","authors":"A. Andreica, D. Stuparu, C. Miu","doi":"10.1109/ICCP.2012.6356166","DOIUrl":"https://doi.org/10.1109/ICCP.2012.6356166","url":null,"abstract":"The paper focuses on techniques for systematically applying mathematical models in software design. We implement a generic sorting algorithm at database level, revealing the advantages of the approach. Based on techniques for processing hierarchical structures at database level, a dedicated analysis addresses means of implementing simplification and equivalence algorithms on data structures based on modular entities. We reveal the advantages of systematically implementing mathematical algorithms in software design and implementation, including the level of database processing. The novelty of the implementation consists in applying generic algorithms at database level and in modelling discipline and module equivalence with equivalence and simplification algorithms.","PeriodicalId":406461,"journal":{"name":"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114688636","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}
引用次数: 5
Multiple partial solutions for the point-to-point correspondence problem in three views 三视图中点对点对应问题的多个部分解
2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing Pub Date : 2012-11-26 DOI: 10.1109/ICCP.2012.6356179
Miguel Carrasco
{"title":"Multiple partial solutions for the point-to-point correspondence problem in three views","authors":"Miguel Carrasco","doi":"10.1109/ICCP.2012.6356179","DOIUrl":"https://doi.org/10.1109/ICCP.2012.6356179","url":null,"abstract":"This paper presents a method of point-to-point correspondence analysis based on a combination of two techniques: (1) correspondence of multiple points through similarity of invariant features in three views by using a standard feature method, and (2) a combination of multiple partial solutions through the trifocal geometry. This method allows the determination of point-to-point geometric correspondence by means of the intersection of multiple partial solutions that are weighted through the MLESAC algorithm. The main advantage of our method is the extension of the algorithms based on the correspondence of invariant descriptors, generalizing the problem of correspondence to a geometric model in multiple views. For all the images analyzed, we showed that the point-to-point correspondence can be generated through a multiple geometric relation between three views. An important characteristic of our method is that can be used in sequences of images that have a low signal-to-noise ratio.","PeriodicalId":406461,"journal":{"name":"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121062243","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}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信