Sign in
Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(5)
Data Structure
Image Analysis
Level Set
Linear Time
Target Selection
Subscribe
Academic
Publications
Selection of Relevant Nodes from Component-Trees in Linear Time
Selection of Relevant Nodes from Component-Trees in Linear Time,10.1007/978-3-642-19867-0_38,Nicolas Passat,Benoît Naegel
Edit
Selection of Relevant Nodes from Component-Trees in Linear Time
(
Citations: 1
)
BibTex
|
RIS
|
RefWorks
Download
Nicolas Passat
,
Benoît Naegel
Component-trees associate to a discrete grey-level image a descriptive
data structure
induced by the inclusion relation between the binary components obtained at successive level-sets. This article presents a method to extract a subset of the component-tree of an image enabling to fit at best a given binary target selected beforehand in the image. A proof of the algorithmic efficiency of this method is proposed. Application examples related to the extraction of drop caps from ancient documents emphasise the usefulness of this technique in the context of assisted segmentation.
Conference:
Discrete Geometry for Computer Imagery - DGCI
, pp. 453-464, 2011
DOI:
10.1007/978-3-642-19867-0_38
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.springerlink.com
)
(
www.springerlink.com
)
(
www.informatik.uni-trier.de
)
(
dx.doi.org
)
More »
Citation Context
(1)
...In [
8
], some of the authors have proved that K α = F α (E), where F α is recursively defined, for all N ∈K ,b y...
Alice Dufour
,
et al.
Interactive 3D brain vessel segmentation from an example
References
(10)
Attribute Openings, Thinnings, and Granulometries
(
Citations: 140
)
Edmond J. Breen
,
Ronald Jones
Journal:
Computer Vision and Image Understanding - CVIU
, vol. 64, no. 3, pp. 377-389, 1996
Connected Filtering and Segmentation Using Component Trees
(
Citations: 51
)
Ronald Jones
Journal:
Computer Vision and Image Understanding - CVIU
, vol. 75, no. 3, pp. 215-228, 1999
Efficient Algorithms to Implement the Confinement Tree
(
Citations: 16
)
Julian Mattes
,
Jacques Demongeot
Conference:
Discrete Geometry for Computer Imagery - DGCI
, pp. 392-405, 2000
Tree Representation for Image Matching and Object Recognition
(
Citations: 24
)
Julian Mattes
,
Mathieu Richard
,
Jacques Demongeot
Conference:
Discrete Geometry for Computer Imagery - DGCI
, pp. 298-312, 1999
A comparative evaluation of interactive segmentation algorithms
(
Citations: 11
)
Kevin McGuinness
,
Noel E. O’Connor
Journal:
Pattern Recognition - PR
, vol. 43, no. 2, pp. 434-444, 2010
Sort by:
Citations
(1)
Interactive 3D brain vessel segmentation from an example
Alice Dufour
,
Nicolas Passat
,
Benoit Naegel
,
Joseph Baruthio
Conference:
IEEE International Symposium on Biomedical Imaging
, pp. 1121-1124, 2011