| 1. |
- Björkman, Mårten, et al.
(författare)
-
Vision in the real world : Finding, attending and recognizing objects
- 2006
-
Ingår i: International journal of imaging systems and technology (Print). - : Wiley. - 0899-9457 .- 1098-1098. ; 16:5, s. 189-208
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper we discuss the notion of a seeing system that uses vision to interact with its environment. The requirements on such a system depend on the tasks it is involved in and should be evaluated with these in mind. Here we consider the task of finding and recognizing objects in the real world. After a discussion of the needed functionalities and issues about the design we present an integrated real-time vision system capable of finding, attending and recognizing objects in real settings. The system is based on a dual set of cameras, a wide field set for attention and a foveal one for recognition. The continuously running attentional process uses top-down object characteristics in terms of hue and 3D size. Recognition is performed with objects of interest foveated and segmented from its background. We describe the system structure as well as the different components in detail and present experimental evaluations of its overall performance.
|
|
| 2. |
- Carmona, Pedro Latorre, et al.
(författare)
-
Performance evaluation of dimensionality reduction techniques for multispectral images
- 2007
-
Ingår i: International journal of imaging systems and technology (Print). - : Institutionen för teknik och naturvetenskap. - 0899-9457 .- 1098-1098. ; 17:3, s. 202-217
-
Tidskriftsartikel (refereegranskat)abstract
- We consider several collections of multispectral color signals and describe how linear and non-linear methods can be used to investigate their internal structure. We use databases consisting of blackbody radiators, approximated and measured daylight spectra, multispectral images of indoor and outdoor scenes under different illumination conditions and numerically computed color signals. We apply Principal Components Analysis, group-theoretical methods and three manifold learning methods: Laplacian Eigenmaps, ISOMAP and Conformal Component Analysis. Identification of low-dimensional structures in these databases is important for analysis, model building and compression and we compare the results obtained by applying the algorithms to the different databases.
|
|
| 3. |
- Danafar, Somayeh, et al.
(författare)
-
A method for eye detection based on SVD transforms
- 2006
-
Ingår i: International journal of imaging systems and technology (Print). - : Wiley. - 0899-9457 .- 1098-1098. ; 16:5, s. 222-229
-
Tidskriftsartikel (refereegranskat)abstract
- A set of transforms (SVD transforms) were introduced in (Shahshahani and Tavakoli Targhi) for understanding images. These transforms have been applied to some problems in computer vision including segmentation, detection of objects in a texture environment, classification of textures, detection of cracks or other imperfections, etc, This technique is shown to be applicable to determination of the location of eyes in a facial image. This method makes no use of color cues, prior geometric knowledge or other assumptions and does not require training. It is also insensitive to local perturbations in lighting, change of orientation and pose, scaling, and complexity of the background including indoor and outdoor environments. The method can be used for eye tracking and has applications to face recognition. It has also been used in animal eye detection and differentiation.
|
|
| 4. |
- Nagy, Benedek, et al.
(författare)
-
Neighborhood Sequences in the Diamond Grid : Algorithms with Two and Three Neighbors
- 2009
-
Ingår i: International journal of imaging systems and technology (Print). - : Wiley Periodicals, Inc.. - 0899-9457 .- 1098-1098. - 9783540896456 ; 19:2, s. 146-157
-
Tidskriftsartikel (refereegranskat)abstract
- In the digital image processing, digital distances are useful; distances based on neighborhood sequences are widely used. In this article, the diamond grid is considered, that is, the three-dimensional grid of carbon atoms in the diamond crystal. An algorithm to compute a shortest path defined by a neighborhood sequence between any two points in the diamond grid is presented. A formula to compute the distance based on neighborhood sequences with two neighborhood relations is given. The metric and nonmetric properties of some distances based on neighborhood sequences are also discussed. Finally, the constrained distance transformation is shown.
|
|
