{"title":"Involuntary diagnosis of intraductal breast images using gaussian mixture model","authors":"M. S. Kumar, E. Dinesh, T. Mohanraj","doi":"10.1109/MVIP.2012.6428773","DOIUrl":"https://doi.org/10.1109/MVIP.2012.6428773","url":null,"abstract":"Intraductal Carcinoma is a noninvasive condition in which abnormal cells are found in the lining of a breast duct. The abnormal cells have not spread outside the duct to other tissues in the breast. During some cases, Intraductal Carcinoma may become persistent cancer. Also spread to other tissues, though it is not known at this time how to predict which lesions will become invasive. Intraductal cancer is the most common type of breast cancer in women. Memory Intraductal includes 3-types of cancer: Usual Ductal Hyperplasia (UDH), Atypical Ductal Hyperplasia (ADH), and Ductal Carcinoma in Situ (DCIS). So the system of detecting the breast microscopic tissue of UDH, ADH, DCIS is proposed. The current standard of care is to perform percutaneous needle biopsies for diagnosis of palpable and image-detected breast abnormalities. UDH is considered benign and patients diagnosed UDH undergo routine follow-up, whereas ADH and DCIS are considered actionable and patients diagnosed with these two subtypes get additional surgical procedures. The systems classify the tissue based on the quantitative feature derived from the images. The statistical features are obtained. The approach makes use of preprocessing, Cell region segmentation, Individual cell segmentation, Feature extraction technique for the detection of cancer.","PeriodicalId":170271,"journal":{"name":"2012 International Conference on Machine Vision and Image Processing (MVIP)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124600114","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}
{"title":"Focus measures for SFF-inspired relative depth estimation","authors":"R. Senthilnathan, R. Sivaramakrishnan","doi":"10.1109/MVIP.2012.6428791","DOIUrl":"https://doi.org/10.1109/MVIP.2012.6428791","url":null,"abstract":"Shape from Focus (SFF) is a method which recovers the 3D geometry of the scene based on a sequence of images taken from different focus distances between the camera and the object. Generally SFF techniques require parallel projection of the scene on to the image plane so that the corresponding pixels in the set of images taken are easily identified. This can be achieved by using a lens which does parallel projection such as a telecentric lens. Moreover the SFF method is widely applied for extremely small objects due to the limited range of magnification that can be maintained. This again is another manifestation of the fact depth of objects produce perspective shift (generally called as structure-dependent pixel motion) in the image plane. All these facts are applicable for situations which utilizes SFF for complete reconstruction of the scene. Applications involving shape information extracted from focus as a secondary cue need not require a complete dense reconstructed information from SFF. Such applications might allow usage of wide angle lenses where the projection is basically a perspective projection of the scene on to the image plane. The research work utilizes a wide angle lens for SFF based scene reconstruction consisting of a macroscopic object. The paper is an attempt to present 24 different focus measures used for quantifying image focus from which depth is interpolated using a standard function. Since the images in the sequence suffer from changes in magnification, finding the correspondence itself is an issue worth addressing. The pixel motion is tackled by a powerful corner detector and a robust matching algorithm. The knowledge of the right focus measure is very important since it is after all from the focus measure depth of the scene is interpolated. The focus measures presented in the paper are a collection from various applications such as microscopy imaging, auto focussing, holographic reconstructions etc., but applied to an image sequence containing variations in focus and magnification.","PeriodicalId":170271,"journal":{"name":"2012 International Conference on Machine Vision and Image Processing (MVIP)","volume":"58 36","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120888908","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}
{"title":"Orthogonal polynomials based low bit rate image coding","authors":"T. Karthikeyan, R. Krishnamoorthy, B. Praburaj","doi":"10.1109/MVIP.2012.6428764","DOIUrl":"https://doi.org/10.1109/MVIP.2012.6428764","url":null,"abstract":"In this paper, a new and efficient method for transform coding of 2-D monochrome images based on orthogonal polynomials has been proposed. The proposed orthogonal polynomials based transform coding system has the encoder, consisting of a polynomial transform operation followed by quantization of transform coefficients and the entropy coding of quantized coefficients. After the encoded bit stream of an input image is transmitted over the channel, the decoder reverses all the functionalities applied in the encoder and tries to reconstruct a decoded image that looks as close as possible to the original input image. The result of the proposed coding are compared with the DCT scheme. The new coding algorithm results in a considerable reduction in computation time and provides better reconstructed picture quality.","PeriodicalId":170271,"journal":{"name":"2012 International Conference on Machine Vision and Image Processing (MVIP)","volume":"263 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116494387","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}
{"title":"Performance analysis of LPG PCA algorithm in medical images","authors":"R. Hari Kumar, B. Vinoth kumar, S. Gowthami","doi":"10.1109/MVIP.2012.6428776","DOIUrl":"https://doi.org/10.1109/MVIP.2012.6428776","url":null,"abstract":"This paper presents the performance analysis of the LPG PCA algorithm in medical images. Medical images containing lot of information are often affected by noise and artifacts, which leads to the inefficient diagnosis. LPG PCA which is a statistical decorrelation technique is found to be one of the efficient methods which could be used in improving the performance of medical images. For better preservation of fine structures in an image, a pixel and its nearest neighbors are modeled as a vector variable whose training samples are selected using a moving window in the image. Such a local vector variable preservation leads to the selection of similar intensity characteristics. This method is done in two stages for improving the denoising performance. Performance analysis of this technique is found using various image quality measures.","PeriodicalId":170271,"journal":{"name":"2012 International Conference on Machine Vision and Image Processing (MVIP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130080342","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}
{"title":"A study on regression spline based local minima approach for gaussian noise reduction in images","authors":"V. S. Bhadouria, D. Ghoshal","doi":"10.1109/MVIP.2012.6428760","DOIUrl":"https://doi.org/10.1109/MVIP.2012.6428760","url":null,"abstract":"The study proposes a novel image denoising algorithm based on the regression splines (RS) for the restoration of images corrupted with the Gaussian noise. In the proposed algorithm, overlapping window of dimension 5×5 have been considered to replace the central pixel value with the local minimum of both diagonal pixels and central row and column pixels of the processing window. Selection of minimum of approximate pixel value helps in reducing the noise diffusion to the neighboring pixels. The proposed algorithm has been found to function efficiently for the Gaussian noise removal while preserving the fine image details.","PeriodicalId":170271,"journal":{"name":"2012 International Conference on Machine Vision and Image Processing (MVIP)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134476171","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}
B. Yogameena, N. Packiyaraj, S. S. Perumal, P. Saravanan
{"title":"Ma-Th algorithm for people count in a dense crowd and their behaviour classification","authors":"B. Yogameena, N. Packiyaraj, S. S. Perumal, P. Saravanan","doi":"10.1109/MVIP.2012.6428750","DOIUrl":"https://doi.org/10.1109/MVIP.2012.6428750","url":null,"abstract":"In this paper, an intelligent surveillance algorithm for estimating the people count in a crowd and also classifying the crowd behavior as normal or abnormal is proposed. This method combines the machine learning and threshold based algorithms (Ma-Th) to estimate the people count and crowd behavior analysis. First, the foreground is segmented using ViBe algorithm. Subsequently, the features are extracted using bounding box characteristics such as crowd density, relative height/width, foreground pixel's horizontal/vertical mean. In addition to that the foreground pixel's kinetic energy and crowd distribution are thresholded. These features are learnt by Relevance Vector Machine (RVM) learning algorithm for both people count and their behavior classification. Experimental results obtained by using benchmark surveillance datasets such as Pets 2009, UMN, UCSD and videos downloaded from internet show the effectiveness of the proposed algorithm.","PeriodicalId":170271,"journal":{"name":"2012 International Conference on Machine Vision and Image Processing (MVIP)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128856478","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}
{"title":"A comparison of FFT and DCT based Phase Correlation function for focused and defocused images","authors":"A. Raj, S. Majeeth, R. Staunton","doi":"10.1109/MVIP.2012.6428788","DOIUrl":"https://doi.org/10.1109/MVIP.2012.6428788","url":null,"abstract":"The paper presents a comparison study between DCT and FFT based Phase Correlation techniques to estimate translational shifts in focused and defocused images. Though FFT based techniques are efficient for motion estimation, considering real-time implementation, DCT based techniques are simpler and computationally efficient. Experimental results with simulated focused and defocused images show comparable results to FFT's both in pixel and sub-pixel levels.","PeriodicalId":170271,"journal":{"name":"2012 International Conference on Machine Vision and Image Processing (MVIP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129864184","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}
K. Deepika, I. Ruth, S. Keerthana, B. Sathya Bama, S. Avvailakshmi, A. Vidhya
{"title":"Robust plant recognition using Graph cut based flower segmentation and PHOG based feature extraction","authors":"K. Deepika, I. Ruth, S. Keerthana, B. Sathya Bama, S. Avvailakshmi, A. Vidhya","doi":"10.1109/MVIP.2012.6428757","DOIUrl":"https://doi.org/10.1109/MVIP.2012.6428757","url":null,"abstract":"This paper proposes an efficient computer-aided plant recognition method based on plant flower images using shape and texture features intended mainly for medical industry, botanical gardening and cosmetic industry. The target flower is segmented from the complex background using Graph cut segmentation. Shape and texture features are extracted for the segmented image. In the shape domain, a feature descriptor is developed using Pyramidal Histogram of Oriented Gradients (PHOG) that represents the image shape. It captures the distribution of intensity gradients or edge directions. Then in the texture domain, the feature descriptor is developed using Pyramidal Local Binary Pattern (PLBP). The relevant images are retrieved from the database by matching the concatenated histogram of the PHOG and PLBP feature descriptors for the given input image. Results on a database of 200 sample images belonging to different types of plants show an increased efficiency of 96%.","PeriodicalId":170271,"journal":{"name":"2012 International Conference on Machine Vision and Image Processing (MVIP)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131885445","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}
{"title":"Spatially adaptive image restoration method using LPG-PCA and JBF","authors":"M. Vijay, S. Subha","doi":"10.1109/MVIP.2012.6428759","DOIUrl":"https://doi.org/10.1109/MVIP.2012.6428759","url":null,"abstract":"This paper presents an efficient image restoration scheme with the help of Principal Component Analysis (PCA) with local pixel grouping (LPG) and Joint Bilateral Filter (JBF) in spatial domain and it also helps to preserve the image local structures. In LPG-PCA method, a vector variable is modeled by using a pixel and its nearest neighbors and also training samples are extracted using the local window and block matching based LPG. It also helps to preserve image local features after coefficient shrinkage in the PCA domain while eliminating noise. For further improvement, the same procedure is iterated again and the noise level is decreased in the second stage. In the third stage, the LPG-PCA output is used as a reference image for the Joint Bilateral Filter (JBF) to preserve and enhance the edges effectively. Experimental results shows that the proposed method gains very competitive denoising performance in terms of PSNR and also the fine structures in an image are preserved. The visual quality shows that this proposed method shows better performance when compare to other methods in reducing various types of noise.","PeriodicalId":170271,"journal":{"name":"2012 International Conference on Machine Vision and Image Processing (MVIP)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121451723","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}
R. Venkata Ramana Chary, K. Sunitha, D. Rajya Lakshmi
{"title":"Similar image searching from image database using cluster mean sorting and performance estimation","authors":"R. Venkata Ramana Chary, K. Sunitha, D. Rajya Lakshmi","doi":"10.1109/MVIP.2012.6428748","DOIUrl":"https://doi.org/10.1109/MVIP.2012.6428748","url":null,"abstract":"Computer vision field over the last decades, Content-Based Image Retrieval (CBIR) systems are used in order to search, retrieve and browse image from databases. This accumulation of large collections of digital images has created the need for efficient and intelligent schemes for classifying and retrieval of images. In our proposed method, we are using, Clustering Algorithms for retrieving the images from huge volumes of data with better performance. This requires image processing, feature extraction, classification of images and retrieval steps in order to develop an efficient image retrieval system. In this work, processing is done through the image clustering method [1] which is used for feature extraction which is taken place. For retrieval of images, mean values are calculated between Query image and database images and all clustered mean values are considered as a sorted order. When the comparisons are allowed between the images, in our observation we founded excellent performance and similarities in between images. The main aim of this work is to extract images with good similarity when the images are retrieved based on query image.","PeriodicalId":170271,"journal":{"name":"2012 International Conference on Machine Vision and Image Processing (MVIP)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122552090","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}