Results 11 - 20
of
59
Adaptive Vision Leveraging Digital Retinas: Extracting Meaningful Segments
- Advanced Concepts for Intelligent Vision Systems, 8th International Conference
, 2006
"... Abstract. In general, the less probable an event, the more attention we pay to it. Likewise, considering visual perception, it is interesting to regard important image features as those that most depart from ran-domness. This statistical approach has recently led to the development of adaptive and p ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
(Show Context)
Abstract. In general, the less probable an event, the more attention we pay to it. Likewise, considering visual perception, it is interesting to regard important image features as those that most depart from ran-domness. This statistical approach has recently led to the development of adaptive and parameterless algorithms for image analysis. However, they require computer-intensive statistical measurements. Digital reti-nas, with their massively parallel and collective computing capababilities, seem adapted to such computational tasks. These principles and oppor-tunities are investigated here through a case study: extracting meaningful segments from an image. 1
A contrario matching of local descriptors
"... This contribution focuses on the matching of local features between images. Given a set of query descriptors and a database of candidate descriptors, the goal is to decide which ones should be matched. This is a crucial issue, since the matching procedure is often a preliminary step for object detec ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
(Show Context)
This contribution focuses on the matching of local features between images. Given a set of query descriptors and a database of candidate descriptors, the goal is to decide which ones should be matched. This is a crucial issue, since the matching procedure is often a preliminary step for object detection, scene identification or image matching. In practice, this matching step is often reduced to a specific threshold on the Euclidean distance to the nearest neighbor. We first introduce a robust distance between descriptors, making use of the Earth Mover’s Distance (EMD). We then propose an a contrario framework for the matching procedure, which enables us to control the number of false alarms. This approach yields validation thresholds automatically adapted to the complexity of the descriptor to be matched and to the diversity and size of the database. The method makes it possible to detect multiple occurrences and to rate the validated matches according to their meaningfulness. 1.
Outdoor scene image segmentation based on background recognition and perceptual organization
, 2012
"... In this paper, we propose a novel outdoor scene image segmentation algorithm based on background recognition and perceptual organization. We recognize the background objects such as the sky, the ground, and vegetation based on the color and texture information. For the structurally challenging obje ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
In this paper, we propose a novel outdoor scene image segmentation algorithm based on background recognition and perceptual organization. We recognize the background objects such as the sky, the ground, and vegetation based on the color and texture information. For the structurally challenging objects, which usually consist of multiple constituent parts, we developed a perceptual organization model that can capture the nonaccidental structural relationships among the constituent parts of the structured objects and, hence, group them together accordingly without depending on apriori knowledge of the specific objects. Our experimental results show that our proposed method outperformed two state-of-the-art image segmentation approaches on two challenging outdoor databases (Gould data set and Berkeley segmentation data set) and achieved accurate segmentation quality on various outdoor natural scene environments.
Networks of polynomial pieces with application to the analysis of point clouds and images
, 2008
"... We consider Hölder smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges between polynomial pieces that are in ‘good continuation ’ of each other. Little known to the community, a similar construc ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
(Show Context)
We consider Hölder smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges between polynomial pieces that are in ‘good continuation ’ of each other. Little known to the community, a similar construction was used by Kolmogorov and Tikhomirov in their proof of their celebrated entropy results for Hölder classes. We show how to use such networks in the context of detecting geometric objects buried in noise to approximate the scan statistic, yielding an optimization problem akin to the Traveling Salesman. In the same context, we describe an alternative approach based on computing the longest path in the network after appropriate thresholding. For the special case of curves, we also formalize the notion of ‘good continuation’ between beamlets in any dimension, obtaining more economical piecewise linear approximation networks for curves. We include some numerical experiments illustrating the use of the beamlet network in characterizing the filamentarity content of 3D datasets, and show that even a rudimentary notion of good continuity may bring substantial improvement.
Towards Robust and Secure Watermarking ∗
"... This paper presents yet another attempt towards robust and secure watermarking. Some recent works have looked at this issue first designing new watermarking schemes with a security oriented point of view, and then evaluating their robustness compared to state-of-the-art but unsecure techniques. Our ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
(Show Context)
This paper presents yet another attempt towards robust and secure watermarking. Some recent works have looked at this issue first designing new watermarking schemes with a security oriented point of view, and then evaluating their robustness compared to state-of-the-art but unsecure techniques. Our approach is, on contrary, to start from a very robust watermarking technique and to propose changes in order to strengthen its security levels. These changes include the introduction of a security criterion, an embedding process implemented as a maximization of a robustness metric under the perceptual and the security constraints, and a watermarking detection seen as a contrario decision test. Our experimentations lead to, once again, a trade-off between security and robustness. The technique is now perfectly secure against attacks mounted during the second edition of the BOWS challenge, but the price to pay is either a lower robustness against common image processing, either a bigger probability of false alarm.
Shape recognition based on an a contrario methodology, in "Statistics and Analysis of Shapes
, 2006
"... This chapter is concerned with the problem of visual recognition of two dimensional planar shapes. Shape recognition methods usually combine three stages: feature ex-traction, matching (the important point here being the definition of a distance or dissimilarity measure between features) and decisio ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
(Show Context)
This chapter is concerned with the problem of visual recognition of two dimensional planar shapes. Shape recognition methods usually combine three stages: feature ex-traction, matching (the important point here being the definition of a distance or dissimilarity measure between features) and decision. The first two stages have been
A contrario edge detection with edgelets
"... Abstract—Edge detection remains an active problem in the image processing community, because of the high complexity of natural images. In the last decade, Desolneux et al. proposed a novel detection approach, parameter free, based on the Helmhotz principle. Applied to the edge detection field, this ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
(Show Context)
Abstract—Edge detection remains an active problem in the image processing community, because of the high complexity of natural images. In the last decade, Desolneux et al. proposed a novel detection approach, parameter free, based on the Helmhotz principle. Applied to the edge detection field, this means that observing a true edge in random and independent conditions is very unlikely, and then considered as meaningful. However, overdetection may occur, partly due to the use of a single pixelwise feature. In this paper, we propose to introduce higher level information in the a contrario framework, by computing several features along a set of connected pixels (an edgelet). Among the features, we introduce a shape prior, learned on a database. We propose to estimate online the a contrario distributions of the two other features, namely the gradient and the texture, by a Monte-Carlo simulation approach. Experiments show that our method improves the original one, by decreasing the number of non relevant edges while preserving the true ones. I.
Visual Grouping by Neural Oscillators
, 2008
"... Distributed synchronization is known to occur at several scales in the brain, and has been suggested as playing a key functional role in perceptual grouping. State-of-the-art visual grouping algorithms, however, seem to give comparatively little attention to neural synchronization analogies. Based o ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
(Show Context)
Distributed synchronization is known to occur at several scales in the brain, and has been suggested as playing a key functional role in perceptual grouping. State-of-the-art visual grouping algorithms, however, seem to give comparatively little attention to neural synchronization analogies. Based on the framework of concurrent synchronization of dynamic systems, simple networks of neural oscillators coupled with diffusive connections are proposed to solve visual grouping problems. Multi-layer algorithms and feedback mechanisms are also studied. The same algorithm is shown to achieve promising results on several classical visual grouping problems, including point clustering, contour integration and image segmentation. 1
ABSTRACT AUTOMATIC COLOR PALETTE
"... Color palettes are an important tool for color image analysis, since they are the initial point of different techniques such as quantization or indexing. This paper presents a new method for the automatic construction of a color palette, which adjusts dynamically its number of colors according to th ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
(Show Context)
Color palettes are an important tool for color image analysis, since they are the initial point of different techniques such as quantization or indexing. This paper presents a new method for the automatic construction of a color palette, which adjusts dynamically its number of colors according to the visual content of the image. The method is based on appropriately segmenting the HSI color space, which is achieved by individually partitioning the histograms associated to each color component. As a result we obtain a hierarchical color palette, which represents the color image with a reduced number of colors. 1.
Text detection in natural scenes with multilingual text
"... Detecting text in natural scenes is an impor-tant prerequisite for further text recognition and other image analysis tasks. Most of text detec-tion methods for scene images usually use a pri-ori knowledge of language to detect text. As a rule such algorithms are evaluated on datasets which contain s ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
(Show Context)
Detecting text in natural scenes is an impor-tant prerequisite for further text recognition and other image analysis tasks. Most of text detec-tion methods for scene images usually use a pri-ori knowledge of language to detect text. As a rule such algorithms are evaluated on datasets which contain scenes only with text in English. This paper discusses known text detection algo-rithms and investigates them for invariance to the language. 1