2017 3rd International Conference on Pattern Recognition and Image Analysis (IPRIA)最新文献

筛选
英文 中文
From machine generated to handwritten character recognition; a deep learning approach 从机器生成到手写字符识别;深度学习方法
Kian Peymani, M. Soryani
{"title":"From machine generated to handwritten character recognition; a deep learning approach","authors":"Kian Peymani, M. Soryani","doi":"10.1109/PRIA.2017.7983055","DOIUrl":"https://doi.org/10.1109/PRIA.2017.7983055","url":null,"abstract":"While the task of Optical Character Recognition is deemed to be a solved problem in many languages, it still requires certain improvements in some languages with more complex script structures such as Farsi. Furthermore, Deep Convolution Neural Networks have reached excellent results in various computer vision tasks, including character recognition. Although, these networks require a great amount of data to be properly learned and (in some cases) lack generalization. In order to address this issue, in this work, we propose a tailored dataset and a delicately designed model that can be trained on only machine-generated character images with various typefaces and not only achieve an excellent result on machine generated images, but also achieve a decent accuracy in detecting handwritten characters.","PeriodicalId":336066,"journal":{"name":"2017 3rd International Conference on Pattern Recognition and Image Analysis (IPRIA)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131830226","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
Reducing circular hough transform parameters using morphological operations 减少圆形霍夫变换参数使用形态学操作
A. Bosaghzadeh
{"title":"Reducing circular hough transform parameters using morphological operations","authors":"A. Bosaghzadeh","doi":"10.1109/PRIA.2017.7983018","DOIUrl":"https://doi.org/10.1109/PRIA.2017.7983018","url":null,"abstract":"This article introduces a new technique to reduce the parameters of the Circular Hough Transform (CHT). CHT is a well-known technique to locate circles in an image. One of the main drawbacks of CHT is its three-dimensional parameter space (location and radius of the circle) which makes this algorithm not memory efficient. In this article, based on morphological operations, we reduce this parameter space to two parameters which greatly improves its speed and memory. In the first step, we determine the radius of the circles using morphological operations. In the second step, only the location of the circle centers should be found. This trick will reduce the need for a third parameter of the CHT, hence can greatly reduce the consumed memory. Moreover, by using morphologically processed images, the images that we feed to CHT mainly have circles with a specific radius while most of other objects are removed. This trick improves the speed of the algorithm since the number of false edges is greatly reduced. Experimental results on different images prove that the proposed method can detect circles with a two-dimensional accumulator space.","PeriodicalId":336066,"journal":{"name":"2017 3rd International Conference on Pattern Recognition and Image Analysis (IPRIA)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128212261","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 Zernike moment based method for classification of Alzheimer's disease from structural MRI 基于Zernike矩的结构MRI阿尔茨海默病分类方法
Aref Shams-Baboli, M. Ezoji
{"title":"A Zernike moment based method for classification of Alzheimer's disease from structural MRI","authors":"Aref Shams-Baboli, M. Ezoji","doi":"10.1109/PRIA.2017.7983061","DOIUrl":"https://doi.org/10.1109/PRIA.2017.7983061","url":null,"abstract":"This paper proposed a method based on Zernike moments to classify the various stages of Alzheimer's Disease(AD) from structural MRIs. The proposed method is benefited from all three orthogonal directions of MRIs i.e. Axial, Sagittal and Coronal images. Three back-propagation algorithms had been used to train the neural network with seven neurons in hidden layer to reach the best accuracy. We experimented this method with 232 MRIs from OASIS database. 70 percent of the subjects had been used for training and the other 30 percent was used to evaluate the trained network. We achieved accuracy of 86.46 percent in multiclass mode and 96.67 percent of accuracy in two class mode between HC and AD.","PeriodicalId":336066,"journal":{"name":"2017 3rd International Conference on Pattern Recognition and Image Analysis (IPRIA)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133670202","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}
引用次数: 9
Superpixel tracking using Kalman filter 使用卡尔曼滤波的超像素跟踪
Mohammad Faghihi, M. Yazdi, Sara Dianat
{"title":"Superpixel tracking using Kalman filter","authors":"Mohammad Faghihi, M. Yazdi, Sara Dianat","doi":"10.1109/PRIA.2017.7983041","DOIUrl":"https://doi.org/10.1109/PRIA.2017.7983041","url":null,"abstract":"In this paper, we propose an algorithm for tracking of moving objects in video sequences. Our method uses Kalman filter to predict the location of target and exploits superpixel based tracking algorithm to find the real position of target in a search region surrounding the predicted location. The motion dynamics and equations from mechanics physics are used to design a Kalman filter with assumption of constant acceleration motion. Using this Kalman filter makes our method able to handle long lasting occlusions. We have also devised a scheme that helps the tracker to find the target after long lasting occlusions.","PeriodicalId":336066,"journal":{"name":"2017 3rd International Conference on Pattern Recognition and Image Analysis (IPRIA)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116545851","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
Superpixel-based feature learning for joint sparse representation of hyperspectral images 基于超像素的高光谱图像联合稀疏表示特征学习
Zehtab Alasvand, M. Naderan, G. Akbarizadeh
{"title":"Superpixel-based feature learning for joint sparse representation of hyperspectral images","authors":"Zehtab Alasvand, M. Naderan, G. Akbarizadeh","doi":"10.1109/PRIA.2017.7983037","DOIUrl":"https://doi.org/10.1109/PRIA.2017.7983037","url":null,"abstract":"Hyper-Spectral Images (HSI) have high dimensional data and low number of training samples. Hence classification of these images is an ill posed problem. Existence of inescapable noise makes it more difficult to distinguish between members of each classes. To overcome this problem extracting both spectral and spatial features in a more effective method can raise the accuracy of classifier. For classification of HSIs one appropriate method is endmember extraction. On the other hand applying sparse representation is a hot topic and high performance in this field. This paper presents a novel superpixel-based method for classification of hyperspectral images. The method is called S3EJSR which uses Semi-Supervised Shroedinger Eigenmaps (SSSE) to extract spatial-spectral features and create superpixels. Next a joint sparse representation (JSR)is applied for endmember extraction and determining the category of pixel is based on a learned dictionary. Finally the classification is accomplished on The AVIRIS Indian Pines dataset and accuracy of this method is determined by SVM classifier. The results show that, compared with the same methods, the proposed classification method has better performance.","PeriodicalId":336066,"journal":{"name":"2017 3rd International Conference on Pattern Recognition and Image Analysis (IPRIA)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115218755","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
Non-local means denoising based on SVD basis images 非局部是指基于SVD基图像去噪
Marzieh Seyedebrahim, Azadeh Mansouri
{"title":"Non-local means denoising based on SVD basis images","authors":"Marzieh Seyedebrahim, Azadeh Mansouri","doi":"10.1109/PRIA.2017.7983047","DOIUrl":"https://doi.org/10.1109/PRIA.2017.7983047","url":null,"abstract":"With the assumption that natural images contain considerable amount of self-similarity, non-local means image de-noising uses patches similarity in order to filter noisy images. Although the output of the Non local means algorithm is very desirable in removing the low level of noise, when the noise increases, the performance deteriorates. This is because the similarity cannot be evaluated perfectly through noisy patches. To solve this problem, in the proposed approach, the similarity evaluation for each patch is performed based on the structural information. This is due to the fact that the HVS (Human Visual System) is highly adopted to extract structural information from a viewing scene. In this paper, a modified non-local means filter is introduced in order to find better similar patches especially in the case of high level of noise. The experimental results show appropriate performance of the presented algorithm both visually and quantitatively.","PeriodicalId":336066,"journal":{"name":"2017 3rd International Conference on Pattern Recognition and Image Analysis (IPRIA)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115198889","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
Inclined planes optimization algorithm in optimal architecture of MLP neural networks MLP神经网络最优结构中的斜面优化算法
N. S. Shahraki, S. Zahiri
{"title":"Inclined planes optimization algorithm in optimal architecture of MLP neural networks","authors":"N. S. Shahraki, S. Zahiri","doi":"10.1109/PRIA.2017.7983044","DOIUrl":"https://doi.org/10.1109/PRIA.2017.7983044","url":null,"abstract":"In this paper an Inclined Planes Optimization algorithm, is used to optimize the performance of the multilayer perceptron. Indeed, the performance of the neural network depends on its parameters such as the number of neurons in the hidden layer and the connection weights. So far, most research has been done in the field of training the neural network. In this paper, a new algorithm optimization is presented in optimal architecture for data classification. Neural network training is done by backpropagation (BP) algorithm and optimization the architecture of neural network is considered as independent variables in the algorithm. The results in three classification problems have shown that a neural network resulting from these methods have low complexity and high accuracy when compared with results of Particle Swarm Optimization and Gravitational Search Algorithm.","PeriodicalId":336066,"journal":{"name":"2017 3rd International Conference on Pattern Recognition and Image Analysis (IPRIA)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122525969","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}
引用次数: 8
Evaluation of graph embedding approach for dimensionality reduction using different kernels 不同核的图嵌入降维方法评价
Mohammad Amin Naeemi, H. Mohseni
{"title":"Evaluation of graph embedding approach for dimensionality reduction using different kernels","authors":"Mohammad Amin Naeemi, H. Mohseni","doi":"10.1109/PRIA.2017.7983020","DOIUrl":"https://doi.org/10.1109/PRIA.2017.7983020","url":null,"abstract":"By passing of time, the size of data such as fMRI scans, speech signals and digital photographs becomes very high and it takes large amount of time for data processing. To overcome this problem, the dimensionality of data should be reduced. Whereas graph embedding introduces a successful framework for dimensionality reduction, we use it as the base of our proposed method. In this framework, similarity and penalty graphs are constructed based on data relations. These graphs characterize the statistical or geometric property of the data that should be kept or avoided during dimensionality reduction. Our proposed method constructs these two graphs on data using Euclidean distance, in which similarity graph connects each data point with its neighboring points on the same class and characterizes compactness of within class data, while penalty graph connects the marginal points and characterizes separability out of classes. These two graphs show the geometry of the neighboring space of each data and are able to describe whole data space. Two extensions of graph embedding are discussed in this paper which are called as linearization and kernelization of graph embedding. In kernel extension, the impression of different kernel functions is evaluated on different databases. Obtained results show that the proposed method improves the accuracy of classification on data such as face and digit databases.","PeriodicalId":336066,"journal":{"name":"2017 3rd International Conference on Pattern Recognition and Image Analysis (IPRIA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128616688","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
Embedding and extracting two separate images signal in salt & pepper noises in digital images based on watermarking 基于水印的数字图像中椒盐噪声中两幅独立图像信号的嵌入与提取
Khalil Shekaramiz, Alireza Naghsh
{"title":"Embedding and extracting two separate images signal in salt & pepper noises in digital images based on watermarking","authors":"Khalil Shekaramiz, Alireza Naghsh","doi":"10.1109/PRIA.2017.7983060","DOIUrl":"https://doi.org/10.1109/PRIA.2017.7983060","url":null,"abstract":"By the increasing exchange of information around the world and the use of computer networks, such as the Internet, having a secure environment for transmission is necessary. Watermarking means hiding the data, known as water marker in digital media, in which the information can be extracted and processed in a safe manner. Watermarking in the spatial domain is done at most in three Least Significant Bits (LSB) of an image. In this paper, we introduce a method for watermarking the two separate digital signals in six bits of applied salt & pepper noises to a digital image; since the salt & pepper noises are placed randomly throughout the image, the pixels' information of the two separate images can be replaced into the salt & pepper noises peer to peer, and then this embedded information in noises is extracted in other applications, and noises from these three images will be removed.","PeriodicalId":336066,"journal":{"name":"2017 3rd International Conference on Pattern Recognition and Image Analysis (IPRIA)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114771776","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
A new approach to locate the hippocampus nest in brain MR images 脑磁共振成像海马巢定位的新方法
Maryam Hajiesmaeili, M. Amirfakhrian
{"title":"A new approach to locate the hippocampus nest in brain MR images","authors":"Maryam Hajiesmaeili, M. Amirfakhrian","doi":"10.1109/PRIA.2017.7983034","DOIUrl":"https://doi.org/10.1109/PRIA.2017.7983034","url":null,"abstract":"Hippocampal shrinkage is a main biomarker for the detection of Alzheimer's disease and Temporal lobe Epilepsy (TLE). Mostly, developing methods for the hippocampus segmentation are unable to initialize automatically due to its low contrast boundary and uncertain position with respect to the wide range of human brain size. This paper will describe how to reduce the search area in brain MRI to determine the hippocampus location by setting a cuboid slice-based nest for the hippocampus called CSNHC surrounding this structure. The proposed algorithm applies a 3D skull stripping method using BET to extract the brain volume, following by the distance estimation from the first slice that brain volume is seen to the first slice including the hippocampus in the coronal, axial and sagittal views. Finally, ground truths for three different dataset including 68 MR images are used to validate our results.","PeriodicalId":336066,"journal":{"name":"2017 3rd International Conference on Pattern Recognition and Image Analysis (IPRIA)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131288938","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
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学术官方微信