<?xml version="1.0" ?>
<rss version="2.0">
	<channel>
		<title><![CDATA[ Computer Vision, IET - new TOC ]]></title>
		<link>http://ieeexplore.ieee.org</link>
		<description>TOC Alert for Publication# 4159597 </description>
		<year>2008</year>
		<month>July     </month>
		<day>30</day>
		<item>
			<title><![CDATA[Editorial - Visual Information Engineering]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4543863&arnumber=4543864]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[June  2008]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4543863&arnumber=4543864]]></guid>
			<volume>2</volume>
			<issue>2</issue>
			<startPage>35</startPage>
			<endPage>36</endPage>
			<fileSize>79</fileSize>
			<authors><![CDATA[Velastin, S.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Discriminant analysis of the two-dimensional Gabor features for face recognition]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4543863&arnumber=4543865]]></link>
			<description><![CDATA[A new technique called two-dimensional Gabor Fisher discriminant (2DGFD) is derived and implemented for image representation and recognition. In this approach, the Gabor wavelets are used to extract facial features. The principal component analysis (PCA) is applied directly on the Gabor transformed matrices to remove redundant information from the image rows and a new direct two-dimensional Fisher linear discriminant (direct 2DFLD) method is derived in order to further remove redundant information and form a discriminant representation more suitable for face recognition. The conventional Gabor-based methods transform the Gabor images into a high-dimensional feature vector. However, these methods lead to high computational complexity and memory requirements. Furthermore, it is difficult to analyse such high-dimensional data accurately. The novel 2DGFD method was tested on face recognition using the ORL, Yale and extended Yale databases, where the images vary in illumination, expression, pose and scale. In particular, the 2DGFD method achieves 98.0% face recognition accuracy when using 20%3 feature matrices for each Gabor output on the ORL database and 97.6% recognition accuracy compared with 91.8% and 91.6% for the 2DPCA and 2DFLD method on the extended Yale database. The results show that the proposed 2DGFD method is computationally more efficient than the Gabor Fisher classifier method by approximately 8 times on the ORL, 135 times on the Yale and 1.2801%10<sup>8</sup> times on the extended Yale B data sets.]]></description>
			<pubDate><![CDATA[June  2008]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4543863&arnumber=4543865]]></guid>
			<volume>2</volume>
			<issue>2</issue>
			<startPage>37</startPage>
			<endPage>49</endPage>
			<fileSize>382</fileSize>
			<authors><![CDATA[Mutelo, R.M.;Woo, W.L.;Dlay, S.S.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Harnessing defocus blur to recover high-resolution information in shape-from-focus technique]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4543863&arnumber=4543866]]></link>
			<description><![CDATA[Traditional shape-from-focus (SFF) uses focus as the singular cue to derive the shape profile of a 3D object from a sequence of images. However, the stack of low-resolution (LR) observations is space-variantly blurred because of the finite depth of field of the camera. The authors propose to exploit the defocus information in the stack of LR images to obtain a super-resolved image as well as a high-resolution (HR) depth map of the underlying 3D object. Appropriate observation models are used to describe the image formation process in SFF. Local spatial dependencies of the intensities of pixels and their depth values are accounted for by modelling the HR image and the HR structure as independent Markov random fields. Taking as input the LR images from the stack and the LR depth map, the authors first obtain the super-resolved image of the 3D specimen and use it subsequently to reconstruct a HR depth profile of the object.]]></description>
			<pubDate><![CDATA[June  2008]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4543863&arnumber=4543866]]></guid>
			<volume>2</volume>
			<issue>2</issue>
			<startPage>50</startPage>
			<endPage>59</endPage>
			<fileSize>485</fileSize>
			<authors><![CDATA[Sahay, R.R.;Rajagopalan, A.N.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Stable bi-level and multi-level thresholding of images using a new global transformation]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4543863&arnumber=4543867]]></link>
			<description><![CDATA[A new transformation for finding global valleys in 1D distributions, with particular application to the thresholding of grey-scale images is described. The applied criterion function estimates the global significance of all the valleys that are located, and thus can cope with multi-mode distributions. Examples make it clear that one of the main advantages of the resulting global valley method (GVM) is that it permits partially hidden minima to be reliably located without complicated analysis. Overall, the GVM is demonstrated to have very good stability properties and high sensitivity for the detection of subsidiary minima - including those arising near the ends of distributions that arise from practically important image detail (such as defects or contaminants in an automated inspection scenario). The global analysis around which the method is formulated is responsible for achieving these capabilities with modest computational demands.]]></description>
			<pubDate><![CDATA[June  2008]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4543863&arnumber=4543867]]></guid>
			<volume>2</volume>
			<issue>2</issue>
			<startPage>60</startPage>
			<endPage>74</endPage>
			<fileSize>1181</fileSize>
			<authors><![CDATA[Davies, E.R.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Task-related population characteristics in handwriting analysis]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4543863&arnumber=4543868]]></link>
			<description><![CDATA[An analysis of features extracted from handwriting samples according to writer demographics and writing task characteristics is presented. The individual demographics studied here include age, gender and handedness, while the handwriting tasks considered include writing the individual signature, form-filling, cheque-completion and constructing free-form written text. By analysing different features of handwriting, the authors establish a link between a writer's individual characteristics including demographic properties, the handwriting task being attempted and quantifiable features of handwriting such as pen velocity, acceleration and slant. Additionally, imitated or 'forged' handwriting is also analysed on exactly the same basis. The analysis is performed on a newly collected database of handwriting samples collected from a population of 150 writers, and which can be utilised in both forensic document inspection and automatic handwriting analysis research. All handwriting samples, including forgery attempts, were recorded both temporally as a series of pen positional coordinates and scanned at a resolution of 600 dpi to enable both dynamic and static processing.]]></description>
			<pubDate><![CDATA[June  2008]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4543863&arnumber=4543868]]></guid>
			<volume>2</volume>
			<issue>2</issue>
			<startPage>75</startPage>
			<endPage>87</endPage>
			<fileSize>658</fileSize>
			<authors><![CDATA[Chapran, J.;Fairhurst, M.C.;Guest, R.M.;Ujam, C.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Modelling periodic scene elements for visual surveillance]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4543863&arnumber=4543869]]></link>
			<description><![CDATA[Some urban scenes exhibit periodic variations that can be relevant to visual surveillance applications. One example is the variation in the background elements, such as those caused by moving escalators, lights and scrolling advertisements. When modelled correctly, the incorporation of these periodic elements as a Markov model in a foreground detection component can improve the performance significantly. Another area where the periodicity in the scene can be used is anomaly detection. In some underground metro stations where the flow of people is periodic, deviations from this periodicity can be interpreted as abnormal movements of people. This can be achieved by using a higher-dimensional model for the underlying data structure, and mapping it to a one-dimensional signal for interpretation. This approach is tested, and the results show that abnormal behaviour can be automatically detected.]]></description>
			<pubDate><![CDATA[June  2008]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4543863&arnumber=4543869]]></guid>
			<volume>2</volume>
			<issue>2</issue>
			<startPage>88</startPage>
			<endPage>98</endPage>
			<fileSize>718</fileSize>
			<authors><![CDATA[Leung, V.;Colombo, A.;Orwell, J.;Velastin, S.A.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Temporal reasoning for scenario recognition in video-surveillance using Bayesian networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4543863&arnumber=4543870]]></link>
			<description><![CDATA[The authors propose a high-level scenario recognition algorithm for video sequence interpretation. The recognition of scenarios is based on a Bayesian networks approach. The model of a scenario contains two main layers. The first one allows events from the observed visual features to be highlighted and the second layer is focused on the temporal reasoning stage. The temporal layer uses specific nodes permitting an event-based approach. These nodes focus on the lifetime of events highlighted from the results of the first layer. The temporal layer then estimates the qualitative and quantitative relations between the different temporal events helpful for the recognition task. The global recognition algorithm is illustrated over real indoor image sequences of an abandoned baggage scenario.]]></description>
			<pubDate><![CDATA[June  2008]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4543863&arnumber=4543870]]></guid>
			<volume>2</volume>
			<issue>2</issue>
			<startPage>99</startPage>
			<endPage>107</endPage>
			<fileSize>607</fileSize>
			<authors><![CDATA[Ziani, A.;Motamed, C.;Noyer, J.C.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Extraction of activity patterns on large video recordings]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4543863&arnumber=4543871]]></link>
			<description><![CDATA[Extracting the hidden and useful knowledge embedded within video sequences and thereby discovering relations between the various elements to help an efficient decision-making process is a challenging task. The task of knowledge discovery and information analysis is possible because of recent advancements in object detection and tracking. The authors present how video information is processed with the ultimate aim to achieve knowledge discovery of people activity and also extract the relationship between the people and contextual objects in the scene. First, the object of interest and its semantic characteristics are derived in real-time. The semantic information related to the objects is represented in a suitable format for knowledge discovery. Next, two clustering processes are applied to derive the knowledge from the video data. Agglomerative hierarchical clustering is used to find the main trajectory patterns of people and relational analysis clustering is employed to extract the relationship between people, contextual objects and events. Finally, the authors evaluate the proposed activity extraction model using real video sequences from underground metro networks (CARETAKER) and a building hall (CAVIAR).]]></description>
			<pubDate><![CDATA[June  2008]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4543863&arnumber=4543871]]></guid>
			<volume>2</volume>
			<issue>2</issue>
			<startPage>108</startPage>
			<endPage>128</endPage>
			<fileSize>1728</fileSize>
			<authors><![CDATA[Patino, L.;Benhadda, H.;Corvee, E.;Bremond, F.;Thonnat, M.;]]></authors>
		</item>
	</channel>
</rss>