The document outlines a research project on developing edge detection methods and walking strategies for multi-legged robots. It discusses using morphological operations on hexagonal grid images to remove noise and detect edges for low resolution images in real-time applications with low computational power. It describes developing structuring elements of various sizes and directions, and comparing performance of hexagonal versus rectangular grid images. The document also explores using fuzzy morphology and discusses evaluating different methods to determine the optimal approach for edge detection to enable efficient walking strategies for robots with damaged legs.
FAN search for image copy-move forgery-amalta 2014SondosFadl
1) The document proposes a fast fan search method for detecting copy-move image forgery. It divides images into blocks, extracts features from blocks, and uses a fan search algorithm to detect duplicated blocks more efficiently than previous methods.
2) Experimental results show the proposed method can detect copy-move forgery 75% faster than other methods, with 99% precision and 98% recall.
3) Future work will improve the method to detect duplications under geometric transformations like rotation and scaling.
FINGERPRINT CLASSIFICATION BASED ON ORIENTATION FIELDijesajournal
ABSTRACT
This paper introduces an effective method of fingerprint classification based on discriminative feature gathering from orientation field. A nonlinear support vector machines (SVMs) is adopted for the classification. The orientation field is estimated through a pixel-Wise gradient descent method and the percentage of directional block classes is estimated. These percentages are classified into four-dimensional vector considered as a good feature that can be combined with an accurate singular point to classify the fingerprint into one of five classes. This method shows high classification accuracy relative to other spatial domain classifiers.
Lecture 06 geometric transformations and image registrationobertksg
This document discusses geometric transformations and image registration. It begins by explaining how geometric transformations modify the spatial relationship between pixels in an image. It then covers transforming points using forward and inverse transformations. The rest of the document describes a hierarchy of geometric transformations including isometries, similarities, affine transformations, and projective transformations. It explains how to apply these transformations to images using interpolation and provides MATLAB examples. The document concludes by discussing image registration.
A Comparison of People Counting Techniques viaVideo Scene AnalysisPoo Kuan Hoong
Real-time human detection and tracking from video surveillance footages is one of the most active research areas in computer vision and pattern recognition. This is due to the widespread application from being able to do it well. One such application is the counting of people, or density estimation, where the two key components are human detection and tracking. Traditional methods such as the usage of sensors are not suitable as they are not easily integrated with current video surveillance systems. As video surveillance systems are currently prevalent in most places, using vision based people counting techniques will be the logical approach. In this paper, we compared the two commonly used techniques which are Cascade Classifier and Histograms of Gradients (HOG) for human detection. We evaluated and compared these two techniques with three different video datasets with three different setting characteristics. From our experiment results, both Cascade Classifier and HOG techniques can be used for people counting to achieve moderate accuracy results.
Copy-Rotate-Move Forgery Detection Based on Spatial DomainSondosFadl
we propose a method which is efficient and fast for detecting Copy-Move regions even when the copied region was undergone rotation modify in spatial domain.
Fuzzy c-means clustering for image segmentationDharmesh Patel
1. The document discusses fuzzy c-means clustering, an image segmentation technique that allows pixels to belong to multiple clusters, unlike k-means clustering.
2. The fuzzy c-means algorithm initializes membership values and centroid values, then iteratively updates these values until convergence.
3. Experimental results on sample images show the output segmentation for varying numbers of clusters, demonstrating both capabilities and limitations of fuzzy c-means clustering.
The document summarizes recent research on human detection from the 2015 CVPR conference. It describes papers on features and models for human detection, including combination features using HOG, HOB, and HOC. It also discusses training detectors without real data using computer-generated scenes, and improving convolutional neural networks for detection. Benchmark datasets and methods detecting across visible and thermal spectra are also summarized. The document provides an overview of recent advances in computer vision for human detection.
FAN search for image copy-move forgery-amalta 2014SondosFadl
1) The document proposes a fast fan search method for detecting copy-move image forgery. It divides images into blocks, extracts features from blocks, and uses a fan search algorithm to detect duplicated blocks more efficiently than previous methods.
2) Experimental results show the proposed method can detect copy-move forgery 75% faster than other methods, with 99% precision and 98% recall.
3) Future work will improve the method to detect duplications under geometric transformations like rotation and scaling.
FINGERPRINT CLASSIFICATION BASED ON ORIENTATION FIELDijesajournal
ABSTRACT
This paper introduces an effective method of fingerprint classification based on discriminative feature gathering from orientation field. A nonlinear support vector machines (SVMs) is adopted for the classification. The orientation field is estimated through a pixel-Wise gradient descent method and the percentage of directional block classes is estimated. These percentages are classified into four-dimensional vector considered as a good feature that can be combined with an accurate singular point to classify the fingerprint into one of five classes. This method shows high classification accuracy relative to other spatial domain classifiers.
Lecture 06 geometric transformations and image registrationobertksg
This document discusses geometric transformations and image registration. It begins by explaining how geometric transformations modify the spatial relationship between pixels in an image. It then covers transforming points using forward and inverse transformations. The rest of the document describes a hierarchy of geometric transformations including isometries, similarities, affine transformations, and projective transformations. It explains how to apply these transformations to images using interpolation and provides MATLAB examples. The document concludes by discussing image registration.
A Comparison of People Counting Techniques viaVideo Scene AnalysisPoo Kuan Hoong
Real-time human detection and tracking from video surveillance footages is one of the most active research areas in computer vision and pattern recognition. This is due to the widespread application from being able to do it well. One such application is the counting of people, or density estimation, where the two key components are human detection and tracking. Traditional methods such as the usage of sensors are not suitable as they are not easily integrated with current video surveillance systems. As video surveillance systems are currently prevalent in most places, using vision based people counting techniques will be the logical approach. In this paper, we compared the two commonly used techniques which are Cascade Classifier and Histograms of Gradients (HOG) for human detection. We evaluated and compared these two techniques with three different video datasets with three different setting characteristics. From our experiment results, both Cascade Classifier and HOG techniques can be used for people counting to achieve moderate accuracy results.
Copy-Rotate-Move Forgery Detection Based on Spatial DomainSondosFadl
we propose a method which is efficient and fast for detecting Copy-Move regions even when the copied region was undergone rotation modify in spatial domain.
Fuzzy c-means clustering for image segmentationDharmesh Patel
1. The document discusses fuzzy c-means clustering, an image segmentation technique that allows pixels to belong to multiple clusters, unlike k-means clustering.
2. The fuzzy c-means algorithm initializes membership values and centroid values, then iteratively updates these values until convergence.
3. Experimental results on sample images show the output segmentation for varying numbers of clusters, demonstrating both capabilities and limitations of fuzzy c-means clustering.
The document summarizes recent research on human detection from the 2015 CVPR conference. It describes papers on features and models for human detection, including combination features using HOG, HOB, and HOC. It also discusses training detectors without real data using computer-generated scenes, and improving convolutional neural networks for detection. Benchmark datasets and methods detecting across visible and thermal spectra are also summarized. The document provides an overview of recent advances in computer vision for human detection.
Analysis and Detection of Image Forgery Methodologiesijsrd.com
"Forgery" is a subjective word. An image can become a forgery based upon the context in which it is used. An image altered for fun or someone who has taken a bad photo, but has been altered to improve its appearance cannot be considered a forgery even though it has been altered from its original capture. The other side of forgery are those who perpetuate a forgery for gain and prestige. They create an image in which to dupe the recipient into believing the image is real and from this they are able to gain payment and fame. Detecting these types of forgeries has become serious problem at present. To determine whether a digital image is original or doctored is a big challenge. To find the marks of tampering in a digital image is a challenging task. Now these marks of tampering can be done by various operations such as rotation, scaling, JPEG compression, Gaussian noise etc. called as attacks. There are various methods proposed in this field in recent years to detect above mentioned attacks. This paper provides a detailed analysis of different approaches and methodologies used to detect image forgery. It is also analysed that block-based features methods are robust to Gaussian noise and JPEG compression and the key point-based feature methods are robust to rotation and scaling.
Template matching is a technique used in computer vision to find sub-images in a target image that match a template image. It involves moving the template over the target image and calculating a measure of similarity at each position. This is computationally expensive. Template matching can be done at the pixel level or on higher-level features and regions. Various measures are used to quantify the similarity or dissimilarity between images during the matching process. Template matching has applications in areas like object detection but faces challenges with noise, occlusions, and variations in scale and rotation.
Multiple Ant Colony Optimizations for Stereo MatchingCSCJournals
The stereo matching problem, which obtains the correspondence between right and left images, can be cast as a search problem. The matching of all candidates in the same line forms a 2D optimization task and the two dimensional (2D) optimization is a NP-hard problem. There are two characteristics in stereo matching. Firstly, the local optimization process along each scan-line can be done concurrently; secondly, there are some relationship among adjacent scan-lines can be explored to promote the matching correctness. Although there are many methods, such as GCPs, GGCPs are proposed, but these so called GCPs maybe not be ground. The relationship among adjacent scan-lines is posteriori, that is to say the relationship can only be discovered after every optimization is finished. The Multiple Ant Colony Optimization(MACO) is efficient to solve large scale problem. It is a proper way to settle down the stereo matching task with constructed MACO, in which the master layer values the sub-solutions and propagate the reliability after every local optimization is finished. Besides, whether the ordering and uniqueness constraints should be considered during the optimization is discussed, and the proposed algorithm is proved to guarantee its convergence to find the optimal matched pairs.
Global Bilateral Symmetry Detection Using Multiscale Mirror HistogramsMohamed Elawady
M. ELAWADY, C. BARAT, C. DUCOTTET and P. COLANTONI
Laboratoire Hubert Curien, Saint-Etienne, FR
Conference "Advanced Concepts for Intelligent Vision Systems
" 2016
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Contour Line Tracing Algorithm for Digital Topographic MapsCSCJournals
Topographic maps contain information related to roads, contours, landmarks land covers and rivers etc. For any Remote sensing and GIS based project, creating a database using digitization techniques is a tedious and time consuming process especially for contour tracing. Contour line is very important information that these maps provide. They are mainly used for determining slope of the landforms or rivers. These contour lines are also used for generating Digital Elevation Model (DEM) for 3D surface generation from any satellite imagery or aerial photographs. This paper suggests an algorithm that can be used for tracing contour lines automatically from contour maps extracted from the topographical sheets and creating a database. In our approach, we have proposed a modified Moore's Neighbor contour tracing algorithm to trace all contours in the given topographic maps. The proposed approach is tested on several topographic maps and provides satisfactory results and takes less time to trace the contour lines compared with other existing algorithms.
The document discusses an automatic process to extract contour lines from topographical maps by:
1) Extracting contour lines from maps based on color and thinning the lines.
2) Reconnecting any broken contour lines.
3) Tracing the contours using an algorithm and extracting altitude data.
4) Storing the extracted contour lines and their attribute data in a database.
Template matching is a technique used to classify objects by comparing portions of images against templates. It involves moving a template image across a larger source image to find the best match based on pixel-by-pixel comparisons of brightness levels. For gray-level images, the difference in brightness levels at each pixel location is used rather than a simple yes/no match. Template matching is commonly used to identify simple objects like printed characters. Matlab examples demonstrate template matching on sample data sets and correlation maps show the strength of matches across the source images.
This document provides an overview of various digital image processing techniques including morphological transformations, geometric transformations, image gradients, Canny edge detection, image thresholding, and a practical demo assignment. It discusses the basic concepts and algorithms for each technique and provides examples code. The document is presented as part of a practical course on digital image processing.
Gait Based Person Recognition Using Partial Least Squares Selection Scheme ijcisjournal
The document summarizes a research paper on gait-based person recognition using partial least squares selection. It presents an Arbitrary View Transformation Model (AVTM) that uses gait energy images and partial least squares (PLS) feature selection to improve gait recognition accuracy under varying viewing angles, clothing, and other conditions. The proposed AVTM PLS method is evaluated on the CASIA gait database and shown to achieve higher recognition rates compared to other existing methods, especially when there are changes in viewing angle, clothing, or whether the person is carrying something. Tables of results demonstrate the proposed method outperforms alternatives across different test conditions and ranges of gallery and probe viewing angles.
morphological tecnquies in image processingsoma saikiran
it describes you about different types of morphological techniques in image processing and what is the function and applications of morphological tecniques in image processing
Scanning 3 d full human bodies using kinectsFensa Saj
The document describes a system for reconstructing 3D human body models using multiple Microsoft Kinect depth cameras. The system uses two Kinects to capture the upper and lower body, and a third from the opposite direction to capture the middle. Pairwise registration is used to align successive frames, and global registration minimizes errors across all frames. A template mesh is deformed to each frame and Poisson reconstruction is used to generate the final model. Results show the ability to generate realistic 3D avatars and enable applications like virtual try-on and personalized avatars for games.
SURVEY ON POLYGONAL APPROXIMATION TECHNIQUES FOR DIGITAL PLANAR CURVESZac Darcy
This document summarizes and compares three techniques for polygonal approximation of digital planar curves:
1) Masood's technique which iteratively deletes redundant points and uses a stabilization process to optimize point locations.
2) Carmona's technique which suppresses redundant points using a breakpoint suppression algorithm and threshold.
3) Tanvir's adaptive optimization algorithm which focuses on high curvature points and applies an optimization procedure.
The techniques are evaluated on standard shapes using measures like number of points, compression ratio, error, and weighted error. Masood's technique generally had lower error while Tanvir's often achieved the highest compression.
The document provides an agenda for a practical session on digital image processing. It discusses stages of computer vision including stereo images, optical flow, and machine learning techniques like classification and clustering. Stereo vision and depth maps from stereo images are explained. Optical flow concepts like the Lucas-Kanade method are covered. Machine learning algorithms like KNN, SVM, and K-means clustering are also summarized. The document concludes with information about a project, assignment, and notable AI companies in Egypt.
This document discusses morphological operations in image processing. It describes how morphological operations like erosion, dilation, opening, and closing can be used to extract shapes and boundaries from binary and grayscale images. Erosion shrinks foreground regions while dilation expands them. Opening performs erosion followed by dilation to remove noise, and closing does the opposite to join broken parts. The hit-and-miss transform is also introduced to detect patterns in binary images using a structuring element containing foreground and background pixels. Examples are provided to illustrate each morphological operation.
This document provides an overview of various computer vision and image processing techniques including template matching, Hough transforms, image segmentation using watershed algorithms, feature detection using Harris corner detection. It outlines the stages of an assignment involving implementing and comparing Hough line and circle transforms, Harris corner detection and JPEG compression with OpenCV. It also describes a final group project to solve a real-world problem using computer vision techniques and building a mobile application.
This project is to retrieve the similar geographic images from the dataset based on the features extracted.
Retrieval is the process of collecting the relevant images from the dataset which contains more number of
images. Initially the preprocessing step is performed in order to remove noise occurred in input image with
the help of Gaussian filter. As the second step, Gray Level Co-occurrence Matrix (GLCM), Scale Invariant
Feature Transform (SIFT), and Moment Invariant Feature algorithms are implemented to extract the
features from the images. After this process, the relevant geographic images are retrieved from the dataset
by using Euclidean distance. In this, the dataset consists of totally 40 images. From that the images which
are all related to the input image are retrieved by using Euclidean distance. The approach of SIFT is to
perform reliable recognition, it is important that the feature extracted from the training image be
detectable even under changes in image scale, noise and illumination. The GLCM calculates how often a
pixel with gray level value occurs. While the focus is on image retrieval, our project is effectively used in
the applications such as detection and classification.
This document presents a study on medial axis transformation (MAT) based skeletonization of image patterns using image processing techniques. It discusses how the MAT of an image can be extracted by first computing the Euclidean distance transform of the binary image. Local maxima in the distance transform image correspond to the MAT. Several performance evaluation metrics for analyzing skeletonized images are also introduced, such as connectivity number, thinness measurement and sensitivity. The technique is demonstrated on sample images and results show it can effectively extract the skeleton with good computational speed.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
This document discusses legged robot locomotion and stability. It explains that statically stable robots can remain balanced without active control, while dynamically stable robots use active control to balance while moving. Hexapod robots that lift three legs at a time can walk in a statically stable alternating tripod gait. Servos are also discussed as actuators commonly used in legged robots due to their precise position control.
This document describes the design of a six-legged walking mechanism. It discusses designing each leg with six linkages that can convert rotational motion to walking motions. It also discusses using a tripod gait where three legs on each side move together in alternating triangular support patterns. The transmission system is designed with a single motor that drives three shafts connected by sprockets and chains to synchronize the six legs through their respective four-bar linkage designs.
Analysis and Detection of Image Forgery Methodologiesijsrd.com
"Forgery" is a subjective word. An image can become a forgery based upon the context in which it is used. An image altered for fun or someone who has taken a bad photo, but has been altered to improve its appearance cannot be considered a forgery even though it has been altered from its original capture. The other side of forgery are those who perpetuate a forgery for gain and prestige. They create an image in which to dupe the recipient into believing the image is real and from this they are able to gain payment and fame. Detecting these types of forgeries has become serious problem at present. To determine whether a digital image is original or doctored is a big challenge. To find the marks of tampering in a digital image is a challenging task. Now these marks of tampering can be done by various operations such as rotation, scaling, JPEG compression, Gaussian noise etc. called as attacks. There are various methods proposed in this field in recent years to detect above mentioned attacks. This paper provides a detailed analysis of different approaches and methodologies used to detect image forgery. It is also analysed that block-based features methods are robust to Gaussian noise and JPEG compression and the key point-based feature methods are robust to rotation and scaling.
Template matching is a technique used in computer vision to find sub-images in a target image that match a template image. It involves moving the template over the target image and calculating a measure of similarity at each position. This is computationally expensive. Template matching can be done at the pixel level or on higher-level features and regions. Various measures are used to quantify the similarity or dissimilarity between images during the matching process. Template matching has applications in areas like object detection but faces challenges with noise, occlusions, and variations in scale and rotation.
Multiple Ant Colony Optimizations for Stereo MatchingCSCJournals
The stereo matching problem, which obtains the correspondence between right and left images, can be cast as a search problem. The matching of all candidates in the same line forms a 2D optimization task and the two dimensional (2D) optimization is a NP-hard problem. There are two characteristics in stereo matching. Firstly, the local optimization process along each scan-line can be done concurrently; secondly, there are some relationship among adjacent scan-lines can be explored to promote the matching correctness. Although there are many methods, such as GCPs, GGCPs are proposed, but these so called GCPs maybe not be ground. The relationship among adjacent scan-lines is posteriori, that is to say the relationship can only be discovered after every optimization is finished. The Multiple Ant Colony Optimization(MACO) is efficient to solve large scale problem. It is a proper way to settle down the stereo matching task with constructed MACO, in which the master layer values the sub-solutions and propagate the reliability after every local optimization is finished. Besides, whether the ordering and uniqueness constraints should be considered during the optimization is discussed, and the proposed algorithm is proved to guarantee its convergence to find the optimal matched pairs.
Global Bilateral Symmetry Detection Using Multiscale Mirror HistogramsMohamed Elawady
M. ELAWADY, C. BARAT, C. DUCOTTET and P. COLANTONI
Laboratoire Hubert Curien, Saint-Etienne, FR
Conference "Advanced Concepts for Intelligent Vision Systems
" 2016
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Contour Line Tracing Algorithm for Digital Topographic MapsCSCJournals
Topographic maps contain information related to roads, contours, landmarks land covers and rivers etc. For any Remote sensing and GIS based project, creating a database using digitization techniques is a tedious and time consuming process especially for contour tracing. Contour line is very important information that these maps provide. They are mainly used for determining slope of the landforms or rivers. These contour lines are also used for generating Digital Elevation Model (DEM) for 3D surface generation from any satellite imagery or aerial photographs. This paper suggests an algorithm that can be used for tracing contour lines automatically from contour maps extracted from the topographical sheets and creating a database. In our approach, we have proposed a modified Moore's Neighbor contour tracing algorithm to trace all contours in the given topographic maps. The proposed approach is tested on several topographic maps and provides satisfactory results and takes less time to trace the contour lines compared with other existing algorithms.
The document discusses an automatic process to extract contour lines from topographical maps by:
1) Extracting contour lines from maps based on color and thinning the lines.
2) Reconnecting any broken contour lines.
3) Tracing the contours using an algorithm and extracting altitude data.
4) Storing the extracted contour lines and their attribute data in a database.
Template matching is a technique used to classify objects by comparing portions of images against templates. It involves moving a template image across a larger source image to find the best match based on pixel-by-pixel comparisons of brightness levels. For gray-level images, the difference in brightness levels at each pixel location is used rather than a simple yes/no match. Template matching is commonly used to identify simple objects like printed characters. Matlab examples demonstrate template matching on sample data sets and correlation maps show the strength of matches across the source images.
This document provides an overview of various digital image processing techniques including morphological transformations, geometric transformations, image gradients, Canny edge detection, image thresholding, and a practical demo assignment. It discusses the basic concepts and algorithms for each technique and provides examples code. The document is presented as part of a practical course on digital image processing.
Gait Based Person Recognition Using Partial Least Squares Selection Scheme ijcisjournal
The document summarizes a research paper on gait-based person recognition using partial least squares selection. It presents an Arbitrary View Transformation Model (AVTM) that uses gait energy images and partial least squares (PLS) feature selection to improve gait recognition accuracy under varying viewing angles, clothing, and other conditions. The proposed AVTM PLS method is evaluated on the CASIA gait database and shown to achieve higher recognition rates compared to other existing methods, especially when there are changes in viewing angle, clothing, or whether the person is carrying something. Tables of results demonstrate the proposed method outperforms alternatives across different test conditions and ranges of gallery and probe viewing angles.
morphological tecnquies in image processingsoma saikiran
it describes you about different types of morphological techniques in image processing and what is the function and applications of morphological tecniques in image processing
Scanning 3 d full human bodies using kinectsFensa Saj
The document describes a system for reconstructing 3D human body models using multiple Microsoft Kinect depth cameras. The system uses two Kinects to capture the upper and lower body, and a third from the opposite direction to capture the middle. Pairwise registration is used to align successive frames, and global registration minimizes errors across all frames. A template mesh is deformed to each frame and Poisson reconstruction is used to generate the final model. Results show the ability to generate realistic 3D avatars and enable applications like virtual try-on and personalized avatars for games.
SURVEY ON POLYGONAL APPROXIMATION TECHNIQUES FOR DIGITAL PLANAR CURVESZac Darcy
This document summarizes and compares three techniques for polygonal approximation of digital planar curves:
1) Masood's technique which iteratively deletes redundant points and uses a stabilization process to optimize point locations.
2) Carmona's technique which suppresses redundant points using a breakpoint suppression algorithm and threshold.
3) Tanvir's adaptive optimization algorithm which focuses on high curvature points and applies an optimization procedure.
The techniques are evaluated on standard shapes using measures like number of points, compression ratio, error, and weighted error. Masood's technique generally had lower error while Tanvir's often achieved the highest compression.
The document provides an agenda for a practical session on digital image processing. It discusses stages of computer vision including stereo images, optical flow, and machine learning techniques like classification and clustering. Stereo vision and depth maps from stereo images are explained. Optical flow concepts like the Lucas-Kanade method are covered. Machine learning algorithms like KNN, SVM, and K-means clustering are also summarized. The document concludes with information about a project, assignment, and notable AI companies in Egypt.
This document discusses morphological operations in image processing. It describes how morphological operations like erosion, dilation, opening, and closing can be used to extract shapes and boundaries from binary and grayscale images. Erosion shrinks foreground regions while dilation expands them. Opening performs erosion followed by dilation to remove noise, and closing does the opposite to join broken parts. The hit-and-miss transform is also introduced to detect patterns in binary images using a structuring element containing foreground and background pixels. Examples are provided to illustrate each morphological operation.
This document provides an overview of various computer vision and image processing techniques including template matching, Hough transforms, image segmentation using watershed algorithms, feature detection using Harris corner detection. It outlines the stages of an assignment involving implementing and comparing Hough line and circle transforms, Harris corner detection and JPEG compression with OpenCV. It also describes a final group project to solve a real-world problem using computer vision techniques and building a mobile application.
This project is to retrieve the similar geographic images from the dataset based on the features extracted.
Retrieval is the process of collecting the relevant images from the dataset which contains more number of
images. Initially the preprocessing step is performed in order to remove noise occurred in input image with
the help of Gaussian filter. As the second step, Gray Level Co-occurrence Matrix (GLCM), Scale Invariant
Feature Transform (SIFT), and Moment Invariant Feature algorithms are implemented to extract the
features from the images. After this process, the relevant geographic images are retrieved from the dataset
by using Euclidean distance. In this, the dataset consists of totally 40 images. From that the images which
are all related to the input image are retrieved by using Euclidean distance. The approach of SIFT is to
perform reliable recognition, it is important that the feature extracted from the training image be
detectable even under changes in image scale, noise and illumination. The GLCM calculates how often a
pixel with gray level value occurs. While the focus is on image retrieval, our project is effectively used in
the applications such as detection and classification.
This document presents a study on medial axis transformation (MAT) based skeletonization of image patterns using image processing techniques. It discusses how the MAT of an image can be extracted by first computing the Euclidean distance transform of the binary image. Local maxima in the distance transform image correspond to the MAT. Several performance evaluation metrics for analyzing skeletonized images are also introduced, such as connectivity number, thinness measurement and sensitivity. The technique is demonstrated on sample images and results show it can effectively extract the skeleton with good computational speed.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
This document discusses legged robot locomotion and stability. It explains that statically stable robots can remain balanced without active control, while dynamically stable robots use active control to balance while moving. Hexapod robots that lift three legs at a time can walk in a statically stable alternating tripod gait. Servos are also discussed as actuators commonly used in legged robots due to their precise position control.
This document describes the design of a six-legged walking mechanism. It discusses designing each leg with six linkages that can convert rotational motion to walking motions. It also discusses using a tripod gait where three legs on each side move together in alternating triangular support patterns. The transmission system is designed with a single motor that drives three shafts connected by sprockets and chains to synchronize the six legs through their respective four-bar linkage designs.
El páncreas se encuentra en la parte superior del abdomen y cumple funciones exocrinas e endocrinas. Sus principales patologías incluyen el cáncer de páncreas, la fibrosis quística, la pancreatitis crónica y la pancreatitis aguda, la cual puede causar complicaciones como necrosis pancreática, pseudoquistes pancreáticos y abscesos pancreáticos.
A 3D Simulator modelling for Hydraulic-drive Hexapod walking Robot using 3D Geometric Technique with distributed Numerical Model
H. Ohroku1, A. Irawan2, K. Nonami3
Graduate School of Science and Technology, Chiba University, 1-33 Yayoi-cho, Inage-ku, Chiba-shi, Chiba, 263-8522, Japan
DESIGN OF A SIMPLIFIED FOUR LEGGED WALKERArshad Javed
Walking on uneven terrain is always a benchmark problem for autonomous guided vehicles. In the present work, the same issue is dealt with the help of a legged mobile robot. Various comparisons are made among two, four, and sixlegged walking machine and a four-legged walking machine is selected based on the suitability criterion. In this paper, the emphasis is given for minimization of the design and controlling complexities for the four-legged walking machine. A prototype devised to test various gaits. For the walking and turning, an improved gait is presented. The legs are designed with one degree of freedom each. The actuation is tested on normal DC geared motors as well as DC servo motors. A comparison is made between the two actuators. For proper walking, a control scheme is prepared and real time tests are performed by implementing it on the Arduino microcontroller. The present work is helpful to analyze the performance of a legged autonomous walking machine on unstructured environment.
Keywords: Walking Machining, Legged AGV, Mobile Robotics, Servo Motor Control
Robotics & Mechatronics
V
Technology in Workshop, a 2 Days Program.
Introduction to Mechanical
o Klann mechanism in Mechanics
o Why Klann mechanism
o Different Types of Motions
o Different Types of Mechanisms
o Types Of Linkages
o Types of joints
Antonio is an insect-inspired hexapod robot with 3 degrees of freedom in each of its 18 legs, allowing it to walk in any direction. It has 25 servos total - 18 for the legs and 7 for the head and tail. An SSC-32U servo controller and BotBoarduino board are used to control the servos either through LynxTerm software or an Arduino sketch uploaded to the board. The robot can be controlled using a PS2 controller for walking, adjusting body height, and special body moves, but the code needs updating to control the head and tail as well.
A six‐legged walking robot that is capable of basic mobility tasks such as walking forward, backward, rotating in place and raising or lowering the body height.The legs will be of a modular design and will have three degrees of freedom each.
The document proposes a new social network-based scheme to help telecom operators prevent churn by providing value-added services. The proposed scheme introduces the concept of user groups, where a group owner can share subscribed services with group members at a discount, providing incentives for both users and service creators. This encourages more service usage and helps operators identify communities and target new service proposals accordingly. The scheme is intended to provide a more flexible charging mechanism for value-added services compared to existing straight-forward monthly subscription models.
Online Multi-Person Tracking Using Variance Magnitude of Image colors and Sol...Pourya Jafarzadeh
The document describes a multi-object tracking method that formulates tracking as a Short Minimum Clique Problem (SMCP). It uses three consecutive frames divided into three clusters, where each clique between clusters represents a tracklet (partial trajectory) of a person. Edges between clusters are weighted based on color histogram similarity and eigenvalue similarity of bounding boxes. Occlusion handling is performed by saving color histograms of occluded people in a buffer and comparing them to newly detected people. The method was evaluated on challenging datasets and shown to achieve promising results compared to state-of-the-art methods.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
IRJET- Texture Analysis and Fracture Identification of Bones X-Ray Images...IRJET Journal
This document presents a study on developing an image processing system for classifying bone fractures using X-ray images. The proposed system uses preprocessing, feature selection, feature extraction using GLCM, and classification with K-Means clustering and SVM. X-ray images of fractured and non-fractured bones are obtained, preprocessed to remove noise, and features are selected using DWT. GLCM is used to extract texture features like entropy, contrast and homogeneity. K-Means clustering groups similar features and SVM classifies images as fractured or non-fractured. The system achieves 90% accuracy in fracture detection and classification.
IRJET-Comparison of SIFT & SURF Corner Detector as Features and other Machine...IRJET Journal
This document compares the SIFT and SURF corner detection algorithms for extracting features from leaf images that can then be used in machine learning techniques for leaf identification. It proposes using SIFT or SURF to extract features from leaf training images, clustering the features using the CURE algorithm into k clusters, and building a decision tree for each cluster using C4.5 or CART classification. The same process would be applied to unknown leaf images to extract features, match them to the closest cluster, and traverse the corresponding decision tree to identify the leaf.
Object extraction using edge, motion and saliency information from videoseSAT Journals
Abstract Object detection is a process of finding the instances of object of a certain class which is useful in analysis of video or image. There are number of algorithms have been developed so far for object detection. Object detection has got significant role in variety of areas of computer vision like video surveillance, image retrieval`. In this paper presented an efficient algorithm for moving object extraction using edge, motion and saliency information from videos. Out methodology includes 4 stages: Frame generation, Pre-processing, Foreground generation and integration of cues. Foreground generation includes edge detection using sobel edge detection algorithm, motion detection using pixel-based absolute difference algorithm and motion saliency detection. Conditional Random Field (CRF) is applied for integration of cues and thus we get better spatial information of segmented object. Keywords: Object detection, Saliency information, Sobel edge detection, CRF.
Brain tumor segmentation using asymmetry based histogram thresholding and k m...eSAT Publishing House
This document presents a method for segmenting brain tumors from MRI images using asymmetry-based histogram thresholding and k-means clustering. The method involves 8 steps: 1) preprocessing the MRI image using sharpening and median filters, 2) computing histograms of the left and right halves of the image, 3) calculating a threshold value using the difference between left and right histograms, 4) applying thresholding and morphological operations to extract the tumor region, 5) applying k-means clustering and using the cluster centroids to refine the segmentation. The method is tested on 30 MRI images and results show the tumor region is accurately segmented. The segmented tumors can then be used for quantification, classification, and computer-assisted diagnosis of brain tumors.
Gabor filter is a powerful way to enhance biometric images like fingerprint images in order to extract correct features from these images, Gabor filter used in extracting features directly asin iris images, and sometimes Gabor filter has been used for texture analysis. In fingerprint images The even symmetric Gabor filter is contextual filter or multi-resolution filter will be used to enhance fingerprint imageby filling small gaps (low-pass effect) in the direction of the ridge (black regions) and to increase the discrimination between ridge and valley (black and white regions) in the direction, orthogonal to the ridge, the proposed method in applying Gabor filter on fingerprint images depending on translated fingerprint image into binary image after applying some simple enhancing methods to partially overcome time consuming problem of the Gabor filter.
Tracking and counting human in visual surveillance systemiaemedu
This document summarizes a proposed system for tracking and counting humans in a visual surveillance system. The system first performs background subtraction on input video frames to detect foreground objects. It applies this process to both grayscale and binary image formats, and selects the better-performing format. Features are then extracted from detected objects. Objects are tracked frame-to-frame based on these features. Counting is performed by analyzing pixels representing detected humans across frames. Experimental results on videos with various challenges like shadows, illumination changes and occlusions show the system can accurately track and count humans, with near real-time performance.
Tracking and counting human in visual surveillance systemiaemedu
This document summarizes a proposed system for tracking and counting humans in a visual surveillance system. The system first performs background subtraction on input video frames to detect foreground objects. It applies this process to both grayscale and binary image formats, and selects the better-performing format. Features are then extracted from detected objects. Objects are tracked frame-to-frame based on these features. Counting is performed by analyzing pixels representing detected humans across frames. Experimental results on videos with various challenges like shadows, illumination changes and occlusions showed the system could accurately track and count humans, with near perfect accuracy in some cases and small errors in others.
Tracking and counting human in visual surveillance systemIAEME Publication
This document summarizes a proposed system for tracking and counting humans in a visual surveillance system. The system first performs background subtraction on input video frames to detect foreground objects. It applies this process to both grayscale and binary image formats, and selects the better-performing format. Features are then extracted from detected objects. Objects are tracked frame-to-frame based on these features. Counting is performed by analyzing pixels representing detected humans across frames. Experimental results on videos with various challenges like shadows, illumination changes and occlusions showed the system could accurately track and count humans, with near perfect accuracy in some cases and small errors in others.
Tracking and counting human in visual surveillance systemiaemedu
This document summarizes a proposed system for tracking and counting humans in a visual surveillance system. The system first performs background subtraction on input video frames to detect foreground objects. It applies this process to both grayscale and binary image formats, and selects the better-performing format. Features are then extracted from detected blobs, including size, centroid, and color. Tracking rectangles are drawn around whole detected objects to group separated body parts. Counting is done by detecting when pixel values change from background to foreground. Experimental results on videos with various challenges like shadows, illumination changes, and occlusions showed the system could accurately track and count humans, with near-perfect accuracy even for occluded or broken objects, though it introduced some minor errors.
The accurate determination of the sex and age of human skull is a critical challenge in skeleton anthropology and crime department. In the forensic
laboratory they determine both the sex and age of skeleton using carbon content of the bones. The teeth, pelvis and skull are the most widely used sites
for determination of sex and age of the skeleton. This paper introduces a technique for objective qualification of age and sexual dimorphic features
using wavelet transformation, it is a multiscale mathematical technique that allows determination of shape variation that are hide at various scale of
resolution. We use a 2D discrete wavelet transform in the proposed method. In the skull the supraorbital margin is consider to determine sex of skull
and the area occupation of upper part of skull is used to estimate the age of the skull. SVM is a classifier used for classification. We used both
supervised and unsupervised SVM for both sex and age detection of the skull.
This document presents a comparative study of edge detection techniques for shoeprint recognition. It provides an overview of common edge detection methods like Canny, Sobel, and Prewitt. The paper applies these techniques to sample shoeprint images and calculates the mean and standard deviation of the results under different threshold values. Canny edge detection performed best at preserving geometric features of the shoeprint, while Prewitt and Sobel algorithms worked better overall on the test images. The study aims to help understand and evaluate edge detection algorithms through practical simulations and analysis.
1) The document describes a method for vehicle detection and tracking in videos using inter-frame coding. It extracts moving blobs through background subtraction and clusters pixels into regions.
2) A blob merging module merges close-by blobs that were incorrectly separated due to occlusion. Tracking corresponds blobs between frames using position, color, and velocity.
3) Experimental results on real-time video show the method can successfully detect and track vehicles under different lighting conditions and levels of noise. The addition of a "Vicinity Factor" improved segmentation accuracy compared to using blob merging thresholds alone.
The objective of this paper is to present the hybrid approach for edge detection. Under this technique, edge
detection is performed in two phase. In first phase, Canny Algorithm is applied for image smoothing and in
second phase neural network is to detecting actual edges. Neural network is a wonderful tool for edge
detection. As it is a non-linear network with built-in thresholding capability. Neural Network can be trained
with back propagation technique using few training patterns but the most important and difficult part is to
identify the correct and proper training set.
In this paper the process of 3D modelling from video is presented. Analysed previous research related to
this process, and specifically described algorithms for detecting and matching key points. We described
their advantages and disadvantages, and made a critical analysis of algorithms. In this paper, the three
detectors (SUSAN, Plessey and Förstner) are tested and compare. We used video taken with hand held
camera of a cube and compare these detectors on it (taking into account their parameters of accuracy and
repeatability). In conclusion, we practically made 3D model of the cube from video used these detectors in
the first step of the process and three algorithms (RANSAC, MSAC and MLESAC) for matching data.
An automatic algorithm for object recognition and detection based on asift ke...Kunal Kishor Nirala
This document presents an automatic algorithm for object recognition and detection based on ASIFT keypoints. The algorithm combines affine scale invariant feature transform (ASIFT) and a region merging algorithm. ASIFT is used to extract keypoints from a training image of the object. These keypoints are then used instead of user markers in a region merging algorithm to recognize and detect the object with full boundary in other images. Experimental results show the method is efficient and accurate at recognizing and detecting objects.
Project on collision avoidance in static and dynamic environmentgopaljee1989
This document proposes a method for real-time path planning of mobile robots to avoid collisions in static and dynamic environments. It involves using an artificial neural network (ANN) for obstacle detection and a vector field histogram method with decision trees for local path planning. When all paths are blocked, fuzzy logic will be used to choose a path. The objective is for the robot to safely navigate around obstacles without communication delays. The proposed method aims to overcome limitations of previous techniques by applying ANN, decision trees, and fuzzy logic for robust, real-time collision avoidance.
AN ENHANCED EDGE ADAPTIVE STEGANOGRAPHY APPROACH USING THRESHOLD VALUE FOR RE...ijcsa
The document summarizes an enhanced edge adaptive steganography approach using a threshold value for region selection. It aims to improve the quality and modification rate of a stego image compared to Sobel and Canny edge detection techniques. The proposed approach uses a threshold value to select high frequency pixels from the cover image for data embedding using LSBMR. Experimental results on 100 images show about a 0.2-0.6% improvement in image quality measured by PSNR and a 4-10% improvement in modification rate measured by MSE compared to Sobel and Canny edge detection.
The document presents a methodology for human segregation from detected moving objects using Histogram of Oriented Gradients (HOG). It proposes using Mixture of Gaussian (MOG) for background subtraction to detect moving objects, followed by applying HOG to distinguish humans from other detected moving objects. The methodology is implemented and experimental results show the ability to segregate humans from other moving objects in video footage. Limitations are discussed and directions for further work are provided, such as object tracking and performance evaluation.
Similar to Multi-legged Robot Walking Strategies, with an Emphasis on Image-based Methods (20)
Discover the latest insights on Data Driven Maintenance with our comprehensive webinar presentation. Learn about traditional maintenance challenges, the right approach to utilizing data, and the benefits of adopting a Data Driven Maintenance strategy. Explore real-world examples, industry best practices, and innovative solutions like FMECA and the D3M model. This presentation, led by expert Jules Oudmans, is essential for asset owners looking to optimize their maintenance processes and leverage digital technologies for improved efficiency and performance. Download now to stay ahead in the evolving maintenance landscape.
Electric vehicle and photovoltaic advanced roles in enhancing the financial p...IJECEIAES
Climate change's impact on the planet forced the United Nations and governments to promote green energies and electric transportation. The deployments of photovoltaic (PV) and electric vehicle (EV) systems gained stronger momentum due to their numerous advantages over fossil fuel types. The advantages go beyond sustainability to reach financial support and stability. The work in this paper introduces the hybrid system between PV and EV to support industrial and commercial plants. This paper covers the theoretical framework of the proposed hybrid system including the required equation to complete the cost analysis when PV and EV are present. In addition, the proposed design diagram which sets the priorities and requirements of the system is presented. The proposed approach allows setup to advance their power stability, especially during power outages. The presented information supports researchers and plant owners to complete the necessary analysis while promoting the deployment of clean energy. The result of a case study that represents a dairy milk farmer supports the theoretical works and highlights its advanced benefits to existing plants. The short return on investment of the proposed approach supports the paper's novelty approach for the sustainable electrical system. In addition, the proposed system allows for an isolated power setup without the need for a transmission line which enhances the safety of the electrical network
Batteries -Introduction – Types of Batteries – discharging and charging of battery - characteristics of battery –battery rating- various tests on battery- – Primary battery: silver button cell- Secondary battery :Ni-Cd battery-modern battery: lithium ion battery-maintenance of batteries-choices of batteries for electric vehicle applications.
Fuel Cells: Introduction- importance and classification of fuel cells - description, principle, components, applications of fuel cells: H2-O2 fuel cell, alkaline fuel cell, molten carbonate fuel cell and direct methanol fuel cells.
An improved modulation technique suitable for a three level flying capacitor ...IJECEIAES
This research paper introduces an innovative modulation technique for controlling a 3-level flying capacitor multilevel inverter (FCMLI), aiming to streamline the modulation process in contrast to conventional methods. The proposed
simplified modulation technique paves the way for more straightforward and
efficient control of multilevel inverters, enabling their widespread adoption and
integration into modern power electronic systems. Through the amalgamation of
sinusoidal pulse width modulation (SPWM) with a high-frequency square wave
pulse, this controlling technique attains energy equilibrium across the coupling
capacitor. The modulation scheme incorporates a simplified switching pattern
and a decreased count of voltage references, thereby simplifying the control
algorithm.
4. Multi-legged Robot Walking Strategy
For low computational power, low resolution images in real
time application; efficient edge detection method is crucial
Edge detection method for multi legged robot to detect
standing zone edges, gap/obstacle
Walking strategy for multi legged robot with damaged leg
We focused small robot with low computation power
4April 03, 2015
5. Edge Detection
Edge detection effectiveness depends on quality of
input image
Images are processed in a rectangular grid
Increases cost & decreases performance
Numerous types of sampling systems are feasible
5April 03, 2015
7. Mathematical Morphology
Morphological erosions & dilations produce results identical to
the nonlinear minimum & maximum filters
7
Figural representation of Grayscale Morphology formula (Dilation)
Dilation
The value of the output pixel is the maximum value of all the
pixels in the input pixel's neighborhood
Structuring Element
Input Image Output Image
8. Classical Sets
8
Classical sets: either an element belongs to the set or it does
not
For example, for the set of integers, either an integer is even or
it is not (it is odd)
Another example is for black & white photographs, one cannot
say either a pixel is white or it is black
When we digitize a b/w figure, we turn all the b/w and gray
scales into 256 discrete tones
April 03, 2015
9. What is Fuzzy Set?
Fuzzy sets first introduced by Lotfi A. Zadeh[1] as an extension of the
classical set theory
In crisp set a pixel is either black or white. For edge detection, its an
edge or a no-edge. But the edges are not always precisely defined.
Fuzzy images are characterized by the degree to which each pixel
belongs to a particular region
9
Crisp set and fuzzy set for grayscale image
[1] Zadeh, L. A. (1965). Fuzzy sets. Information and control, 8(3), 338-353.
Crisp set
“dark gray-levels”
fuzzy set
“dark gray-levels”
April 03, 2015
10. Fuzzy Morphology
The word “fuzzy” means “vague”. Fuzziness occurs when the
border of information is not clear-cut
It can handle the idea of partial truth & false
Fuzzy set theory allows the gradual calculation
FM uses the concepts of fuzzy set theory
FM is the extension of mathematical morphology to fuzzy sets
10April 03, 2015
12. Research Objectives
The purpose of this study is to
Develop structuring elements (morphological gradients)
for low resolution images
Apply proposed method for noise removal and edge
detection
Derive efficient walking strategies by using image based
method and with damaged leg
12April 03, 2015
14. Mathematical Morphology
14April 03, 2015
Serra (1986)
Z. Yu-qian
(2006)
Y. Zhang
(2010)
X. Bai
(2010)
Zhang
(2015)
A good review of morphological operator
Detect the edge of lungs CT image with salt-and-
pepper noise
Comparison between Morphological edge detection
and traditional edge operator
Multiscale top-hat transformations based on SE’S has
been constructed
The Application of Mathematical Morphology & Sobel
Operator in Infrared Image Edge Detection
15. Fuzzy Morphology
15
Publications about Fuzzy Morphology in Image Processing over the last 30 Years
Tree of fuzzy morphology
The most renowned concept of fuzzy
morphology is the alpha-morphology
It’s founded on the level sets of fuzzy
membership degree function and first
introduced by Bloch et al
16. Multi Legged Robot
Considerable research[1,2] done on robot vision and has been primarily
based on the rule of forbidden walking regions
Inagaki[3] investigated the leg failure situations in hexapod robots of
which one leg was damaged.
More recently, Yang[4] mentioned that it is helpful to lock the joint
associated with a damaged motor.
However, locking mechanism always cannot provide support. When
collapse occurs at 2nd or 3rd joint in a leg
16
[1] R. Ponticelli and P. G. de Santos, "Obtaining terrain maps and obstacle contours for terrain-recognition tasks," Mechatronics, vol. 20, 2010.
[2] J. Estremera, et. al. "Continuous free-crab gaits for hexapod robots on a natural terrain with forbidden zones: An application to humanitarian demining,” Robotics & Autonomous Systems, 2010.
[3] K. Inagaki, "Gait study for hexapod walking with disabled leg," in Intelligent Robots and Systems, IROS'97.
[4] J.-M. Yang, "Gait synthesis for hexapod robots with a locked joint failure," Robotica, vol. 23, 2005.
19. Binary Morphology
19
Simulated Hexagonal Grid
d=3d=2d=1
Many square grids combine together to create a pixel block.
For example, d= 7;
Combines 120 rectangular grids.
Resolution = (Summation of 120 pixels gray values)/120
d=4
Image Resampling
April 03, 2015
20. Image Resampling
20
Different values for simulated hexagonal grid
Image conversion from rectangular to simulated hexagonal grid:
(a) hexagonal image(D=2) (b) hexagonal image (D=7)April 03, 2015
23. Noise Removal
The proposed noise removal method: (a) Noisy image (a) Noise-free image
The proposed method applied opening followed by closing with various combinations of
SEs
The better combination to remove noise was defined by horizontal, 60°, 120°, and three-by-
three structuring element
23
24. Edge Detection
Edge detection achieved by applying
various directional three-by-three SEs
on the hexagonal grid
24
The performances of the three-by-three
hexagonal SEs were superior to those of
their five-by-five
The smaller circular-shape hexagonal
SEs achieved superior performance in
identifying curved edges
By contrast, larger SEs introduced
unwanted thickness & discontinuities
April 03, 2015
25. Edge Detection
Edge detection achieved by applying
various directional three-by-three SEs
on the rectangular grid
Numerous unwanted discontinuities
in the rectangular images
April 03, 2015 25
26. Performance evaluation
26
Combination of
Structuring Elements
The Face Test Image
MSE Ratio of edge pixels
to image size (%)
Hexagonal
Image
Horizontal, 60° and 120° SE
Horizontal, Vertical and 120° SE
Horizontal, Vertical and 60° SE
Vertical, 60° and 120° SE
0.97
1.47
3.02
5.05
15.78
15.02
14.79
14.23
Rectangular
Image
Horizontal, 60° and 120° SE
Horizontal, Vertical and 120° SE
Horizontal, Vertical and 60° SE
10.56
11.36
12.02
13.07
12.93
12.71
27. 27
Rectangular Grid
Image
Hexagonal Image
Image
Fuzzification
Hexagonal
Fuzzy SE
Fuzzy
Morphology
Hexagonal
Multi scale SE
Grayscale
morphology
Noise Removal
& Edge
detection
Evaluate both
method
Find the
optimum one
Top Hat
Transformation
to enhance
edges
Resampling
(Rectangular
to hexagonal
Grid)
Grayscale & Fuzzy Morphology
April 03, 2015
29. Grayscale Morphology
Hexagonal Structuring Elements (3x3, 5x5, 7x7)
Hexagonal Grayscale Morphological Operator
29
(c)(b)(a)
(a) Hexagonal image
(b) Structuring element
(c) After Dilation
April 03, 2015
30. Grayscale Morphology (Multiscale)
Multi scale morphological analysis seems to be more favorable than single-scale
analysis
where B is the SE and n is the number of operations
Multiscale Dilation = A⊕nB, and Multiscale Erosion = AΘnB,
where A is the input image, B is the SE, and n is the number of operations
Multiscale Gradient = (A⊕nB) – (AΘnB)
Multiscale Gradient = (A●nB) – (AonB)
30
,
1
timesn
BBBBBnB
April 03, 2015
31. Edge Detection (Morphological Gradient)
Multi-scale Gradient = (A⊕nB) – (AΘnB)
31
Edge image by using hexagonal morphological gradient operator (a) 3x3(b) 5x5
Multiscale hexagonal morphological gradient 3x3 SE (a) n=1(b) n=2(c) n=3
April 03, 2015
32. Edge Enhancement (Top hat transformation)
White top-hat transformation:
𝑾𝑻𝑯 𝒙, 𝒚 = 𝒇 𝒙, 𝒚 − 𝒎𝒊𝒏 𝒇 ⊖ 𝑩 ⊕ 𝑩, 𝒇 𝒙, 𝒚
Black top-hat transformation:
𝑩𝑻𝑯 𝒙, 𝒚 = 𝒎𝒂𝒙((𝒇 ⊕ 𝑩) ⊖ 𝑩, 𝒇 𝒙, 𝒚 ) − 𝒇 𝒙, 𝒚
32
MW = max (WTH1, WTH2, …); MB = max (BTH1, BTH2, …)
Enhanced Edges = (Original Image x W1) + (MW x W2) – (M B x W3)
April 03, 2015
34. PerformanceEvaluation
SE Lena Pepper Barbara
MSE Linear Index
of fuzziness
MSE Linear Index
of fuzziness
MSE Linear Index of
fuzziness
3x3 52.98 0.064 57.47 0.062 38.56 0.116
5x5 46.47 0.137 48.77 0.137 31.28 0.203
7x7 41.24 0.201 42.36 0.205 26.65 0.283
9x9 37.16 0.255 37.37 0.265 23.35 0.353
34
Comparison of different HSE Edge detection using morphological gradient
SE Lena Pepper Barbara
MSE Linear Index
of fuzziness
MSE Linear Index
of fuzziness
MSE Linear Index
of fuzziness
3x3 56.21 0.054 59.23 0.055 43.41 0.101
5x5 53.91 0.126 56.36 0.105 42.56 0.155
7x7 51.09 0.153 53.01 0.133 40.55 0.189
9x9 46.81 0.181 48.25 0.175 36.41 0.229
Comparison of different HSE enhanced Edge detection
April 03, 2015
35. Fuzzy Morphology
35
Rectangular
grid Gray scale
Image
Image
Resampling
(Rectangular to
Hexagonal Grid)
Image
Fuzzification
(S-membership
function)
Fuzzy
Morphology
(Noise removal &
Edge detection)
Defuzzification
Performance
Evaluation
System diagram for performing fuzzy image processing on hexagonally sampled grid
April 03, 2015
37. Image Fuzzification
S-membership function as given below:
μ(x) = 0 x<a,
= 2 [(x -a)/(c - a)]2 a < x < b
= 1 – 2 [(x - c)/(c - a)]2 b < x < c,
= 1 x > c,
where, b is any value between a and c. For a = Xmin, c = Xmax
37
Membershipdegree
Pixels
April 03, 2015
42. Performance evaluation
Mean Square Error (MSE),
Signal to Noise Ratio (SNR) and
The ratio of edge pixels to image size 42
Standard test image & it’s Ground Truth prepared manually for evaluation
April 03, 2015
43. Performance evaluation
Method
Pepper Test Image
MSE SNR Ratio of edge pixels to
image size
Hexagonal
Image
Combination of Horizontal, 60° and 120° SE 0.74 21.97 17.8%
Combination of Horizontal, Vertical and 120° SE 1.92 19.85 17.01%
Combination of Horizontal, Vertical and 60° SE 4.02 17.67 16.61%
Combination of Vertical, 60° and 120° SE 7.05 15.22 16.01%
Combination of 60° and 120° SE 7.31 15.06 15.85%
Rectangular
Image
Combination of Horizontal, 60° and 120° SE 10.56 12.56 14.06%
Combination of Horizontal, Vertical and 120° SE 11.36 12.43 14.01%
Combination of Horizontal, Vertical and 60° SE 12.02 12.09 13.81%
Combination of 60° and 120° SE 13.06 11.06 13.61%
43
Quantitative measure obtained by edge detectors in hexagonal grid and rectangular
grid by using fuzzy hexagonal morphology for real test images Pepper
44. Better Walking Strategies for Multi-legged Robots
Multi legged robots present various limitations, such as traveling
on discontinuous terrain and navigation systems
Moreover, there are several kinds of damages can be happen in
multi legged robot legs
Thus, we proposed image-based walking strategy
44April 03, 2015
45. Better Walking Strategies for Multi-legged Robots
An Image-based Walking Strategy
45
Geometric model of the
proposed hexapod robot A uniformly distributed random terrain Terrain edges (black lines)
April 03, 2015
46. 46
Discontinuous terrain consisting of the
standing zone (white), forbidden zone
(black), and edges (yellow)
7 by 7 structuring element
An Image-based Walking Strategy
47. Hexapod Parameters
47
The 2-3-6 gait support pattern of the hexapodHexapod parameters
Rmax = 60 Pixels
Rmin = 20 Pixels
B = 100 Pixels
W = 50 Pixels
D = 50 Pixels
April 03, 2015
48. Grayscale Image of a Simplified Forward Gait
48
Each step of the simplified forward gait’s ranges of movement (Km) was
measured and stored in a matrix
Brighter zones represent higher Km values, and vice versa. White denotes wide
ranges of movement & black represents shortest ranges of movement.
April 03, 2015
49. Gait Selection for Forward Walking
49
α -15° -30° -45° 0°
S 111.57 101.21 83.43 112
SX -28 -50 -59 0
SY 108 88 59 112
The parameter values of robot’s forward gait
α 15° 30° 45° 60°
S 111.57 101.21 83.43 67.23
SX 28 50 59 58
SY 108 88 59 34
Forward angle α; Stride length S;
SX, SY (S in X and Y directions)
This study create an adaptive forward gait list by selecting from
eight simplified forward gait angles, namely 0°, 15°, 30°, 45°, 60°,
-15°, -30°, and -45°.
April 03, 2015
50. Rotational Gait (Around the CG)
The distance between every point of motion range and the CG was measured
Then applied the aforementioned ranges of movement matrix for the hexapod’s
movement. A gray value of 255 was defined for the maximal angle of rotation
50April 03, 2015
51. Maximal Angle of Rotation
51
θ S SX SY R x y
Rotation around the CG 30.03° 0 0 0 0 0 0
Max. angle of rotation 37.67° 40.16 13 38 62 62 0
The comparison of rotational gait
Rotation around the point OT and after rotation
θ3 as 58.85°
θ2 as 30.03°
θ6 as 30.39°
Rotated clockwise with 2-3-6 gait
The hexapod reached
the maximal angle of
rotation when θ2, θ3,
and θ6 were equivalent.
52. Rotation around Any Point
52
For 5 ° angle of rotation For 10° angle of rotation
θ S SX SY R X Y
5° 101.90 28 98 1162 1130 272
10° 93 27 89 527.68 515 115
The Parameters for rotation of 5° and 10°
Hexapod’s destination
target point was in front and
the CG was on the right
side of the rear position
In each step, the hexapod
could rotate θ degrees
However, the rotation of the
hexapod depended on the
condition of the forbidden
edges, zones, and target
distance
After each movement, the
hexapod’s CG and stability
margin were measured and
updated
53. The Algorithm for Gait Selection
53
Changes in the gait sequence
( 1-4-5 gaits, 2-3-6 gaits, symmetrical gaits)
The gray regions indicate the
overlapping ranges of motion
April 03, 2015
59. Walking Strategy with Damaged Leg
The use of removable sliding legs
59
Fixed Position Adjustment
Step 01: Damaged leg removed
Step 02: Middle leg slide into the removed leg
When the position of the leg started to move
& remaining leg may not provide stable
support
However as any of these legs lifts above the
ground, the remaining legs fail to provide a
usable support polygon
Thus, firstly let R1 swing backward a distance
S, & secondly make R2 also move in the
same direction an amount of S, then swing R1
back to original stances. Repeat these steps
April 03, 2015
60. Axial stability for an adjusted gait
60
Maximum stride length is 2S; SL+ & SL‐ are the
front and rear axial stability limit respectively
The standard stride length is 2S. The maximum
swing for both the front & the rear leg is assumed
to be S
Most insects can walk with the tripod gait, which is
a fast and statically balanced gait (SBG) for
Hexapods.
However, when one or more legs are missing,
regular tripod gait is no longer possible. To get
around this, a “common leg” needs to be shared in
two tripod groups.
April 03, 2015
Multi-legged Robot Schematics
61. Alternative Gait
Configuration
The 6‐1‐R2 case
Common Leg R3
A hexapod robot which has no R2 leg
In (a), hollow arrow indicates half step &
solid arrow indicates full step (2S)
Dash lines are indicate the support
polygon
In each interval the robot travels a
distance S
Robot schematics
Enhanced Gait Chart (EGC)April 03, 2015 61
L1
L2
L3
R1
R3
64. Non Fixed Position Adjustment (NFP)
64
Best Combination for [3|3] type gait sequence
(a) 8-2-L2 R3 type as an example
(b) Before adjustment, L3 R1 R4 constitute
support polygon
(c) SL + = 1.52 S, SL- = 2.64 S, d min = 0.53 S
(d) Six legged standard form by using step
less transportation.
(e) Now, SL + and SL- become equal (both
2.08 S), and d min = 1.08S and the whole
system become more stable
April 03, 2015
Support Polygon (L3 R1 R4 )
L3
R4
R1
65. Non Fixed Position Adjustment (NFP)
65
Best combination for [2|4] type
The R3 leg in (L3, R1, R3) support polygon
is first moved downward by 0.5S, making
(SL+) increase from 1.25S to 1.5S
Then L3 is move downward by 0.03S to
equalize the two SL values to 1.51S.
Since the other group (L2, R2, R4) is of
opposite shape, so it is adjusted reversely
The minimal SL value (dmin) is thus increased
from 1.25S to 1.51S.
This is now the better configuration for [2|4]
category
Support Polygon
(L3 R1 R3 )
R3L3
R1
L2 R2
L4
68. Contributions
Developed various membership functions for image
fuzzification and find out the better one
Moreover, this study provided an application of edge
detection and noise removal technique for low resolution
image
Developed multi legged robots walking strategies by
applying mathematical morphology image processing
based method
68April 03, 2015
69. Contributions
Developed multi legged robots with damaged leg walking
strategy
This study developed “Severed Leg” & “Sliding Leg”
approach to maintaining the efficiency & stability of robot
69April 03, 2015
70. Future Work
Although this study has accomplished a small step toward edge
detection & multi legged robot walking strategies, the quest for a
better edge detection and walking strategy system will continue to
persist.
There are some research topics worth continued study. For
instance, fuzzy fusion concepts to extend fuzzy morphology to
color data (Color Fuzzy Morphology).
In addition, the recognition of low-resolution images needs to be
extended to a more general geometric transformation as well.
70April 03, 2015