UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Scalable image segmentation via decoupled sub-graph compression

dc.contributor.authorMedeiros, Rafael Sachett
dc.contributor.authorWong, Alexander
dc.contributor.authorScharcanski, Jacob
dc.date.accessioned2018-03-21T13:41:59Z
dc.date.available2018-03-21T13:41:59Z
dc.date.issued2018-06-01
dc.descriptionThe final publication is available at Elsevier via http://dx.doi.org/10.1016/j.patcog.2017.11.028 © 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0/en
dc.description.abstractDealing with large images is an on-going challenge in image segmentation, where many of the current methods run into computational and/or memory complexity issues. This work presents a novel decoupled sub-graph compression (DSC) approach for efficient and scalable image segmentation. In DSC, the image is modeled as a region graph, which is then decoupled into small sub-graphs. The sub-graphs undergo a compression process, which simplifies the graph, reducing the number of vertices and edges, while keeping the overall graph structure. Finally, the compressed sub-graphs are re-coupled and re-compressed to form a final compressed graph representing the final image segmentation. Experimental results based on a dataset of high resolution images (1000 × 1500) show that the DSC method achieves better segmentation performance when compared to state-of-the-art segmentation methods (PRI=0.84 and F=0.61), while having significantly lower computational and memory complexity.en
dc.identifier.urihttp://dx.doi.org/10.1016/j.patcog.2017.11.028
dc.identifier.urihttp://hdl.handle.net/10012/13051
dc.language.isoenen
dc.publisherElsevieren
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectDecouplingen
dc.subjectGraph compressionen
dc.subjectScalabilityen
dc.subjectSegmentationen
dc.titleScalable image segmentation via decoupled sub-graph compressionen
dc.typeArticleen
dcterms.bibliographicCitationMedeiros, R. S., Wong, A., & Scharcanski, J. (2018). Scalable image segmentation via decoupled sub-graph compression. Pattern Recognition, 78, 228–241. https://doi.org/10.1016/j.patcog.2017.11.028en
uws.contributor.affiliation1Faculty of Engineeringen
uws.contributor.affiliation2Systems Design Engineeringen
uws.peerReviewStatusRevieweden
uws.scholarLevelFacultyen
uws.typeOfResourceTexten
uws.typeOfResourceTexten

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
1-s2.0-S003132031730482X-main.pdf
Size:
34.84 MB
Format:
Adobe Portable Document Format
Description:
Post-print
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
4.46 KB
Format:
Plain Text
Description: