{"title":"基于集成聚类和图割优化方法的低景深图像兴趣区域自动分割","authors":"Gholamreza Rafiee, S. Dlay, W. L. Woo","doi":"10.1109/ISM.2012.39","DOIUrl":null,"url":null,"abstract":"Automatic segmentation of images with low depth of field (DOF) plays an important role in content-based multimedia applications. The proposed approach aims to separate the important objects (i.e., interest regions) of a given image from its defocused background in two stages. In stage one, image blocks are classified into object and background blocks using a novel cluster ensemble algorithm. By indicating the certain pixels (seeds) of the object and background blocks, a hard constraint is provided for the next stage of the approach. In stage two, a minimal graph cut is constructed using object and background seeds, which is based on the max-flow method. Experimental results for a wide range of busy-texture (i.e., noisy) and smooth regions demonstrate that the proposed approach provides better segmentation performance at higher speed compared with the state-of-the-art approaches.","PeriodicalId":282528,"journal":{"name":"2012 IEEE International Symposium on Multimedia","volume":"492 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Automatic Segmentation of Interest Regions in Low Depth of Field Images Using Ensemble Clustering and Graph Cut Optimization Approaches\",\"authors\":\"Gholamreza Rafiee, S. Dlay, W. L. Woo\",\"doi\":\"10.1109/ISM.2012.39\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Automatic segmentation of images with low depth of field (DOF) plays an important role in content-based multimedia applications. The proposed approach aims to separate the important objects (i.e., interest regions) of a given image from its defocused background in two stages. In stage one, image blocks are classified into object and background blocks using a novel cluster ensemble algorithm. By indicating the certain pixels (seeds) of the object and background blocks, a hard constraint is provided for the next stage of the approach. In stage two, a minimal graph cut is constructed using object and background seeds, which is based on the max-flow method. Experimental results for a wide range of busy-texture (i.e., noisy) and smooth regions demonstrate that the proposed approach provides better segmentation performance at higher speed compared with the state-of-the-art approaches.\",\"PeriodicalId\":282528,\"journal\":{\"name\":\"2012 IEEE International Symposium on Multimedia\",\"volume\":\"492 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-12-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE International Symposium on Multimedia\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISM.2012.39\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE International Symposium on Multimedia","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISM.2012.39","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Automatic Segmentation of Interest Regions in Low Depth of Field Images Using Ensemble Clustering and Graph Cut Optimization Approaches
Automatic segmentation of images with low depth of field (DOF) plays an important role in content-based multimedia applications. The proposed approach aims to separate the important objects (i.e., interest regions) of a given image from its defocused background in two stages. In stage one, image blocks are classified into object and background blocks using a novel cluster ensemble algorithm. By indicating the certain pixels (seeds) of the object and background blocks, a hard constraint is provided for the next stage of the approach. In stage two, a minimal graph cut is constructed using object and background seeds, which is based on the max-flow method. Experimental results for a wide range of busy-texture (i.e., noisy) and smooth regions demonstrate that the proposed approach provides better segmentation performance at higher speed compared with the state-of-the-art approaches.