Results 271 to 280 of about 1,465,159 (304)

Grid of Segment Trees for Packet Classification

2010 24th IEEE International Conference on Advanced Information Networking and Applications, 2010
Packet classification problem has received much attention and continued to be an important topic in recent years. In packet classification problem, each incoming packet should be classified into flows according to a set of pre-defined rules.
Yeim-Kuan Chang, Yung-Chieh Lin, Chen-Yu Lin   +2 more
openaire   +1 more source

Minimum Spanning Tree of Line Segments

2018
In this article, we study a variant of the geometric minimum spanning tree (MST) problem. Given a set \(\mathcal{S}\) of n disjoint line segments in Open image in new window , we need to find a tree spanning one endpoint from each of the segments in \(\mathcal{S}\).
Sanjana Dey, Ramesh K. Jallu, Subhas C. Nandy   +2 more
openaire   +2 more sources

Feature tree clustering for image segmentation

2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236), 2002
A new image segmentation method using a feature tree is proposed in this paper. The feature tree reflects the feature of an image. The proposed method is composed of two processes: (I) learning process and (II) clustering process. In the learning process, many efficient feature trees are made that construct an integrated tree.
Suguru Inoue, Masafumi Hagiwara
openaire   +1 more source

Dynamic Segment Trees for Ranges and Prefixes

IEEE Transactions on Computers, 2007
In this paper, we develop a segment tree data structure for solving dynamic table lookup problems. The proposed dynamic segment tree (DST) uses all of the distinct end points of ranges as the keys based on a new range end point scheme. The new end point scheme generates fewer end points than the traditional end point scheme.
Yeim-Kuan Chang, Yung-Chieh Lin
openaire   +2 more sources

Rectilinear line segment intersection, layered segment trees, and dynamization

Journal of Algorithms, 1982
Abstract The aim of the present paper is to provide an efficient solution to the following problem: “Given a family of n rectilinear line segments in two-space report all intersections in the family with a query consisting of an arbitrary rectilinear line segment.” We provide an algorithm which takes O ( n log 2 n ) preprocessing time, o ( n log
Vijay K. Vaishnavi, Derick Wood
openaire   +1 more source

Preferential Image Segmentation Using Trees of Shapes

IEEE Transactions on Image Processing, 2009
A novel preferential image segmentation method is proposed that performs image segmentation and object recognition using mathematical morphologies. The method preferentially segments objects that have intensities and boundaries similar to those of objects in a database of prior images. A tree of shapes is utilized to represent the content distributions
Yongsheng Pan, J. Douglas Birdwell, Seddik M. Djouadi   +2 more
openaire   +3 more sources

Vascular Active Contour for Vessel Tree Segmentation

IEEE Transactions on Biomedical Engineering, 2011
In this paper, a novel active contour model is proposed for vessel tree segmentation. First, we introduce a region competition-based active contour model exploiting the gaussian mixture model, which mainly segments thick vessels. Second, we define a vascular vector field to evolve the active contour along its center line into the thin and weak vessels.
Shang, Yanfeng, Rudi, Deklerck, Nyssen, Edgard, Markova, Aneta, Johan, De Mey, Yang, X., Sun, K.   +6 more
openaire   +4 more sources

K-Smallest Spanning Tree Segmentations

2013
Real-world images often admit many different segmentations that have nearly the same quality according to the underlying energy function. The diversity of these solutions may be a powerful uncertainty indicator. We provide the crucial prerequisite in the context of seeded segmentation with minimum spanning trees (i.e.
Christoph N. Straehle, Sven Peter, Ullrich Köthe, Fred A. Hamprecht   +3 more
openaire   +2 more sources

A decision tree algorithm with segmentation

Proceedings IECON '91: 1991 International Conference on Industrial Electronics, Control and Instrumentation, 2002
A novel version of the ID3 induction's decision tree algorithm is presented. The aim of this version is to work with feature values which have a measuring process with noise. The induction input is a table with feature values where objects are labeled.
F. Moura-Pires, A. Steiger-Garcao
openaire   +1 more source

Segmenting Strings Homogeneously Via Trees

2007
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. For binary strings we develop a linear-time algorithm for any k. Key to efficiency is a special-purpose data structure, called W-tree, which reflects relations between ...
openaire   +2 more sources