151
|
Wu JS, Zheng WS, Lai JH. Approximate kernel competitive learning. Neural Netw 2014; 63:117-32. [PMID: 25528318 DOI: 10.1016/j.neunet.2014.11.003] [Citation(s) in RCA: 7] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 04/18/2014] [Revised: 09/23/2014] [Accepted: 11/14/2014] [Indexed: 11/25/2022]
Abstract
Kernel competitive learning has been successfully used to achieve robust clustering. However, kernel competitive learning (KCL) is not scalable for large scale data processing, because (1) it has to calculate and store the full kernel matrix that is too large to be calculated and kept in the memory and (2) it cannot be computed in parallel. In this paper we develop a framework of approximate kernel competitive learning for processing large scale dataset. The proposed framework consists of two parts. First, it derives an approximate kernel competitive learning (AKCL), which learns kernel competitive learning in a subspace via sampling. We provide solid theoretical analysis on why the proposed approximation modelling would work for kernel competitive learning, and furthermore, we show that the computational complexity of AKCL is largely reduced. Second, we propose a pseudo-parallelled approximate kernel competitive learning (PAKCL) based on a set-based kernel competitive learning strategy, which overcomes the obstacle of using parallel programming in kernel competitive learning and significantly accelerates the approximate kernel competitive learning for large scale clustering. The empirical evaluation on publicly available datasets shows that the proposed AKCL and PAKCL can perform comparably as KCL, with a large reduction on computational cost. Also, the proposed methods achieve more effective clustering performance in terms of clustering precision against related approximate clustering approaches.
Collapse
Affiliation(s)
- Jian-Sheng Wu
- School of Information Science and Technology, Sun Yat-sen University, Guangzhou 510006, China; SYSU-CMU Shunde International Joint Research Institute, Shunde, China.
| | - Wei-Shi Zheng
- School of Information Science and Technology, Sun Yat-sen University, Guangzhou 510006, China; Guangdong Province Key Laboratory of Computational Science, Guangzhou 510275, China.
| | - Jian-Huang Lai
- School of Information Science and Technology, Sun Yat-sen University, Guangzhou 510006, China; Guangdong Province Key Laboratory of Information Security, China.
| |
Collapse
|
152
|
Woodworth JT, Mohler GO, Bertozzi AL, Brantingham PJ. Non-local crime density estimation incorporating housing information. PHILOSOPHICAL TRANSACTIONS. SERIES A, MATHEMATICAL, PHYSICAL, AND ENGINEERING SCIENCES 2014; 372:rsta.2013.0403. [PMID: 25288817 PMCID: PMC4186253 DOI: 10.1098/rsta.2013.0403] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/02/2023]
Abstract
Given a discrete sample of event locations, we wish to produce a probability density that models the relative probability of events occurring in a spatial domain. Standard density estimation techniques do not incorporate priors informed by spatial data. Such methods can result in assigning significant positive probability to locations where events cannot realistically occur. In particular, when modelling residential burglaries, standard density estimation can predict residential burglaries occurring where there are no residences. Incorporating the spatial data can inform the valid region for the density. When modelling very few events, additional priors can help to correctly fill in the gaps. Learning and enforcing correlation between spatial data and event data can yield better estimates from fewer events. We propose a non-local version of maximum penalized likelihood estimation based on the H(1) Sobolev seminorm regularizer that computes non-local weights from spatial data to obtain more spatially accurate density estimates. We evaluate this method in application to a residential burglary dataset from San Fernando Valley with the non-local weights informed by housing data or a satellite image.
Collapse
Affiliation(s)
- J T Woodworth
- Department of Mathematics, University of California, Los Angeles, CA 90095, USA
| | - G O Mohler
- Department of Mathematics and Computer Science, Santa Clara University, Santa Clara, CA 95053-0290, USA
| | - A L Bertozzi
- Department of Mathematics, University of California, Los Angeles, CA 90095, USA
| | - P J Brantingham
- Department of Anthropology, University of California, Los Angeles, CA 90095, USA
| |
Collapse
|
153
|
Wang J, Sun X, Nahavandi S, Kouzani A, Wu Y, She M. Multichannel biomedical time series clustering via hierarchical probabilistic latent semantic analysis. COMPUTER METHODS AND PROGRAMS IN BIOMEDICINE 2014; 117:238-246. [PMID: 25023531 DOI: 10.1016/j.cmpb.2014.06.014] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Received: 08/08/2013] [Revised: 06/20/2014] [Accepted: 06/22/2014] [Indexed: 06/03/2023]
Abstract
Biomedical time series clustering that automatically groups a collection of time series according to their internal similarity is of importance for medical record management and inspection such as bio-signals archiving and retrieval. In this paper, a novel framework that automatically groups a set of unlabelled multichannel biomedical time series according to their internal structural similarity is proposed. Specifically, we treat a multichannel biomedical time series as a document and extract local segments from the time series as words. We extend a topic model, i.e., the Hierarchical probabilistic Latent Semantic Analysis (H-pLSA), which was originally developed for visual motion analysis to cluster a set of unlabelled multichannel time series. The H-pLSA models each channel of the multichannel time series using a local pLSA in the first layer. The topics learned in the local pLSA are then fed to a global pLSA in the second layer to discover the categories of multichannel time series. Experiments on a dataset extracted from multichannel Electrocardiography (ECG) signals demonstrate that the proposed method performs better than previous state-of-the-art approaches and is relatively robust to the variations of parameters including length of local segments and dictionary size. Although the experimental evaluation used the multichannel ECG signals in a biometric scenario, the proposed algorithm is a universal framework for multichannel biomedical time series clustering according to their structural similarity, which has many applications in biomedical time series management.
Collapse
Affiliation(s)
- Jin Wang
- School of Computer Science & Software Engineering, The University of Western Australia, Australia; Center for Intelligent Systems Research, Deakin University, Australia.
| | - Xiangping Sun
- Center for Intelligent Systems Research, Deakin University, Australia; School of Engineering, Deakin University, Australia
| | - Saeid Nahavandi
- Center for Intelligent Systems Research, Deakin University, Australia
| | | | - Yuchuan Wu
- School of Mechanical Engineering and Automation, Wuhan Textile University, Wuhan, PR China
| | - Mary She
- Center for Intelligent Systems Research, Deakin University, Australia; School of Engineering, Deakin University, Australia
| |
Collapse
|
154
|
|
155
|
|
156
|
Garcia-Cardona C, Merkurjev E, Bertozzi AL, Flenner A, Percus AG. Multiclass Data Segmentation Using Diffuse Interface Methods on Graphs. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2014; 36:1600-1613. [PMID: 26353341 DOI: 10.1109/tpami.2014.2300478] [Citation(s) in RCA: 6] [Impact Index Per Article: 0.6] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/05/2023]
Abstract
We present two graph-based algorithms for multiclass segmentation of high-dimensional data on graphs. The algorithms use a diffuse interface model based on the Ginzburg-Landau functional, related to total variation and graph cuts. A multiclass extension is introduced using the Gibbs simplex, with the functional's double-well potential modified to handle the multiclass case. The first algorithm minimizes the functional using a convex splitting numerical scheme. The second algorithm uses a graph adaptation of the classical numerical Merriman-Bence-Osher (MBO) scheme, which alternates between diffusion and thresholding. We demonstrate the performance of both algorithms experimentally on synthetic data, image labeling, and several benchmark data sets such as MNIST, COIL and WebKB. We also make use of fast numerical solvers for finding the eigenvectors and eigenvalues of the graph Laplacian, and take advantage of the sparsity of the matrix. Experiments indicate that the results are competitive with or better than the current state-of-the-art in multiclass graph-based segmentation algorithms for high-dimensional data.
Collapse
|
157
|
Shi J, Wu J, Paul A, Jiao L, Gong M. A partition-based active contour model incorporating local information for image segmentation. ScientificWorldJournal 2014; 2014:840305. [PMID: 25147868 PMCID: PMC4131507 DOI: 10.1155/2014/840305] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/03/2014] [Revised: 06/02/2014] [Accepted: 06/05/2014] [Indexed: 11/18/2022] Open
Abstract
Active contour models are always designed on the assumption that images are approximated by regions with piecewise-constant intensities. This assumption, however, cannot be satisfied when describing intensity inhomogeneous images which frequently occur in real world images and induced considerable difficulties in image segmentation. A milder assumption that the image is statistically homogeneous within different local regions may better suit real world images. By taking local image information into consideration, an enhanced active contour model is proposed to overcome difficulties caused by intensity inhomogeneity. In addition, according to curve evolution theory, only the region near contour boundaries is supposed to be evolved in each iteration. We try to detect the regions near contour boundaries adaptively for satisfying the requirement of curve evolution theory. In the proposed method, pixels within a selected region near contour boundaries have the opportunity to be updated in each iteration, which enables the contour to be evolved gradually. Experimental results on synthetic and real world images demonstrate the advantages of the proposed model when dealing with intensity inhomogeneity images.
Collapse
Affiliation(s)
- Jiao Shi
- Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education, Institute of Intelligent Information Processing, Xidian University, Xi'an, Shaanxi 710071, China
| | - Jiaji Wu
- Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education, Institute of Intelligent Information Processing, Xidian University, Xi'an, Shaanxi 710071, China
| | - Anand Paul
- School of Computer Science Engineering, Kyungpook National University, Daegu 702-701, Republic of Korea
| | - Licheng Jiao
- Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education, Institute of Intelligent Information Processing, Xidian University, Xi'an, Shaanxi 710071, China
| | - Maoguo Gong
- Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education, Institute of Intelligent Information Processing, Xidian University, Xi'an, Shaanxi 710071, China
| |
Collapse
|
158
|
Sourati J, Erdogmus D, Dy JG, Brooks DH. Accelerated learning-based interactive image segmentation using pairwise constraints. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 2014; 23:3057-3070. [PMID: 24860031 PMCID: PMC4096329 DOI: 10.1109/tip.2014.2325783] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/03/2023]
Abstract
Algorithms for fully automatic segmentation of images are often not sufficiently generic with suitable accuracy, and fully manual segmentation is not practical in many settings. There is a need for semiautomatic algorithms, which are capable of interacting with the user and taking into account the collected feedback. Typically, such methods have simply incorporated user feedback directly. Here, we employ active learning of optimal queries to guide user interaction. Our work in this paper is based on constrained spectral clustering that iteratively incorporates user feedback by propagating it through the calculated affinities. The original framework does not scale well to large data sets, and hence is not straightforward to apply to interactive image segmentation. In order to address this issue, we adopt advanced numerical methods for eigen-decomposition implemented over a subsampling scheme. Our key innovation, however, is an active learning strategy that chooses pairwise queries to present to the user in order to increase the rate of learning from the feedback. Performance evaluation is carried out on the Berkeley segmentation and Graz-02 image data sets, confirming that convergence to high accuracy levels is realizable in relatively few iterations.
Collapse
|
159
|
Fagette A, Courty N, Racoceanu D, Dufour JY. Unsupervised dense crowd detection by multiscale texture analysis. Pattern Recognit Lett 2014. [DOI: 10.1016/j.patrec.2013.09.020] [Citation(s) in RCA: 16] [Impact Index Per Article: 1.6] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/26/2022]
|
160
|
|
161
|
Zhang K, Wang Q, Lan L, Sun Y, Marsic I. Sparse semi-supervised learning on low-rank kernel. Neurocomputing 2014. [DOI: 10.1016/j.neucom.2013.09.033] [Citation(s) in RCA: 7] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/26/2022]
|
162
|
Cao J, Chen P, Dai Q, Ling WK. Local information-based fast approximate spectral clustering. Pattern Recognit Lett 2014. [DOI: 10.1016/j.patrec.2013.11.005] [Citation(s) in RCA: 19] [Impact Index Per Article: 1.9] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/26/2022]
|
163
|
Çetingül HE, Wright MJ, Thompson PM, Vidal R. Segmentation of high angular resolution diffusion MRI using sparse riemannian manifold clustering. IEEE TRANSACTIONS ON MEDICAL IMAGING 2014; 33:301-317. [PMID: 24108748 PMCID: PMC4293082 DOI: 10.1109/tmi.2013.2284360] [Citation(s) in RCA: 7] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/02/2023]
Abstract
We address the problem of segmenting high angular resolution diffusion imaging (HARDI) data into multiple regions (or fiber tracts) with distinct diffusion properties. We use the orientation distribution function (ODF) to model diffusion and cast the ODF segmentation problem as a clustering problem in the space of ODFs. Our approach integrates tools from sparse representation theory and Riemannian geometry into a graph theoretic segmentation framework. By exploiting the Riemannian properties of the space of ODFs, we learn a sparse representation for each ODF and infer the segmentation by applying spectral clustering to a similarity matrix built from these representations. In cases where regions with similar (resp. distinct) diffusion properties belong to different (resp. same) fiber tracts, we obtain the segmentation by incorporating spatial and user-specified pairwise relationships into the formulation. Experiments on synthetic data evaluate the sensitivity of our method to image noise and to the concentration parameters, and show its superior performance compared to alternative methods when analyzing complex fiber configurations. Experiments on phantom and real data demonstrate the accuracy of the proposed method in segmenting simulated fibers and white matter fiber tracts of clinical importance.
Collapse
Affiliation(s)
- H. Ertan Çetingül
- Imaging and Computer Vision Technology Field, Siemens Corporation, Corporate Technology, Princeton, NJ 08540, USA. ()
| | - Margaret J. Wright
- Queensland Institute of Medical Research and with the School of Psychology, The University of Queensland, Brisbane 4072, Queensland, Australia ()
| | - Paul M. Thompson
- Laboratory of Neuro Imaging, Department of Neurology, University of California-Los Angeles (UCLA) School of Medicine, Los Angeles, CA 90095, USA ()
| | - René Vidal
- Department of Biomedical Engineering, The Johns Hopkins University, Baltimore, MD 21218, USA ()
| |
Collapse
|
164
|
Talebi H, Milanfar P. Global Image Denoising. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 2014; 23:755-768. [PMID: 26270916 DOI: 10.1109/tip.2013.2293425] [Citation(s) in RCA: 20] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/04/2023]
Abstract
Most existing state-of-the-art image denoising algorithms are based on exploiting similarity between a relatively modest number of patches. These patch-based methods are strictly dependent on patch matching, and their performance is hamstrung by the ability to reliably find sufficiently similar patches. As the number of patches grows, a point of diminishing returns is reached where the performance improvement due to more patches is offset by the lower likelihood of finding sufficiently close matches. The net effect is that while patch-based methods, such as BM3D, are excellent overall, they are ultimately limited in how well they can do on (larger) images with increasing complexity. In this paper, we address these shortcomings by developing a paradigm for truly global filtering where each pixel is estimated from all pixels in the image. Our objectives in this paper are two-fold. First, we give a statistical analysis of our proposed global filter, based on a spectral decomposition of its corresponding operator, and we study the effect of truncation of this spectral decomposition. Second, we derive an approximation to the spectral (principal) components using the Nyström extension. Using these, we demonstrate that this global filter can be implemented efficiently by sampling a fairly small percentage of the pixels in the image. Experiments illustrate that our strategy can effectively globalize any existing denoising filters to estimate each pixel using all pixels in the image, hence improving upon the best patch-based methods.
Collapse
|
165
|
Rezvanifar A, Khosravifard M. Including the Size of Regions in Image Segmentation by Region-Based Graph. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 2014; 23:635-644. [PMID: 24216717 DOI: 10.1109/tip.2013.2289984] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/02/2023]
Abstract
Applying a fast over-segmentation algorithm to image and working on a region-based graph (instead of the pixel-based graph) is an efficient approach to reduce the computational complexity of graph-based image segmentation methods. Nevertheless, some undesirable effects may arise if the conventional cost functions, such as Ncut, AverageCut, and MinCut, are employed for partitioning the region-based graph. This is because these cost functions are generally tailored to pixel-based graphs. In order to resolve this problem, we first introduce a new class of cost functions (containing Ncut and AverageCut) for graph partitioning whose corresponding suboptimal solution can be efficiently computed by solving a generalized eigenvalue problem. Then, among these cost functions, we propose one that considers the size of regions in the partitioning procedure. By simulation, the performance of the proposed cost function is quantitatively compared with that of the Ncut and AverageCut.
Collapse
|
166
|
|
167
|
|
168
|
|
169
|
Candelieri A, Conti D, Archetti F. A Graph based Analysis of Leak Localization in Urban Water Networks. ACTA ACUST UNITED AC 2014. [DOI: 10.1016/j.proeng.2014.02.026] [Citation(s) in RCA: 20] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/26/2022]
|
170
|
Effective and precise face detection based on color and depth data. APPLIED COMPUTING AND INFORMATICS 2014. [DOI: 10.1016/j.aci.2014.04.001] [Citation(s) in RCA: 14] [Impact Index Per Article: 1.4] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/23/2022]
|
171
|
Collins MD, Liu J, Xu J, Mukherjee L, Singh V. Spectral Clustering with a Convex Regularizer on Millions of Images. ACTA ACUST UNITED AC 2014. [DOI: 10.1007/978-3-319-10578-9_19] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 02/17/2023]
|
172
|
|
173
|
Dameh TA, Abd-Almageed W, Hefeeda M. Distributed Kernel Matrix Approximation and Implementation Using Message Passing Interface. 2013 12TH INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND APPLICATIONS 2013. [DOI: 10.1109/icmla.2013.17] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 09/01/2023]
|
174
|
Schultz T, Kindlmann GL. Open-box spectral clustering: applications to medical image analysis. IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 2013; 19:2100-2108. [PMID: 24051776 DOI: 10.1109/tvcg.2013.181] [Citation(s) in RCA: 9] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [Abstract] [MESH Headings] [Grants] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/02/2023]
Abstract
Spectral clustering is a powerful and versatile technique, whose broad range of applications includes 3D image analysis. However, its practical use often involves a tedious and time-consuming process of tuning parameters and making application-specific choices. In the absence of training data with labeled clusters, help from a human analyst is required to decide the number of clusters, to determine whether hierarchical clustering is needed, and to define the appropriate distance measures, parameters of the underlying graph, and type of graph Laplacian. We propose to simplify this process via an open-box approach, in which an interactive system visualizes the involved mathematical quantities, suggests parameter values, and provides immediate feedback to support the required decisions. Our framework focuses on applications in 3D image analysis, and links the abstract high-dimensional feature space used in spectral clustering to the three-dimensional data space. This provides a better understanding of the technique, and helps the analyst predict how well specific parameter settings will generalize to similar tasks. In addition, our system supports filtering outliers and labeling the final clusters in such a way that user actions can be recorded and transferred to different data in which the same structures are to be found. Our system supports a wide range of inputs, including triangular meshes, regular grids, and point clouds. We use our system to develop segmentation protocols in chest CT and brain MRI that are then successfully applied to other datasets in an automated manner.
Collapse
|
175
|
Sparks R, Madabhushi A. Explicit shape descriptors: novel morphologic features for histopathology classification. Med Image Anal 2013; 17:997-1009. [PMID: 23850744 PMCID: PMC3811112 DOI: 10.1016/j.media.2013.06.002] [Citation(s) in RCA: 35] [Impact Index Per Article: 3.2] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 07/05/2011] [Revised: 05/31/2013] [Accepted: 06/03/2013] [Indexed: 11/25/2022]
Abstract
Object morphology, defined as shape and size characteristics, observed on medical imagery is often an important marker for disease presence and/or aggressiveness. In the context of prostate cancer histopathology, gland morphology is an integral component of the Gleason grading system which enables discrimination between low and high grade disease. However, clinicians are often unable to distinguish between subtle differences in object morphology, as evidenced by high inter-observer variability in Gleason grading. Boundary-based morphologic descriptors, such as the variance in the distance from points on the boundary of an object to its center, may not have the requisite discriminability to separate objects with subtle shape differences. In this paper, we present a set of novel explicit shape descriptors (ESDs) which are capable of distinguishing subtle shape differences between prostate glands of intermediate Gleason grades (grades 3 and 4) on prostate cancer histopathology. Calculation of ESDs involves: (1) representing object morphology using an explicit shape model (e.g. medial axis); (2) aligning the shape models via a non-rigid registration scheme with a diffeomorphic constraint and quantifying shape model dissimilarity; and (3) applying a non-linear dimensionality reduction scheme (e.g. Graph Embedding) to learn a low dimensional projection encoding the shape differences between objects. ESDs are hence the principal eigenvectors in the reduced embedding space. In this work we demonstrate that ESDs in conjunction with a Support Vector Machine classifier are able to correctly distinguish between 888 prostate glands corresponding to different Gleason grades (benign, grade 3, or grade 4) of prostate cancer from 58 needle biopsy specimens with a maximum accuracy of 0.89 and corresponding area under the receiver operating characteristic curve of 0.78.
Collapse
Affiliation(s)
- Rachel Sparks
- Rutgers University, Department of Biomedical Engineering, 599 Taylor Road, Piscataway, NJ, USA
| | - Anant Madabhushi
- Case Western Reserve University, Department of Biomedical Engineering, 10900 Euclid Ave, Cleveland, OH, USA
| |
Collapse
|
176
|
XU CHENLIANG, DOELL RICHARDF, HANSON STEPHENJOSÉ, HANSON CATHERINE, CORSO JASONJ. A STUDY OF ACTOR AND ACTION SEMANTIC RETENTION IN VIDEO SUPERVOXEL SEGMENTATION. INTERNATIONAL JOURNAL OF SEMANTIC COMPUTING 2013. [DOI: 10.1142/s1793351x13400114] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/18/2022]
Abstract
Existing methods in the semantic computer vision community seem unable to deal with the explosion and richness of modern, open-source and social video content. Although sophisticated methods such as object detection or bag-of-words models have been well studied, they typically operate on low level features and ultimately suffer from either scalability issues or a lack of semantic meaning. On the other hand, video supervoxel segmentation has recently been established and applied to large scale data processing, which potentially serves as an intermediate representation to high level video semantic extraction. The supervoxels are rich decompositions of the video content: they capture object shape and motion well. However, it is not yet known if the supervoxel segmentation retains the semantics of the underlying video content. In this paper, we conduct a systematic study of how well the actor and action semantics are retained in video supervoxel segmentation. Our study has human observers watching supervoxel segmentation videos and trying to discriminate both actor (human or animal) and action (one of eight everyday actions). We gather and analyze a large set of 640 human perceptions over 96 videos in 3 different supervoxel scales. Furthermore, we design a feature defined on supervoxel segmentation, called supervoxel shape context, which is inspired by the higher order processes in human perception. We conduct actor and action classification experiments with this new feature and compare to various traditional video features. Our ultimate findings suggest that a significant amount of semantics have been well retained in the video supervoxel segmentation and can be used for further video analysis.
Collapse
Affiliation(s)
- CHENLIANG XU
- Department of Computer Science and Engineering, SUNY at Buffalo, Buffalo, NY 14260, USA
| | - RICHARD F. DOELL
- Department of Computer Science and Engineering, SUNY at Buffalo, Buffalo, NY 14260, USA
| | - STEPHEN JOSÉ HANSON
- Department of Psychology and Rutgers Brain Imaging Center, Rutgers University, Newark, NJ 07102, USA
| | - CATHERINE HANSON
- Department of Psychology and Rutgers Brain Imaging Center, Rutgers University, Newark, NJ 07102, USA
| | - JASON J. CORSO
- Department of Computer Science and Engineering, SUNY at Buffalo, Buffalo, NY 14260, USA
| |
Collapse
|
177
|
Liu Y, Shao J, Xiao J, Wu F, Zhuang Y. Hypergraph Spectral Hashing for image retrieval with heterogeneous social contexts. Neurocomputing 2013. [DOI: 10.1016/j.neucom.2012.02.051] [Citation(s) in RCA: 22] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/26/2022]
|
178
|
|
179
|
Wang J, Liu P, F H She M, Nahavandi S, Kouzani A. Biomedical time series clustering based on non-negative sparse coding and probabilistic topic model. COMPUTER METHODS AND PROGRAMS IN BIOMEDICINE 2013; 111:629-641. [PMID: 23846155 DOI: 10.1016/j.cmpb.2013.05.022] [Citation(s) in RCA: 7] [Impact Index Per Article: 0.6] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Received: 12/12/2012] [Revised: 05/26/2013] [Accepted: 05/28/2013] [Indexed: 06/02/2023]
Abstract
Biomedical time series clustering that groups a set of unlabelled temporal signals according to their underlying similarity is very useful for biomedical records management and analysis such as biosignals archiving and diagnosis. In this paper, a new framework for clustering of long-term biomedical time series such as electrocardiography (ECG) and electroencephalography (EEG) signals is proposed. Specifically, local segments extracted from the time series are projected as a combination of a small number of basis elements in a trained dictionary by non-negative sparse coding. A Bag-of-Words (BoW) representation is then constructed by summing up all the sparse coefficients of local segments in a time series. Based on the BoW representation, a probabilistic topic model that was originally developed for text document analysis is extended to discover the underlying similarity of a collection of time series. The underlying similarity of biomedical time series is well captured attributing to the statistic nature of the probabilistic topic model. Experiments on three datasets constructed from publicly available EEG and ECG signals demonstrates that the proposed approach achieves better accuracy than existing state-of-the-art methods, and is insensitive to model parameters such as length of local segments and dictionary size.
Collapse
Affiliation(s)
- Jin Wang
- Center for Intelligent Systems Research, Deakin University, Waurn Ponds 3217, Australia.
| | | | | | | | | |
Collapse
|
180
|
Sparks R, Madabhushi A. Statistical Shape Model for Manifold Regularization: Gleason grading of prostate histology. COMPUTER VISION AND IMAGE UNDERSTANDING : CVIU 2013; 117:1138-1146. [PMID: 23888106 PMCID: PMC3718190 DOI: 10.1016/j.cviu.2012.11.011] [Citation(s) in RCA: 19] [Impact Index Per Article: 1.7] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/02/2023]
Abstract
Gleason patterns of prostate cancer histopathology, characterized primarily by morphological and architectural attributes of histological structures (glands and nuclei), have been found to be highly correlated with disease aggressiveness and patient outcome. Gleason patterns 4 and 5 are highly correlated with more aggressive disease and poorer patient outcome, while Gleason patterns 1-3 tend to reflect more favorable patient outcome. Because Gleason grading is done manually by a pathologist visually examining glass (or digital) slides subtle morphologic and architectural differences of histological attributes, in addition to other factors, may result in grading errors and hence cause high inter-observer variability. Recently some researchers have proposed computerized decision support systems to automatically grade Gleason patterns by using features pertaining to nuclear architecture, gland morphology, as well as tissue texture. Automated characterization of gland morphology has been shown to distinguish between intermediate Gleason patterns 3 and 4 with high accuracy. Manifold learning (ML) schemes attempt to generate a low dimensional manifold representation of a higher dimensional feature space while simultaneously preserving nonlinear relationships between object instances. Classification can then be performed in the low dimensional space with high accuracy. However ML is sensitive to the samples contained in the dataset; changes in the dataset may alter the manifold structure. In this paper we present a manifold regularization technique to constrain the low dimensional manifold to a specific range of possible manifold shapes, the range being determined via a statistical shape model of manifolds (SSMM). In this work we demonstrate applications of the SSMM in (1) identifying samples on the manifold which contain noise, defined as those samples which deviate from the SSMM, and (2) accurate out-of-sample extrapolation (OSE) of newly acquired samples onto a manifold constrained by the SSMM. We demonstrate these applications of the SSMM in the context of distinguish between Gleason patterns 3 and 4 using glandular morphologic features in a prostate histopathology dataset of 58 patient studies. Identifying and eliminating noisy samples from the manifold via the SSMM results in a statistically significant improvement in area under the receiver operator characteristic curve (AUC), 0.832 ± 0.048 with removal of noisy samples compared to a AUC of 0.779 ± 0.075 without removal of samples. The use of the SSMM for OSE of newly acquired glands also shows statistically significant improvement in AUC, 0.834 ± 0.051 with the SSMM compared to 0.779 ± 0.054 without the SSMM. Similar results were observed for the synthetic Swiss Roll and Helix datasets.
Collapse
Affiliation(s)
- Rachel Sparks
- Department of Biomedical Engineering, Rutgers University, Piscataway, NJ, 08854
- Department of Biomedical Engineering, Case Western Reserve University, Cleveland, OH, 44106
| | - Anant Madabhushi
- Department of Biomedical Engineering, Case Western Reserve University, Cleveland, OH, 44106
| |
Collapse
|
181
|
Lombaert H, Grady L, Polimeni JR, Cheriet F. FOCUSR: feature oriented correspondence using spectral regularization--a method for precise surface matching. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2013; 35:2143-60. [PMID: 23868776 PMCID: PMC3707975 DOI: 10.1109/tpami.2012.276] [Citation(s) in RCA: 42] [Impact Index Per Article: 3.8] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/22/2023]
Abstract
Existing methods for surface matching are limited by the tradeoff between precision and computational efficiency. Here, we present an improved algorithm for dense vertex-to-vertex correspondence that uses direct matching of features defined on a surface and improves it by using spectral correspondence as a regularization. This algorithm has the speed of both feature matching and spectral matching while exhibiting greatly improved precision (distance errors of 1.4 percent). The method, FOCUSR, incorporates implicitly such additional features to calculate the correspondence and relies on the smoothness of the lowest-frequency harmonics of a graph Laplacian to spatially regularize the features. In its simplest form, FOCUSR is an improved spectral correspondence method that nonrigidly deforms spectral embeddings. We provide here a full realization of spectral correspondence where virtually any feature can be used as an additional information using weights on graph edges, but also on graph nodes and as extra embedded coordinates. As an example, the full power of FOCUSR is demonstrated in a real-case scenario with the challenging task of brain surface matching across several individuals. Our results show that combining features and regularizing them in a spectral embedding greatly improves the matching precision (to a submillimeter level) while performing at much greater speed than existing methods.
Collapse
Affiliation(s)
- Herve Lombaert
- Centre for Intelligent Machines, McGill University, 4239 Rue St-Denis, Montreal, QC H2J2K9, Canada
| | | | | | | |
Collapse
|
182
|
Kim TH, Lee KM, Lee SU. Learning full pairwise affinities for spectral segmentation. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2013; 35:1690-703. [PMID: 23681996 DOI: 10.1109/tpami.2012.237] [Citation(s) in RCA: 9] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/02/2023]
Abstract
Segmenting a single image into multiple coherent groups remains a challenging task in the field of computer vision. Particularly, spectral segmentation which uses the global information embedded in the spectrum of a given image's affinity matrix is a major trend in image segmentation. This paper focuses on the problem of efficiently learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. We first construct a sparse multilayer graph whose nodes are both the pixels and the oversegmented regions obtained by an unsupervised segmentation algorithm. By applying the semi-supervised learning strategy to this graph, the intra and interlayer affinities between all pairs of nodes can be estimated without iteration. These pairwise affinities are then applied into the spectral segmentation algorithms. In this paper, two types of spectral segmentation algorithms are introduced: $(K)$-way segmentation and hierarchical segmentation. Our algorithms provide high-quality segmentations which preserve object details by directly incorporating the full-range connections. Moreover, since our full affinity matrix is defined by the inverse of a sparse matrix, its eigendecomposition can be efficiently computed. The experimental results on the BSDS and MSRC image databases demonstrate the superiority of our segmentation algorithms in terms of relevance and accuracy compared with existing popular methods.
Collapse
Affiliation(s)
- Tae Hoon Kim
- Department of Electrical and Computer Engineering, Automation and Systems Research Institute, Seoul National University, 1 Gwanak-ro, Gwanak-gu, Seoul 151-744, Korea.
| | | | | |
Collapse
|
183
|
|
184
|
Ashraf AB, Gavenonis SC, Daye D, Mies C, Rosen MA, Kontos D. A multichannel Markov random field framework for tumor segmentation with an application to classification of gene expression-based breast cancer recurrence risk. IEEE TRANSACTIONS ON MEDICAL IMAGING 2013; 32:637-648. [PMID: 23008246 PMCID: PMC4197832 DOI: 10.1109/tmi.2012.2219589] [Citation(s) in RCA: 31] [Impact Index Per Article: 2.8] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/01/2023]
Abstract
We present a methodological framework for multichannel Markov random fields (MRFs). We show that conditional independence allows loopy belief propagation to solve a multichannel MRF as a single channel MRF. We use conditional mutual information to search for features that satisfy conditional independence assumptions. Using this framework we incorporate kinetic feature maps derived from breast dynamic contrast enhanced magnetic resonance imaging as observation channels in MRF for tumor segmentation. Our algorithm based on multichannel MRF achieves an receiver operating characteristic area under curve (AUC) of 0.97 for tumor segmentation when using a radiologist's manual delineation as ground truth. Single channel MRF based on the best feature chosen from the same pool of features as used by the multichannel MRF achieved a lower AUC of 0.89. We also present a comparison against the well established normalized cuts segmentation algorithm along with commonly used approaches for breast tumor segmentation including fuzzy C-means (FCM) and the more recent method of running FCM on enhancement variance features (FCM-VES). These previous methods give a lower AUC of 0.92, 0.88, and 0.60, respectively. Finally, we also investigate the role of superior segmentation in feature extraction and tumor characterization. Specifically, we examine the effect of improved segmentation on predicting the probability of breast cancer recurrence as determined by a validated tumor gene expression assay. We demonstrate that an support vector machine classifier trained on kinetic statistics extracted from tumors as segmented by our algorithm gives a significant improvement in distinguishing between women with high and low recurrence risk, giving an AUC of 0.88 as compared to 0.79, 0.76, 0.75, and 0.66 when using normalized cuts, single channel MRF, FCM, and FCM-VES, respectively, for segmentation.
Collapse
Affiliation(s)
- Ahmed B Ashraf
- Computational Breast Imaging Group, Department of Radiology, University of Pennsylvania, Philadelphia, PA 19104, USA.
| | | | | | | | | | | |
Collapse
|
185
|
|
186
|
Gong M, Liang Y, Shi J, Ma W, Ma J. Fuzzy C-means clustering with local information and kernel metric for image segmentation. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 2013; 22:573-84. [PMID: 23008257 DOI: 10.1109/tip.2012.2219547] [Citation(s) in RCA: 132] [Impact Index Per Article: 12.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/09/2023]
Abstract
In this paper, we present an improved fuzzy C-means (FCM) algorithm for image segmentation by introducing a tradeoff weighted fuzzy factor and a kernel metric. The tradeoff weighted fuzzy factor depends on the space distance of all neighboring pixels and their gray-level difference simultaneously. By using this factor, the new algorithm can accurately estimate the damping extent of neighboring pixels. In order to further enhance its robustness to noise and outliers, we introduce a kernel distance measure to its objective function. The new algorithm adaptively determines the kernel parameter by using a fast bandwidth selection rule based on the distance variance of all data points in the collection. Furthermore, the tradeoff weighted fuzzy factor and the kernel distance measure are both parameter free. Experimental results on synthetic and real images show that the new algorithm is effective and efficient, and is relatively independent of this type of noise.
Collapse
Affiliation(s)
- Maoguo Gong
- Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education of China, Xidian University, Xi’an 710071, China.
| | | | | | | | | |
Collapse
|
187
|
Choromanska A, Jebara T, Kim H, Mohan M, Monteleoni C. Fast Spectral Clustering via the Nyström Method. LECTURE NOTES IN COMPUTER SCIENCE 2013. [DOI: 10.1007/978-3-642-40935-6_26] [Citation(s) in RCA: 16] [Impact Index Per Article: 1.5] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 12/12/2022]
|
188
|
Daliri MR. Chi-square distance kernel of the gaits for the diagnosis of Parkinson's disease. Biomed Signal Process Control 2013. [DOI: 10.1016/j.bspc.2012.04.007] [Citation(s) in RCA: 38] [Impact Index Per Article: 3.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/28/2022]
|
189
|
Grauman K, Fergus R. Learning Binary Hash Codes for Large-Scale Image Search. MACHINE LEARNING FOR COMPUTER VISION 2013. [DOI: 10.1007/978-3-642-28661-2_3] [Citation(s) in RCA: 55] [Impact Index Per Article: 5.0] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 12/02/2022]
|
190
|
Jin R, Kou C, Liu R, Li Y. Efficient parallel spectral clustering algorithm design for large data sets under cloud computing environment. JOURNAL OF CLOUD COMPUTING: ADVANCES, SYSTEMS AND APPLICATIONS 2013. [DOI: 10.1186/2192-113x-2-18] [Citation(s) in RCA: 13] [Impact Index Per Article: 1.2] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/10/2022] Open
|
191
|
Wang J, Kumar S, Chang SF. Semi-supervised hashing for large-scale search. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2012; 34:2393-2406. [PMID: 22331853 DOI: 10.1109/tpami.2012.48] [Citation(s) in RCA: 104] [Impact Index Per Article: 8.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/31/2023]
Abstract
Hashing-based approximate nearest neighbor (ANN) search in huge databases has become popular due to its computational and memory efficiency. The popular hashing methods, e.g., Locality Sensitive Hashing and Spectral Hashing, construct hash functions based on random or principal projections. The resulting hashes are either not very accurate or are inefficient. Moreover, these methods are designed for a given metric similarity. On the contrary, semantic similarity is usually given in terms of pairwise labels of samples. There exist supervised hashing methods that can handle such semantic similarity, but they are prone to overfitting when labeled data are small or noisy. In this work, we propose a semi-supervised hashing (SSH) framework that minimizes empirical error over the labeled set and an information theoretic regularizer over both labeled and unlabeled sets. Based on this framework, we present three different semi-supervised hashing methods, including orthogonal hashing, nonorthogonal hashing, and sequential hashing. Particularly, the sequential hashing method generates robust codes in which each hash function is designed to correct the errors made by the previous ones. We further show that the sequential learning paradigm can be extended to unsupervised domains where no labeled pairs are available. Extensive experiments on four large datasets (up to 80 million samples) demonstrate the superior performance of the proposed SSH methods over state-of-the-art supervised and unsupervised hashing techniques.
Collapse
Affiliation(s)
- Jun Wang
- Business Analytics and Mathematical Sciences Department, IBM T.J. Watson Research Center, RM 31-229, 1101 Kitchawan Rd, Rte. 134, Yorktown Heights, NY 10598, USA.
| | | | | |
Collapse
|
192
|
Wang L, Dong M. Multi-level Low-rank Approximation-based Spectral Clustering for image segmentation. Pattern Recognit Lett 2012. [DOI: 10.1016/j.patrec.2012.07.024] [Citation(s) in RCA: 18] [Impact Index Per Article: 1.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/28/2022]
|
193
|
Liu H, Zhao F, Jiao L. Fuzzy spectral clustering with robust spatial information for image segmentation. Appl Soft Comput 2012. [DOI: 10.1016/j.asoc.2012.05.026] [Citation(s) in RCA: 21] [Impact Index Per Article: 1.8] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/28/2022]
|
194
|
Tam GKL, Lau RWH. Embedding retrieval of articulated geometry models. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2012; 34:2134-2146. [PMID: 22231592 DOI: 10.1109/tpami.2012.17] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/31/2023]
Abstract
Due to the popularity of computer games and animation, research on 3D articulated geometry model retrieval has attracted a lot of attention in recent years. However, most existing works extract high-dimensional features to represent models and suffer from practical limitations. First, misalignment in high-dimensional features may produce unreliable euclidean distances and affect retrieval accuracy. Second, the curse of dimensionality also degrades efficiency. In this paper, we propose an embedding retrieval framework to improve the practicability of these methods. It is based on a manifold learning technique, the Diffusion Map (DM). We project all pairwise distances onto a low-dimensional space. This improves retrieval accuracy because intercluster distances are exaggerated. Then we adapt the Density-Weighted Nyström extension and further propose a novel step to locally align the Nyström embedding to the eigensolver embedding so as to reduce extension error and preserve retrieval accuracy. Finally, we propose a heuristic to handle disconnected manifolds by augmenting the kernel matrix with multiple similarity measures and shortcut edges, and further discuss the choice of DM parameters. We have incorporated two existing matching algorithms for testing. Our experimental results show improvement in precision at high recalls and in speed. Our work provides a robust retrieval framework for the matching of multimedia data that lie on manifolds.
Collapse
Affiliation(s)
- Gary K L Tam
- Department of Computer Science and Informatics, Cardiff University, Cardiff, United Kingdom.
| | | |
Collapse
|
195
|
Alzate C, Suykens JA. Hierarchical kernel spectral clustering. Neural Netw 2012; 35:21-30. [DOI: 10.1016/j.neunet.2012.06.007] [Citation(s) in RCA: 19] [Impact Index Per Article: 1.6] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 05/24/2012] [Accepted: 06/22/2012] [Indexed: 11/16/2022]
|
196
|
Zhu X, Li M, Li X, Yang Z, Tsien JZ. Robust action recognition using multi-scale spatial-temporal concatenations of local features as natural action structures. PLoS One 2012; 7:e46686. [PMID: 23056403 PMCID: PMC3464264 DOI: 10.1371/journal.pone.0046686] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 02/06/2012] [Accepted: 09/07/2012] [Indexed: 11/19/2022] Open
Abstract
Human and many other animals can detect, recognize, and classify natural actions in a very short time. How this is achieved by the visual system and how to make machines understand natural actions have been the focus of neurobiological studies and computational modeling in the last several decades. A key issue is what spatial-temporal features should be encoded and what the characteristics of their occurrences are in natural actions. Current global encoding schemes depend heavily on segmenting while local encoding schemes lack descriptive power. Here, we propose natural action structures, i.e., multi-size, multi-scale, spatial-temporal concatenations of local features, as the basic features for representing natural actions. In this concept, any action is a spatial-temporal concatenation of a set of natural action structures, which convey a full range of information about natural actions. We took several steps to extract these structures. First, we sampled a large number of sequences of patches at multiple spatial-temporal scales. Second, we performed independent component analysis on the patch sequences and classified the independent components into clusters. Finally, we compiled a large set of natural action structures, with each corresponding to a unique combination of the clusters at the selected spatial-temporal scales. To classify human actions, we used a set of informative natural action structures as inputs to two widely used models. We found that the natural action structures obtained here achieved a significantly better recognition performance than low-level features and that the performance was better than or comparable to the best current models. We also found that the classification performance with natural action structures as features was slightly affected by changes of scale and artificially added noise. We concluded that the natural action structures proposed here can be used as the basic encoding units of actions and may hold the key to natural action understanding.
Collapse
Affiliation(s)
- Xiaoyuan Zhu
- Brain and Behavior Discovery Institute, Medical College of Georgia, Georgia Regents University, Augusta, Georgia, United States of America
- Department of Neurology, Medical College of Georgia, Georgia Regents University, Augusta, Georgia, United States of America
| | - Meng Li
- Brain and Behavior Discovery Institute, Medical College of Georgia, Georgia Regents University, Augusta, Georgia, United States of America
- Department of Neurology, Medical College of Georgia, Georgia Regents University, Augusta, Georgia, United States of America
| | - Xiaojian Li
- Brain and Behavior Discovery Institute, Medical College of Georgia, Georgia Regents University, Augusta, Georgia, United States of America
- Department of Neurology, Medical College of Georgia, Georgia Regents University, Augusta, Georgia, United States of America
| | - Zhiyong Yang
- Brain and Behavior Discovery Institute, Medical College of Georgia, Georgia Regents University, Augusta, Georgia, United States of America
- Department of Ophthalmology, Medical College of Georgia, Georgia Regents University, Augusta, Georgia, United States of America
- * E-mail: (ZY); (JZT)
| | - Joe Z. Tsien
- Brain and Behavior Discovery Institute, Medical College of Georgia, Georgia Regents University, Augusta, Georgia, United States of America
- Department of Neurology, Medical College of Georgia, Georgia Regents University, Augusta, Georgia, United States of America
- * E-mail: (ZY); (JZT)
| |
Collapse
|
197
|
Computer-aided colorectal tumor classification in NBI endoscopy using local features. Med Image Anal 2012; 17:78-100. [PMID: 23085199 DOI: 10.1016/j.media.2012.08.003] [Citation(s) in RCA: 107] [Impact Index Per Article: 8.9] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 10/01/2011] [Revised: 07/26/2012] [Accepted: 08/20/2012] [Indexed: 12/18/2022]
Abstract
An early detection of colorectal cancer through colorectal endoscopy is important and widely used in hospitals as a standard medical procedure. During colonoscopy, the lesions of colorectal tumors on the colon surface are visually inspected by a Narrow Band Imaging (NBI) zoom-videoendoscope. By using the visual appearance of colorectal tumors in endoscopic images, histological diagnosis is presumed based on classification schemes for NBI magnification findings. In this paper, we report on the performance of a recognition system for classifying NBI images of colorectal tumors into three types (A, B, and C3) based on the NBI magnification findings. To deal with the problem of computer-aided classification of NBI images, we explore a local feature-based recognition method, bag-of-visual-words (BoW), and provide extensive experiments on a variety of technical aspects. The proposed prototype system, used in the experiments, consists of a bag-of-visual-words representation of local features followed by Support Vector Machine (SVM) classifiers. A number of local features are extracted by using sampling schemes such as Difference-of-Gaussians and grid sampling. In addition, in this paper we propose a new combination of local features and sampling schemes. Extensive experiments with varying the parameters for each component are carried out, for the performance of the system is usually affected by those parameters, e.g. the sampling strategy for the local features, the representation of the local feature histograms, the kernel types of the SVM classifiers, the number of classes to be considered, etc. The recognition results are compared in terms of recognition rates, precision/recall, and F-measure for different numbers of visual words. The proposed system achieves a recognition rate of 96% for 10-fold cross validation on a real dataset of 908 NBI images collected during actual colonoscopy, and 93% for a separate test dataset.
Collapse
|
198
|
Schuetter J, Shi T. Multiple Sample Data Spectroscopic Clustering of Large Datasets Using Nyström Extension. J Comput Graph Stat 2012. [DOI: 10.1080/10618600.2012.672104] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/27/2022]
|
199
|
Zheng WS, Gong S, Xiang T. Quantifying and transferring contextual information in object detection. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2012; 34:762-777. [PMID: 21844619 DOI: 10.1109/tpami.2011.164] [Citation(s) in RCA: 6] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/31/2023]
Abstract
Context is critical for reducing the uncertainty in object detection. However, context modeling is challenging because there are often many different types of contextual information coexisting with different degrees of relevance to the detection of target object(s) in different images. It is therefore crucial to devise a context model to automatically quantify and select the most effective contextual information for assisting in detecting the target object. Nevertheless, the diversity of contextual information means that learning a robust context model requires a larger training set than learning the target object appearance model, which may not be available in practice. In this work, a novel context modeling framework is proposed without the need for any prior scene segmentation or context annotation. We formulate a polar geometric context descriptor for representing multiple types of contextual information. In order to quantify context, we propose a new maximum margin context (MMC) model to evaluate and measure the usefulness of contextual information directly and explicitly through a discriminant context inference method. Furthermore, to address the problem of context learning with limited data, we exploit the idea of transfer learning based on the observation that although two categories of objects can have very different visual appearance, there can be similarity in their context and/or the way contextual information helps to distinguish target objects from nontarget objects. To that end, two novel context transfer learning models are proposed which utilize training samples from source object classes to improve the learning of the context model for a target object class based on a joint maximum margin learning framework. Experiments are carried out on PASCAL VOC2005 and VOC2007 data sets, a luggage detection data set extracted from the i-LIDS data set, and a vehicle detection data set extracted from outdoor surveillance footage. Our results validate the effectiveness of the proposed models for quantifying and transferring contextual information, and demonstrate that they outperform related alternative context models.
Collapse
Affiliation(s)
- Wei-Shi Zheng
- School of Information Science and Technology, Sun Yat-sen University, Guangzhou, Guangdong 510006, P.R. China.
| | | | | |
Collapse
|
200
|
|