Negative determinant of Hessian features

Local image feature extractors that select local maxima of the determinant of Hessian function have been shown to perform well and are widely used. This paper introduces the negative local minima of the determinant of Hessian function for local feature extraction. The properties and scale-space behaviour of these features are examined and found to be desirable for feature extraction. It is shown how this new feature type can be implemented along with the existing local maxima approach at negligible extra processing cost. Applications to affine covariant feature extraction and sub-pixel precise corner extraction are demonstrated. Experimental results indicate that the new corner detector is more robust to image blur and noise than existing methods. It is also accurate for a broader range of corner geometries. An affine covariant feature extractor is implemented by combining the minima of the determinant of Hessian with existing scale and shape adaptation methods. This extractor can be implemented along side the existing Hessian maxima extractor simply by finding both minima and maxima during the initial extraction stage. The minima features increase the number of correspondences by two to four fold. The additional minima features are very distinct from the maxima features in descriptor space and do not make the matching process more ambiguous.

Towards an understanding of teacher judgement in the context of social moderation

Social moderation involves teachers gathering together to discuss their judgements of the quality of student work and to reach agreement regarding the standard awarded. This qualitative study conducted over a three-year period investigated the social practice of moderation and the influence on teachers’ judgements of students work. An initial survey of teachers’ understandings of moderation and standards, pre-interviews of teachers who participated in the moderation meetings, observations of these meetings with a particular focus on one teacher (focus teachers) comprised the data collection methods. Data analysis involved organising, matching, coding, identifying patterns and themes using a constant comparative method. Socio-cultural theories of learning and assessment underpinned the approach to data analysis and proved helpful in explaining the diverse influences on teachers’ judgements beyond the task criteria, and the progressive development of shared understandings through engaging in professional discussions of students’ work. The study revealed that the process is not clear and linear and is influenced by factors such as the representation of the standards and the knowledge base of the teachers.

Towards condition-invariant sequence-based route recognition

In this paper we present a novel algorithm for localization during navigation that performs matching over local image sequences. Instead of calculating the single location most likely to correspond to a current visual scene, the approach finds candidate matching locations within every section (subroute) of all learned routes. Through this approach, we reduce the demands upon the image processing front-end, requiring it to only be able to correctly pick the best matching image from within a short local image sequence, rather than globally. We applied this algorithm to a challenging downhill mountainbiking visual dataset where there was significant perceptual or environment change between repeated traverses of the environment, and compared performance to applying the feature-based algorithm FAB-MAP. The results demonstrate the potential for localization using visual sequences, even when there are no visual features that can be reliably detected.

A review of road traffic noise indicators and their correlation with the LA10(18hour)

This paper outlines a study to determine the correlation between the LA10(18hour) and other road traffic noise indicators. It is based on a database comprising of 404 measurement locations including 947 individual days of valid noise measurements across numerous circumstances taken between November 2001 and November 2007. This paper firstly discusses the need and constraints on the indicators and their nature of matching a suitable indicator to the various road traffic noise dynamical characteristics. The paper then presents a statistical analysis of the road traffic noise monitoring data, correlating various indicators with the LA10(18hour) statistical indicator and provides a comprehensive table of linear correlations. There is an extended analysis on relationships across the night time period. The paper concludes with a discussion on the findings.

Towards automatic object segmentation with sequential multiple views

Object segmentation is one of the fundamental steps for a number of robotic applications such as manipulation, object detection, and obstacle avoidance. This paper proposes a visual method for incorporating colour and depth information from sequential multiview stereo images to segment objects of interest from complex and cluttered environments. Rather than segmenting objects using information from a single frame in the sequence, we incorporate information from neighbouring views to increase the reliability of the information and improve the overall segmentation result. Specifically, dense depth information of a scene is computed using multiple view stereo. Depths from neighbouring views are reprojected into the reference frame to be segmented compensating for imperfect depth computations for individual frames. The multiple depth layers are then combined with color information from the reference frame to create a Markov random field to model the segmentation problem. Finally, graphcut optimisation is employed to infer pixels belonging to the object to be segmented. The segmentation accuracy is evaluated over images from an outdoor video sequence demonstrating the viability for automatic object segmentation for mobile robots using monocular cameras as a primary sensor.

A recommendation method for online dating networks based on social relations and demographic information

A new relationship type of social networks - online dating - are gaining popularity. With a large member base, users of a dating network are overloaded with choices about their ideal partners. Recommendation methods can be utilized to overcome this problem. However, traditional recommendation methods do not work effectively for online dating networks where the dataset is sparse and large, and a two-way matching is required. This paper applies social networking concepts to solve the problem of developing a recommendation method for online dating networks. We propose a method by using clustering, SimRank and adapted SimRank algorithms to recommend matching candidates. Empirical results show that the proposed method can achieve nearly double the performance of the traditional collaborative filtering and common neighbor methods of recommendation.

An ontology-based mining approach for user search intent discovery

Discovering proper search intents is a vi- tal process to return desired results. It is constantly a hot research topic regarding information retrieval in recent years. Existing methods are mainly limited by utilizing context-based mining, query expansion, and user profiling techniques, which are still suffering from the issue of ambiguity in search queries. In this pa- per, we introduce a novel ontology-based approach in terms of a world knowledge base in order to construct personalized ontologies for identifying adequate con- cept levels for matching user search intents. An iter- ative mining algorithm is designed for evaluating po- tential intents level by level until meeting the best re- sult. The propose-to-attempt approach is evaluated in a large volume RCV1 data set, and experimental results indicate a distinct improvement on top precision after compared with baseline models.

XML data clustering: An overview

In the last few years we have observed a proliferation of approaches for clustering XML docu- ments and schemas based on their structure and content. The presence of such a huge amount of approaches is due to the different applications requiring the XML data to be clustered. These applications need data in the form of similar contents, tags, paths, structures and semantics. In this paper, we first outline the application contexts in which clustering is useful, then we survey approaches so far proposed relying on the abstract representation of data (instances or schema), on the identified similarity measure, and on the clustering algorithm. This presentation leads to draw a taxonomy in which the current approaches can be classified and compared. We aim at introducing an integrated view that is useful when comparing XML data clustering approaches, when developing a new clustering algorithm, and when implementing an XML clustering compo- nent. Finally, the paper moves into the description of future trends and research issues that still need to be faced.

A semi-local method for iterative depth-map refinement

We present an iterative hierarchical algorithm for multi-view stereo. The algorithm attempts to utilise as much contextual information as is available to compute highly accurate and robust depth maps. There are three novel aspects to the approach: 1) firstly we incrementally improve the depth fidelity as the algorithm progresses through the image pyramid; 2) secondly we show how to incorporate visual hull information (when available) to constrain depth searches; and 3) we show how to simultaneously enforce the consistency of the depth-map by continual comparison with neighbouring depth-maps. We show that this approach produces highly accurate depth-maps and, since it is essentially a local method, is both extremely fast and simple to implement.

Nanostructures for sensors, electronics, energy and environment

Nanoscale science is growing evermore important on a global scale and is widely seen as playing an integral part in the growth of future world economies. The daunting energy crisis we are facing could be solved not only by new and improved ways of getting energy directly from the sun, but also by saving power thanks to advancements in electronics and sensors. New, cheap dye-sensitized and polymer solar cells hold the promise of environmentally friendly and simple production methods, along with mechanical flexibility and low weight, matching the conditions for a widespread deployment of this technology. Cheap sensors based on nanomaterials can make a fundamental contribution to the reduction of greenhouse gas emissions, allowing the creation of large sensor networks to monitor countries and cities, improving our quality of life. Nanowires and nano-platelets of metal oxides are at the forefront of the research to improve sensitivity and reduce the power consumption in gas sensors. Nanoelectronics is the next step in the electronic roadmap, with many devices currently in production already containing components smaller than 100 nm. Molecules and conducting polymers are at the forefront of this research with the goal of reducing component size through the use of cheap and environmentally friendly production methods. This, and the coming steps that will eventually bring the individual circuit element close to the ultimate limit of the atomic level, are expected to deliver better devices with reduced power consumption.

Performance enhancement of smart antennas with reduced element spacing

This paper addresses the problem of degradations in adaptive digital beam-forming (DBF) systems caused by mutual coupling between array elements. The focus is on compact arrays with reduced element spacing and, hence, strongly coupled elements. Deviations in the radiation patterns of coupled and (theoretically) uncoupled elements can be compensated for by weight-adjustments in DBF, but SNR degradation due to impedance mismatches cannot be compensated for via signal processing techniques. It is shown that this problem can be overcome via the implementation of a RF-decoupling-network. SNR enhancement is achieved at the cost of a reduced frequency bandwidth and an increased sensitivity to dissipative losses in the antenna and matching network structure.

Automated cross-lingual link discovery in Wikipedia

At NTCIR-9, we participated in the cross-lingual link discovery (Crosslink) task. In this paper we describe our approaches to discovering Chinese, Japanese, and Korean (CJK) cross-lingual links for English documents in Wikipedia. Our experimental results show that a link mining approach that mines the existing link structure for anchor probabilities and relies on the “translation” using cross-lingual document name triangulation performs very well. The evaluation shows encouraging results for our system.

Fast detection of exact clones in business process model repositories

As organizations reach higher levels of business process management maturity, they often find themselves maintaining very large process model repositories, representing valuable knowledge about their operations. A common practice within these repositories is to create new process models, or extend existing ones, by copying and merging fragments from other models. We contend that if these duplicate fragments, a.k.a. ex- act clones, can be identified and factored out as shared subprocesses, the repository’s maintainability can be greatly improved. With this purpose in mind, we propose an indexing structure to support fast detection of clones in process model repositories. Moreover, we show how this index can be used to efficiently query a process model repository for fragments. This index, called RPSDAG, is based on a novel combination of a method for process model decomposition (namely the Refined Process Structure Tree), with established graph canonization and string matching techniques. We evaluated the RPSDAG with large process model repositories from industrial practice. The experiments show that a significant number of non-trivial clones can be efficiently found in such repositories, and that fragment queries can be handled efficiently.

Design and implementation of wideband baluns for Archimedean spiral antennas

The demand for high-speed data services for portable device has become a driving force for development of advanced broadband access technologies. Despite recent advances in broadband wireless technologies, there remain a number of critical issues to be resolved. One of the major concerns is the implementation of compact antennas that can operate in a wide frequency band. Spiral antenna has been used extensively for broadband applications due to its planar structure, wide bandwidth characteristics and circular polarisation. However, the practical implementation of spiral antennas is challenged by its high input characteristic impedance, relatively low gain and the need for balanced feeding structures. Further development of wideband balanced feeding structures for spiral antennas with matching impedance capabilities remain a need. This thesis proposes three wideband feeding systems for spiral antennas which are compatible with wideband array antenna geometries. First, a novel tapered geometry is proposed for a symmetric coplanar waveguide (CPW) to coplanar strip line (CPS) wideband balun. This balun can achieve the unbalanced to balanced transformation while matching the high input impedance of the antenna to a reference impedance of 50 . The discontinuity between CPW and CPS is accommodated by using a radial stub and bond wires. The bandwidth of the balun is improved by appropriately tapering the CPW line instead of using a stepped impedance transformer. Next, the tapered design is applied to an asymmetric CPW to propose a novel asymmetric CPW to CPS wideband balun. The use of asymmetric CPW does away with the discontinuities between CPW and CPS without having to use a radial stub or bond wires. Finally, a tapered microstrip line to parallel striplines balun is proposed. The balun consists of two sections. One section is the parallel striplines which are connected to the antenna, with the impedance of balanced line equal to the antenna input impedance. The other section consists of a microstrip line where the width of the ground plane is gradually reduced to eventually resemble a parallel stripline. The taper accomplishes the mode and impedance transformation. This balun has significantly improved bandwidth characteristics. Characteristics of proposed feeding structures are measured in a back-to-back configuration and compared to simulated results. The simulated and measured results show the tapered microstrip to parallel striplines balun to have more than three octaves of bandwidth. The tapered microstrip line to parallel striplines balun is integrated with a single Archimedean spiral antenna and with an array of spiral antennas. The performance of the integrated structures is simulated with the aid of electromagnetic simulation software, and results are compared to measurements. The back-to-back microstrip to parallel strip balun has a return loss of better than 10 dB over a wide bandwidth from 1.75 to 15 GHz. The performance of the microstrip to parallel strip balun was validated with the spiral antennas. The results show the balun to be an effective mean of feeding network with a low profile and wide bandwidth (2.5 to 15 GHz) for balanced spiral antennas.

CAT-SLAM : probabilistic localisation and mapping using a continuous appearance-based trajectory

This paper describes a new system, dubbed Continuous Appearance-based Trajectory Simultaneous Localisation and Mapping (CAT-SLAM), which augments sequential appearance-based place recognition with local metric pose filtering to improve the frequency and reliability of appearance-based loop closure. As in other approaches to appearance-based mapping, loop closure is performed without calculating global feature geometry or performing 3D map construction. Loop-closure filtering uses a probabilistic distribution of possible loop closures along the robot’s previous trajectory, which is represented by a linked list of previously visited locations linked by odometric information. Sequential appearance-based place recognition and local metric pose filtering are evaluated simultaneously using a Rao–Blackwellised particle filter, which weights particles based on appearance matching over sequential frames and the similarity of robot motion along the trajectory. The particle filter explicitly models both the likelihood of revisiting previous locations and exploring new locations. A modified resampling scheme counters particle deprivation and allows loop-closure updates to be performed in constant time for a given environment. We compare the performance of CAT-SLAM with FAB-MAP (a state-of-the-art appearance-only SLAM algorithm) using multiple real-world datasets, demonstrating an increase in the number of correct loop closures detected by CAT-SLAM.