Results 1 - 10
of
10,328
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
” segments may consist of several isolated parts. Some experimental results are presented in the context of photo/video editing and medical image segmentation. We also demonstrate an interesting Gestalt example. A fast implementation of our segmentation method is possible via a new max-flow algorithm in [2].
Combined Object Categorization and Segmentation With An Implicit Shape Model
- In ECCV workshop on statistical learning in computer vision
, 2004
"... We present a method for object categorization in real-world scenes. Following a common consensus in the field, we do not assume that a figure-ground segmentation is available prior to recognition. However, in contrast to most standard approaches for object class recognition, our approach automatical ..."
Abstract
-
Cited by 406 (10 self)
- Add to MetaCart
automatically segments the object as a result of the categorization. This combination of recognition and segmentation into one process is made possible by our use of an Implicit Shape Model, which integrates both capabilities into a common probabilistic framework. In addition to the recognition and segmentation
Segmentation using eigenvectors: A unifying view
- In ICCV
, 1999
"... Automatic grouping and segmentation of images remains a challenging problem in computer vision. Recently, a number of authors have demonstrated good performance on this task using methods that are based on eigenvectors of the a nity matrix. These approaches are extremely attractive in that they are ..."
Abstract
-
Cited by 380 (1 self)
- Add to MetaCart
Automatic grouping and segmentation of images remains a challenging problem in computer vision. Recently, a number of authors have demonstrated good performance on this task using methods that are based on eigenvectors of the a nity matrix. These approaches are extremely attractive
A survey of methods and strategies in character segmentation
- IEEE TRANSACTION ON PAMI
, 1996
"... Character segmentation has long been a critical area of the OCR process. The higher recognition rates for isolated characters vs. those obtained for words and connected character strings well illustrate this fact. A good part of recent progress in reading unconstrained printed and written text may b ..."
Abstract
-
Cited by 212 (1 self)
- Add to MetaCart
classification to select from the range of admissible segmentation possibilities offered by these subimages. Finally, holistic approaches that avoid segmentation by recognizing entire character strings as units are described.
Interactive Control of Avatars Animated with Human Motion Data
, 2002
"... Real-time control of three-dimensional avatars is an important problem in the context of computer games and virtual environments. Avatar animation and control is difficult, however, because a large repertoire of avatar behaviors must be made available, and the user must be able to select from this s ..."
Abstract
-
Cited by 369 (38 self)
- Add to MetaCart
this set of behaviors, possibly with a low-dimensional input device. One appealing approach to obtaining a rich set of avatar behaviors is to collect an extended, unlabeled sequence of motion data appropriate to the application. In this paper, we show that such a motion database can be preprocessed
Unsupervised Segmentation of Color-Texture Regions in Images and Video
, 2001
"... A new method for unsupervised segmentation of color-texture regions in images and video is presented. This method, which we refer to as JSEG, consists of two independent steps: color quantization and spatial segmentation. In the first step, colors in the image are quantized to several representative ..."
Abstract
-
Cited by 318 (3 self)
- Add to MetaCart
the class-map is proposed. Applying the criterion to local windows in the class-map results in the "Jimage, " in which high and low values correspond to possible boundaries and interiors of colortexture regions. A region growing method is then used to segment the image based on the multiscale J
Graph Cuts and Efficient N-D Image Segmentation
, 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
Videoconferencing on the Internet
- IEEE/ACM Trans. on Networking
, 1996
"... This paper describes the INRIA Videoconferencing System (IVS), a low bandwidth tool for real-time video between workstations on the Internet using UDP datagrams and the IP multicast extension. The video coder-decoder (codec) is a software implementation of the UIT-T recommendation H.261 originally d ..."
Abstract
-
Cited by 337 (2 self)
- Add to MetaCart
. This work shows that it is possible to maintain videoconferences with reasonable quality across packet-switched networks without requiring special support from the network such as resource reservation or admission control.
Dynamics of mitochondrial DNA evolution in animals: amplification and sequencing with conserved primers.
- Proc. Natl. Acad. Sci. USA
, 1989
"... ABSTRACT With a standard set of primers directed toward conserved regions, we have used the polymerase chain reaction to amplify homologous segments of mtDNA from more than 100 animal species, including mammals, birds, amphibians, fishes, and some invertebrates. Amplification and direct sequencing ..."
Abstract
-
Cited by 310 (3 self)
- Add to MetaCart
ABSTRACT With a standard set of primers directed toward conserved regions, we have used the polymerase chain reaction to amplify homologous segments of mtDNA from more than 100 animal species, including mammals, birds, amphibians, fishes, and some invertebrates. Amplification and direct sequencing
Membrane protein structure prediction. Hydrophobicity analysis and the positive-inside rule
- J. Mol. Biol
, 1992
"... A new strategy for predicting the topology of bacterial inner membrane proteins is proposed on the basis of hydrophobicity analysis, automatic generation of a set of possible topologies and ranking of these according to the positive-inside rule. A straightforward implementation with no attempts at o ..."
Abstract
-
Cited by 275 (4 self)
- Add to MetaCart
A new strategy for predicting the topology of bacterial inner membrane proteins is proposed on the basis of hydrophobicity analysis, automatic generation of a set of possible topologies and ranking of these according to the positive-inside rule. A straightforward implementation with no attempts
Results 1 - 10
of
10,328