2013 International Conference on Digital Image Computing: Techniques and Applications (DICTA)最新文献

筛选
英文 中文
Detection of Structural Similarity for Multimodal Microscopic Image Registration 多模态显微图像配准的结构相似性检测
Guohua Lv, S. Teng, Guojun Lu, M. Lackmann
{"title":"Detection of Structural Similarity for Multimodal Microscopic Image Registration","authors":"Guohua Lv, S. Teng, Guojun Lu, M. Lackmann","doi":"10.1109/DICTA.2013.6691495","DOIUrl":"https://doi.org/10.1109/DICTA.2013.6691495","url":null,"abstract":"In this paper we propose a novel method to detect the structural similarity in registering color and confocal microscopic images. Our prior work presented the basic idea of detecting the structural similarity of such images, which utilizes the intensity relationships among red-green-blue color channels. The work in this paper will make the detection of structural similarity automatic and adaptive to each individual color microscopic image. The experimental results will demonstrate the effectiveness of the proposed method in detecting the structural similarity of these images and significant improvements in the registration performance.","PeriodicalId":231632,"journal":{"name":"2013 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116212066","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
Lq Averaging for Symmetric Positive-Definite Matrices 对称正定矩阵的Lq平均
Khurrum Aftab, R. Hartley
{"title":"Lq Averaging for Symmetric Positive-Definite Matrices","authors":"Khurrum Aftab, R. Hartley","doi":"10.1109/DICTA.2013.6691505","DOIUrl":"https://doi.org/10.1109/DICTA.2013.6691505","url":null,"abstract":"We propose a method to find the Lq mean of a set of symmetric positive-definite (SPD) matrices, for 1 ≤ q ≤ 2. Given a set of points, the Lq mean is defined as a point for which the sum of q-th power of distances to all the given points is minimum. The Lq mean, for some value of q, has an advantage of being more robust to outliers than the standard L2 mean. The proposed method uses a Weiszfeld inspired gradient descent approach to compute the update in the descent direction. Thus, the method is very simple to understand and easy to code because it does not required line search or other complex strategy to compute the update direction. We endow a Riemannian structure on the space of SPD matrices, in particular we are interested in the Riemannian structure induced by the Log-Euclidean metric. We give a proof of convergence of the proposed algorithm to the Lq mean, under the Log-Euclidean metric. Although no such proof exists for the affine invariant metric but our experimental results show that the proposed algorithm under the affine invariant metric converges to the Lq mean. Furthermore, our experimental results on synthetic data confirms the fact that the L1 mean is more robust to outliers than the standard L2 mean.","PeriodicalId":231632,"journal":{"name":"2013 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114383012","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 Pedestrian Multiple Hypothesis Tracker Fusing Head and Body Detections 一种融合头部和身体检测的行人多假设跟踪器
J. Sherrah, B. Ristic, D. Kamenetsky
{"title":"A Pedestrian Multiple Hypothesis Tracker Fusing Head and Body Detections","authors":"J. Sherrah, B. Ristic, D. Kamenetsky","doi":"10.1109/DICTA.2013.6691474","DOIUrl":"https://doi.org/10.1109/DICTA.2013.6691474","url":null,"abstract":"We present a multiple hypothesis pedestrian tracker for surveillance video that combines head and whole-body detections. The multiple hypothesis tracker deals with ambiguity in track-to-observation matching by maintaining the most likely valid data association hypotheses. Observations are head and body detections from HOG sliding window detectors. The head detector has a high probability of detection and high false alarm rate, whereas for the body detector these probabilities are lower. The two detection types are fused in a probabilistic framework to achieve robust pedestrian tracking in a crowded environment with clutter and partial occlusions. Experiments show that the use of head and body detections along with multiple hypothesis tracking can improve online track-by-detect methods.","PeriodicalId":231632,"journal":{"name":"2013 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114387703","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
Biometric Security Application for Person Authentication Using Retinal Vessel Feature 利用视网膜血管特征进行身份认证的生物识别安全应用
Md. Akter Hussain, A. Bhuiyan, A. Mian, K. Ramamohanarao
{"title":"Biometric Security Application for Person Authentication Using Retinal Vessel Feature","authors":"Md. Akter Hussain, A. Bhuiyan, A. Mian, K. Ramamohanarao","doi":"10.1109/DICTA.2013.6691489","DOIUrl":"https://doi.org/10.1109/DICTA.2013.6691489","url":null,"abstract":"Retinal vascular branch and crossover points are unique features for each individual that can be used as a reliable biometric for personal authentication and can be used for information retrieval and security application. In this work, a novel biometric authentication scheme is proposed based on the retinal vascular network features. We apply an automatic technique to detect and identify retinal vascular branch and crossover points. These branch and crossover points are mapped from prominent blood vessels in the image. For this, a novel vessel width measurement method is applied and vessels more than certain widths are selected. Based on these vessel segments their corresponding branch and crossover points are identified. Invariant features are constructed through Geometric Hashing of the detected branch and crossover points. We consider the crossover points for modelling a basis pair and all other points together for locations in the hash table entries. Thus, the models are invariant to rotation, translation and scaling. For each person, the system is trained with the models to accept or reject a claimed identity. The initial results show that the proposed method has achieved 100% detection accuracy which is highly potential for reliable person identification.","PeriodicalId":231632,"journal":{"name":"2013 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126060390","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
Particle Detection and Classification in Photoelectric Smoke Detectors Using Image Histogram Features 基于图像直方图特征的光电烟雾探测器粒子检测与分类
K. Pahalawatta, R. Green
{"title":"Particle Detection and Classification in Photoelectric Smoke Detectors Using Image Histogram Features","authors":"K. Pahalawatta, R. Green","doi":"10.1109/DICTA.2013.6691509","DOIUrl":"https://doi.org/10.1109/DICTA.2013.6691509","url":null,"abstract":"Due to the failure of detecting smaller smoke particles (<; 1 nm in diameter) and the occurrence of false positives by commercially available photoelectric smoke detectors, a new detection algorithm was constructed by analyzing the image histogram features of smoke particles generated by Rayleigh scattered light to detect and classify the smoke particles of common household fires. Seven particle types were selected and exposed to a continuous spectrum of light in a closed particle chamber and a significant result was achieved over the common photoelectric smoke detectors by detecting all test particles using colour histograms. As Rayleigh theory suggested, comparing the intensities of scattered light of different wavelengths is the best method to classify different sized particles. Existing histogram comparison methods based on histogram bin values failed to evaluate a relationship between the scattered intensities of individual red, green and blue laser beams with different sized particles due to the uneven particles movements inside the chamber. The proposed classification algorithm which is based on a particle density independent feature, histogram maximum value index, classified all the monotype particles with 100% accuracy. As expected, the classifier failed to distinguish wood smoke from other monotype particles since wood smoke is itself a complex composition of many monotype particles.","PeriodicalId":231632,"journal":{"name":"2013 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126868777","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
Adaptive Morphological Filtering of Incomplete Data 不完全数据的自适应形态学滤波
A. Landström, M. Thurley, Håkan Jonsson
{"title":"Adaptive Morphological Filtering of Incomplete Data","authors":"A. Landström, M. Thurley, Håkan Jonsson","doi":"10.1109/DICTA.2013.6691479","DOIUrl":"https://doi.org/10.1109/DICTA.2013.6691479","url":null,"abstract":"We demonstrate how known convolution techniques for uncertain data can be used to set the shapes of structuring elements in adaptive mathematical morphology, enabling robust morphological processing of partially occluded or otherwise incomplete data. Results are presented for filtering of both gray-scale images containing missing data and 3D profile data where information is missing due to occlusion effects. The latter demonstrates the intended use of the method: enhancement of crack signatures in a surface inspection system for casted steel. The presented method is able to disregard unreliable data in a systematic and robust way, enabling adaptive morphological processing of the available information while avoiding any false edges or other unwanted features introduced by the values of faulty pixels.","PeriodicalId":231632,"journal":{"name":"2013 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","volume":"281 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130685240","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
Kernel Partial Least Squares Based Hierarchical Building Change Detection Using High Resolution Aerial Images and Lidar Data 基于核偏最小二乘的高分辨率航空图像和激光雷达数据分层建筑变化检测
Kaibin Zong, A. Sowmya, J. Trinder
{"title":"Kernel Partial Least Squares Based Hierarchical Building Change Detection Using High Resolution Aerial Images and Lidar Data","authors":"Kaibin Zong, A. Sowmya, J. Trinder","doi":"10.1109/DICTA.2013.6691502","DOIUrl":"https://doi.org/10.1109/DICTA.2013.6691502","url":null,"abstract":"Map databases usually suffer from obsolete scene details due to frequently occurring changes, therefore automatic change detection has become vital. Recently, researchers have explored change detection by combining high resolution images with airborne lidar data to overcome the disadvantages of using images alone. However, multiple correlations between different features are usually ignored and false alarms will further depress the value of final detection result. In this paper, we propose an hierarchical framework for building change detection by fusing high resolution aerial images with airborne lidar data that provides elevation information. The kernel partial least squares (KPLS) method is introduced for dealing with feature correlations, and dimension reduction and pixel level change detection are conducted simultaneously in a single learning process. To address the relatively high false alarm rate, an object based post processing technique is proposed to further eliminate those pseudo candidates. All spectral, structural and contextual information are combined together in this step. Experimental results demonstrate the capability of our proposed method for building change detection.","PeriodicalId":231632,"journal":{"name":"2013 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129628206","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
Taxonomy of File Fragments Using Gray-Level Co-Occurrence Matrices 基于灰度共生矩阵的文件片段分类
P. P. Pullaperuma, A. Dharmarathne
{"title":"Taxonomy of File Fragments Using Gray-Level Co-Occurrence Matrices","authors":"P. P. Pullaperuma, A. Dharmarathne","doi":"10.1109/DICTA.2013.6691534","DOIUrl":"https://doi.org/10.1109/DICTA.2013.6691534","url":null,"abstract":"Researches up to data have focused on using non texture based methods in addressing the problem of classifying the data types of file fragments. In this research we considered a file fragment as a 8 bit grayscale image and the Gray Level Co-Occurrence Matrix (GLCM) based method was used to extract textural features. Texture features for fragment dimensions 8 × 8, 16 × 16, 32 × 32 and 64 × 64 and gray level quantizations from 4 to 64 with step increments of 4 were explored. The K nearest neighbor classifier was used as the classifier and the optimal GLCM features for a particular gray level and fragment dimension were determined using Sequential Forward Selection (SFS) algorithm. On the classification of 7 data types, our novel approach reached a maximum overall accuracy of 86.86% in classifying 64 × 64 sized fragments with 12 gray levels.","PeriodicalId":231632,"journal":{"name":"2013 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114660685","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
Undecoded Coefficients Recovery in Distributed Video Coding by Exploiting Spatio-Temporal Correlation: A Linear Programming Approach 利用时空相关性的分布式视频解码系数恢复:一种线性规划方法
Mortuza Ali, M. Murshed
{"title":"Undecoded Coefficients Recovery in Distributed Video Coding by Exploiting Spatio-Temporal Correlation: A Linear Programming Approach","authors":"Mortuza Ali, M. Murshed","doi":"10.1109/DICTA.2013.6691535","DOIUrl":"https://doi.org/10.1109/DICTA.2013.6691535","url":null,"abstract":"Distributed video coding (DVC) aims at achieving low-complexity encoding in contrast to the existing video coding standards' high complexity encoding. According to the Wyner-Ziv theorem this can be achieved, under certain conditions, by independent encoding of the frames while resorting to joint decoding. However, the performance of a Wyner-Ziv coding scheme significantly depends on its knowledge about the spatio-temporal correlation of the video. Unfortunately, correlation statistics in a video widely varies both along the spatial and temporal directions. Therefore, we argue that in a feedback free transform domain DVC scheme the decoder will fail to recover all the transform coefficients with a nonzero probability. Thus, we suggest to integrate a recovery method with the decoder that aims at recovering the undecoded coefficients by exploiting the spatio-temporal correlation of the video. Besides, we extend and modify a recovery scheme, recently proposed in the context of images, for DVC so that it exploits both spatial and temporal correlations in recovering the undecoded coefficients. The essential idea of this scheme is to formulate the recovery problem as a linear optimization problem which can be solved efficiently using linear programming. Our simulation results demonstrated that the proposed scheme can significantly improve the PSNR and visual quality of the erroneous video frames produced by a DVC decoder.","PeriodicalId":231632,"journal":{"name":"2013 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128856159","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
Biologically Significant Facial Landmarks: How Significant Are They for Gender Classification? 生物学上重要的面部标志:它们对性别分类有多重要?
S. Z. Gilani, F. Shafait, A. Mian
{"title":"Biologically Significant Facial Landmarks: How Significant Are They for Gender Classification?","authors":"S. Z. Gilani, F. Shafait, A. Mian","doi":"10.1109/DICTA.2013.6691488","DOIUrl":"https://doi.org/10.1109/DICTA.2013.6691488","url":null,"abstract":"Automatic gender classification has many applications in human computer interaction. However, to determine the gender of an unseen face is challenging because of the diversity and variations in the human face. In this paper, we explore the importance of biologically significant facial landmarks for gender classification and propose a fully automatic gender classification algorithm. We extract 3D Euclidean and Geodesic distances between these landmarks and use feature selection to determine the relative importance of the biological landmarks for classifying gender. Unlike existing techniques, our algorithm is fully automatic since all landmarks are automatically detected. Experiments on one of the largest 3D face databases FRGC v2 show that our algorithm outperforms all existing techniques by a significant margin.","PeriodicalId":231632,"journal":{"name":"2013 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129605200","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}
引用次数: 24
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学术官方微信