This PDF file contains the front matter associated with SPIE Proceedings Volume 10025, including the Title Page, Copyright information, Table of Contents, Introduction (if any), and Conference Committee listing.

Batik is one of Indonesian’s traditional cloth. Motif or pattern drawn on a piece of batik fabric has a specific name and philosopy. Although batik cloths are widely used in everyday life, but only few people understand its motif and philosophy. This research is intended to develop a batik motif recognition system which can be used to identify motif of Batik image automatically. First, a batik image is decomposed into sub-images using wavelet transform. Six texture descriptors, i.e. max probability, correlation, contrast, uniformity, homogenity and entropy, are extracted from gray-level co-occurrence matrix of each sub-image. The texture features are then matched to the template features using canberra distance. The experiment is performed on Batik Dataset consisting of 1088 batik images grouped into seven motifs. The best recognition rate, that is 92,1%, is achieved using feature extraction process with 5 level wavelet decomposition and 4 directional gray-level co-occurrence matrix.

Template matching is a basic algorithm for image processing, and real-time is a crucial requirement of object tracking. For real-time tracking, a fast template matching algorithm based on grey prediction is presented, where computation cost can be reduced dramatically by minimizing search range. First, location of the tracked object in the current image is estimated by Grey Model (GM). GM(1,1), which is the basic model of grey prediction, can use some known information to foretell the location. Second, the precise position of the object in the frame is computed by template matching. Herein, Sequential Similarity Detection Algorithm (SSDA) with a self-adaptive threshold is employed to obtain the matching position in the neighborhood of the predicted location. The role of threshold in SSDA is important, as a proper threshold can make template matching fast and accurate. Moreover, a practical weighted strategy is utilized to handle scale and rotation changes of the object, as well as illumination changes. The experimental results show the superior performance of the proposed algorithm over the conventional full-search method, especially in terms of executive time.

Object tracking is a challenging research task due to target appearance variation caused by deformation and occlusion. Keypoint matching based tracker can handle partial occlusion problem, but it’s vulnerable to matching faults and inflexible to target deformation. In this paper, we propose an innovative keypoint matching procedure to address above issues. Firstly, the scale and orientation of corresponding keypoints are applied to estimate the target’s status. Secondly, a kernel function is employed in order to discard the mismatched keypoints, so as to improve the estimation accuracy. Thirdly, the model updating mechanism is applied to adapt to target deformation. Moreover, in order to avoid bad updating, backward matching is used to determine whether or not to update target model. Extensive experiments on challenging image sequences show that our method performs favorably against state-of-the-art methods.

This paper describes the use of image skeletonization for the estimation of all the navigable points, inside a scene of mobile robots navigation. Those points are used for computing a valid navigation path, using standard methods. The main idea is to find the middle and the extreme points of the obstacles in the scene, taking into account the robot size, and create a map of navigable points, in order to reduce the amount of information for the planning algorithm. Those points are located by means of the skeletonization of a binary image of the obstacles and the scene background, along with some other digital image processing algorithms. The proposed algorithm automatically gives a variable number of navigable points per obstacle, depending on the complexity of its shape. As well as, the way how the algorithm can change some of their parameters in order to change the final number of the resultant key points is shown. The results shown here were obtained applying different kinds of digital image processing algorithms on static scenes.

Many data mining adopts the form of Artificial Neural Network (ANN) to solve many problems, many problems will be involved in the process of training Artificial Neural Network, such as the number of samples with volume label, the time and performance of training, the number of hidden layers and Transfer function, if the compared data results are not expected, it cannot be known clearly that which dimension causes the deviation, the main reason is that Artificial Neural Network trains compared results through the form of modifying weight, and it is not a kind of training to improve the original algorithm for the extraction algorithm of image, but tend to obtain correct value aimed at the result plus the weigh; in terms of these problems, this paper will mainly put forward a method to assist in the image data analysis of Artificial Neural Network; normally, a parameter will be set as the value to extract feature vector during processing the image, which will be considered by us as weight, the experiment will use the value extracted from feature point of Speeded Up Robust Features (SURF) Image as the basis for training, SURF itself can extract different feature points according to extracted values, we will make initial semi-supervised clustering according to these values, and use Modified K - on his Neighbors (MFKNN) as training and classification, the matching mode of unknown images is not one-to-one complete comparison, but only compare group Centroid, its main purpose is to save its efficiency and speed up, and its retrieved data results will be observed and analyzed eventually; the method is mainly to make clustering and classification with the use of the nature of image feature point to give values to groups with high error rate to produce new feature points and put them into Input Layer of Artificial Neural Network for training, and finally comparative analysis is made with Back-Propagation Neural Network (BPN) of Genetic Algorithm-Artificial Neural Network (GAANN through the weight training results.

This paper proposes a method for removing mismatched lines on multispectral images. The inaccurate detection of ending points brings a great challenge for matching lines since corresponding lines may not be integrally extracted. Due to the inaccurate detection of ending points, lines are usually mismatched with the line description. To eliminate the mismatched lines, we employ a modified RANSAC (Random Sample Consensus) consisting of two steps: (1) pick three line matches randomly and determine their intersections, which are used to calculate a transformation; (2) the best transformation is obtained by sorting the matching score of line matches and then the inliers are declared as the correct matches. Experimental results show that the proposed method can effectively remove incorrect matches on multispectral images.

Solar magnetic structures exhibit a wealth of different spatial and temporal scales. Presently, solar magnetic element is believed to be the ultra-fine magnetic structure in the lower solar atmospheric layer, and the diffraction limit of the largest-aperture solar telescope (New Vacuum Solar Telescope; NVST) of China is close to the spatial scale of magnetic element. This implies that modern solar observations have entered the era of high resolution better than 0.2 arc-second. Since the year of 2011, the NVST have successfully established and obtained huge observational data. Moreover, the ultra-fine magnetic structure rooted in the dark inter-graunlar lanes can be easily resolved. Studies on the observational characteristics and physical mechanism of magnetic bright points is one of the most important aspects in the field of solar physics, so it is very important to determine the statistical and physical parameters of magnetic bright points with the feature extraction techniques and numerical analysis approaches. For identifying such ultra-fine magnetic structure, an automatically and effectively detection algorithm, employed the Laplacian transform and the morphological dilation technique, is proposed and examined. Then, the statistical parameters such as the typical diameter, the area distribution, the eccentricity, and the intensity contrast are obtained. And finally, the scientific meaning for investigating the physical parameters of magnetic bright points are discussed, especially for understanding the physical processes of solar magnetic energy transferred from the photosphere to the corona.

It is highly important for visually impaired people (VIP) to be aware of human beings around themselves, so correctly recognizing people in VIP assisting apparatus provide great convenience. However, in classical face recognition technology, faces used in training and prediction procedures are usually frontal, and the procedures of acquiring face images require subjects to get close to the camera so that frontal face and illumination guaranteed. Meanwhile, labels of faces are defined manually rather than automatically. Most of the time, labels belonging to different classes need to be input one by one. It prevents assisting application for VIP with these constraints in practice. In this article, a face recognition system under unconstrained environment is proposed. Specifically, it doesn’t require frontal pose or uniform illumination as required by previous algorithms. The attributes of this work lie in three aspects. First, a real time frontal-face synthesizing enhancement is implemented, and frontal faces help to increase recognition rate, which is proved with experiment results. Secondly, RGB-D camera plays a significant role in our system, from which both color and depth information are utilized to achieve real time face tracking which not only raises the detection rate but also gives an access to label faces automatically. Finally, we propose to use neural networks to train a face recognition system, and Principal Component Analysis (PCA) is applied to pre-refine the input data. This system is expected to provide convenient help for VIP to get familiar with others, and make an access for them to recognize people when the system is trained enough.

Biometric identification technology replaces traditional security technology, which has become a trend, and gait recognition also has become a hot spot of research because its feature is difficult to imitate and theft. This paper presents a gait recognition system based on integral outline of human body. The system has three important aspects: the preprocessing of gait image, feature extraction and classification. Finally, using a method of polling to evaluate the performance of the system, and summarizing the problems existing in the gait recognition and the direction of development in the future.

This paper presents novel approach to the recognition of mammograms. The analyzed mammograms represent the normal and breast cancer (benign and malignant) cases. The solution applies the deep learning technique in image recognition. To obtain increased accuracy of classification the nonnegative matrix factorization and statistical self-similarity of images are applied. The images reconstructed by using these two approaches enrich the data base and thanks to this improve of quality measures of mammogram recognition (increase of accuracy, sensitivity and specificity). The results of numerical experiments performed on large DDSM data base containing more than 10000 mammograms have confirmed good accuracy of class recognition, exceeding the best results reported in the actual publications for this data base.

Descriptor is the key of any image-based recognition algorithm. For ear recognition, conventional descriptors are either based on 2D data or 3D data. 2D images provide rich texture information and human ear is a 3D surface that could offer shape information. It also inspires us that 2D data is more robust against occlusion while 3D data shows more robustness against illumination variation and pose variation. In this paper, we introduce a novel Texture and Depth Scale Invariant Feature Transform (TDSIFT) descriptor to encode 2D and 3D local features for ear recognition. Compared to the original Scale Invariant Feature Transform (SIFT) descriptor, the proposed TDSIFT shows its superiority by fusing 2D local information and 3D local information. Firstly, keypoints are detected and described on texture images. Then, 3D information of the keypoints located on the corresponding depth images is added to form the TDSIFT descriptor. Finally, a local feature based classification algorithm is adopted to identify ear samples by TDSIFT. Experimental results on a benchmark dataset demonstrate the feasibility and effectiveness of our proposed descriptor. The rank-1 recognition rate achieved on a gallery of 415 persons is 95.9% and the time involved in the computation is satisfactory compared to state-of-the-art methods.

Fall prevention and detection system have to subjugate many challenges in order to develop an efficient those system. Some of the difficult problems are obtrusion, occlusion and overlay in vision based system. Other associated issues are privacy, cost, noise, computation complexity and definition of threshold values. Estimating human motion using vision based usually involves with partial overlay, caused either by direction of view point between objects or body parts and camera, and these issues have to be taken into consideration. This paper proposes the use of dynamic threshold based and bounding box posture analysis method with multiple Kinect cameras setting for human posture analysis and fall detection. The proposed work only uses two Kinect cameras for acquiring distributed values and differentiating activities between normal and falls. If the peak value of head velocity is greater than the dynamic threshold value, bounding box posture analysis will be used to confirm fall occurrence. Furthermore, information captured by multiple Kinect placed in right angle will address the skeleton overlay problem due to single Kinect. This work contributes on the fusion of multiple Kinect based skeletons, based on dynamic threshold and bounding box posture analysis which is the only research work reported so far.

We present a spine arch analysis method in dairy cows using overhead 3D video data. This method is aimed for early stage lameness detection. That is important in order to allow early treatment; and thus, reduce the animal suffering and minimize the high forecasted financial losses, caused by lameness. Our physical data collection setup is non-intrusive, covert and designed to allow full automation; therefore, it could be implemented on a large scale or daily basis with high accuracy. We track the animal’s spine using shape index and curvedness measure from the 3D surface as she walks freely under the 3D camera. Our spinal analysis focuses on the thoracic vertebrae region, where we found most of the arching caused by lameness. A cubic polynomial is fitted to analyze the arch and estimate the locomotion soundness. We have found more accurate results by eliminating the regular neck/head movements’ effect from the arch. Using 22-cow data set, we are able to achieve an early stage lameness detection accuracy of 95.4%.

In animal behavior research, the main task of observing the behavior of an animal is usually done manually. The measurement of the trajectory of an animal and its real-time posture description is often omitted due to the lack of automatic computer vision tools. Even though there are many publications for pose estimation, few are efficient enough to apply in real-time or can be used without the machine learning algorithm to train a classifier from mass samples. In this paper, we propose a novel strategy for the real-time lobster posture estimation to overcome those difficulties. In our proposed algorithm, we use the Gaussian mixture model (GMM) for lobster segmentation. Then the posture estimation is based on the distance transform and skeleton calculated from the segmentation. We tested the algorithm on a serials lobster videos in different size and lighting conditions. The results show that our proposed algorithm is efficient and robust under various conditions.

In this paper, we propose a novel feature extraction method for face recognition based on two dimensional fractional Fourier transform (2D-FrFT). First, we extract the phase information of facial image in 2D-FrFT, which is called the generalized phase spectra (GPS). Then, we present an improved two-dimensional separability judgment (I2DSJ) to select appropriate order parameters for discrete fractional Fourier transform. Finally, multiple orders’ generalized phase spectrum bands (MGPSB) fusion is proposed. In order to make full use of the discriminative information from different orders for face recognition, the proposed approach merges different orders’ generalized phase spectra (GPS) of 2D-FrFT. The proposed method is no need to construct the subspace through the feature extraction methods and has less computation cost. Experimental results on the public face databases demonstrate that our method outperforms the representative methods.

We present in this paper a new approach for Arabic sign language (ArSL) alphabet recognition using hand gesture analysis. This analysis consists in extracting a histogram of oriented gradient (HOG) features from a hand image and then using them to generate an SVM Models. Which will be used to recognize the ArSL alphabet in real-time from hand gesture using a Microsoft Kinect camera. Our approach involves three steps: (i) Hand detection and localization using a Microsoft Kinect camera, (ii) hand segmentation and (iii) feature extraction using Arabic alphabet recognition. One each input image first obtained by using a depth sensor, we apply our method based on hand anatomy to segment hand and eliminate all the errors pixels. This approach is invariant to scale, to rotation and to translation of the hand. Some experimental results show the effectiveness of our new approach. Experiment revealed that the proposed ArSL system is able to recognize the ArSL with an accuracy of 90.12%.

A different approach of sign language recognition of static and dynamic hand movements was developed in this study using normalized correlation algorithm. The goal of this research was to translate fingerspelling sign language into text using MATLAB and Microsoft Kinect. Digital input image captured by Kinect devices are matched from template samples stored in a database. This Human Computer Interaction (HCI) prototype was developed to help people with communication disability to express their thoughts with ease. Frame segmentation and feature extraction was used to give meaning to the captured images. Sequential and random testing was used to test both static and dynamic fingerspelling gestures. The researchers explained some factors they encountered causing some misclassification of signs.

This research explored the creation of a model to detect emotion from Filipino songs. The emotion model used was based from Paul Ekman’s six basic emotions. The songs were classified into the following genres: kundiman, novelty, pop, and rock. The songs were annotated by a group of music experts based on the emotion the song induces to the listener. Musical features of the songs were extracted using jAudio while the lyric features were extracted by Bag-of- Words feature representation. The audio and lyric features of the Filipino songs were extracted for classification by the chosen three classifiers, Naïve Bayes, Support Vector Machines, and k-Nearest Neighbors. The goal of the research was to know which classifier would work best for Filipino music. Evaluation was done by 10-fold cross validation and accuracy, precision, recall, and F-measure results were compared. Models were also tested with unknown test data to further determine the models’ accuracy through the prediction results.

Disasters such as typhoons, tornadoes, and earthquakes are inevitable. Aftermaths of these disasters include the missing people. Using robots with human detection capabilities to locate the missing people, can dramatically reduce the harm and risk to those who work in such circumstances. This study aims to: design and build a tele-operated robot; implement in MATLAB an algorithm for the detection of humans; and create a database of human identification based on various positions, angles, light intensity, as well as distances from which humans will be identified. Different light intensities were made by using Photoshop to simulate smoke, dust and water drops conditions. After processing the image, the system can indicate either a human is detected or not detected. Testing with bodies covered was also conducted to test the algorithm’s robustness. Based on the results, the algorithm can detect humans with full body shown. For upright and lying positions, detection can happen from 8 feet to 20 feet. For sitting position, detection can happen from 2 feet to 20 feet with slight variances in results because of different lighting conditions. The distances greater than 20 feet, no humans can be processed or false negatives can occur. For bodies covered, the algorithm can detect humans in cases made under given circumstances. On three positions, humans can be detected from 0 degrees to 180 degrees under normal, with smoke, with dust, and with water droplet conditions. This study was able to design and build a tele-operated robot with MATLAB algorithm that can detect humans with an overall precision of 88.30%, from which a database was created for human identification based on various conditions, where humans will be identified.

As possible active sites, the concave and convex feature regions of the molecule are the locations where the molecular docking will happen more possibly. Then how to search for those regions is valuable to study. In this paper, a new method is proposed for identifying concave and convex regions. Based on the established spherical mapping between molecular surfaces and its bounding-sphere surfaces, the concave and convex vertices of local areas can be determined according to the expansion distance defined by the spherical mapping. Then through mesh growing, a feature region can be firmed by a concave point or a convex point, also called center point, and its neighboring faces, whose normal vector has an angle in a specified range with the center point. After that, areas and volumes of feature regions are calculated. The experimental results indicate that the method can well identify the concave and convex characteristics of the molecule.

This research is about translating series of hand gesture to form a word and produce its equivalent sound on how it is read and said in Filipino accent using Support Vector Machine and Mel Frequency Cepstral Coefficient analysis. The concept is to detect Filipino speech input and translate the spoken words to their text form in Filipino. This study is trying to help the Filipino deaf community to impart their thoughts through the use of hand gestures and be able to communicate to people who do not know how to read hand gestures. This also helps literate deaf to simply read the spoken words relayed to them using the Filipino speech to text system.

This paper shows a technique based on CHT (Circle Hough Transform) to achieve the optical Braille recognition (OBR). Unlike other papers developed around the same topic, this one is made by using Hough Transform to process the recognition and transcription of Braille cells, proving CHT to be an appropriate technique to go over different non-systematics factors who can affect the process, as the paper type where the text to traduce is placed, some lightning factors, input image resolution and some flaws derived from the capture process, which is realized using a scanner. Tests are performed with a local database using text generated by visual nondisabled people and some transcripts by sightless people; all of this with the support of National Institute for Blind People (INCI for their Spanish acronym) placed in Colombia.

The 1-D mapping is an intensity-based method used to estimate a projective transformation between two images. However, it lacks an intensity-invariant criterion for deciding whether two images can be aligned or not. The paper proposes a novel decision criterion and, thus, develops an error-detective 1-D mapping method. First, a multiple 1-D mapping scheme is devised for yielding redundant estimates of an image transformation. Then, a voting scheme is proposed for verifying these multiple estimates, in which at least one estimate without receiving all the votes is taken as a decision criterion for false-match rejection. Based on the decision criterion, an error-detective 1-D mapping algorithm is also constructed. Finally, the proposed algorithm is evaluated in registering real image pairs with a large range of projective transformations.

The scale-invariant feature transform (SIFT) algorithm is devised to detect keypoints via the difference of Gaussian (DoG) images. However, the DoG data lacks the high-frequency information, which can lead to a performance drop of the algorithm. To address this issue, this paper proposes a novel log-polar feature detector (LPFD) to detect scale-invariant blubs (keypoints) in log-polar space, which, in contrast, can retain all the image information. The algorithm consists of three components, viz. keypoint detection, descriptor extraction and descriptor matching. Besides, the algorithm is evaluated in detecting keypoints from the INRIA dataset by comparing with the SIFT algorithm and one of its fast versions, the speed up robust features (SURF) algorithm in terms of three performance measures, viz. correspondences, repeatability, correct matches and matching score.

Activity-dependent changes in the synaptic connections of the brain are tightly related to learning and memory. Previous studies have shown that essentially all new synaptic contacts were made by adding new partners to existing synaptic elements. To further explore synaptic dynamics in specific pathways, concurrent imaging of pre and postsynaptic structures in identified connections is required. Consequently, considerable attention has been paid for the automated detection of axonal boutons. Different from most previous methods proposed in vitro data, this paper considers a more practical case in vivo neuron images which can provide real time information and direct observation of the dynamics of a disease process in mouse. Additionally, we present an automated approach for detecting axonal boutons by starting with deconvolving the original images, then thresholding the enhanced images, and reserving the regions fulfilling a series of criteria. Experimental result in vivo two-photon imaging of mouse demonstrates the effectiveness of our proposed method.

Underwater images are blurred due to light scattering and absorption. Image restoration is therefore important in many underwater research and practical tasks. In this paper, we propose an effective two-stage method to restore underwater scene images. Based on an underwater light propagation model, we first remove backscatter by fitting a binary quadratic function. Then we eliminate the forward scattering and non-uniform lighting attenuation using blue-green dark channel prior. The proposed method requires no additional calibration and we show its effectiveness and robustness by restoring images captured under various underwater scenes.

Recent medical virtual reality (VR) applications to minimize re-operations are being studied for improvements in surgical efficiency and reduction of operation error. The CT image acquisition method considering three-dimensional (3D) modeling for medical VR applications is important, because the realistic model is required for the actual human organ. However, the research for medical VR applications has focused on 3D modeling techniques and utilized 3D models. In addition, research on a CT image acquisition method considering 3D modeling has never been reported. The conventional CT image acquisition method involves scanning a limited area of the lesion for the diagnosis of doctors once or twice. However, the medical VR application is required to acquire the CT image considering patients’ various postures and a wider area than the lesion. A wider area than the lesion is required because of the necessary process of comparing bilateral sides for dyskinesia diagnosis of the shoulder, pelvis, and leg. Moreover, patients’ various postures are required due to the different effects on the musculoskeletal system. Therefore, in this paper, we perform a comparative experiment on the acquired CT images considering image area (unilateral/bilateral) and patients’ postures (neutral/abducted). CT images are acquired from 10 patients for the experiments, and the acquired CT images are evaluated based on the length per pixel and the morphological deviation. Finally, by comparing the experiment results, we evaluate the CT image acquisition method for medical VR applications.

The use of fisheye image stitching is a popular method to produce panoramic images rapidly. A fisheye lens with a large angle can reduce the number of times of image acquisition, but distortion makes the registration of images difficult. As a key determinant of the effect of fisheye image mosaic quality, the estimation of external parameters of images has become a core issue in panorama generation. Previously established methods require additional measurement devices or are only suitable for specific scenarios. In this study, we develop an image mosaic method. A large-angle fisheye lens is adopted for conformal projection and spherical matching. First, to facilitate the search for corresponding corners, the source images are rotated by 90°. Then, conformal projection transformation is utilized to present the feature structures of the overlap area of two images in a consistent manner. Second, the searched corner points are projected onto the unit sphere, and the motion parameters are estimated with the direct linear transform method. Experimental results show that our method can efficiently complete image registration with a large angle between fisheye images. Hence, a full-view panoramic image of 360°×180° can be obtained with the use of two fisheye cameras with an angle of more than 180°.

In this paper, in order to classify liver cirrhosis on regions of interest (ROIs) images from B-mode ultrasound images, we have proposed to use the higher order local autocorrelation (HLAC) features. In a previous study, we tried to classify liver cirrhosis by using a Gabor filter based approach. However, the classification performance of the Gabor feature was poor from our preliminary experimental results. In order accurately to classify liver cirrhosis, we examined to use the HLAC features for liver cirrhosis classification. The experimental results show the effectiveness of HLAC features compared with the Gabor feature. Furthermore, by using a binary image made by an adaptive thresholding method, the classification performance of HLAC features has improved.

Gray Level Co-occurrence Matrix (GLCM) is one of the main techniques for texture analysis that has been widely used in many applications. Conventional GLCMs usually focus on two-dimensional (2D) image texture analysis only. However, a three-dimensional (3D) image volume requires specific texture analysis computation. In this paper, an extended 2D to 3D GLCM approach based on the concept of multiple 2D plane positions and pixel orientation directions in the 3D environment is proposed. The algorithm was implemented by breaking down the 3D image volume into 2D slices based on five different plane positions (coordinate axes and oblique axes) resulting in 13 independent directions, then calculating the GLCMs. The resulted GLCMs were averaged to obtain normalized values, then the 3D texture features were calculated. A preliminary examination was performed on a 3D image volume (64 x 64 x 64 voxels). Our analysis confirmed that the proposed technique is capable of extracting the 3D texture features from the extended GLCMs approach. It is a simple and comprehensive technique that can contribute to the 3D image analysis.

In this paper, we propose two new problems related to classification of photographed document images, and based on deep learning methods, present the baseline solutions for these two problems. The first problem is that, for some photographed document images, which book do they belong to? The second one is, for some photographed document images, what is the type of the book they belong to? To address these two problems, we apply “AexNet” to the collected document images. Using the pre-trained “AlexNet” on the ImageNet data set directly, we obtain 92.57% accuracy for the book-name classification and 93.33% accuracy for the book-type one. After fine-tuning on the training set of the photographed document images, the accuracy of the book-name classification increases to 95.54% and that of the booktype one to 95.42%. To our best knowledge, although there exist many image classification algorithm, no previous work has targeted to these two challenging problems. In addition, the experiments demonstrate that deep-learning features outperform features extracted with traditional image descriptors on these two problems.

This paper presents a new data compilation of the image transformation base on the series of the trace transform. The advantage of this new compilation is to solve the noise problem that usually appears in the pattern recognition. Submicro pattern analysis is employ to encode the series of the trace transform from a image which organizes by the shift-invariant sub-micro pattern scheme (SiSMP). Then, all data will sum to the final result by 2-D histogram with the Discriminant Feature Transform. The experiments of our approach show that the new compilation can increase the performance of the recognition compare with the LBP technique by using Brodatz texture database.

Pyramid Histogram of Words (PHOW), combined Bag of Visual Words (BoVW) with the spatial pyramid matching (SPM) in order to add location information to extracted features. However, different PHOW extracted from various color spaces, and they did not extract color information individually, that means they discard color information, which is an important characteristic of any image that is motivated by human vision. This article, concatenated PHOW Multi-Scale Dense Scale Invariant Feature Transform (MSDSIFT) histogram and a proposed Color histogram to improve the performance of existing image classification algorithms. Performance evaluation on several datasets proves that the new approach outperforms other existing, state-of-the-art methods.

Multi-label image annotation (MIA) has been widely studied during recent years and many MIA schemes have been proposed. However, the most existing schemes are not satisfactory. In this paper, an improved multiple kernel learning (IMKL) method of support vector machine (SVM) is proposed to improve the classification accuracy of SVM, then a novel MIA scheme based on IMKL is presented, which uses the discriminant loss to control the number of top semantic labels, and the feature selection approach is also used for improving the performance of MIA. The experiment results show that proposed MIA scheme achieves higher the performance than the existing other MIA schemes, its performance is satisfactory for large image dataset.

Accurate information extraction from images can only be realised if the data is blur free and contains no artificial artefacts. In astronomical images, apart from hardware limitations, biases are introduced by phenomena beyond control such as atmospheric turbulence. The induced blur function does vary in both time and space depending on the astronomical “seeing” conditions as well as the wavelengths being recorded. Multi-frame blind image deconvolution attempts to recover a sharp latent image from an image sequence of blurry and noisy observations without knowledge of the blur applied to each image within the recorded sequence. Finding a solution to this inverse problem that estimates the original scene from convolved data is a heavily ill-posed problem. In this paper we describe a novel multi-frame blind deconvolution algorithm, that performs image restoration by recovering the frequency and phase information of the latent sharp image in two separate steps. For every given image in the sequence a point-spread function (PSF) is estimated that allows iterative refinement of our latent sharp image estimate. The datasets generated for testing purposes assume Moffat or complex Kolmogorov blur kernels. The results from our implemented prototype are promising and encourage further research.

In this paper we propose a technique for obtaining a high resolution (HR) image from a single low resolution (LR) image -using joint learning dictionary - on the basis of image statistic research. It suggests that with an appropriate choice of an over-complete dictionary, image patches can be well represented as a sparse linear combination. Medical imaging for clinical analysis and medical intervention is being used for creating visual representations of the interior of a body, as well as visual representation of the function of some organs or tissues (physiology). A number of medical imaging techniques are in use like MRI, CT scan, X-rays and Optical Coherence Tomography (OCT). OCT is one of the new technologies in medical imaging and one of its uses is in ophthalmology where it is being used for analysis of the choroidal thickness in the eyes in healthy and disease states such as age-related macular degeneration, central serous chorioretinopathy, diabetic retinopathy and inherited retinal dystrophies. We have proposed a technique for enhancing the OCT images which can be used for clearly identifying and analyzing the particular diseases. Our method uses dictionary learning technique for generating a high resolution image from a single input LR image. We train two joint dictionaries, one with OCT images and the second with multiple different natural images, and compare the results with previous SR technique. Proposed method for both dictionaries produces HR images which are comparatively superior in quality with the other proposed method of SR. Proposed technique is very effective for noisy OCT images and produces up-sampled and enhanced OCT images.

The tools developed by the School of geostatistical have many applications for image segmentation . First, it is very suited to the analysis of natural images eg from remote sensing images and medical images. secondly, they are less expensive in time calculation, as can the methods, from Fourier analysis or matrices coocurrences. We offer reviews of various works of authors to segment natural textures.

The finite mixture model based on the Gaussian distribution is a flexible and powerful tool to address image segmentation. However, in the case of ultrasound images, the intensity distributions are non-symmetric whereas the Gaussian distribution is symmetric. In this study, a new finite bounded Rayleigh distribution is proposed. One advantage of the proposed model is that Rayleigh distribution is non-symmetric which has ability to fit the shape of medical ultrasound data. Another advantage is that each component of the proposed model is suitable for the ultrasound image segmentation. We also apply the bounded Rayleigh mixture model in order to improve the accuracy and to reduce the computational time. Experiments show that the proposed model outperforms the state-of-art methods on time consumption and accuracy.

Mammography is currently the most effective imaging modality used by radiologists for the screening of breast cancer. Segmentation is one of the key steps in the process of developing anatomical models for calculation of safe medical dose of radiation. This paper explores the potential of the statistical region merging segmentation technique for Breast segmentation in digital mammograms. First, the mammograms are pre-processing for regions enhancement, then the enhanced images are segmented using SRM with multi scales, finally these segmentations are combined for region of interest (ROI) separation and edge detection. The proposed algorithm uses multi-scales region segmentation in order to: separate breast region from background region, region edge detection and ROIs separation. The experiments are performed using a data set of mammograms from different patients, demonstrating the validity of the proposed criterion. Results show that, the statistical region merging segmentation algorithm actually can work on the segmentation of medical image and more accurate than another methods. And the outcome shows that the technique has a great potential to become a method of choice for segmentation of mammograms.

An Omega-3 chicken egg is a chicken egg produced through food engineering technology. It is produced by hen fed with high omega-3 fatty acids. So, it has fifteen times nutrient content of omega-3 higher than Leghorn’s. Visually, its shell has the same shape and colour as Leghorn’s. Each egg can be distinguished by breaking the egg’s shell and testing the egg yolk’s nutrient content in a laboratory. But, those methods were proven not effective and efficient. Observing this problem, the purpose of this research is to make an application to detect the type of omega-3 chicken egg by using a mobile-based computer vision. This application was built in OpenCV computer vision library to support Android Operating System. This experiment required some chicken egg images taken using an egg candling box. We used 60 omega-3 chicken and Leghorn eggs as samples. Then, using an Android smartphone, image acquisition of the egg was obtained. After that, we applied several steps using image processing methods such as Grab Cut, convert RGB image to eight bit grayscale, median filter, P-Tile segmentation, and morphology technique in this research. The next steps were feature extraction which was used to extract feature values via mean, variance, skewness, and kurtosis from each image. Finally, using digital image measurement, some chicken egg images were classified. The result showed that omega-3 chicken egg and Leghorn egg had different values. This system is able to provide accurate reading around of 91%.

Postsurgical wound care has a great impact on patients' prognosis. It often takes few days, even few weeks, for the wound to stabilize, which incurs a great cost of health care and nursing resources. To assess the wound condition and diagnosis, it is important to segment out the wound region for further analysis. However, the scenario of this strategy often consists of complicated background and noise. In this study, we propose a wound segmentation algorithm based on Canny edge detector and genetic algorithm with an unsupervised evaluation function. The results were evaluated by the 112 clinical images, and 94.3% of images were correctly segmented. The judgment was based on the evaluation of experimented medical doctors. This capability to extract complete wound regions, makes it possible to conduct further image analysis such as intelligent recovery evaluation and automatic infection requirements.

In this paper, a nonlinear least square twin support vector machine (NLSTSVM) with the integration of active contour model (ACM) is proposed for noisy image segmentation. Efforts have been made to seek the kernel-generated surfaces instead of hyper-planes for the pixels belonging to the foreground and background, respectively, using the kernel trick to enhance the performance. The concurrent self organizing maps (SOMs) are applied to approximate the intensity distributions in a supervised way, so as to establish the original training sets for the NLSTSVM. Further, the two sets are updated by adding the global region average intensities at each iteration. Moreover, a local variable regional term rather than edge stop function is adopted in the energy function to ameliorate the noise robustness. Experiment results demonstrate that our model holds the higher segmentation accuracy and more noise robustness.

Automatic segmentation of Left Ventricle (LV) is an essential task in the field of computer-aided analysis of cardiac function. In this paper, a simplified pulse coupled neural network (SPCNN) based approach is proposed to segment LV endocardium automatically. Different from the traditional image-driven methods, the SPCNN based approach is independent of the image gray distribution models, which makes it more stable. Firstly, the temporal and spatial characteristics of the cardiac magnetic resonance image are used to extract a region of interest and to locate LV cavity. Then, SPCNN model is iteratively applied with an increasing parameter to segment an optimal cavity. Finally, the endocardium is delineated via several post-processing operations. Quantitative evaluation is performed on the public database provided by MICCAI 2009. Over all studies, all slices, and two phases (end-diastole and end-systole), the average percentage of good contours is 91.02%, the average perpendicular distance is 2.24 mm and the overlapping dice metric is 0.86.These results indicate that the proposed approach possesses high precision and good competitiveness.

Since handwritten text lines are generally skewed and not obviously separated, text line segmentation of handwritten document images is still a challenging problem. In this paper, we propose a novel text line segmentation algorithm based on the spectral clustering. Given a handwritten document image, we convert it to a binary image first, and then compute the adjacent matrix of the pixel points. We apply spectral clustering on this similarity metric and use the orthogonal kmeans clustering algorithm to group the text lines. Experiments on Chinese handwritten documents database (HIT-MW) demonstrate the effectiveness of the proposed method.

This paper proposes a layered approach to improve the embedding capacity of the existing pixel-value differencing (PVD) methods for image steganography. Specifically, one of the PVD methods is applied to embed a secret information into a cover image and the resulting image, called stego-image, is used to embed additional secret information by the same or another PVD method. This results in a double-layered stego-image. Then, another PVD method can be applied to the double-layered stego-image, resulting in a triple-layered stego-image. Likewise, multi-layered stego-images can be obtained. To successfully recover the secret information hidden in each layer, the embedding process is carefully designed. In the experiment, the proposed layered PVD method proved to be effective.

In this work, a fingerprint spoof detection method using an extended feature, namely Wavelet-based Local Binary Pattern (Wavelet-LBP) is introduced. Conventional wavelet-based methods calculate wavelet energy of sub-band images as the feature for discrimination while we propose to use Local Binary Pattern (LBP) operation to capture the local appearance of the sub-band images instead. The fingerprint image is firstly decomposed by two-dimensional discrete wavelet transform (2D-DWT), and then LBP is applied on the derived wavelet sub-band images. Furthermore, the extracted features are used to train Support Vector Machine (SVM) classifier to create the model for classifying the fingerprint images into genuine and spoof. Experiments that has been done on Fingerprint Liveness Detection Competition (LivDet) datasets show the improvement of the fingerprint spoof detection by using the proposed feature.

Lens flare effects in various photo and camera software nowadays can partially or fully damage the watermark information within the watermarked image. We propose in this paper a spatial domain based image watermarking against lens flare effects. The watermark embedding is based on the modification of the saturation color component in HSV color space of a host image. For watermark extraction, a homomorphic filter is used to predict the original embedding component from the watermarked component, and the watermark is blindly recovered by differentiating both components. The watermarked image’s quality is evaluated by wPSNR, while the extracted watermark’s accuracy is evaluated by NC. The experimental results against various types of lens flare effects from both computer software and mobile application showed that our proposed method outperformed the previous methods.

Indoor space 3D visual reconstruction has many applications and, once done accurately, it enables people to conduct different indoor activities in an efficient manner. For example, an effective and efficient emergency rescue response can be accomplished in a fire disaster situation by using 3D visual information of a destroyed building. Therefore, an accurate Indoor Space 3D visual reconstruction system which can be operated in any given environment without GPS has been developed using a Human-Operated mobile cart equipped with a laser scanner, CCD camera, omnidirectional camera and a computer. By using the system, accurate indoor 3D Visual Data is reconstructed automatically. The obtained 3D data can be used for rescue operations, guiding blind or partially sighted persons and so forth.

In optical flow for motion allocation, the efficient result in Motion Vector (MV) is an important issue. Several noisy conditions may cause the unreliable result in optical flow algorithms. We discover that many classical optical flows algorithms perform better result under noisy condition when combined with modern optimized model. This paper introduces effective robust models of optical flow by using Robust high reliability spatial based optical flow algorithms using the adaptive Lorentzian norm influence function in computation on simple spatial temporal optical flows algorithm. Experiment on our proposed models confirm better noise tolerance in optical flow’s MV under noisy condition when they are applied over simple spatial temporal optical flow algorithms as a filtering model in simple frame-to-frame correlation technique. We illustrate the performance of our models by performing an experiment on several typical sequences with differences in movement speed of foreground and background where the experiment sequences are contaminated by the additive white Gaussian noise (AWGN) at different noise decibels (dB). This paper shows very high effectiveness of noise tolerance models that they are indicated by peak signal to noise ratio (PSNR).

The high spatial resolution images are ultimately demanded due to the requirement of the advance digital signal processing (DSP) and digital image processing (DIP) in modern implementations thereby the image spatial enhancements, especially for an ultra-rate spatial enhanced rate, have been ultimately investigated in the DSP and DIP society in the last twenty five years. The ultra-rate spatial enhancement employed by MSRR with Huber ML (Maximum Likelihood) regularization technique and SSRR with Huber high-spectrum expectation is proposed for enhancing upto 16x spatial rate in this paper. Initially, the collection of low spatial resolution images with noise is processed by MSRR for attenuating the noise and enhancing the spatial resolution. Later, the enhanced image is processed by SSRR for calculating the high-spectrum information in order to reconstruct the extortionate spatial enhancement with 16x spatial enhanced rate. In the performance evaluation section, the simulated consequences of the proposed ultra-rate spatial enhancement are compared with other previous state-of-art (such as a bicubic interpolation technique, a classical MSRR and a classical SSRR) in both PSNR (Peak Signal to Noise Ratio) and virtual quality attitude. From the performance evaluation consequence of four noise types at many noise powers, the proposed ultra-rate spatial enhancement has a superior performance than other previous state-of-art.

Remote eye trackers with consumer price have been used for various applications on flat computer screen. On the other hand, 3D gaze tracking in physical environment has been useful for visualizing gaze behavior, robots controller, and assistive technology. Instead of using affordable remote eye trackers, 3D gaze tracking in physical environment has been performed using corporate-level head mounted eye trackers, limiting its practical usage to niche user. In this research, we propose a novel method to estimate 3D gaze using consumer-level remote eye tracker. We implement geometric approach to obtain 3D point of gaze from binocular lines-of-sight. Experimental results show that the proposed method yielded low errors of 3.47±3.02 cm, 3.02±1.34 cm, and 2.57±1.85 cm in X, Y , and Z dimensions, respectively. The proposed approach may be used as a starting point for designing interaction method in 3D physical environment.

In this paper, we introduce an idea of content-adaptive sparse reconstruction to achieve optimized magnification quality for those down sampled video frames, to which two stages of pruning are applied to select the closest correlated images for construction of an over-complete dictionary and drive the sparse representation of its enlarged frame. In this way, not only the sampling and dictionary training process is accelerated and optimized in accordance with the input frame content, but also an add-on video compression codec can be further developed by applying such scheme as a preprocessor to any standard video compression algorithm. Our extensive experiments illustrate that (i) the proposed content-adaptive sparse reconstruction outperforms the existing benchmark in terms of super-resolution quality; (ii) When applied to H.264, one of the international video compression standards, the proposed add-on video codec can achieve three times more compression while maintaining competitive decoding quality.

In this paper a sample-adaptive prediction technique is proposed to yield efficient coding performance in an intracoding for screen content video coding. The sample-based prediction is to reduce spatial redundancies in neighboring samples. To this aim, the proposed technique uses a weighted linear combination of neighboring samples and applies the robust optimization technique, namely, ridge estimation to derive the weights in a decoder side. The ridge estimation uses L₂ norm based regularization term, and, thus the solution is more robust to high variance samples such as in sharp edges and high color contrasts exhibited in screen content videos. It is demonstrated with the experimental results that the proposed technique provides an improved coding gain as compared to the HEVC screen content video coding reference software.

For Dynamic Vision Sensors (DVS), thermal noise and junction leakage current induced Background Activity (BA) is the major cause of the deterioration of images quality. Inspired by the smoothing filtering principle of horizontal cells in vertebrate retina, A DVS pixel with Neighbor Pixel Communication (NPC) filtering structure is proposed to solve this issue. The NPC structure is designed to judge the validity of pixel’s activity through the communication between its 4 adjacent pixels. The pixel’s outputs will be suppressed if its activities are determined not real. The proposed pixel’s area is 23.76×24.71μm2 and only 3ns output latency is introduced. In order to validate the effectiveness of the structure, a 5×5 pixel array has been implemented in SMIC 0.13μm CIS process. 3 test cases of array’s behavioral model show that the NPC-DVS have an ability of filtering the BA.