As smart devices become popular among people, there are many demands for handling these devices. Smart devices are different from desktop and laptop in that the smart devices cannot be used with user interface periphe...
详细信息
As smart devices become popular among people, there are many demands for handling these devices. Smart devices are different from desktop and laptop in that the smart devices cannot be used with user interface peripherals such as mouse and keyboard due to the nature of itself, portability. So here is our proposal, eye blinking detection algorithm for interacting with smart devices. This algorithm that we are going to suggest can replace the most important functions of mouse, "clicking". This is possible because "Mouse Clicking" can be easily replaced by "Eye Blinking". We focus on the fast detection algorithm for the real time performance. Current existing studies of eye blinking detection have not concerned about the detection speed while they have quite clear detection accuracy. In this paper, our algorithm is designed to achieve not only the detection accuracy but the rapid speed as well.
Diaries - and now lifelogs - offer ways to store old memories, review them from time to time, and reflect about the past. Self-reflection is a crucial factor in personal growth. However, to make this process effective...
详细信息
This paper presents a method for recognizing legends in images of ancient coins. It accounts for the special challenging conditions of ancient coins and thus does not rely on character segmentation contrary to traditi...
详细信息
In this paper, we propose a Self-aware Distance Transform (SDT) for efficient template-based point feature tracking. The proposed SDT encapsulates the relationship between autocorrelation coefficients and the distance...
详细信息
ISBN:
(纸本)1901725464
In this paper, we propose a Self-aware Distance Transform (SDT) for efficient template-based point feature tracking. The proposed SDT encapsulates the relationship between autocorrelation coefficients and the distance from the best match;therefore, it can be used to automatically determine the size of a search region in each point feature. The proposed SDT returns the expected distance between the predicted position and the best match from a statistical viewpoint, which guarantees a certain level of successful tracking depending on the cross-correlation at the predicted position. If the SDT returns a large expected distance due to the abrupt motion of a feature or inaccurate prediction, we progressively expand the search region on a hexagonal lattice while also using the SDT to reduce unnecessary computations. The performance of the proposed tracking method based on the SDT was verified experimentally in terms of its accuracy, robustness, and computational efficiency by comparing the proposed method to other tracking methods.
Document analysis is done to analyze entire forms (e.g. intelligent form analysis, table detection) or to describe the layout/structure of a document for further processing. A pre-processing step of document analysis ...
详细信息
Writer identification determines the writer of one document among a number of known writers where at least one sample is known. Writer retrieval searches all documents of one particular writer by creating a ranking of...
详细信息
Domes are architectural structural elements typical for ecclesiastical and secular grand buildings, like churches, mosques, palaces, capitols and city halls. The current paper targets the problem of segmentation of do...
详细信息
Architectural elements are the components and details of buildings. Their unique set, combination, design, construction technique form the architectural style of buildings. Building facade classification by architectu...
详细信息
This paper proposes a simple color image retrieval method based on multi resolution enhanced orthogonal polynomials model. In the proposed method, a set of orthogonal polynomials has been chosen and the model coeffici...
详细信息
ISBN:
(纸本)9781601322258
This paper proposes a simple color image retrieval method based on multi resolution enhanced orthogonal polynomials model. In the proposed method, a set of orthogonal polynomials has been chosen and the model coefficients are reordered into multiresolution subband like structure. The subband coefficients are quantized into three levels. Then the weighted autocorrelogram is computed from the quantized subbands in R, G and B color space. The obtained weighted autocoorelogram is termed as global color feature vector and are normalized with Z - score normalization. This feature vector is used for retrieving similar images with weighted Manhattan distance metric. The efficiency of the proposed method is experimented on a subset of standard COREL database and the results are compared with existing techniques. The proposed method yields significant retrieval results.
We present a novel method for learning densities with bounded support which enables us to incorporate 'hard' topological constraints. In particular, we show how emerging techniques from computational algebraic...
详细信息
ISBN:
(纸本)9781627480031
We present a novel method for learning densities with bounded support which enables us to incorporate 'hard' topological constraints. In particular, we show how emerging techniques from computational algebraic topology and the notion of persistent homology can be combined with kernel-based methods from machine learning for the purpose of density estimation. The proposed formalism facilitates learning of models with bounded support in a principled way, and - by incorporating persistent homology techniques in our approach - we are able to encode algebraic-topological constraints which are not addressed in current state of the art probabilistic models. We study the behaviour of our method on two synthetic examples for various sample sizes and exemplify the benefits of the proposed approach on a real-world dataset by learning a motion model for a race car. We show how to learn a model which respects the underlying topological structure of the racetrack, constraining the trajectories of the car.
暂无评论