Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,926
Interactive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in N-D Images
, 2001
"... In this paper we describe a new technique for general purpose interactive segmentation of N-dimensional images. The user marks certain pixels as “object” or “background” to provide hard constraints for segmentation. Additional soft constraints incorporate both boundary and region information. Graph ..."
Abstract
-
Cited by 1010 (20 self)
- Add to MetaCart
In this paper we describe a new technique for general purpose interactive segmentation of N-dimensional images. The user marks certain pixels as “object” or “background” to provide hard constraints for segmentation. Additional soft constraints incorporate both boundary and region information. Graph
Exploring features for identifying edited regions in disfluent sentences
- In Proceedings of the International Workshop on Parsing Techniques
, 2005
"... This paper describes our effort on the task of edited region identification for parsing disfluent sentences in the Switchboard corpus. We focus our attention on exploring feature spaces and selecting good features and start with analyzing the distributions of the edited regions and their components ..."
Abstract
-
Cited by 7 (4 self)
- Add to MetaCart
This paper describes our effort on the task of edited region identification for parsing disfluent sentences in the Switchboard corpus. We focus our attention on exploring feature spaces and selecting good features and start with analyzing the distributions of the edited regions and their components
Micro-foundations of urban agglomeration economies
- In Vernon Henderson and Jacques-François Thisse (eds.) Handbook of Regional and Urban Economics
, 2004
"... Abstract: This handbook chapter studies the theoretical microfoundations of urban agglomeration economies. We distinguish three types of micro-foundations, based on sharing, matching, and learning mechanisms. For each of these three categories, we develop one or more core models in detail and discus ..."
Abstract
-
Cited by 318 (32 self)
- Add to MetaCart
in the Handbook of Regional and Urban Economics, Volume 4, edited by J. Vernon Henderson and Jacques-François Thisse, to be published by North-Holland. We are grateful to the editors, Masa Fujita, Mike Peters, and the participants at the the 2002 narsa meetings for comments and suggestions.
Object categorization by learned universal visual dictionary
- IN ICCV
, 2005
"... This paper presents a new algorithm for the automatic recognition of object classes from images (categorization). Compact and yet discriminative appearance-based object class models are automatically learned from a set of training images. The method is simple and extremely fast, making it suitable ..."
Abstract
-
Cited by 302 (8 self)
- Add to MetaCart
it suitable for many applications such as semantic image retrieval, web search, and interactive image editing. It classifies a region according to the proportions of different visual words (clusters in feature space). The specific visual words and the typical proportions in each object are learned from a
Laplacian Surface Editing
, 2004
"... Surface editing operations commonly require geometric details of the surface to be preserved as much as possible. We argue that geometric detail is an intrinsic property of a surface and that, consequently, surface editing is best performed by operating over an intrinsic surface representation. We p ..."
Abstract
-
Cited by 235 (27 self)
- Add to MetaCart
editing operations: interactive free-form deformation in a region of interest based on the transformation of a handle, transfer and mixing of geometric details between two surfaces, and transplanting of a partial surface mesh onto another surface. The main computation involved in all operations
Image and 3D-object editing with precisely specified editing regions
- VISION, MODELING AND VISUALISATION
, 2003
"... In this paper we present a new approach to the editing of polygons, images and triangulated surface meshes featuring the exact specification of the area that is being edited, the area that remains unchanged and an area that is transformed rigidly. This allows intuitive editing of arbitrary triangle ..."
Abstract
-
Cited by 6 (1 self)
- Add to MetaCart
In this paper we present a new approach to the editing of polygons, images and triangulated surface meshes featuring the exact specification of the area that is being edited, the area that remains unchanged and an area that is transformed rigidly. This allows intuitive editing of arbitrary triangle
Interactive image segmentation using an adaptive GMMRF model
- in ECCV
, 2004
"... Abstract. The problem of interactive foreground/background segmentation in still images is of great practical importance in image editing. The state of the art in interactive segmentation is probably represented by the graph cut algorithm of Boykov and Jolly (ICCV 2001). Its underlying model uses bo ..."
Abstract
-
Cited by 217 (29 self)
- Add to MetaCart
Abstract. The problem of interactive foreground/background segmentation in still images is of great practical importance in image editing. The state of the art in interactive segmentation is probably represented by the graph cut algorithm of Boykov and Jolly (ICCV 2001). Its underlying model uses
Consed: a graphical tool for sequence finishing
- Genome Res
, 1998
"... Sequencing of large clones or small genomes is generally done by the shotgun approach Although complete automation of data processing in shotgun sequencing is clearly desirable and may be feasible in the near future, at present finishing still requires extensive human intervention. This is customa ..."
Abstract
-
Cited by 207 (0 self)
- Add to MetaCart
) and other information that may be useful in evaluating the base calls and assembly. It should also facilitate the detection of regions where additional data are needed, help in determining reagents (e.g., sequencing primers and templates) needed to obtain these data, and allow editing to correct errors. A
A.Blake. Cosegmentation of image pairs by histogram matching - incorporating a global constraint into MRFs
- In CVPR
, 2006
"... We introduce the term cosegmentation which denotes the task of segmenting simultaneously the common parts of an image pair. A generative model for cosegmentation is presented. Inference in the model leads to minimizing an energy with an MRF term encoding spatial coherency and a global constraint whi ..."
Abstract
-
Cited by 176 (3 self)
- Add to MetaCart
which attempts to match the appearance histograms of the common parts. This energy has not been proposed previously and its optimization is challenging and NP-hard. For this problem a novel optimization scheme which we call trust region graph cuts is presented. We demonstrate that this framework has
Results 1 - 10
of
1,926
