Image Modelling: A Feature Detection Approach for Steganalysis

2017 ◽  
pp. 140-148
Author(s):  
Anuj Rani ◽  
Manoj Kumar ◽  
Payel Goel
Keyword(s):  
Feature Detection ◽  
Detection Approach ◽  
Image Modelling

scholarly journals Natural Feature Detection on Mobile Phones with 3D FAST

2010 ◽  
Vol 9 (4) ◽  
pp. 29-34 ◽  
Author(s):  
Achim Weimert ◽  
Xueting Tan ◽  
Xubo Yang
Keyword(s):  
Feature Detection ◽  
Feature Matching ◽  
Hessian Matrix ◽  
Detection Algorithm ◽  
Scale Invariant ◽  
Natural Feature ◽  
Detection Approach ◽  
Scale Levels ◽  
Speed Up ◽  
Low Performance

In this paper, we present a novel feature detection approach designed for mobile devices, showing optimized solutions for both detection and description. It is based on FAST (Features from Accelerated Segment Test) and named 3D FAST. Being robust, scale-invariant and easy to compute, it is a candidate for augmented reality (AR) applications running on low performance platforms. Using simple calculations and machine learning, FAST is a feature detection algorithm known to be efficient but not very robust in addition to its lack of scale information. Our approach relies on gradient images calculated for different scale levels on which a modified9 FAST algorithm operates to obtain the values of the corner response function. We combine the detection with an adapted version of SURF (Speed Up Robust Features) descriptors, providing a system with all means to implement feature matching and object detection. Experimental evaluation on a Symbian OS device using a standard image set and comparison with SURF using Hessian matrix-based detector is included in this paper, showing improvements in speed (compared to SURF) and robustness (compared to FAST)

Fast intersecting feature detection approach based on original face naming mechanism

2010 ◽  
Vol 30 (6) ◽  
pp. 1584-1586
Author(s):  
Jing LIU ◽  
Kun WEN ◽  
Ying ZHU ◽  
Zheng-ming CHEN
Keyword(s):  
Feature Detection ◽  
Detection Approach

Feature Detection Requires Spatial Attention

2007 ◽  
Author(s):  
Jan Theeuwes ◽  
Erik van der Burg ◽  
Artem V. Belopolsky
Keyword(s):  
Spatial Attention ◽  
Feature Detection

A Fault Detection Approach Based on Sound Signal Analysis for Equipment Monitoring

2020 ◽  
pp. 129-139
Author(s):  
Weihai Sun ◽  
Lemei Han
Keyword(s):  
Fault Detection ◽  
Signal Analysis ◽  
Energy Analysis ◽  
Detection Method ◽  
Sound Signal ◽  
Practical Significance ◽  
Time Frequency ◽  
Detection Approach ◽  
Machine Fault ◽  
Learning Data

Machine fault detection has great practical significance. Compared with the detection method that requires external sensors, the detection of machine fault by sound signal does not need to destroy its structure. The current popular audio-based fault detection often needs a lot of learning data and complex learning process, and needs the support of known fault database. The fault detection method based on audio proposed in this paper only needs to ensure that the machine works normally in the first second. Through the correlation coefficient calculation, energy analysis, EMD and other methods to carry out time-frequency analysis of the subsequent collected sound signals, we can detect whether the machine has fault.

ON METHODS OF OBJECT DETECTION IN VIDEO STREAMS

2017 ◽  
Vol 2 (1) ◽  
pp. 80-87
Author(s):  
Puyda V. ◽  
◽  
Stoian. A.
Keyword(s):  
Computer Vision ◽  
Object Detection ◽  
Open Source ◽  
Feature Detection ◽  
Video Stream ◽  
Object Identification ◽  
Vision Systems ◽  
Modern Computer ◽  
Computer Vision Systems ◽  
Open Source Hardware

Detecting objects in a video stream is a typical problem in modern computer vision systems that are used in multiple areas. Object detection can be done on both static images and on frames of a video stream. Essentially, object detection means finding color and intensity non-uniformities which can be treated as physical objects. Beside that, the operations of finding coordinates, size and other characteristics of these non-uniformities that can be used to solve other computer vision related problems like object identification can be executed. In this paper, we study three algorithms which can be used to detect objects of different nature and are based on different approaches: detection of color non-uniformities, frame difference and feature detection. As the input data, we use a video stream which is obtained from a video camera or from an mp4 video file. Simulations and testing of the algoritms were done on a universal computer based on an open-source hardware, built on the Broadcom BCM2711, quad-core Cortex-A72 (ARM v8) 64-bit SoC processor with frequency 1,5GHz. The software was created in Visual Studio 2019 using OpenCV 4 on Windows 10 and on a universal computer operated under Linux (Raspbian Buster OS) for an open-source hardware. In the paper, the methods under consideration are compared. The results of the paper can be used in research and development of modern computer vision systems used for different purposes. Keywords: object detection, feature points, keypoints, ORB detector, computer vision, motion detection, HSV model color

Recognition of Birds in Blurred and Illumination Images by Local Features

2017 ◽  
Vol 7 (7) ◽  
pp. 243
Author(s):  
Suresha .M ◽  
. Sandeep
Keyword(s):  
Computer Vision ◽  
Time Complexity ◽  
Feature Detection ◽  
Feature Matching ◽  
Fast Algorithms ◽  
Local Features ◽  
Experimental Demonstration ◽  
Harris Corner ◽  
Blurred Image ◽  
Blurred Images

Local features are of great importance in computer vision. It performs feature detection and feature matching are two important tasks. In this paper concentrates on the problem of recognition of birds using local features. Investigation summarizes the local features SURF, FAST and HARRIS against blurred and illumination images. FAST and Harris corner algorithm have given less accuracy for blurred images. The SURF algorithm gives best result for blurred image because its identify strongest local features and time complexity is less and experimental demonstration shows that SURF algorithm is robust for blurred images and the FAST algorithms is suitable for images with illumination.

Do Sequential Lineups Impair Discriminability?

2020 ◽  
Author(s):  
Matthew Philip Kaesler ◽  
John C Dunn ◽  
Keith Ransom ◽  
Carolyn Semmler
Keyword(s):  
Human Behavior ◽  
Feature Detection ◽  
Eyewitness Memory ◽  
Simultaneous Presentation ◽  
Diagnostic Feature ◽  
Sequential Presentation ◽  
Sequential Lineups ◽  
Measurement Models ◽  
Sequential Lineup ◽  
Lineup Procedures

The debate regarding the best way to test and measure eyewitness memory has dominated the eyewitness literature for more than thirty years. We argue that to resolve this debate requires the development and application of appropriate measurement models. In this study we develop models of simultaneous and sequential lineup presentations and use these to compare the procedures in terms of discriminability and response bias. We tested a key prediction of the diagnostic feature detection hypothesis that discriminability should be greater for simultaneous than sequential lineups. We fit the models to the corpus of studies originally described by Palmer and Brewer (2012, Law and Human Behavior, 36(3), 247-255) and to data from a new experiment. The results of both investigations showed that discriminability did not differ between the two procedures, while responses were more conservative for sequential presentation compared to simultaneous presentation. We conclude that the two procedures do not differ in the efficiency with which they allow eyewitness memory to be expressed. We discuss the implications of this for the diagnostic feature detection hypothesis and other sequential lineup procedures used in current jurisdictions.

Sign in / Sign up

Export Citation Format

Share Document