Object recognition from images is one of the essential problems in automatic imageprocessing. In this paper we focus specifically on nearest neighbor methods, which are widely used in many practical applications, not...
详细信息
In this paper, we establish a correspondence between the incremental algorithm for computing AT-models [8,9] and the one for computing persistent homology [6,14,15]. We also present a decremental algorithm for computi...
详细信息
A major obstacle to the broader use of 3D object reconstruction and modeling is the extent of manual intervention needed. Such interventions are currently extensive and exist throughout every phase of a 3D reconstruct...
详细信息
We study the task of interactive semantic labeling of a segmentation hierarchy. To this end we propose a framework interleaving two components: an automatic labeling step, based on a Conditional Random Field whose dep...
详细信息
This paper presents a visual surveillance system for the automatic scene interpretation of airport aprons. The system comprises two modules - Scene Tracking and Scene Understanding. The Scene Tracking module, comprisi...
详细信息
The activation of ancient vessel-fragments is a time consuming but important task for archaeologists. The basis for classification and reconstruction is the profile which is the cross-section of the fragment in the di...
We present a method that partitions a single image into two layers, requiring that one layer has similar properties in terms of pixel colour variation to a provided template patch. First the paper provides a new view ...
详细信息
ISBN:
(纸本)1904410146
We present a method that partitions a single image into two layers, requiring that one layer has similar properties in terms of pixel colour variation to a provided template patch. First the paper provides a new view on defining a similarity function for a pixel with its small neighbourhood to be part of the texture described by the template patch. This results in better description of pixels near the texture boundary. Second, it is shown how the Maximally Stable Extremal Regions (MSERs), originally designed for wide baseline stereo matching, can be used to locally merge pixels having the same intensity and thus reduce the dimension of the graph representing the image. The MSERs help in texture description and yield significant reduction of memory and computation time. Finally the graph is fed into the ***/*** algorithm to cut the graph into two parts. Performance of the method is presented on some images from the Berkeley database. Finally, restrictions in using the method are discussed.
The efficiency of an image compression technique relies on the capability of finding sparse M-terms for best approximation with reduced visually significant quality loss. By "visually significant" it is mean...
详细信息
Graph pyramids allow to combine pruning of skeletons with a concept known from the representation of line images, i.e. generalization of paths without branchings by single edges. Pruning will enable further generaliza...
详细信息
The use of plane graphs for the description of image structure and shape representation poses two problems : (1) how to obtain the set of vertices, the set of edges and the incidence relation of the graph, and (2) how...
详细信息
暂无评论