首页 > 最新文献

Proceedings of the ... IAPR International Conference on Pattern Recognition. International Conference on Pattern Recognition最新文献

英文 中文
Detection of Intracranial Hypertension using Deep Learning. 应用深度学习检测颅内高压。
Benjamin Quachtran, Robert Hamilton, Fabien Scalzo

Intracranial Hypertension, a disorder characterized by elevated pressure in the brain, is typically monitored in neurointensive care and diagnosed only after elevation has occurred. This reaction-based method of treatment leaves patients at higher risk of additional complications in case of misdetection. The detection of intracranial hypertension has been the subject of many recent studies in an attempt to accurately characterize the causes of hypertension, specifically examining waveform morphology. We investigate the use of Deep Learning, a hierarchical form of machine learning, to model the relationship between hypertension and waveform morphology, giving us the ability to accurately detect presence hypertension. Data from 60 patients, showing intracranial pressure levels over a half hour time span, was used to evaluate the model. We divided each patient's recording into average normalized beats over 30 sec segments, assigning each beat a label of high (i.e. greater than 15 mmHg) or low intracranial pressure. The model was tested to predict the presence of elevated intracranial pressure. The algorithm was found to be 92.05± 2.25% accurate in detecting intracranial hypertension on our dataset.

颅内高压是一种以颅内压升高为特征的疾病,通常在神经重症监护中监测,只有在出现升高后才能诊断。这种以反应为基础的治疗方法使患者在误诊的情况下面临更高的并发症风险。颅内高压的检测一直是最近许多研究的主题,试图准确地描述高血压的原因,特别是检查波形形态。我们研究了深度学习(一种分层形式的机器学习)的使用,以模拟高血压和波形形态之间的关系,使我们能够准确检测高血压的存在。来自60名患者的数据显示了半小时内的颅内压水平,用于评估该模型。我们将每位患者的记录分为30秒内的平均标准化心跳片段,并将每个心跳标记为高(即大于15 mmHg)或低颅内压。该模型用于预测颅内压升高的存在。在我们的数据集上,该算法检测颅内高压的准确率为92.05±2.25%。
{"title":"Detection of Intracranial Hypertension using Deep Learning.","authors":"Benjamin Quachtran,&nbsp;Robert Hamilton,&nbsp;Fabien Scalzo","doi":"10.1109/ICPR.2016.7900010","DOIUrl":"https://doi.org/10.1109/ICPR.2016.7900010","url":null,"abstract":"<p><p>Intracranial Hypertension, a disorder characterized by elevated pressure in the brain, is typically monitored in neurointensive care and diagnosed only after elevation has occurred. This reaction-based method of treatment leaves patients at higher risk of additional complications in case of misdetection. The detection of intracranial hypertension has been the subject of many recent studies in an attempt to accurately characterize the causes of hypertension, specifically examining waveform morphology. We investigate the use of Deep Learning, a hierarchical form of machine learning, to model the relationship between hypertension and waveform morphology, giving us the ability to accurately detect presence hypertension. Data from 60 patients, showing intracranial pressure levels over a half hour time span, was used to evaluate the model. We divided each patient's recording into average normalized beats over 30 sec segments, assigning each beat a label of high (i.e. greater than 15 mmHg) or low intracranial pressure. The model was tested to predict the presence of elevated intracranial pressure. The algorithm was found to be 92.05± 2.25% accurate in detecting intracranial hypertension on our dataset.</p>","PeriodicalId":74516,"journal":{"name":"Proceedings of the ... IAPR International Conference on Pattern Recognition. International Conference on Pattern Recognition","volume":"2016 ","pages":"2491-2496"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/ICPR.2016.7900010","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35377867","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 20
Bayesian approach to learn Bayesian networks using data and constraints 贝叶斯方法学习使用数据和约束的贝叶斯网络
Xiao-Guang Gao, Yu Yang, Zhi-gao Guo, Daqing Chen
{"title":"Bayesian approach to learn Bayesian networks using data and constraints","authors":"Xiao-Guang Gao, Yu Yang, Zhi-gao Guo, Daqing Chen","doi":"10.1109/ICPR.2016.7900204","DOIUrl":"https://doi.org/10.1109/ICPR.2016.7900204","url":null,"abstract":"","PeriodicalId":74516,"journal":{"name":"Proceedings of the ... IAPR International Conference on Pattern Recognition. International Conference on Pattern Recognition","volume":"38 1","pages":"3667-3672"},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87275154","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
Unsupervised Surveillance Video Retrieval Based on Human Action and Appearance 基于人的动作和外表的无监督监控视频检索
D. Gómez, H. Kjellström
Forensic video analysis is the offline analysis of video aimed at understanding what happened in a scene in the past. Two of its key tasks are the recognition of specific actions, e.g., walking or fighting, and the search for specific persons, also referred to as re-identification. Although these tasks have traditionally been performed manually in forensic investigations, the current growing number of cameras and recorded video leads to the need for automated analysis. In this paper we propose an unsupervised retrieval system for surveillance videos based on human action and appearance. Given a query window, the system retrieves people performing the same action as the one in the query, the same person performing any action, or the same person performing the same action. We use an adaptive search algorithm that focuses the analysis on relevant frames based on the inter-frame difference of foreground masks. Then, for each analyzed frame, a pedestrian detector is used to extract windows containing each pedestrian in the scene. For each detection, we use optical flow features to represent its action and color features to represent its appearance. These extracted features are used to compute the probability that the detection matches the query according to the specified criterion. The algorithm is fully unsupervised, i.e., no training or constraints on the appearance, actions or number of actions that will appear in the test video are made. The proposed algorithm is tested on a surveillance video with different people performing different actions, providing satisfactory retrieval performance.
法医视频分析是对视频进行离线分析,目的是了解过去某个场景中发生了什么。它的两个关键任务是识别特定的动作,例如行走或战斗,以及寻找特定的人,也称为重新识别。虽然这些任务传统上是在法医调查中手动执行的,但目前越来越多的摄像机和录制的视频导致需要自动分析。本文提出了一种基于人的动作和外表的监控视频无监督检索系统。给定一个查询窗口,系统检索执行与查询中相同操作的人员,执行任何操作的同一个人,或执行相同操作的同一个人。我们采用了一种基于前景蒙版帧间差异的自适应搜索算法,重点对相关帧进行分析。然后,对于每个分析帧,使用行人检测器提取包含场景中每个行人的窗口。对于每次检测,我们使用光流特征来表示其动作,使用颜色特征来表示其外观。这些提取的特征用于根据指定的标准计算检测与查询匹配的概率。该算法是完全无监督的,即没有对测试视频中出现的外观、动作或动作数量进行训练或约束。在不同人不同动作的监控视频中进行了测试,取得了令人满意的检索性能。
{"title":"Unsupervised Surveillance Video Retrieval Based on Human Action and Appearance","authors":"D. Gómez, H. Kjellström","doi":"10.1109/ICPR.2014.792","DOIUrl":"https://doi.org/10.1109/ICPR.2014.792","url":null,"abstract":"Forensic video analysis is the offline analysis of video aimed at understanding what happened in a scene in the past. Two of its key tasks are the recognition of specific actions, e.g., walking or fighting, and the search for specific persons, also referred to as re-identification. Although these tasks have traditionally been performed manually in forensic investigations, the current growing number of cameras and recorded video leads to the need for automated analysis. In this paper we propose an unsupervised retrieval system for surveillance videos based on human action and appearance. Given a query window, the system retrieves people performing the same action as the one in the query, the same person performing any action, or the same person performing the same action. We use an adaptive search algorithm that focuses the analysis on relevant frames based on the inter-frame difference of foreground masks. Then, for each analyzed frame, a pedestrian detector is used to extract windows containing each pedestrian in the scene. For each detection, we use optical flow features to represent its action and color features to represent its appearance. These extracted features are used to compute the probability that the detection matches the query according to the specified criterion. The algorithm is fully unsupervised, i.e., no training or constraints on the appearance, actions or number of actions that will appear in the test video are made. The proposed algorithm is tested on a surveillance video with different people performing different actions, providing satisfactory retrieval performance.","PeriodicalId":74516,"journal":{"name":"Proceedings of the ... IAPR International Conference on Pattern Recognition. International Conference on Pattern Recognition","volume":"210 1","pages":"4630-4635"},"PeriodicalIF":0.0,"publicationDate":"2014-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76262271","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}
引用次数: 15
Learning to Rank the Severity of Unrepaired Cleft Lip Nasal Deformity on 3D Mesh Data. 基于三维网格数据的未修复唇裂鼻畸形严重程度排序学习。
Jia Wu, Raymond Tse, Linda G Shapiro

Cleft lip is a birth defect that results in deformity of the upper lip and nose. Its severity is widely variable and the results of treatment are influenced by the initial deformity. Objective assessment of severity would help to guide prognosis and treatment. However, most assessments are subjective. The purpose of this study is to develop and test quantitative computer-based methods of measuring cleft lip severity. In this paper, a grid-patch based measurement of symmetry is introduced, with which a computer program learns to rank the severity of cleft lip on 3D meshes of human infant faces. Three computer-based methods to define the midfacial reference plane were compared to two manual methods. Four different symmetry features were calculated based upon these reference planes, and evaluated. The result shows that the rankings predicted by the proposed features were highly correlated with the ranking orders provided by experts that were used as the ground truth.

唇裂是一种先天缺陷,导致上唇和鼻子畸形。其严重程度变化很大,治疗结果受初始畸形的影响。客观评估严重程度有助于指导预后和治疗。然而,大多数评估都是主观的。本研究的目的是开发和测试定量的基于计算机的方法来测量唇裂的严重程度。本文介绍了一种基于网格补丁的对称测量方法,利用该方法,计算机程序学习在婴儿面部的三维网格上对唇裂的严重程度进行排序。将三种基于计算机的面中参考平面定义方法与两种手工方法进行了比较。基于这些参考面计算了四种不同的对称特征,并对其进行了评价。结果表明,所提出的特征预测的排名与专家提供的排名顺序高度相关,这些排名顺序被用作基础真理。
{"title":"Learning to Rank the Severity of Unrepaired Cleft Lip Nasal Deformity on 3D Mesh Data.","authors":"Jia Wu,&nbsp;Raymond Tse,&nbsp;Linda G Shapiro","doi":"10.1109/ICPR.2014.88","DOIUrl":"https://doi.org/10.1109/ICPR.2014.88","url":null,"abstract":"<p><p>Cleft lip is a birth defect that results in deformity of the upper lip and nose. Its severity is widely variable and the results of treatment are influenced by the initial deformity. Objective assessment of severity would help to guide prognosis and treatment. However, most assessments are subjective. The purpose of this study is to develop and test quantitative computer-based methods of measuring cleft lip severity. In this paper, a grid-patch based measurement of symmetry is introduced, with which a computer program learns to rank the severity of cleft lip on 3D meshes of human infant faces. Three computer-based methods to define the midfacial reference plane were compared to two manual methods. Four different symmetry features were calculated based upon these reference planes, and evaluated. The result shows that the rankings predicted by the proposed features were highly correlated with the ranking orders provided by experts that were used as the ground truth.</p>","PeriodicalId":74516,"journal":{"name":"Proceedings of the ... IAPR International Conference on Pattern Recognition. International Conference on Pattern Recognition","volume":"2014 ","pages":"460-464"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/ICPR.2014.88","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"32949304","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
A New Approach of Arc Skeletonization for Tree-Like Objects Using Minimum Cost Path. 一种基于最小代价路径的树形物体弧骨架化新方法。
Dakai Jin, Krishna S Iyer, Eric A Hoffman, Punam K Saha

Traditional arc skeletonization algorithms using the principle of Blum's transform, often, produce unwanted spurious branches due to boundary irregularities and digital effects on objects and other artifacts. This paper presents a new robust approach of extracting arc skeletons for three-dimensional (3-D) elongated fuzzy objects, which avoids spurious branches without requiring post-pruning. Starting from a root voxel, the method iteratively expands the skeleton by adding a new branch in each iteration that connects the farthest voxel to the current skeleton using a minimum-cost geodesic path. The path-cost function is formulated using a novel measure of local significance factor defined by fuzzy distance transform field, which forces the path to stick to the centerline of the object. The algorithm terminates when dilated skeletal branches fill the entire object volume or the current farthest voxel fails to generate a meaningful branch. Accuracy of the algorithm has been evaluated using computer-generated blurred and noisy phantoms with known skeletons. Performance of the method in terms of false and missing skeletal branches, as defined by human expert, has been examined using in vivo CT imaging of human intrathoracic airways. Experimental results from both experiments have established the superiority of the new method as compared to a widely used conventional method in terms of accuracy of medialness as well as robustness of true and false skeletal branches.

使用Blum变换原理的传统弧线骨架化算法,由于边界不规则性和对物体和其他工件的数字效果,通常会产生不必要的虚假分支。本文提出了一种新的提取三维(3-D)细长模糊目标圆弧骨架的鲁棒方法,该方法避免了虚假分支而无需进行后剪枝。该方法从根体素开始,通过在每次迭代中添加一个新的分支来迭代地扩展骨架,该分支使用最小代价的测地线路径将最远的体素连接到当前骨架。路径代价函数采用模糊距离变换场定义的局部显著性因子,使路径紧贴目标中心线。当扩展的骨架分支填充整个对象体积或当前最远的体素未能生成有意义的分支时,算法终止。该算法的准确性已经用计算机生成的带有已知骨架的模糊和噪声的幻影进行了评估。根据人类专家定义的虚假和缺失的骨骼分支,该方法的性能已经使用人体胸内气道的活体CT成像进行了检查。两个实验的实验结果都表明,与广泛使用的传统方法相比,新方法在中间性的准确性以及真假骨骼分支的鲁棒性方面具有优越性。
{"title":"A New Approach of Arc Skeletonization for Tree-Like Objects Using Minimum Cost Path.","authors":"Dakai Jin,&nbsp;Krishna S Iyer,&nbsp;Eric A Hoffman,&nbsp;Punam K Saha","doi":"10.1109/ICPR.2014.172","DOIUrl":"https://doi.org/10.1109/ICPR.2014.172","url":null,"abstract":"<p><p>Traditional arc skeletonization algorithms using the principle of Blum's transform, often, produce unwanted spurious branches due to boundary irregularities and digital effects on objects and other artifacts. This paper presents a new robust approach of extracting arc skeletons for three-dimensional (3-D) elongated fuzzy objects, which avoids spurious branches without requiring post-pruning. Starting from a root voxel, the method iteratively expands the skeleton by adding a new branch in each iteration that connects the farthest voxel to the current skeleton using a minimum-cost geodesic path. The path-cost function is formulated using a novel measure of local significance factor defined by fuzzy distance transform field, which forces the path to stick to the centerline of the object. The algorithm terminates when dilated skeletal branches fill the entire object volume or the current farthest voxel fails to generate a meaningful branch. Accuracy of the algorithm has been evaluated using computer-generated blurred and noisy phantoms with known skeletons. Performance of the method in terms of false and missing skeletal branches, as defined by human expert, has been examined using <i>in vivo</i> CT imaging of human intrathoracic airways. Experimental results from both experiments have established the superiority of the new method as compared to a widely used conventional method in terms of accuracy of medialness as well as robustness of true and false skeletal branches.</p>","PeriodicalId":74516,"journal":{"name":"Proceedings of the ... IAPR International Conference on Pattern Recognition. International Conference on Pattern Recognition","volume":"2014 ","pages":"942-947"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/ICPR.2014.172","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"33003518","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Watershed Merge Tree Classification for Electron Microscopy Image Segmentation. 分水岭合并树分类用于电子显微镜图像分割。
Ting Liu, Elizabeth Jurrus, Mojtaba Seyedhosseini, Mark Ellisman, Tolga Tasdizen

Automated segmentation of electron microscopy (EM) images is a challenging problem. In this paper, we present a novel method that utilizes a hierarchical structure and boundary classification for 2D neuron segmentation. With a membrane detection probability map, a watershed merge tree is built for the representation of hierarchical region merging from the watershed algorithm. A boundary classifier is learned with non-local image features to predict each potential merge in the tree, upon which merge decisions are made with consistency constraints to acquire the final segmentation. Independent of classifiers and decision strategies, our approach proposes a general framework for efficient hierarchical segmentation with statistical learning. We demonstrate that our method leads to a substantial improvement in segmentation accuracy.

电子显微镜(EM)图像的自动分割是一个具有挑战性的问题。本文提出了一种利用层次结构和边界分类进行二维神经元分割的新方法。利用膜检测概率图,构建分水岭合并树,对分水岭算法的分层区域合并进行表示。利用非局部图像特征学习边界分类器,预测树中每个可能的合并,并在合并决策的基础上进行一致性约束,获得最终的分割结果。独立于分类器和决策策略,我们的方法提出了一个通用的框架,用于有效的分层分割与统计学习。我们证明了我们的方法在分割精度方面有很大的提高。
{"title":"Watershed Merge Tree Classification for Electron Microscopy Image Segmentation.","authors":"Ting Liu,&nbsp;Elizabeth Jurrus,&nbsp;Mojtaba Seyedhosseini,&nbsp;Mark Ellisman,&nbsp;Tolga Tasdizen","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Automated segmentation of electron microscopy (EM) images is a challenging problem. In this paper, we present a novel method that utilizes a hierarchical structure and boundary classification for 2D neuron segmentation. With a membrane detection probability map, a watershed merge tree is built for the representation of hierarchical region merging from the watershed algorithm. A boundary classifier is learned with non-local image features to predict each potential merge in the tree, upon which merge decisions are made with consistency constraints to acquire the final segmentation. Independent of classifiers and decision strategies, our approach proposes a general framework for efficient hierarchical segmentation with statistical learning. We demonstrate that our method leads to a substantial improvement in segmentation accuracy.</p>","PeriodicalId":74516,"journal":{"name":"Proceedings of the ... IAPR International Conference on Pattern Recognition. International Conference on Pattern Recognition","volume":"2012 ","pages":"133-137"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4256108/pdf/nihms606909.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"32889499","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
3D shape isometric correspondence by spectral assignment. 光谱分配的三维形状等距对应。
Xiang Pan, Linda Shapiro

Finding correspondences between two 3D shapes is common both in computer vision and computer graphics. In this paper, we propose a general framework that shows how to build correspondences by utilizing the isometric property. We show that the problem of finding such correspondences can be reduced to the problem of spectral assignment, which can be solved by finding the principal eigenvector of the pairwise correspondence matrix. The proposed framework consists of four main steps. First, it obtains initial candidate pairs by performing a preliminary matching using local shape features. Second, it constructs a pairwise correspondence matrix using geodesic distance and these initial pairs. Next, the principal eigenvector of the matrix is computed. Finally, the final correspondence is obtained from the maximal elements of the principal eigenvector. In our experiments, we show that the proposed method is robust under a variety of poses. Furthermore, our results show a great improvement over the best related method in the literature.

在计算机视觉和计算机图形学中,寻找两个三维形状之间的对应关系是很常见的。在本文中,我们提出了一个通用框架,展示了如何利用等距性质建立对应。我们证明了寻找这种对应的问题可以简化为谱分配问题,而谱分配问题可以通过寻找成对对应矩阵的主特征向量来解决。拟议的框架包括四个主要步骤。首先,利用局部形状特征进行初步匹配,得到初始候选对;其次,利用测地线距离和这些初始对构造成对对应矩阵。然后,计算矩阵的主特征向量。最后,由主特征向量的极大元素得到最终对应关系。实验结果表明,该方法在多种姿态下都具有良好的鲁棒性。此外,我们的结果比文献中最好的相关方法有很大的改进。
{"title":"3D shape isometric correspondence by spectral assignment.","authors":"Xiang Pan,&nbsp;Linda Shapiro","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Finding correspondences between two 3D shapes is common both in computer vision and computer graphics. In this paper, we propose a general framework that shows how to build correspondences by utilizing the isometric property. We show that the problem of finding such correspondences can be reduced to the problem of spectral assignment, which can be solved by finding the principal eigenvector of the pairwise correspondence matrix. The proposed framework consists of four main steps. First, it obtains initial candidate pairs by performing a preliminary matching using local shape features. Second, it constructs a pairwise correspondence matrix using geodesic distance and these initial pairs. Next, the principal eigenvector of the matrix is computed. Finally, the final correspondence is obtained from the maximal elements of the principal eigenvector. In our experiments, we show that the proposed method is robust under a variety of poses. Furthermore, our results show a great improvement over the best related method in the literature.</p>","PeriodicalId":74516,"journal":{"name":"Proceedings of the ... IAPR International Conference on Pattern Recognition. International Conference on Pattern Recognition","volume":"2012 ","pages":"2210-2213"},"PeriodicalIF":0.0,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4166483/pdf/nihms432519.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"32685854","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Edge Based Binarization for Video Text Images 基于边缘的视频文本图像二值化
Zhou Zhiwei, Liu Linlin, T. C. Lim
This paper introduces a binarization method based on edge for video text images, especially for images with complex background or low contrast. The binarization method first detects the contour of the text, and utilizes a local thresholding method to decide the inner side of the contour, and then fills up the contour to form characters that are recognizable to OCR software. Experiment results show that our method is especially effective on complex background and low contrast images.
介绍了一种基于边缘的视频文本图像二值化方法,特别是对背景复杂或对比度较低的视频文本图像。二值化方法首先检测文本的轮廓,利用局部阈值法确定轮廓内侧,然后对轮廓进行填充,形成OCR软件可识别的字符。实验结果表明,该方法对复杂背景和低对比度图像具有较好的识别效果。
{"title":"Edge Based Binarization for Video Text Images","authors":"Zhou Zhiwei, Liu Linlin, T. C. Lim","doi":"10.1109/ICPR.2010.41","DOIUrl":"https://doi.org/10.1109/ICPR.2010.41","url":null,"abstract":"This paper introduces a binarization method based on edge for video text images, especially for images with complex background or low contrast. The binarization method first detects the contour of the text, and utilizes a local thresholding method to decide the inner side of the contour, and then fills up the contour to form characters that are recognizable to OCR software. Experiment results show that our method is especially effective on complex background and low contrast images.","PeriodicalId":74516,"journal":{"name":"Proceedings of the ... IAPR International Conference on Pattern Recognition. International Conference on Pattern Recognition","volume":"25 1","pages":"133-136"},"PeriodicalIF":0.0,"publicationDate":"2010-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76030533","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}
引用次数: 37
Locally Deformable Shape Model to Improve 3D Level Set based Esophagus Segmentation. 局部变形形状模型改进基于水平集的食道三维分割。
Sila Kurugol, Necmiye Ozay, Jennifer G Dy, Gregory C Sharp, Dana H Brooks

In this paper we propose a supervised 3D segmentation algorithm to locate the esophagus in thoracic CT scans using a variational framework. To address challenges due to low contrast, several priors are learned from a training set of segmented images. Our algorithm first estimates the centerline based on a spatial model learned at a few manually marked anatomical reference points. Then an implicit shape model is learned by subtracting the centerline and applying PCA to these shapes. To allow local variations in the shapes, we propose to use nonlinear smooth local deformations. Finally, the esophageal wall is located within a 3D level set framework by optimizing a cost function including terms for appearance, the shape model, smoothness constraints and an air/contrast model.

在本文中,我们提出了一种有监督的三维分割算法,利用变分框架在胸部CT扫描中定位食道。为了解决低对比度带来的挑战,从一组分割图像的训练集中学习了几个先验。我们的算法首先基于在几个手动标记的解剖参考点上学习的空间模型来估计中心线。然后通过减去中心线并对这些形状应用主成分分析来学习隐式形状模型。为了允许形状的局部变化,我们建议使用非线性光滑局部变形。最后,通过优化成本函数(包括外观、形状模型、平滑约束和空气/对比度模型),将食管壁置于3D关卡集框架中。
{"title":"Locally Deformable Shape Model to Improve 3D Level Set based Esophagus Segmentation.","authors":"Sila Kurugol,&nbsp;Necmiye Ozay,&nbsp;Jennifer G Dy,&nbsp;Gregory C Sharp,&nbsp;Dana H Brooks","doi":"10.1109/ICPR.2010.962","DOIUrl":"https://doi.org/10.1109/ICPR.2010.962","url":null,"abstract":"<p><p>In this paper we propose a supervised 3D segmentation algorithm to locate the esophagus in thoracic CT scans using a variational framework. To address challenges due to low contrast, several priors are learned from a training set of segmented images. Our algorithm first estimates the centerline based on a spatial model learned at a few manually marked anatomical reference points. Then an implicit shape model is learned by subtracting the centerline and applying PCA to these shapes. To allow local variations in the shapes, we propose to use nonlinear smooth local deformations. Finally, the esophageal wall is located within a 3D level set framework by optimizing a cost function including terms for appearance, the shape model, smoothness constraints and an air/contrast model.</p>","PeriodicalId":74516,"journal":{"name":"Proceedings of the ... IAPR International Conference on Pattern Recognition. International Conference on Pattern Recognition","volume":" ","pages":"3955-3958"},"PeriodicalIF":0.0,"publicationDate":"2010-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/ICPR.2010.962","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"29985684","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Content Adaptive Hash Lookups for Near-Duplicate Image Search by Full or Partial Image Queries 内容自适应哈希查找近重复图像搜索的全部或部分图像查询
Harmanci Oztan, R. HaritaogluIsmail
In this paper we present a scalable and high performance near-duplicate image search method. The proposed algorithm follows the common paradigm of computing local features around repeatable scale invariant interest points. Unlike existing methods, much shorter hashes are used (40 bits). By leveraging on the shortness of the hashes, a novel high performance search algorithm is introduced which analyzes the reliability of each bit of a hash and performs content adaptive hash lookups by adaptively adjusting the "range" of each hash bit based on reliability. Matched features are post-processed to determine the final match results. We experimentally show that the algorithm can detect cropped, resized, print-scanned and re-encoded images and pieces from images among thousands of images. The proposed algorithm can search for a 200x200 piece of image in a database of 2,250 images with size 2400x4000 in 0.020 seconds on 2.5GHz Intel Core 2.
本文提出了一种可扩展的高性能近重复图像搜索方法。该算法遵循可重复尺度不变兴趣点周围局部特征计算的通用范式。与现有的方法不同,它使用了更短的哈希值(40位)。通过利用哈希的短性,引入了一种新的高性能搜索算法,该算法分析哈希的每个位的可靠性,并通过基于可靠性自适应调整每个哈希位的“范围”来执行内容自适应哈希查找。匹配的特征被后处理以确定最终的匹配结果。实验表明,该算法可以从数千张图像中检测出裁剪、调整大小、打印扫描和重新编码的图像和图像片段。该算法在2.5GHz的Intel Core 2处理器上,可以在0.020秒内从2250张大小为2400x4000的图像数据库中搜索到一张200x200的图像。
{"title":"Content Adaptive Hash Lookups for Near-Duplicate Image Search by Full or Partial Image Queries","authors":"Harmanci Oztan, R. HaritaogluIsmail","doi":"10.1109/ICPR.2010.391","DOIUrl":"https://doi.org/10.1109/ICPR.2010.391","url":null,"abstract":"In this paper we present a scalable and high performance near-duplicate image search method. The proposed algorithm follows the common paradigm of computing local features around repeatable scale invariant interest points. Unlike existing methods, much shorter hashes are used (40 bits). By leveraging on the shortness of the hashes, a novel high performance search algorithm is introduced which analyzes the reliability of each bit of a hash and performs content adaptive hash lookups by adaptively adjusting the \"range\" of each hash bit based on reliability. Matched features are post-processed to determine the final match results. We experimentally show that the algorithm can detect cropped, resized, print-scanned and re-encoded images and pieces from images among thousands of images. The proposed algorithm can search for a 200x200 piece of image in a database of 2,250 images with size 2400x4000 in 0.020 seconds on 2.5GHz Intel Core 2.","PeriodicalId":74516,"journal":{"name":"Proceedings of the ... IAPR International Conference on Pattern Recognition. International Conference on Pattern Recognition","volume":"73 1","pages":"1582-1585"},"PeriodicalIF":0.0,"publicationDate":"2010-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77289320","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
期刊
Proceedings of the ... IAPR International Conference on Pattern Recognition. International Conference on Pattern Recognition
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1