Journal of Modern Physics
Vol.4 No.1(2013), Article ID:26702,5 pages DOI:10.4236/jmp.2013.41005

Bifurcation and Pattern Recognition

Yehuda Roth

Oranim Academic College, Kiryat Tivon, Israel


Received November 6, 2012; revised December 7, 2012; accepted December 15, 2012

Keywords: Incoherence; Bifurcation and Re-Coherence


We propose a new approach in dealing with image recognition. We suggest that recognizing an image is related to the knowledge of a pure quantum state. Since most images are screened through incoherent photons, we introduce a method base on non-linear mapping iterations to regenerate coherence between the image photons.

1. Introduction

An image can possess a large amount of data. However, recognizing an image corresponds only with a single output. For example, face recognition describes a process for which all the face details are eventually integrated to form the single output, namely the face identification. The very fact that the face can have a single recognizing name indicates that indeed all the face details are now gathered under the same single identification.

There are mainly two physical versions for screening the same image: The frequent, for which the image emits mainly incoherent photons with a recognizable order. The photons data is then processed and integrated to form the single item recognition such as a known face. The second alternative is realized when the image is represented by a coherent light, meaning an interference pattern. In that case, all the image information is stored in a single state that according to quantum mechanics is a measurable quantity. Practically speaking, both the coherent and the incoherent photons can represent the same image although physically the representative photons’ structures are entirely different.

A coherent system is defined as being composed of coordinated parts such that the whole system can be considered and analyzed as a single entity. A face, for example, is composed of many details, yet, once it is recognized it can be treated as a single person face.

Let us assume that the image is represented by a coherent-photons-state. In this paper we suggest that recognizing an image is identified with revealing the appropriate state. Thus, an image which is already presented by coherent photons is easier to analyze. Moreover, in an ideal coherent light representation, revealing the state by a single measurement is sufficient to complete the whole recognition. Unfortunately, most observed images are realized by incoherent photons and therefore this direct measurement approach seems to be unpractical. Consequently, regardless of the image representation, coherent or incoherent, the recognition process should yield a coherent state, we introduce a re-coherence formalism which is associated with some recognition device (likewise the human brain). We show in that proposed formalism that coherence or incoherence photons that arrive to the device, always terminate as a coherent state, that is a recognized image.

Roughly speaking perception is the way reality is interpreted by the individual. Image recognition falls under this category since we identify image recognition as one of the perception skills. Since perception is only an interpretation of reality, there is no necessity for the recognized state to be identical with the original state that was emitted by the image photons. For recognition purpose it is sufficient if each photon state will be constantly mapped into a same associated state. This target state will be considered as the recognition and it will be considered as the way the image is precept by the recognition device. If all recognition tools (including the human brain) act similarly, they will all agree of the same recognition even though the final result can be different from the original state. If we borrow the psychological concept to experience, we can say that when seeing an image, all individuals will experience the same vision. Surly, they might be situations for which different images will be mapped into the same state. This will be considered as the recognition limitation. To conclude, we identify the recognized state with the state mapping target rather than identifying the original state.

In this paper we propose a nonlinear mode based upon the analysis of recursive maps as is often presented in chaos theory [1]. In our approach the measuring device defines an external surrounding that influences the detected photons. The surrounding is represented by the recursive maps that determine the system time evolution toward coherence and consequently to the recognition. We will show the possibility of describing recursive maps with Fock space where the map time evolution can be described by means of unitary operators.

Small physical systems which are subject to the influence of the surrounding tend to become dissipative [2,3]. However, in the regular regime for which the maps converge only into few numeric values (in our model two values), we show the re-coherence effect that is needed for the recognition process as presented previously.

2. The States Basis

We start with the definition of the image pure state and we present the target state that is considered as the image recognition state. Later we will show how a mixed state becomes coherent under the maps iteration.

The image is is divided into an small squares matrix (pixels). A pixel location is represented by the states, where describes a pixel location. With a tensor product we compose the photon states and as the absent and existent of a photon in the pixel location, respectively.

An image coherent photon is described by the following superposition


with and being the superposition coefficients for the pixel.

In a column representation we obtain: 


where for a single photon we obtain,


3. The Recognition Operator

Sharp (or definite) recognition is associated with distinguish ability between the images where the representative states are distinguishable only when they are orthogonal. The maximum number of orthogonal states forms the space basis of states. Clearly, sharp recognition can be implemented only for a specific spanning set basis of states where the selection between the various set possibilities is subject to the observer determination [4,5]. However, unlike the measurement collapse phenomena for which the measurement output corresponds with the collapse linearity breaking [6-11], in our device an initial state experiences discrete rotations until it reaches a recognized state. This rotation will be related to the recognition mapping.

We define each pixel with a unitary operator that rotates the coefficient vector. Applying the operator several times generates a recursive relation as indicated by the extra superscript. This operator generate each pixel vector with a recursive relation,


The unitary operator conserve the coefficients vector norm, that is for a single photon,


The global unitary operator is:


Applying the operator on the image state (Equation (2) with an addition superscript) we obtain


Using Equation (4) we obtain,


Defining yields


It is easy to see that the transformation conserve the state norm that is for a single photon,.

4. A Simple Demonstration of a Recursive Maps

Let us demonstrate our recognition algorithm with the following unitary maps:


We define the relations


to obtain


These equations describes recursive maps of the form


To simplify further this model we assume that and are real numbers

and that


There are unlimited types of recursive maps that can be derived from Equations (12)-(14). We constrict our model to maps with a double period bifurcation behavior [12]. To be more specific we assume that at each pixel the maps converge into the following values:


with the complementary values


Although the maps do not converge into a single output (single values for and) it is possible to redefine a map which retrieves a single stable result if we define as follows,




where the composed map corresponds with a time interval which is twice the original -time.

Under the -map we obtain two types of sets; the firsts converge into the values and the others reach the output

It is easy to identify each set as follows: Suppose that we start with initial condition namely the final states or. Now for the maps split into two types:



where the even and odd series converge into the values and, respectively.

Since the two maps operate separately, we associate them with independent states and types, respectively.

When applying the maps (the maps with the double steps iterations) on the initial state, that is, the initial photons state that hit the recognition machine, it iterates according to the g’s maps until it reaches the final values. or If we denote

and as the final values of the iteration.

The state


is the image recognition.

5. The Recognition Algorithm

The following diagram summarizes the complete recognition procedure:

6. The Lyapunov Exponent with Respect to the Complementary Maps

Earlier we mentioned that practically most images are screened by incoherent photons. Yet, in our analysis we considered only pure states. In this section we present a formalism that is responsible for a re-coherence process, that is, a formalism that generate coherence between the incoherent states. Suppose that we have the following initial conditions


where the terms and are correlated such that while and represent the incoherent part of the pixels arriving photons.

According to Lyapunov theorem [13] for large we obtain


where and are the Lyapunov exponents for the, maps, obtained as:


We recall that

yielding that

and therefore.

Thus we obtain


7. Re-Coherence and Recognition

The Lyapunov theorem predicts a negative exponent for non-chaotic maps [13]. In particular as in our model, a negative exponent is obtained for the double period bifurcation maps type. Thus, Equation (25) yields that

that is, the incoherent terms, vanishes during the iterations. Consequently, under the proper mapping the non-coherent photons, eventually become coherent to form the single final state. This state is now considered to stand for the image recognition state.

8. The Recognition Efficiency

In this paper we demonstrated that what seems to be a collapse drawback may turn into an advantage if the collapse represents the observer interpretation. The traditional approach for figuring images is by dividing them into pixels and using sophisticated algorithms in order to figure the image significance [14-17]. This corresponds to a situation with multi-pixel states. In our approach if we have a coherent image, the observer can define a quantum basis of states (which are defined as a superposition of the pixel states) rather than using the pixel basis. In quantum mechanics any quantum basis of states can be associated with a measuring device. Thus, the observer possesses the ability of building a device that measures directly the desired image. Selecting the figure basis depends on the observer determination. Consequently, the collapse can be regarded as the observer interpretation of the original coherent image. Thus, working within the image basis allows us to measure and interpret the image multi-pixel state directly in a single measurement and the result of any coherent image’s multi-data state will be an interpretation into one of the device figure states.

Thus, for a coherent image, our approach is very efficient. For an incoherent image we consider the single measurement time as a very low time relative to all other recognition methods. From Equation (25) we see that the incoherent image approaches the coherent state exponentially with typical time of the order of.


  1. H. Schanz, T. Dittrich and R. Ketzmerick, “Directed Chaotic Transport in Hamiltonian Ratchets,” Physical Review E, Vol. 71, No. 2, 2005, Article ID: 026228. Hdoi:10.1103/PhysRevE.71.026228
  2. W. H. Zurek, “Decoherence, Einselection, and the Quantum Origins of the Classical,” Reviews of Modern Physics, Vol. 75, No. 3, 2003, pp. 715-775. Hdoi:10.1103/RevModPhys.75.715
  3. W. H. Zurek, “Decoherence and the Transition from Quantum to Classical,” Physics Today, Vol. 44, No. 10, 1991, p. 36. Hdoi:10.1063/1.881293
  4. Y. Roth, “The Quantum Observer’s Consciousness,” EPL, Vol. 82, 2008, Article ID: 10006.
  5. Y. Roth, “The Observer Determination,” International Journal of Theoretical Physics, Vol. 51, No. 12, 2012, pp. 3847-3855.
  6. R. Penrose, “The Road to Reality: A Complete Guide to the Laws of the Universe,” Vintage Books, New York, 2004.
  7. A. Bassi, “Dynamical Reduction Models: Present Status and Future Developments,” Journal of Physics: Conference Series, Vol. 67, 2007, Article ID: 012013.
  8. A. Bassi and D. G. M. Salvetti, “The Quantum Theory of Measurement within Dynamical Reduction Models,” Journal of Physics A: Mathematical and Theoretical, Vol. 40, No. 32, 2007, p. 9859. Hdoi:10.1088/1751-8113/40/32/011
  9. W. H. Zurek, “Decoherence and the Transition from Quantum to Classical,” Physics Today, Vol. 44, 1991, pp. 36-44. arXiv: quant-ph/0306072v1.
  10. S. L. Adler, et al., “Collapse Models with Non-White Noises,” Journal of Physics A: Mathematical and Theoretical, Vol. 40, No. 50, 2007, pp. 15083-15098. Hdoi:10.1088/1751-8113/40/50/012
  11. G. C. Ghirardi, A. Rimini and T. Weber, “Unified Dynamics for Microscopic and Macroscopic Systems,” Physical Review D, Vol. 34, No. 2, 1986, pp. 470-491.
  12. J. D. Crawford, “Introduction to Bifurcation Theory,” Reviews of Modern Physics, Vol. 63, No. 4, 1991, pp. 991-1037. Hdoi:10.1103/RevModPhys.63.991
  13. A. Wolf, J. B. Swift, H. L. Swinney and J. A. Vastano, “Determining Lyapunov Exponents from a Time Series,” Physica D, Vol. 16, No. 3, 1985, pp. 285-317. Hdoi:10.1016/0167-2789(85)90011-9
  14. A. Y. Vlasov, 1996. arXiv:quant-ph/9703010
  15. D. Deutsch, “Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer,” Proceedings of the Royal Society A, Vol. 400, No. 1818, 1985, pp. 97-117. Hdoi:10.1098/rspa.1985.0070
  16. M. A. Nielsen and I. L. Chuang, “Quantum Computation and Quantum Information,” Cambridge University Press, Cambridge, 2000.
  17. U. Fayyad, G. Piatetsky-Shapiro and P. Smyth, “From Data Mining to Knowledge Discovery in Databases,”AI Magazine, Vol. 17, No. 3, 1996, pp. 37-54.