2,790 research outputs found
Optimized Algorithm for Face Detection Integrating Different Illuminating Conditions
Face detection is a significant research topic to contrive identity for many automated systems. We present a novel face detection algorithm to detect a single face in an image sequence in the real-time environment by finding structural features. The proposed method allows the user to detect the face in case the lighting conditions, pose, and viewpoint vary. The proposed algorithm combines two segmentation approaches. The first approach is a Pixel-based approach by using the components Y, Cb, and Cr in YCbCr color model as threshold conditions to segment the image into luminance and chrominance components. Based on the components of YCbCr color model, the pixel can be classified to have skin tone if it's value is between two specific thresholds. The second approach is an Edgebased approach by using Roberts cross operator. It approximates the magnitude of the gradient of the test image. It also separates the integrated regions into the face and highlights these regions of high spatial gradients which correspond to the edges of the face. The new algorithm achieves high detection rate and low false positive rate
Real-Time Construction Algorithm of Co-Occurrence Network Based on Inverted Index
Co-occurrence networks are an important method in the field of natural
language processing and text mining for discovering semantic relationships
within texts. However, the traditional traversal algorithm for constructing
co-occurrence networks has high time complexity and space complexity when
dealing with large-scale text data. In this paper, we propose an optimized
algorithm based on inverted indexing and breadth-first search to improve the
efficiency of co-occurrence network construction and reduce memory consumption.
Firstly, the traditional traversal algorithm is analyzed, and its performance
issues in constructing co-occurrence networks are identified. Then, the
detailed implementation process of the optimized algorithm is presented.
Subsequently, the CSL large-scale Chinese scientific literature dataset is used
for experimental validation, comparing the performance of the traditional
traversal algorithm and the optimized algorithm in terms of running time and
memory usage. Finally, using non-parametric test methods, the optimized
algorithm is proven to have significantly better performance than the
traditional traversal algorithm. The research in this paper provides an
effective method for the rapid construction of co-occurrence networks,
contributing to the further development of the Information Organization fields.Comment: 10 pages, 8 figure
Hierarchical stack filtering : a bitplane-based algorithm for massively parallel processors
With the development of novel parallel architectures for image processing, the implementation
of well-known image operators needs to be reformulated to take advantage of the so-called
massive parallelism. In this work, we propose a general algorithm that implements a large
class of nonlinear filters, called stack filters, with a 2D-array processor. The proposed method consists of decomposing an image into bitplanes with the bitwise decomposition, and then process every bitplane hierarchically. The filtered image is reconstructed by simply stacking the filtered bitplanes according to their order of significance. Owing to its hierarchical structure, our algorithm allows us to trade-off between image quality and processing time, and to significantly reduce the computation time of low-entropy images. Also, experimental tests show that the processing time of our method is substantially lower than that of classical methods when using large structuring elements. All these features are of interest to a variety of real-time applications based on morphological operations such as video segmentation and video enhancement
Effect of heuristics on serendipity in path-based storytelling with linked data
Path-based storytelling with Linked Data on the Web provides users the ability to discover concepts in an entertaining and educational way. Given a query context, many state-of-the-art pathfinding approaches aim at telling a story that coincides with the user's expectations by investigating paths over Linked Data on the Web. By taking into account serendipity in storytelling, we aim at improving and tailoring existing approaches towards better fitting user expectations so that users are able to discover interesting knowledge without feeling unsure or even lost in the story facts. To this end, we propose to optimize the link estimation between - and the selection of facts in a story by increasing the consistency and relevancy of links between facts through additional domain delineation and refinement steps. In order to address multiple aspects of serendipity, we propose and investigate combinations of weights and heuristics in paths forming the essential building blocks for each story. Our experimental findings with stories based on DBpedia indicate the improvements when applying the optimized algorithm
- …