• Documents
  • Authors
  • Tables

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 2,129
Next 10 →

Contour Detection and Hierarchical Image Segmentation

by Pablo Arbeláez, Michael Maire, Charless Fowlkes, Jitendra Malik - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 2010
"... This paper investigates two fundamental problems in computer vision: contour detection and image segmentation. We present state-of-the-art algorithms for both of these tasks. Our contour detector combines multiple local cues into a globalization framework based on spectral clustering. Our segmentati ..."
Abstract - Cited by 389 (24 self) - Add to MetaCart
segmentation algorithm consists of generic machinery for transforming the output of any contour detector into a hierarchical region tree. In this manner, we reduce the problem of image segmentation to that of contour detection. Extensive experimental evaluation demonstrates that both our contour detection

Matching words and pictures

by Kobus Barnard, Pinar Duygulu, David Forsyth, Nando De Freitas, David M. Blei, Michael I. Jordan - JOURNAL OF MACHINE LEARNING RESEARCH , 2003
"... We present a new approach for modeling multi-modal data sets, focusing on the specific case of segmented images with associated text. Learning the joint distribution of image regions and words has many applications. We consider in detail predicting words associated with whole images (auto-annotation ..."
Abstract - Cited by 665 (40 self) - Add to MetaCart
We present a new approach for modeling multi-modal data sets, focusing on the specific case of segmented images with associated text. Learning the joint distribution of image regions and words has many applications. We consider in detail predicting words associated with whole images (auto

An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation

by Zhenyu Wu, Richard Leahy - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 1993
"... A novel graph theoretic approach for data clustering is presented and its application to the image segmentation problem is demonstrated. The data to be clustered are represented by an undirected adjacency graph G with arc capacities assigned to reflect the similarity between the linked vertices. Cl ..."
Abstract - Cited by 360 (0 self) - Add to MetaCart
A novel graph theoretic approach for data clustering is presented and its application to the image segmentation problem is demonstrated. The data to be clustered are represented by an undirected adjacency graph G with arc capacities assigned to reflect the similarity between the linked vertices

Semantic Texton Forests for Image Categorization and Segmentation

by Jamie Shotton, Matthew Johnson, Roberto Cipolla
"... We propose semantic texton forests, efficient and powerful new low-level features. These are ensembles of decision trees that act directly on image pixels, and therefore do not need the expensive computation of filter-bank responses or local descriptors. They are extremely fast to both train and tes ..."
Abstract - Cited by 304 (13 self) - Add to MetaCart
and test, especially compared with k-means clustering and nearest-neighbor assignment of feature descriptors. The nodes in the trees provide (i) an implicit hierarchical clustering into semantic textons, and (ii) an explicit local classification estimate. Our second contribution, the bag of semantic

Graph Cuts and Efficient N-D Image Segmentation

by Yuri Boykov, Gareth Funka-Lea , 2006
"... Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of graph-cuts: segmentation of objects in image data. Despite its simplicity, this application epitomizes the best features ..."
Abstract - Cited by 307 (7 self) - Add to MetaCart
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of graph-cuts: segmentation of objects in image data. Despite its simplicity, this application epitomizes the best features

Learning by Watching: Extracting Reusable Task Knowledge from Visual Observation of Human Performance

by Yasuo Kuniyoshi, Masayuki Inaba, Hirochika Inoue - IEEE Transactions on Robotics and Automation , 1994
"... A novel task instruction method for future intelligent robots is presented. In our method, a robot learns reusable task plans by watching a human perform assembly tasks. Functional units and working algorithms for visual recognition and analysis of human action sequences are presented. The overall s ..."
Abstract - Cited by 298 (6 self) - Add to MetaCart
system is model based and integrated at the symbolic level. Temporal segmentation of a continuous task performance into meaningful units and identification of each operation is processed in real time by concurrent recognition processes under active attention control. Dependency among assembly operations

Associative hierarchical CRFs for object class image segmentation

by Chris Russell, Philip H. S. Torr, Pushmeet Kohli - in Proc. ICCV , 2009
"... Most methods for object class segmentation are formulated as a labelling problem over a single choice of quantisation of an image space- pixels, segments or group of segments. It is well known that each quantisation has its fair share of pros and cons; and the existence of a common optimal quantisat ..."
Abstract - Cited by 172 (25 self) - Add to MetaCart
Most methods for object class segmentation are formulated as a labelling problem over a single choice of quantisation of an image space- pixels, segments or group of segments. It is well known that each quantisation has its fair share of pros and cons; and the existence of a common optimal

Speaker, Environment And Channel Change Detection And Clustering Via The Bayesian Information Criterion

by Scott Shaobing Chen, P. S. Gopalakrishnan , 1998
"... In this paper, we are interested in detecting changes in speaker identity, environmental condition and channel condition; we call this the problem of acoustic change detection. The input audio stream can be modeled as a Gaussian process in the cepstral space. We present a maximum likelihood approach ..."
Abstract - Cited by 272 (2 self) - Add to MetaCart
approach to detect turns of a Gaussian process; the decision of a turn is based on the Bayesian Information Criterion (BIC), a model selection criterion well-known in the statistics literature. The BIC criterion can also be applied as a termination criterion in hierarchical methods for clustering of audio

Incorporating Contextual Information in Recommender Systems Using a Multidimensional Approach

by Gediminas Adomavicius, Ramesh Sankaranarayanan, Shahana Sen, Alexander Tuzhilin - ACM Transactions on Information Systems , 2005
"... The paper presents a multidimensional (MD) approach to recommender systems that can provide recommendations based on additional contextual information besides the typical information on users and items used in most of the current recommender systems. This approach supports multiple dimensions, exten ..."
Abstract - Cited by 236 (9 self) - Add to MetaCart
, extensive profiling, and hierarchical aggregation of recommendations. The paper also presents a multidimensional rating estimation method capable of selecting two-dimensional segments of ratings pertinent to the recommendation context and applying standard collaborative filtering or other traditional two

Beyond the session timeout: automatic hierarchical segmentation of search topics in query logs

by Rosie Jones, Kristina Lisa Klinkner - In Conference on Information and Knowledge Management (CIKM , 2008
"... Most analysis of web search relevance and performance takes a single query as the unit of search engine interaction. When studies attempt to group queries together by task or session, a timeout is typically used to identify the boundary. However, users query search engines in order to accomplish tas ..."
Abstract - Cited by 147 (1 self) - Add to MetaCart
or addressed automatic identification of interleaved and hierarchically organized search tasks. We propose and evaluate a method for the automated segmentation of users’ query streams into hierarchical units. Our classifiers can improve on timeout segmentation, as well as other previously published approaches
Next 10 →
Results 1 - 10 of 2,129
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University