Yide Ma

Bio: Yide Ma is an academic researcher from Lanzhou University. The author has contributed to research in topics: Evolutionary computation & Iris recognition. The author has an hindex of 1, co-authored 4 publications receiving 17 citations.

Accurate Iris Location Based on Region of Interest

Abstract: Iris location is an essential module in iris recognition. Traditional iris location methods involve a large range of search, which is computation wasting and sensitive to noise. And these methods adopt circular template to locate the pupillary boundary. It may not accurately describe the pupillary actual boundary and bring the error for the following feature extraction and recognition. To address these problems, this paper presents an algorithm of accurate iris location based on region of interest for improving the accuracy of iris location. At first, according to the feature of approximate concentric circles of iris inner and outer boundaries, the Region of Interest (ROI) only containing the complete iris information can be automatically extracted from an original iris image by Histograms of Oriented Gradients (HOG) to get the statistical information of direction and gradient of an iris image and then the information is taken into Support Vector Machines (SVM) for training and the SVM decision function is gotten. It can eliminate the sensitive noise and reduce the amount of calculation when reserving the useful information as much as possible. Then the iris inner boundary is located roughly by using minimum average gray method, on the basis of this, the annular region is mapped on the rectangular region for the iris inner boundary accurate detection. At last, the iris outer boundary is confirmed by using the improved J.Daugman circle differential algorithm. Experimental results show that the proposed algorithm can efficiently improve the accuracy of iris location.

An Efficient Contour Tracking and Coding Algorithm Based on Vertex Chain Code

Abstract: Based on analysis of contours of irregular region, and according to the characteristic that massive continuous code and the same specific code combination are usually contained in a region boundary's vertex chain code, a new effective contour tracking algorithm and representation method based on the pixel vertex matrix is proposed. Moreover, we re-encoding the new vertex chain code using a Huffman coding strategy and then select the more compressed result as the output. The results showed that the new method could effectively reduce code stream for contours, hence increase the compression ratio of the image.

The Program Modeling and Simulation of Cellular Function Expression

Abstract: Based on the gene expression process through two stages:transcripts and translation, and such a fact that embryonic stem cell must be division and differentiation, this paper used the reflection-based object-oriented programming skills to simulate the gene expression, cell division and differentiation process. Then through the logic analysis the following hypothesis was proposed: the DNA molecular chain is a program coding sequence, similar to the modern computer program coding sequence that contains abstract data code and corresponding control instruction code. The paper used analogy analysis and simulation method, and the life phenomenon and computer process, genome code sequences and computer program code sequences were compared, then their common properties were abstracted and analyzed, and some computer programs were designed to simulate the cellular function expression and other key procedure. From the simulation results, it can be seen that the genetic code’s working mechanism in cells is similar to the Java program working mechanism in computers, and the life phenomena and computer processes are in line with the principle of program (ordered set of instructions) execution. From the perspective of program, the DNA code sequences and the life phenomena were studied to understand the structure of the genetic code and the cell’s working mechanism. It was pointed out how to qualitative the relationship of DNA code, RNA code and protein code in the program perspective.

Programmed Interpretation of the Life Evolution and Computer Simulation

Abstract: Start from analyzing Lamarckian theory of evolution and Darwin's theory of evolution, combined with modern evolutionary theory and genetics knowledge, we will find that DNA is the key material of the genetics and evolution. Based on the fact that DNA is the key material of the propagation and evolution in all organisms, the paper proposed a hypothesis that DNA molecular chain in living organisms is a program code sequence which stores the opcode and the operand. Life is macroscopic showing presented by the program code in running status, as a computer process. And using EPM (Evolutionary Programming Model) to design a series simulation program to simulate and demonstrate the principle as well as the process of DNA molecular chain changed in the life evolution. From the program model to look at the phenomenon of biological evolution, both Lamarck's theory and Darwin's theory have its program realization foundation, and the modern comprehensive evolution theory also accord with the characteristics of cooperative coevolution programs.

Molecular Biology of the Gene.

Abstract: No wonder you activities are, reading will be always needed. It is not only to fulfil the duties that you need to finish in deadline time. Reading will encourage your mind and thoughts. Of course, reading will greatly develop your experiences about everything. Reading molecular biology of the gene is also a way as one of the collective books that gives many advantages. The advantages are not only for you, but for the other peoples with those meaningful benefits.

Simulating the Past for Understanding the Present. A Critical Review

Abstract: This introductory essay aims to introduce the chapters in the book presenting some aspects of the theoretical and conceptual framework necessary to consider the advantages computer simulation techniques and technologies offer to historical disciplines, but also quoting from the hundreds of examples in current scientific literature to give a context within which the individual contributions can be understood better. We argue that historical simulations should be much more than vivid illustrations of what scholars believe in the present existed in the past. A simulation is basically the computer representation of a “mechanism”, representing how social intentions, goals and behaviors were causally connected in the past. This can be done by formulating a “generative model”, that is, a model of a set of mechanisms. In this chapter, it is suggested that computer simulation may act as a Virtual Laboratory to help studying how human societies have experimented relevant transformations and in which way the consequences of those transformations in technology, activities, behavior, organization or knowledge were transmitted to other social agents or groups of social agents. Building artificial societies inside a computer allows us to understand that social reality is not capricious. It has been produced somehow, although not always the same cause produces the same effect, because social actions are not performed in isolation, but in complex and dialectical frameworks, which favor, prevent, or modify the capacity, propensity, or tendency the action has to produce or to determine a concrete effect. This way of studying social dynamics in the past by means of computer simulations is beginning to abandon its infancy. Archaeologists and historians have started to convert social theories in computer programs trying to simulate social process and experiment with different explanations about known archaeological societies. Our book is just one additional example of a current trend among archaeologists and historians: historical events occurred only once and many years ago but within a computer surrogates of those events can be artificially repeated here and now for understanding how and why they happened.

Iris location based on regional property and iterative searching

Abstract: Iris recognition is one of common biometric identification technologies, and an important part of iris recognition is iris location, whose precision directly affects the accuracy of iris recognition. Fitting the inner and outer edge of iris as an approximate circle is a common iris location method, which thereby can lead to fitting errors between the location result and the actual edge. In order to solve this problem, the paper proposes an iris location algorithm based on regional property and iterative searching. The pupil area is extracted using the regional attribute of the iris image, and the iris inner edge is fitted exactly by iterating, comparing and sorting the pupil edge points; then the outer edge location is completed in an iterative searching method on the basis of the extracted pupil centre and radius. The results of the experiment show that in this algorithm, more accurate iris inner edge location can be achieved and a range of comprehensive advantages of faster location speed and higher location accuracy are.

A new effective algorithm for iris location

Abstract: Iris location is an essential step and an important part in an iris recognition system. However, traditional iris location methods often involve a large space of search, which is calculation wasting and sensitive to noise. And these methods adopt circular orientation to locate the pupillary boundary; it may lead to inaccurate location result and influence the subsequent feature extraction and recognition. To address these problems, this paper presents a precise iris location algorithm based on Vector Field Convolution (VFC, an improved Snake model) to improve the accuracy of iris location. Firstly, obtaining the iris area completely include the inside and outside boundary from an original iris image, then using minimum average grey value method to determine initialization contour of VFC model automatically, so as to locate an iris inner boundary precisely under the internal and external force of active contour. At last, we adopt the improved Daugman algorithm to locate the iris outer boundary that relatively contains little texture information. Experimental results show that the location accuracy of this method is higher, the iris inner edge location is much closer to the real boundary, the result of location have been improved significantly.

Edge based selective encryption scheme for biometric data using chaotic theory

Abstract: Security of biometric data plays a major concern due to extensive use of biometric systems in many applications. This paper proposes an efficient method for encryption of iris images using edge based encryption algorithm based on chaotic theory. In this proposed technique, the iris image is segmented into significant and non significant blocks to find region of interest (ROI) i.e. to localize iris from complete eye image from which features are extracted to generate biometric template. Selective encryption is used to encrypt the region of interest and it reduces the computational overhead and processing time as compared to full encryption techniques. The experimental results prove that edge based selective encryption significantly reduces the time of encryption of iris images as compared to full encryption method without any compromise in performance. Performance of proposed algorithm has been experimentally analyzed using key sensitivity analysis and the results prove that the encryption algorithm has high key sensitivity and the algorithm is lossless in nature.