RESUMO
In this paper, we propose a new framework for hierarchical image segmentation based on iterative contraction and merging. In the proposed framework, we treat the hierarchical image segmentation problem as a sequel of optimization problems, with each optimization process being realized by a contraction-and-merging process to identify and merge the most similar data pairs at the current resolution. At the beginning, we perform pixel-based contraction and merging to quickly combine image pixels into initial region-elements with visually indistinguishable intra-region color difference. After that, we iteratively perform region-based contraction and merging to group adjacent regions into larger ones to progressively form a segmentation dendrogram for hierarchical segmentation. Comparing with the state-of-the-art techniques, the proposed algorithm can not only produce high-quality segmentation results in a more efficient way, but also keep a lot of boundary details in the segmentation results.
RESUMO
Automatically extracting foreground objects from a natural image remains a challenging task. This paper presents a learning-based hierarchical graph for unsupervised matting. The proposed hierarchical framework progressively condenses image data from pixels into cells, from cells into components, and finally from components into matting layers. First, in the proposed framework, a graph-based contraction process is proposed to condense image pixels into cells in order to reduce the computational loads in the subsequent processes. Cells are further mapped into matting components using spectral clustering over a learning based graph. The graph affinity is efficiently learnt from image patches of different resolutions and the inclusion of multiscale information can effectively improve the performance of spectral clustering. In the final stage of the hierarchical scheme, we propose a multilayer foreground estimation process to assemble matting components into a set of matting layers. Unlike conventional approaches, which typically address binary foreground/background partitioning, the proposed method provides a set of multilayer interpretations for unsupervised matting. Experimental results show that the proposed approach can generate more consistent and accurate results as compared with state-of-the-art techniques.
Assuntos
Processamento de Imagem Assistida por Computador/métodos , Algoritmos , Animais , Análise por Conglomerados , Humanos , Análise EspectralRESUMO
This paper presents a new approach to represent an image by "verge points," which are defined as high-curvature points on the image surface. This representation offers a compact and reversible way to preserve the essence of the original image. Various applications, such as compression, edge detection, image enhancement, and image editing, can be achieved based on this representation. In this paper, the whole procedure for verge point representation is presented. Based on these verge points, image reconstruction can be easily achieved via iterative linear interpolation. These extracted verge points with compatible properties are further linked into verge curves to offer more compact representation. Progressive representation is also developed based on a multiscale extraction scheme. Some potential applications are then presented to demonstrate the versatility of this representation.