www.nosefish.de Gehe zur Webseite
Multi-Class Image Segmentation via Convex and Biconvex Optimization
This thesis is divided into two parts. Both cope with multi-class image segmentation and utilize
non-smooth optimization algorithms.
The topic of the first part, namely unsupervised segmentation, is the application of clustering
to image pixels. Therefore, we start with an introduction of the biconvex center-based clustering
algorithms c-means and fuzzy c-means, where c denotes the number of classes. We show that
fuzzy c-means can be seen as an approximation of c-means in terms of power mea
| Webseiten Geschwindigkeit: | 0.555 Sekunden |
Wichtigste Keywords
multi-class image segmentation convex optimization Biconvex image data segmentation model segment membership clustering models approach provides better segmented center based fiber reinforced silicon carbide application Universität start cope thesis part algorithm algorithms pixels smooth supervised divided parts utilize first topic unsupervised
DNS-Daten
| Host | Klasse | Typ | Ziel |
|---|---|---|---|
| nosefish.de | IN | NS | a1.wpns.hosteurope.de |
| nosefish.de | IN | NS | a1.wsns.hosteurope.de |
| nosefish.de | IN | MX | mx0.nosefish.de |
| nosefish.de | IN | SOA | a1.wpns.hosteurope.de |
| nosefish.de | IN | A | 80.237.133.25 |
| nosefish.de | IN | AAAA |
Server-Ping
PING nosefish.de (80.237.133.25) 56(84) bytes of data. 64 bytes from wp256.webpack.hosteurope.de (80.237.133.25): icmp_req=1 ttl=55 time=7.68 ms 64 bytes from wp256.webpack.hosteurope.de (80.237.133.25): icmp_req=2 ttl=55 time=7.69 ms 64 bytes from wp256.webpack.hosteurope.de (80.237.133.25): icmp_req=3 ttl=55 time=7.70 ms 64 bytes from wp256.webpack.hosteurope.de (80.237.133.25): icmp_req=4 ttl=55 time=7.68 ms --- nosefish.de ping statistics --- 4 packets transmitted, 4 received, 0% packet loss, time 600ms rtt min/avg/max/mdev = 7.685/7.693/7.701/0.007 ms
HTTP-Header
| HTTP-Tag | Wert |
|---|---|
| http_version | HTTP/1.1 |
| statuscode | 200 |
| date | Sun, 06 Jul 2014 18:07:11 GMT |
| server | Apache |
| set-cookie | PHPSESSID=bqr0345bvbojnbdgi3j518n13tjdhcvnsvtdutgl9ok287e13j51; path=/ |
| expires | Thu, 19 Nov 1981 08:52:00 GMT |
| cache-control | no-store, no-cache, must-revalidate, post-check=0, pre-check=0 |
| pragma | no-cache |
| vary | Accept-Encoding |
| content-encoding | gzip |
| strict-transport-security | max-age=31536000 |
| content-length | 5535 |
| content-type | text/html |
Meta Tags
| Meta-Tag | Wert |
|---|---|
| DC.Creator | Shafei, Behrang |
| author | Shafei, Behrang |
| citation_author | Shafei, Behrang |
| DC.title | Multi-Class Image Segmentation via Convex and Biconvex Optimization |
| citation_title | Multi-Class Image Segmentation via Convex and Biconvex Optimization |
| DC.Description | This thesis is divided into two parts. Both cope with multi-class image segmentation and utilize no... |
| description | This thesis is divided into two parts. Both cope with multi-class image segmentation and utilize no... |
| DC.subject | fiber reinforced silicon carbide |
| keywords | multi-class image segmentation, alternating optimization, total variation, graph p-Laplacian, RKHS, ... |
| DC.Identifier | https://kluedo.ub.uni-kl.de/documents/3656/thesis-b-shafei.pdf |
| citation_pdf_url | https://kluedo.ub.uni-kl.de/documents/3656/thesis-b-shafei.pdf |
| Last-Modified | Mon, 25 Nov 2013 08:30:52 +0100 |
| Content-Type | text/html; charset=UTF-8 |
| Content-Language | de-DE |
Interne Links
Externe Links
| Anchor | URL |
|---|---|
| Technische Universität Kaiserslautern | http://www.uni-kl.de/?L=0 |
| Aktuelles | http://www.uni-kl.de/aktuelles/?L=0 |
| Studium | http://www.uni-kl.de/studium/?L=0 |
| Forschung | http://www.uni-kl.de/forschung/?L=0 |
| Universität | http://www.uni-kl.de/universitaet/?L=0 |
| Schüler/innen | http://www.uni-kl.de/schuelerinnen/?L=0 |
| Teilen auf Twitter | http://twitter.com/share?url=https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/3656 |
| urn:nbn:de:hbz:386-kluedo-36564 | http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hbz:386-kluedo-36564 |
| Impressum | http://www.uni-kl.de/impressum/?L=0 |
| Datenschutzerklärung | http://www.uni-kl.de/datenschutzerklaerung/?L=0 |
