Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

ISMM
2009
Springer

favoriteEmaildiscussreport

119views Image Processing» more ISMM 2009»

Fast Implementation of the Ultimate Opening

13 years 11 months ago

Fast Implementation of the Ultimate Opening

Download cmm.ensmp.fr

Abstract. We present an eﬃcient implementation of the ultimate attribute opening operator. In this implementation, the ultimate opening is computed by processing the image maxtree representation. To show the eﬃciency of this implementation, execution time is given for various images at diﬀerent scales. A quasi-linear dependency with the number of pixels is observed. This new implementation makes the ultimate attribute opening usable in real time. Moreover, the use of the maxtree allows us to process speciﬁc zones of the image independently, with a negligible additional computation time.

Jonathan Fabrizio, Beatriz Marcotegui

Real-time Traffic

Attribute Opening Operator | Image Processing | ISMM 2009 | Ultimate Attribute | Ultimate Opening |

claim paper

Related Content

» GDRouter interleaved global routing and detailed routing for ultimate routability

» Webbased technologies reaching their ultimate potential on restricted budgets

» Building a fast virtualized data plane with programmable hardware

» OpenID 20 a platform for usercentric identity management

» Management of Advanced Services in H323 Internet Protocol Telephony

» Implementation of ARPpath low latency bridges in Linux and OpenFlowNetFPGA

» Anatomically correct testbed hand control Muscle and joint control strategies

» Ambulant a fast multiplatform open source SMIL player

» A Deterministic Subexponential Algorithm for Solving Parity Games

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	ISMM
Authors	Jonathan Fabrizio, Beatriz Marcotegui

Comments (0)