A New Diffusion-Based Variational Model for Image Denoising and Segmentation

In this paper we propose a new variational model for image denoising and segmentation of both gray and color images. This method is inspired by the complex Ginzburg–Landau model and the weighted bounded variation model. Compared with active contour methods, our new algorithm can detect non-closed edges as well as quadruple junctions, and the initialization is completely automatic. The existence of the minimizer for our energy functional is proved. Numerical results show the effectiveness of our proposed model in image denoising and segmentation. Fang Li received the MSc degree in Mathematics from the South West China Normal University in 2004 and from then on she works in the South West University. Meanwhile, she studies mathematics at the East China Normal University as a doctoral student. Her research interests include anisotropic diffusion filtering, the variational methods and PDEs in image processing. Chaomin Shen received the MSc degree in Mathematics from the National University of Singapore (NUS) in 1998. He worked in the Centre for Remote Imaging, Sensing and Processing (CRISP), NUS as an associate scientist during 1998 to 2004. Currently he is a lecturer in Joint Laboratory for Imaging Science & Technology and Department of Computer Science, East China Normal University. His research interests include remote sensing applications and variational methods in image processing. Ling Pi received her MSc degree from the Department of Mathematics, East China Normal University in 2003. She is currently a lecturer in the Department of Applied Mathematics, Shanghai Jiaotong University. Her work involves the application of geometric and analytic methods to problems in image processing.     

Chance discovery and scenario analysis

Scenario analysis is often used to identify possible chance events. However, no formal, computational theory yet exists for scenario analysis. In this paper, we commence development of such a theory by defining a scenario in an argumentation context, and by considering the question of when two scenarios are the same. Peter McBurney, Ph.D.: He is a lecturer in the Department of Computer Science at the University of Liverpool, UK. He has a first degree in Pure Mathematics and Statistics from the Australian National University, Canberra, and a Ph.D in Artificial Intelligence from the University of Liverpool. His Ph.D research concerned the design of protocols for rational interaction between autonomous software agents, and he has several publications in this area. Prior to completing his Ph.D he worked as a consultant to major telecommunications network operating companies, primarily in mobile and satellite communications, where his work involved strategic marketing programming. Simon Parsons, Ph.D.: He is currently visiting the Sloan School of Management at Massachusetts Institute of Technology (MIT) and is a Visiting Professor at the University of Liverpool, UK. He holds a first degree in Engineering from Cambridge University, and an MSc and Ph.D in Artificial Intelligence from the University of London. In 1998, he was awarded the Young Engineer Achievement Medal of the British Institution of Electrical Engineers (IEE), the largest professional engineering society in Europe. He has published 4 books and over 100 articles on autonomous agents and multi-agent systems, uncertainty formalisms, risk and decision-making.     

A General Probability Formula of the Number of Location Areas＇ Boundaries Crossed by a Mobile Between Two Successive Call Arrivals

Mobility management is a challenging topic in mobile computing environment. Studying the situation of mobiles crossing the boundaries of location areas is significant for evaluating the costs and performances of various location management strategies. Hitherto, several formulae were derived to describe the probability of the number of location areas‘ boundaries crossed by a mobile. Some of them were widely used in analyzing the costs and performances of mobility management strategies. Utilizing the density evolution method of vector Markov processes, we propose a general probability formula of the number of location areas‘ boundaries crossed by a mobile between two successive calls. Fortunately, several widely-used formulae are special cases of the proposed formula.     

Adaptive nonlinear composite filters for pattern recognition

Adaptive composite nonlinear filters for reliable illumination-invariant pattern recognition are proposed. The information about objects to be recognized, false objects, and a background to be rejected is utilized in an iterative training procedure to design a nonlinear adaptive correlation filter with a given value of discrimination capability. The designed filter during recognition process adapts its parameters to local statistics of the input image. Computer simulation results obtained with the proposed filters in test nonuniform illuminated scenes are discussed and compared with those of linear composite correlation filters in terms of recognition performance. The text was submitted by the authors in English. Saul Martínez Diaz. Received his MSc degree in Computer Science from Instituto Tecnologico de La Paz, Mexico in 2005. He is currently a PhD student at Department of Computer Science, CICESE, Mexico. His research interests include nonlinear image processing and pattern recognition. Vitaly Kober. Obtained his MS degree in Applied Mathematics from the Air-Space University of Samara (Russia) in 1984, his PhD degree in 1992, and Doctor of Sciences degree in 2004 in Image Processing from the Institute of Information Transmission Problems, Russian Academy of Sciences. Now he is a titular researcher at CICESE, Mexico. His research interests include signal and image processing, pattern recognition. Iosif A. Ovseyevich. Graduated from the Moscow Electrotechnical Institute of Telecommunications. Received Candidate’s degree in 1953 and Doctor’s degree in information theory in 1972. At present he is Emeritus Professor at the Institute of Information Transmission Problems of the Russian Academy of Sciences. His research interests include information theory, signal processing, and expert systems. He is a Member of IEEE, Popov Radio Society.     

TEG—a hybrid approach to information extraction

This paper describes a hybrid statistical and knowledge-based information extraction model, able to extract entities and relations at the sentence level. The model attempts to retain and improve the high accuracy levels of knowledge-based systems while drastically reducing the amount of manual labour by relying on statistics drawn from a training corpus. The implementation of the model, called TEG (trainable extraction grammar), can be adapted to any IE domain by writing a suitable set of rules in a SCFG (stochastic context-free grammar)-based extraction language and training them using an annotated corpus. The system does not contain any purely linguistic components, such as PoS tagger or shallow parser, but allows to using external linguistic components if necessary. We demonstrate the performance of the system on several named entity extraction and relation extraction tasks. The experiments show that our hybrid approach outperforms both purely statistical and purely knowledge-based systems, while requiring orders of magnitude less manual rule writing and smaller amounts of training data. We also demonstrate the robustness of our system under conditions of poor training-data quality. Ronen Feldman is a senior lecturer at the Mathematics and Computer Science Department of Bar-Ilan University in Israel, and the Director of the Data Mining Laboratory. He received his B.Sc. in Math, Physics and Computer Science from the Hebrew University, M.Sc. in Computer Science from Bar-Ilan University, and his Ph.D. in Computer Science from Cornell University in NY. He was an Adjunct Professor at NYU Stern Business School. He is the founder of ClearForest Corporation, a Boston based company specializing in development of text mining tools and applications. He has given more than 30 tutorials on next mining and information extraction and authored numerous papers on these topics. He is currently finishing his book “The Text Mining Handbook” to the published by Cambridge University Press. Benjamin Rosenfeld is a research scientist at ClearForest Corporation. He received his B.Sc. in Mathematics and Computer Science from Bar-Ilan University. He is the co-inventor of the DIAL information extraction language. Moshe Fresko is finalizing his Ph.D. in Computer Science Department at Bar-Ilan University in Israel. He received his B.Sc. in Computer Engineering from Bogazici University, Istanbul/Turkey on 1991, and M.Sc. on 1994. He is also an adjunct lecturer at the Computer Science Department of Bar-Ilan University and functions as the Information-Extraction Group Leader in the Data Mining Laboratory.     

ScaleSpaceViz: α-Scale spaces in practice

Kernels of the so-called α-scale space have the undesirable property of having no closed-form representation in the spatial domain, despite their simple closed-form expression in the Fourier domain. This obstructs spatial convolution or recursive implementation. For this reason an approximation of the 2D α-kernel in the spatial domain is presented using the well-known Gaussian kernel and the Poisson kernel. Experiments show good results, with maximum relative errors of less than 2.4%. The approximation has been successfully implemented in a program for visualizing α-scale spaces. Some examples of practical applications with scale space feature points using the proposed approximation are given. The text was submitted by the authors in English. Frans Kanters received his MSc degree in Electrical Engineering in 2002 from the Eindhoven University of Technology in the Netherlands. Currently he is working on his PhD at the Biomedical Imaging and Informatics group at the Eindhoven University of Technology. His PhD work is part of the “Deep Structure, Singularities, and Computer Vision (DSSCV)” project sponsored by the European Union. His research interests include scale space theory, image reconstruction, image processing algorithms, and hardware implementations thereof. Luc Florack received his MSc degree in theoretical physics in 1989 and his PhD degree cum laude in 1993 with a thesis on image structure, both from Utrecht University, the Netherlands. During the period from 1994 to 1995, he was an ERCIM/HCM research fellow at INRIA Sophia-Antipolis, France, and IN-ESC Aveiro, Portugal. In 1996 he was an assistant research professor at DIKU, Copenhagen, Denmark, on a grant from the Danish Research Council. From 1997 to June 2001, he was an assistant research professor at Utrecht University in the Department of Mathematics and Computer Science. Since June 1, 2001, he has been working as an assistant professor and, then, as an associate professor at Eindhoven University of Technology, Department of Biomedical Engineering. His interest includes all multiscale structural aspects of signals, images, and movies and their applications to imaging and vision. Remco Duits received his MSc degree (cum laude) in Mathematics in 2001 from the Eindhoven University of Technology, the Netherlands. Today he is a PhD student at the Department of Biomedical Engineering at the Eindhoven University of Technology on the subject of multiscale perceptual organization. His interest subtends functional analysis, group theory, partial differential equations, multiscale representations and their applications to biomedical imaging and vision, perceptual grouping. Currently, he is finishing his thesis “Perceptual Organization in Image Analysis (A Mathematical Approach Based on Scale, Orientation and Curvature).” During his PhD work, several of his submissions at conferences were chosen as selected or best papers—in particular, at the PRIA 2004 conference on pattern recognition and image analysis in St. Petersburg, where he received a best paper award (second place) for his work on invertible orientation scores. Bram Platel received his Masters Degree cum laude in biomedical engineering from the Eindhoven University of Technology in 2002. His research interests include image matching, scale space theory, catastrophe theory, and image-describing graph constructions. Currently he is working on his PhD in the Biomedical Imaging and Informatics group at the Eindhoven University of Technology. Bart M. ter Haar Romany is full professor in Biomedical Image Analysis at the Department of Biomedical Engineering at Eindhoven University of Technology. He has been in this position since 2001. He received a MSc in Applied Physics from Delft University of Technology in 1978, and a PhD on neuromuscular nonlinearities from Utrecht University in 1983. After being the principal physicist of the Utrecht University Hospital Radiology Department, in 1989 he joined the department of Medical Imaging at Utrecht University as an associate professor. His interests are mathematical aspects of visual perception, in particular linear and non-linear scale-space theory, computer vision applications, and all aspects of medical imaging. He is author of numerous papers and book chapters on these issues; he edited a book on non-linear diffusion theory and is author of an interactive tutorial book on scale-space theory in computer vision. He has initiated a number of international collaborations on these subjects. He is an active teacher in international courses, a senior member of IEEE, and IEEE Chapter Tutorial Speaker. He is chairman of the Dutch Biophysical Society.     

A user-friendly tool for image analysis

A new graphical tool (Multimedia University’s RSIMANA—Remote-Sensing Image Analyzer) developed for image analysis is described in this paper. MATLAB and ENVI are some of the commercially available tools in the market that aid in image processing and analysis. But their current versions are of limited assistance in image analysis; for example, MATLAB can extract the area of irregular objects and patterns in images, but not their length. ENVI is more focused on image processing than on image analysis functions. Other commercially available tools are also prohibitively expensive. This indicates the need to develop a userfriendly graphical tool that meets research objectives in the educational environment. The text was submitted by the author in English. Hema Nair. Born 1965. Educational qualifications: B.Tech. (Electrical Engineering) from Government Engineering College affiliated to University of Calicut, Kerala State, India, 1986; MSc (Electrical Engineering) from National University of Singapore, 1993; MSc (Computer Science) from Clark Atlanta University, USA, 1996. Previous employment: Researcher and Project Leader in AT & T, New Jersey, USA, for about 5 years. Also worked in Bangalore, India, before that in Apple Information Technology Ltd. as Teaching Faculty. Current employment: lecturer, Faculty of Engineering and Technology, Multimedia University, Malaysia. Current research: the final stages of her PhD in Computer Science at Multimedia University. Scientific interests are image analysis, pattern recognition, databases, AI, data mining. Member of IEEE (USA) since 1997, Professional Member of ACM (USA) since 1997, Member of Institution of Engineers (India) since 1986. Reviewer for IASTED International Conference 2004. Current PhD project entitled “Pattern Extraction and Concept Clustering in Linguistic Terms from Mined Images” is funded by an Intensive Research in Priority Area (IRPA) grant from Government of Malaysia. Research for MSc in Computer Science from USA was funded by a research grant from the US Army. Author of three International Conference papers accepted in Portugal, Belgium, and India.     

Improved Results on Robust H∞ Control of Uncertain Discrete-time Systems with Time-varying Delay

In this paper, the robust H∞ control problem for uncertain discrete-time systems with time-varying state delay is con- sidered. Based on the Lyapunov functional method, and by resorting to the new technique for estimating the upper bound of the difference of the Lyapunov functional, a new less conservative sufficient condition for the existence of a robust H∞ controller is obtained. Moreover, the cone complementary linearisation procedure is employed to solve the nonconvex feasibility problem. Finally, several numerical examples are presented to show the effectiveness and less conservativeness of the proposed method.     

Automatic diatom identification using contour analysis by morphological curvature scale spaces

A method for automatic identification of diatoms (single-celled algae with silica shells) based on extraction of features on the contour of the cells by multi-scale mathematical morphology is presented. After extracting the contour of the cell, it is smoothed adaptively, encoded using Freeman chain code, and converted into a curvature representation which is invariant under translation and scale change. A curvature scale space is built from these data, and the most important features are extracted from it by unsupervised cluster analysis. The resulting pattern vectors, which are also rotation-invariant, provide the input for automatic identification of diatoms by decision trees and k-nearest neighbor classifiers. The method is tested on two large sets of diatom images. The techniques used are applicable to other shapes besides diatoms. Andrei C. Jalba received his B.Sc. (1998) and M.Sc. (1999) in Applied Electronics and Information Engineering from “Politehnica” University of Bucharest, Romania. He recently obtained a Ph.D. degree at the Institute for Mathematics and Computing Science of the University of Groningen, where he now is a postdoctoral researcher. His research interests include computer vision, pattern recognition, image processing, and parallel computing. Michael Wilkinson obtained an M.Sc. in astronomy from the Kapteyn Laboratory, University of Groningen (RuG) in 1993, after which he worked on image analysis of intestinal bacteria at the Department of Medical Microbiology, RuG. This work formed the basis of his Ph.D. at the Institute of Mathematics and Computing Science (IWI), RuG, in 1995. He was appointed as researcher at the Centre for High Performance Computing (also RuG) working on simulating the intestinal microbial ecosystem on parallel computers. During that time he edited the book “Digital Image Analysis of Microbes” (John Wiley, UK, 1998) together with Frits Schut. After this he worked as a researcher at the IWI on image analysis of diatoms. He is currently assistant professor at the IWI. Jos B.T.M. Roerdink received his M.Sc. (1979) in theoretical physics from the University of Nijmegen, the Netherlands. Following his Ph.D. (1983) from the University of Utrecht and a 2-year position (1983--1985) as a Postdoctoral Fellow at the University of California, San Diego, both in the area of stochastic processes, he joined the Centre for Mathematics and Computer Science in Amsterdam. There he worked from 1986-1992 on image processing and tomographic reconstruction. He was appointed associate professor (1992) and full professor (2003), respectively, at the Institute for Mathematics and Computing Science of the University of Groningen, where he currently holds a chair in Scientific Visualization and Computer Graphics. His current research interests include biomedical visualization, neuroimaging and bioinformatics. Micha Bayer graduated from St. Andrews University, Scotland, with an M.Sc. in Marine Biology in 1994. He obtained his Ph.D. in Marine Biology from there in 1998, and then followed this up with two postdoctoral positions at the Royal Botanic Garden Edinburgh, Scotland, first on the ADIAC and then on the DIADIST project. In both of these projects he was responsible for establishing the collections of diatom training data to be used for the pattern recognition systems. From 2002–2003 he was enrolled for an M.Sc. in information technology at the University of Glasgow, Scotland, and is now working as a grid developer at the National e-Science Centre at Glasgow University. Stephen Juggins is a senior lecturer at the School of Geography, Politics and Sociology, University of Newcastle. His research focuses on the use of diatoms for monitoring environmental change and on the analysis of ecological and palaeoecological data. He has worked in Europe, North America and Central Asia on problems of river water quality, historical lake acidification, coastal eutrophication and Quaternary climate change.     

A Variational Approach to Reconstructing Images Corrupted by Poisson Noise

We propose a new variational model to denoise an image corrupted by Poisson noise. Like the ROF model described in [1] and [2], the new model uses total-variation regularization, which preserves edges. Unlike the ROF model, our model uses a data-fidelity term that is suitable for Poisson noise. The result is that the strength of the regularization is signal dependent, precisely like Poisson noise. Noise of varying scales will be removed by our model, while preserving low-contrast features in regions of low intensity. Funded by the Department of Energy under contract W-7405ENG-36. Triet M. Le received his Ph.D. in Mathematics from the University of California, Los Angeles, in 2006. He is now a Gibbs Assistant Professor in the Mathematics Department at Yale University. His research interests are in applied harmonic analysis and function spaces with application to image analysis and inverse problems. Rick Chartrand received a Ph.D. in Mathematics from UC Berkeley in 1999, where he studied functional analysis. He now works as an applied mathematician at Los Alamos National Laboratory. His research interests are image and signal processing, inverse problems, and classification. Tom Asaki is a staff member in the Computer and Computational Science Division at Los Alamos National Laboratory. He obtained his doctorate in physics from Washington State University. His interests are mixed-variable and direct-search optimization, applied inverse problems, and quantitative tomography.     

Geometric Analysis of Particle Motion in a Vector Image Field

This paper proposes a geometrical model for the Particle Motion in a Vector Image Field (PMVIF) method. The model introduces a c-evolute to approximate the edge curve in the gray-level image. The c-evolute concept has three major novelties: (1) The locus of Particle Motion in a Vector Image Field (PMVIF) is a c-evolute of image edge curve; (2) A geometrical interpretation is given to the setting of the parameters for the method based on the PMVIF; (3) The gap between the image edge’s critical property and the particle motion equations appeared in PMVIF is padded. Our experimental simulation based on the image gradient field is simple in computing and robust, and can perform well even in situations where high curvature exists. Chenggang Lu received his Bachelor of Science and PhD degrees from Zhejiang University in 1996 and 2003, respectively. Since 2003, he has been with VIA Software (Hang Zhou), Inc. and Huawei Technology, Inc. His research interests include image processing, acoustic signaling processing, and communication engineering. Zheru Chi received his BEng and MEng degrees from Zhejiang University in 1982 and 1985 respectively, and his PhD degree from the University of Sydney in March 1994, all in electrical engineering. Between 1985 and 1989, he was on the Faculty of the Department of Scientific Instruments at Zhejiang University. He worked as a Senior Research Assistant/Research Fellow in the Laboratory for Imaging Science and Engineering at the University of Sydney from April 1993 to January 1995. Since February 1995, he has been with the Hong Kong Polytechnic University, where he is now an Associate Professor in the Department of Electronic and Information Engineering. Since 1997, he has served on the organization or program committees for a number of international conferences. His research interests include image processing, pattern recognition, and computational intelligence. Dr. Chi has authored/co-authored one book and nine book chapters, and published more than 140 technical papers. Gang Chen received his Bachelor of Science degree from Anqing Teachers College in 1983 and his PhD degree in the Department of Applied Mathematics at Zhejiang University in 1994. Between 1994 and 1996, he was a postdoctoral researcher in electrical engineering at Zhejiang University. From 1997 to 1999, he was a visiting researcher in the Institute of Mathematics at the Chinese University of Hong Kong and the Department of Electronic and Information Engineering at The Hong Kong Polytechnic University. Since 2001, he has been a Professor at Zhejiang University. He has been the Director of the Institute of DSP and Software Techniques at Ningbo University since 2002. His research interests include applied mathematics, image processing, fractal geometry, wavelet analysis and computer graphics. Prof. Chen has co-authored one book, co-edited five technical proceedings and published more than 80 technical papers. (David) Dagan Feng received his ME in Electrical Engineering & Computing Science (EECS) from Shanghai JiaoTong University in 1982, MSc in Biocybernetics and Ph.D in Computer Science from the University of California, Los Angeles (UCLA) in 1985 and 1988 respectively. After briefly working as Assistant Professor at the University of California, Riverside, he joined the University of Sydney at the end of 1988, as Lecturer, Senior Lecturer, Reader, Professor and Head of Department of Computer Science/School of Information Technologies, and Associate Dean of Faculty of Science. He is Chair-Professor of Information Technology, Hong Kong Polytechnic University; Honorary Research Consultant, Royal Prince Alfred Hospital, the largest hospital in Australia; Advisory Professor, Shanghai JiaoTong University; Guest Professor, Northwestern Polytechnic University, Northeastern University and Tsinghua University. His research area is Biomedical & Multimedia Information Technology (BMIT). He is the Founder and Director of the BMIT Research Group. He has published over 400 scholarly research papers, pioneered several new research directions, made a number of landmark contributions in his field with significant scientific impact and social benefit, and received the Crump Prize for Excellence in Medical Engineering from USA. More importantly, however, is that many of his research results have been translated into solutions to real-life problems and have made tremendous improvements to the quality of life worldwide. He is a Fellow of ACS, HKIE, IEE, IEEE, and ATSE, Special Area Editor of IEEE Transactions on Information Technology in Biomedicine, and is the current Chairman of IFAC-TC-BIOMED.     

Behavioural notions for elementary net systems

We study the relationships between a number of behavioural notions that have arisen in the theory of distributed computing. In order to sharpen the under-standing of these relationships we apply the chosen behavioural notions to a basic net-theoretic model of distributed systems called elementary net systems. The behavioural notions that are considered here are trace languages, non-sequential processes, unfoldings and event structures. The relationships between these notions are brought out in the process of establishing that for each elementary net system, the trace language representation of its behaviour agrees in a strong way with the event structure representation of its behaviour. M. Nielsen received a Master of Science degree in mathematics and computer science in 1973, and a Ph.D. degree in computer science in 1976 both from Aarhus University, Denmark. He has held academic positions at Department of Computer Science, Aarhus University, Denmark since 1976, and was visiting researcher at Computer Science Department, University of Edinburgh, U.K., 1977–79, and Computer Laboratory, Cambridge University, U.K., 1986. His research interest is in the theory of distributed computing. Grzegorz Rozenberg received a master of engineering degree from the Department of Electronics (section computers) of the Technical University of Warsaw in 1964 and a Ph.D. in mathematics from the Institute of Mathematics of the Polish Academy of Science in 1968. He has held acdeemic positions at the Institute of Mathematics of the Polish Academy of Science, the Department of Mathematics of Utrecht University, the Department of Computer Science at SUNY at Buffalo, and the Department of Mathematics of the University of Antwerp. He is currently Professor at the Department of Computer Science of Leiden University and Adjoint Professor at the Department of Computer Science of the University of Colorado at Boulder. His research interests include formal languages and automata theory, theory of graph transformations, and theory of concurrent systems. He is currently President of the European Association for Theoretical Computer Science (EATCS). P.S. Thiagarajan received the Bachelor of Technology degree from the Indian Institute of Technology, Madras, India in 1970. He was awarded the Ph.D. degree by Rice University, Houston Texas, U.S.A, in 1973. He has been a Research Associate at the Massachusetts Institute of Technology, Cambridge a Staff Scientist at the Geosellschaft für Mathematik und Datenverarbeitung, St. Augustin, a Lektor at Århus University, Århus and an Associate Professor at the Institute of Mathematical Sciences, Madras. He is currently a Professor at the School of Mathematics, SPIC Science Foundation, Madras. He research intest is in the theory of distributed computing.     

Image hiding scheme using modulus function and optimal substitution table

The simple least-significant-bit (LSB) substitution technique is the easiest way to embed secret data in the host image. To avoid image degradation of the simple LSB substitution technique, Wang et al. proposed a method using the substitution table to process image hiding. Later, Thien and Lin employed the modulus function to solve the same problem. In this paper, the proposed scheme combines the modulus function and the optimal substitution table to improve the quality of the stego-image. Experimental results show that our method can achieve better quality of the stego-image than Thien and Lin’s method does. The text was submitted by the authors in English. Chin-Shiang Chan received his BS degree in Computer Science in 1999 from the National Cheng Chi University, Taipei, Taiwan and the MS degree in Computer Science and Information Engineering in 2001 from the National Chung Cheng University, ChiaYi, Taiwan. He is currently a Ph.D. student in Computer Science and Information Engineering at the National Chung Cheng University, Chiayi, Taiwan. His research fields are image hiding and image compression. Chin-Chen Chang received his BS degree in applied mathematics in 1977 and his MS degree in computer and decision sciences in 1979, both from the National Tsing Hua University, Hsinchu, Taiwan. He received his Ph.D. in computer engineering in 1982 from the National Chiao Tung University, Hsinchu, Taiwan. During the academic years of 1980–1983, he was on the faculty of the Department of Computer Engineering at the National Chiao Tung University. From 1983–1989, he was on the faculty of the Institute of Applied Mathematics, National Chung Hsing University, Taichung, Taiwan. From 1989 to 2004, he has worked as a professor in the Institute of Computer Science and Information Engineering at National Chung Cheng University, Chiayi, Taiwan. Since 2005, he has worked as a professor in the Department of Information Engineering and Computer Science at Feng Chia University, Taichung, Taiwan. Dr. Chang is a Fellow of IEEE, a Fellow of IEE and a member of the Chinese Language Computer Society, the Chinese Institute of Engineers of the Republic of China, and the Phi Tau Phi Society of the Republic of China. His research interests include computer cryptography, data engineering, and image compression. Yu-Chen Hu received his Ph.D. degree in Computer Science and Information Engineering from the Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan in 1999. Dr. Hu is currently an assistant professor in the Department of Computer Science and Information Engineering, Providence University, Sha-Lu, Taiwan. He is a member of the SPIE society and a member of the IEEE society. He is also a member of the Phi Tau Phi Society of the Republic of China. His research interests include image and data compression, information hiding, and image processing.     

Computational model for recognition of scene objects with an active sensor

In the paper, a computational model for recognition of objects in a scene image is presented. The model is based on the use of an active sensor. The structure of the object model (OM) is described. This structure is a component that stores different representations of the object and puts at user’s disposal an interface whose operations are used in the scene recognition process. Semen Yu. Sergunin. Born 1980. Graduated from the Faculty of Mathematics and Mechanics of Moscow State University in 2002. Finished postgraduate course of the Department of Computational Mathematics of the same faculty. Scientific interests include image recognition. Author of about 20 papers. Mikhail I. Kumskov. Graduated from the Faculty of Computational Mathematics and Cybernetics of Moscow State University in 1978. Received his candidate’s degree (in Physics and Mathematics) in 1981 and doctoral degree in 1997. In 1981–1997 taught at the Faculty of Computational Mathematics and Cybernetics in the special seminar on Computer Graphics and Image Processing of the Department of Automation of Systems of Computational Complexes. Since 1992 works at the laboratory of Mathematical Chemistry of the Zelinsky Institute of Organic Chemistry of the Russian Academy of Sciences. Since 1997 teaches at the Department of Computational Mathematics of the Faculty of Mathematics and Mechanics of Moscow State University. Author of more than 50 papers. Scientific interests include prediction of properties of chemical compounds, optimization of structural object representation for classification problems, and image understanding.     

Controller design of high order nonholonomic system with nonlinear drifts

A controller design is proposed for a class of high order nonholonomic systems with nonlinear drifts. The purpose is to ensure a solution for the closed-loop system regulated to zero. Adding a power integrator backstepping technique and the switching control strategy are employed to design the controller. The state scaling is applied to the recursive manipulation. The simulation example demonstrates the effectiveness and robust features of the proposed method.     

A Numerical Scheme for the Curvature Equation Near the Singularities

In this paper we propose a modification in the usual numerical method for computing the solutions of the curvature equation in the plane . This modification takes place near the singularities of the image. We propose to use zero as the vertical speed at a saddle point and, at an extremum, the geometric mean of the eigenvalues of the Hessian matrix. This modification is theoretically justified and the preliminary experimental results show that it makes the algorithm more reliable.Marcos Craizer has a degree in mathematics from UFRJ (Rio de Janeiro), a M.Sc. from IMPA (Rio de Janeiro) and received his Ph.D. in mathematics also from IMPA, in 1989. His research interests in image processing includes image representation, curve evolution and PDE applications. Since 1988, he has been working at the math department of PUC-Rio, Brazil.Sinésio Pesco is an Assistant Professor of the Department of Mathematics at Pontifical Catholic University of Rio de Janeiro (PUCRio). He received his Ph.D. and MS degree in Applied Mathematics at PUC-Rio and a B.S. degree in mathematics from State University of Maringa Brasil. He has visiting positions at Lawrence Livermore National Laboratory, CSE/OGI School of Science and Engineering (Oregon Health & Science University) and Scientific Computation and Imaging Insititute (University of UTAH). His main research interests are in Computational Topology, Image Processing and Scientific Visualization. Since 1991, he has been working in the development of a CAD system for petroleum reservoir modeling.Ralph Teixeira has a degree in Computer Engineering from IME (in Rio), a M.Sc. from IMPA (also in Rio) and received his Ph.D. in Mathematics from Harvard University in 1998. His research interests in Computer Vision include shape representations by skeletons (medial axis and similar objects), curve evolutions and PDE applications. Since 2001, he has been working at Fundação Getulio Vargas in Rio de Janeiro, Brazil.     

GH 2 control for uncertain discrete-time-delay fuzzy systems based on a switching fuzzy model and piecewise Lyapunov function

Generalized H2 （GH2） stability analysis and controller design of the uncertain discrete-time Takagi-Sugeno （T-S） fuzzy systems with state delay are studied based on a switching fuzzy model and piecewise Lyapunov function. GH2 stability sufficient conditions are derived in terms of linear matrix inequalities （LMIs）. The interactions among the fuzzy subsystems are considered. Therefore, the proposed conditions are less conservative than the previous results. Since only a set of LMIs is involved, the controller design is quite simple and numerically tractable. To illustrate the validity of the proposed method, a design example is provided.     

Hiding a halftone secret image in two camouflaged halftone images

In this paper, we shall propose a method to hide a halftone secret image into two other camouflaged halftone images. In our method, we adjust the gray-level image pixel value to fit the pixel values of the secret image and two camouflaged images. Then, we use the halftone technique to transform the secret image into a secret halftone image. After that, we make two camouflaged halftone images at the same time out of the two camouflaged images and the secret halftone image. After overlaying the two camouflaged halftone images, the secret halftone image can be revealed by using our eyes. The experimental results included in this paper show that our method is very practicable. The text was submitted by the authors in English. Wei-Liang Tai received his BS degree in Computer Science in 2002 from Tamkang University, Tamsui, Taiwan, and his MS degree in Computer Science and Information Engineering in 2004 from National Chung Cheng University, Chiayi, Taiwan. He is currently a PhD student of Computer Science and Information Engineering at National Chung Cheng University. His research fields are image hiding, digital watermarking, and image compression. Chi-Shiang Chan received his BS degree in Computer Science in 1999 from National Cheng Chi University, Taipei, Taiwan, and his MS degree in Computer Science and Information Engineering in 2001 from National Chung Cheng University, Chiayi, Taiwan. He is currently a PhD student of Computer Science and Information Engineering at National Chung Cheng University. His research fields are image hiding and image compression. Chin-Chen Chang received his BS degree in Applied Mathematics in 1977 and his MS degree in Computer and Decision Sciences in 1979, both from National Tsing Hua University, Hsinchu, Taiwan. He received his PhD in Computer Engineering in 1982 from National Chiao Tung University, Hsinchu, Taiwan. During the academic years of 1980–1983, he was on the faculty of the Department of Computer Engineering at National Chiao Tung University. From 1983–1989, he was on the faculty of the Institute of Applied Mathematics, National Chung Hsing University, Taichung, Taiwan. From 1989 to 2004, he has worked as a professor in the Institute of Computer Science and Information Engineering at National Chung Cheng University, Chiayi, Taiwan. Since 2005, he has worked as a professor in the Department of Information Engineering and Computer Science at Feng Chia University, Taichung, Taiwan. Dr. Chang is a fellow of the IEEE, a fellow of the IEE, and a member of the Chinese Language Computer Society, the Chinese Institute of Engineers of the Republic of China, and the Phi Tau Phi Society of the Republic of China. His research interests include computer cryptography, data engineering, and image compression.     

A new type of solution method for the generalized linear complementarity problem over a polyhedral cone

This paper addresses the generalized linear complementarity problem （GLCP） over a polyhedral cone. To solve the problem, we first equivalently convert the problem into an affine variational inequalities problem over a closed polyhedral cone, and then propose a new type of method to solve the GLCP based on the error bound estimation. The global and R-linear convergence rate is established. The numerical experiments show the efficiency of the method.