2014 IEEE Symposium on Computational Intelligence for Multimedia, Signal and Vision Processing (CIMSIVP)最新文献

筛选
英文 中文
PFBIK-tracking: Particle filter with bio-inspired keypoints tracking PFBIK-tracking:具有仿生关键点跟踪的粒子过滤器
S. Filipe, Luís A. Alexandre
{"title":"PFBIK-tracking: Particle filter with bio-inspired keypoints tracking","authors":"S. Filipe, Luís A. Alexandre","doi":"10.1109/CIMSIVP.2014.7013280","DOIUrl":"https://doi.org/10.1109/CIMSIVP.2014.7013280","url":null,"abstract":"In this paper, we propose a robust detection and tracking method for 3D objects by using keypoint information in a particle filter. Our method consists of three distinct steps: Segmentation, Tracking Initialization and Tracking. The segmentation is made in order to remove all the background information, in order to reduce the number of points for further processing. In the initialization, we use a keypoint detector with biological inspiration. The information of the object that we want to follow is given by the extracted keypoints. The particle filter does the tracking of the keypoints, so with that we can predict where the keypoints will be in the next frame. In a recognition system, one of the problems is the computational cost of keypoint detectors with this we intend to solve this problem. The experiments with PFBIK-Tracking method are done indoors in an office/home environment, where personal robots are expected to operate. The Tracking Error evaluate the stability of the general tracking method. We also quantitatively evaluate this method using a “Tracking Error”. Our evaluation is done by the computation of the keypoint and particle centroid. Comparing our system with the tracking method which exists in the Point Cloud Library, we archive better results, with a much smaller number of points and computational time. Our method is faster and more robust to occlusion when compared to the OpenniTracker.","PeriodicalId":210556,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence for Multimedia, Signal and Vision Processing (CIMSIVP)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127087359","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
Unsupervised multiobjective design for weighted median filters using genetic algorithm 遗传算法加权中值滤波器的无监督多目标设计
Y. Hanada, Y. Orito
{"title":"Unsupervised multiobjective design for weighted median filters using genetic algorithm","authors":"Y. Hanada, Y. Orito","doi":"10.1109/CIMSIVP.2014.7013281","DOIUrl":"https://doi.org/10.1109/CIMSIVP.2014.7013281","url":null,"abstract":"In this paper, a new unsupervised design method of the weighted median filter (WMF) is proposed for recovering images from impulse noise. A design problem of WMFs is to determine a suitable window shape, and an appropriate weight for each element in the window. The purpose of the filter for the noise removal is generally to estimate the original values precisely for corrupted pixels while preserving the original values of non-corrupted pixels. WMF is required to output the image with higher preservation quality and higher restoration quality, however, these qualities often have a trade-off relation. Here, we formulate the design of WMF as a multi-objective optimization problem that treats the preservation performance and the restoration performance as trade-off functions. Through the experiments, we show our method obtains a wide variety of filters that have the high preservation performance or the high restoration performance at one search process. In addition, we also discuss how to select a good set of sophisticated filters from the designed filters.","PeriodicalId":210556,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence for Multimedia, Signal and Vision Processing (CIMSIVP)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126857927","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
Self-localization method for three-dimensional handy scanner using multi spot laser 多光斑激光三维手持扫描仪的自定位方法
Kumiko Yoshida, K. Kawasue
{"title":"Self-localization method for three-dimensional handy scanner using multi spot laser","authors":"Kumiko Yoshida, K. Kawasue","doi":"10.1109/CIMSIVP.2014.7013289","DOIUrl":"https://doi.org/10.1109/CIMSIVP.2014.7013289","url":null,"abstract":"On the computer vision system, if the shape of the object includes complex parts, unmeasurable area exists for occlusions of the part on its surface in many cases. The area where camera can observe in a frame is also limited and the limitation causes the unmeasurable area. In order to reduce the unmeasurable area, scanning the measurement device is required. Many numbers of views of each model from different position (orientation) have to be taken to reconstruct the whole shape of the model. The point cloud data (surface data) obtained by the measurement device are connected to reconstruct the model. The connection of the data is performed by considering the movement of the measurement system (Self-localization) or using ICP (Iterative Closest Point) algorithm. Accuracy of the connection influences the result of the model reconstructions. Reliable and accurate self-localization of measurement device is introduced in this paper.","PeriodicalId":210556,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence for Multimedia, Signal and Vision Processing (CIMSIVP)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126873306","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}
引用次数: 1
Multivariate PDF matching via kernel density estimation 基于核密度估计的多元PDF匹配
D. Fantinato, L. Boccato, R. Attux, A. Neves
{"title":"Multivariate PDF matching via kernel density estimation","authors":"D. Fantinato, L. Boccato, R. Attux, A. Neves","doi":"10.1109/CIMSIVP.2014.7013285","DOIUrl":"https://doi.org/10.1109/CIMSIVP.2014.7013285","url":null,"abstract":"In this work, a measure of similarity based on the matching of multivariate probability density functions (PDFs) is proposed. In consonance with the information theoretic learning (ITL) framework, the affinity comparison between the joint PDFs is performed using a quadratic distance, estimated with the aid of the Parzen window method with Gaussian kernels. The motivation underlying this proposal is to introduce a criterion capable of quantifying, to a significant extent, the statistical dependence present on information sources endowed with temporal and/or spatial structure, like audio, images and coded data. The measure is analyzed and compared with the canonical ITL-based approach - correntropy - for a set of blind equalization scenarios. The comparison includes elements like surface analysis, performance comparison in terms of bit error rate and a qualitative discussion concerning image processing. It is also important to remark that the study includes the application of two computational intelligence paradigms: extreme learning machines and differential evolution. The results indicate that the proposal can be, in some scenarios, a more informative formulation than correntropy.","PeriodicalId":210556,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence for Multimedia, Signal and Vision Processing (CIMSIVP)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129097141","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}
引用次数: 10
Automatic tumor lesion detection and segmentation using histogram-based gravitational optimization algorithm 基于直方图的重力优化算法的肿瘤病灶自动检测与分割
Nooshin Nabizadeh, Mohsen Dorodchi
{"title":"Automatic tumor lesion detection and segmentation using histogram-based gravitational optimization algorithm","authors":"Nooshin Nabizadeh, Mohsen Dorodchi","doi":"10.1109/CIMSIVP.2014.7013271","DOIUrl":"https://doi.org/10.1109/CIMSIVP.2014.7013271","url":null,"abstract":"In this paper, an automated and customized brain tumor segmentation method is presented and validated against ground truth applying simulated T1-weighted magnetic resonance images in 25 subjects. A new intensity-based segmentation technique called histogram based gravitational optimization algorithm is developed to segment the brain image into discriminative sections (segments) with high accuracy. While the mathematical foundation of this algorithm is presented in details, the application of the proposed algorithm in the segmentation of single T1-weighted images (T1-w) modality of healthy and lesion MR images is also presented. The results show that the tumor lesion is segmented from the detected lesion slice with 89.6% accuracy.","PeriodicalId":210556,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence for Multimedia, Signal and Vision Processing (CIMSIVP)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125282403","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}
引用次数: 1
Clustering and visualization of geodetic array data streams using self-organizing maps 使用自组织地图的大地测量阵列数据流聚类和可视化
R. Popovici, Răzvan Andonie, W. Szeliga, T. Melbourne, C. Scrivner
{"title":"Clustering and visualization of geodetic array data streams using self-organizing maps","authors":"R. Popovici, Răzvan Andonie, W. Szeliga, T. Melbourne, C. Scrivner","doi":"10.1109/CIMSIVP.2014.7013290","DOIUrl":"https://doi.org/10.1109/CIMSIVP.2014.7013290","url":null,"abstract":"The Pacific Northwest Geodesic Array at Central Washington University collects telemetered streaming data from 450 GPS stations. These real-time data are used to monitor and mitigate natural hazards arising from earthquakes, volcanic eruptions, landslides, and coastal sea-level hazards in the Pacific Northwest. Recent improvements in both accuracy of positioning measurements and latency of terrestrial data communication have led to the ability to collect data with higher sampling rates. For seismic monitoring applications, this means 1350 separate position streams from stations located across 1200 km along the West Coast of North America must be able to be both visually observed and automatically analyzed at a sampling rate of up to 1 Hz. Our goal is to efficiently extract and visualize useful information from these data streams. We propose a method to visualize the geodetic data by clustering the signal types with a Self-Organizing Map (SOM). The similarity measure in the SOM is determined by the similarity of signals received from GPS stations. Signals are transformed to symbol strings, and the distance measure in the SOM is defined by an edit distance. The symbol strings represent data streams and the SOM is dynamic. We overlap the resulted dynamic SOM on the Google Maps representation.","PeriodicalId":210556,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence for Multimedia, Signal and Vision Processing (CIMSIVP)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123361294","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
Incremental semi-supervised fuzzy clustering for shape annotation 形状标注的增量半监督模糊聚类
G. Castellano, A. Fanelli, M. Torsello
{"title":"Incremental semi-supervised fuzzy clustering for shape annotation","authors":"G. Castellano, A. Fanelli, M. Torsello","doi":"10.1109/CIMSIVP.2014.7013291","DOIUrl":"https://doi.org/10.1109/CIMSIVP.2014.7013291","url":null,"abstract":"In this paper, we present an incremental clustering approach for shape annotation, which is useful when new sets of images are available over time. A semi-supervised fuzzy clustering algorithm is used to group shapes into a number of clusters. Each cluster is represented by a prototype that is manually labeled and used to annotate shapes belonging to that cluster. To capture the evolution of the image set over time, the previously discovered prototypes are added as pre-labeled objects to the current shape set and semi-supervised clustering is applied again. The proposed incremental approach is evaluated on two benchmark image datasets, which are divided into chunks of data to simulate the progressive availability of images during time.","PeriodicalId":210556,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence for Multimedia, Signal and Vision Processing (CIMSIVP)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123744564","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}
引用次数: 1
A multi-modal moving object detection method based on GrowCut segmentation 基于GrowCut分割的多模态运动目标检测方法
Xiuwei Zhang, Yanning Zhang, S. Maybank, Jun Liang
{"title":"A multi-modal moving object detection method based on GrowCut segmentation","authors":"Xiuwei Zhang, Yanning Zhang, S. Maybank, Jun Liang","doi":"10.1109/CIMSIVP.2014.7013295","DOIUrl":"https://doi.org/10.1109/CIMSIVP.2014.7013295","url":null,"abstract":"Commonly-used motion detection methods, such as background subtraction, optical flow and frame subtraction are all based on the differences between consecutive image frames. There are many difficulties, including similarities between objects and background, shadows, low illumination, thermal halo. Visible light images and thermal images are complementary. Many difficulties in motion detection do not occur simultaneously in visible and thermal images. The proposed multimodal detection method combines the advantages of multi-modal image and GrowCut segmentation, overcomes the difficulties mentioned above and works well in complicated outdoor surveillance environments. Experiments showed our method yields better results than commonly-used fusion methods.","PeriodicalId":210556,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence for Multimedia, Signal and Vision Processing (CIMSIVP)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124405117","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
Fast overcomplete topographical independent component analysis (FOTICA) and its implementation using GPUs 快速过完备地形独立分量分析(FOTICA)及其gpu实现
Chao-Hui Huang
{"title":"Fast overcomplete topographical independent component analysis (FOTICA) and its implementation using GPUs","authors":"Chao-Hui Huang","doi":"10.1109/CIMSIVP.2014.7013293","DOIUrl":"https://doi.org/10.1109/CIMSIVP.2014.7013293","url":null,"abstract":"Overcomplete and topographic representation of natural images is an important concept in computational neuro-science due to its similarity to the anatomy of visual cortex. In this paper, we propose a novel approach, which applies the fixed-point technique of the method called FastICA [1] to the ICA model with the properties of overcomplete and topographic representation, named Fast Overcomplete Topographic ICA (FOTICA). This method inherits the features of FastICA, such as faster time to convergence, simpler structure, and less parameters. The proposed FOTICA can easily be implemented in GPUs. In this paper, we also compare the performances with different system configurations. Through the comparison, we will show the performance of the proposed FOTICA and the power of implementing FOTICA using GPUs.","PeriodicalId":210556,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence for Multimedia, Signal and Vision Processing (CIMSIVP)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128187510","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
Improving codebook generation for action recognition using a mixture of Asymmetric Gaussians 使用非对称高斯混合改进动作识别的码本生成
Tarek Elguebaly, N. Bouguila
{"title":"Improving codebook generation for action recognition using a mixture of Asymmetric Gaussians","authors":"Tarek Elguebaly, N. Bouguila","doi":"10.1109/CIMSIVP.2014.7013267","DOIUrl":"https://doi.org/10.1109/CIMSIVP.2014.7013267","url":null,"abstract":"Human activity recognition is a crucial area of computer vision research and applications. The goal of human activity recognition aims to automatically analyze and interpret ongoing events and their context from video data. Recently, the bag of visual words (BoVW) approach has been widely applied for human action recognition. Generally, a representative corpus of videos is used to build the Visual Words dictionary or codebook using a simple k-means clustering approach. This visual dictionary is then used to quantize the extracted features by simply assigning the label of the closest cluster centroid using Euclidean distance between the cluster centers and the input descriptor. Thus, each video can be represented as a frequency histogram over visual words. However, the BoVW approach has several limitations such as its need for a predefined codebook size, dependence on the chosen set of visual words, and the use of hard assignment clustering for histogram creation. In this paper, we are trying to overcome these issues by using a mixture of Asymmetric Gaussians to build the codebook. Our method is able to identify the best size for our dictionary in an unsupervised manner, to represent the set of input feature vectors by an estimate of their density distribution, and to allow soft assignments. Furthermore, we validate the efficiency of the proposed algorithm for human action recognition.","PeriodicalId":210556,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence for Multimedia, Signal and Vision Processing (CIMSIVP)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134276392","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}
引用次数: 6
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学术文献互助群
群 号:604180095
Book学术官方微信