Probability Distributions.- Linear Models for Regression.- Linear Models for Classification.- Neural Networks.- Kernel Methods.- Sparse Kernel Machines.- Graphical Models.- Mixture Models and EM.- Approximate Inference.- Sampling Methods.- Continuous Latent Variables.- Sequential Data.- Combining Models.

Pattern Recognition and Machine Learning

Since the first shape-from-shading (SFS) technique was developed by Horn in the early 1970s, many different approaches have emerged. In this paper, six well-known SFS algorithms are implemented and compared. The performance of the algorithms was analyzed on synthetic images using mean and standard deviation of depth (Z) error, mean of surface gradient (p, q) error, and CPU timing. Each algorithm works well for certain images, but performs poorly for others. In general, minimization approaches are more robust, while the other approaches are faster.

https://crcv.ucf.edu/papers/Zhang_Tsai_Cryer_Shah_PAMI1999.pdf

Shape-from-shading: a survey

https://hal.inria.fr/inria-00074398/document

A robust technique for matching two uncalibrated images through the recovery of the unknown epipolar geometry

Constraint programming is a powerful paradigm for solving combinatorial search problems that draws on a wide range of techniques from artificial intelligence, computer science, databases, programming languages, and operations research. Constraint programming is currently applied with success to many domains, such as scheduling, planning, vehicle routing, configuration, networks, and bioinformatics.

The aim of this handbook is to capture the full breadth and depth of the constraint programming field and to be encyclopedic in its scope and coverage. While there are several excellent books on constraint programming, such books necessarily focus on the main notions and techniques and cannot cover also extensions, applications, and languages. The handbook gives a reasonably complete coverage of all these lines of work, based on constraint programming, so that a reader can have a rather precise idea of the whole field and its potential. Of course each line of work is dealt with in a survey-like style, where some details may be neglected in favor of coverage. However, the extensive bibliography of each chapter will help the interested readers to find suitable sources for the missing details. Each chapter of the handbook is intended to be a self-contained survey of a topic, and is written by one or more authors who are leading researchers in the area.

The intended audience of the handbook is researchers, graduate students, higher-year undergraduates and practitioners who wish to learn about the state-of-the-art in constraint programming. No prior knowledge about the field is necessary to be able to read the chapters and gather useful knowledge. Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas.

The handbook is organized in two parts. The first part covers the basic foundations of constraint programming, including the history, the notion of constraint propagation, basic search methods, global constraints, tractability and computational complexity, and important issues in modeling a problem as a constraint problem. The second part covers constraint languages and solver, several useful extensions to the basic framework (such as interval constraints, structured domains, and distributed CSPs), and successful application areas for constraint programming.

- Covers the whole field of constraint programming
- Survey-style chapters
- Five chapters on applications

Table of Contents

Foreword (Ugo Montanari) 
Part I : Foundations
Chapter 1. Introduction (Francesca Rossi, Peter van Beek, Toby Walsh) 
Chapter 2. Constraint Satisfaction: An Emerging Paradigm (Eugene C. Freuder, Alan K. Mackworth) 
Chapter 3. Constraint Propagation (Christian Bessiere) 
Chapter 4. Backtracking Search Algorithms (Peter van Beek) 
Chapter 5. Local Search Methods (Holger H. Hoos, Edward Tsang) 
Chapter 6. Global Constraints (Willem-Jan van Hoeve, Irit Katriel)
Chapter 7. Tractable Structures for CSPs (Rina Dechter)
Chapter 8. The Complexity of Constraint Languages
(David Cohen, Peter Jeavons) 
Chapter 9. Soft Constraints (Pedro Meseguer, Francesca Rossi, Thomas Schiex) 
Chapter 10. Symmetry in Constraint Programming
(Ian P. Gent, Karen E. Petrie, Jean-Francois Puget)
Chapter 11. Modelling (Barbara M. Smith) 
Part II : Extensions, Languages, and Applications

Chapter 12. Constraint Logic Programming (Kim Marriott, Peter J. Stuckey, Mark Wallace) 
Chapter 13. Constraints in Procedural and Concurrent Languages (Thom Fruehwirth, Laurent Michel, Christian Schulte)
Chapter 14. Finite Domain Constraint Programming Systems (Christian Schulte, Mats Carlsson) 
Chapter 15. Operations Research Methods in Constraint Programming (John Hooker) 
Chapter 16. Continuous and Interval Constraints(Frederic Benhamou, Laurent Granvilliers) 
Chapter 17. Constraints over Structured Domains
(Carmen Gervet) 
Chapter 18. Randomness and Structure (Carla Gomes, Toby Walsh)
Chapter 19. Temporal CSPs (Manolis Koubarakis)
Chapter 20. Distributed Constraint Programming
(Boi Faltings) 
Chapter 21. Uncertainty and Change (Kenneth N. Brown, Ian Miguel)
Chapter 22. Constraint-Based Scheduling and Planning
(Philippe Baptiste, Philippe Laborie, Claude Le Pape, Wim Nuijten)
Chapter 23. Vehicle Routing (Philip Kilby, Paul Shaw) 
Chapter 24. Configuration (Ulrich Junker)
Chapter 25. Constraint Applications in Networks
(Helmut Simonis)
Chapter 26. Bioinformatics and Constraints (Rolf Backofen, David Gilbert)

/pdf/handbook-of-constraint-programming-53srutguo2.pdf

Handbook of Constraint Programming

A recommender system aims to provide users with personalized online product or service recommendations to handle the increasing online information overload problem and improve customer relationship management. Various recommender system techniques have been proposed since the mid-1990s, and many sorts of recommender system software have been developed recently for a variety of applications. Researchers and managers recognize that recommender systems offer great opportunities and challenges for business, government, education, and other domains, with more recent successful developments of recommender systems for real-world applications becoming apparent. It is thus vital that a high quality, instructive review of current trends should be conducted, not only of the theoretical research results but more importantly of the practical developments in recommender systems. This paper therefore reviews up-to-date application developments of recommender systems, clusters their applications into eight main categories: e-government, e-business, e-commerce/e-shopping, e-library, e-learning, e-tourism, e-resource services and e-group activities, and summarizes the related recommendation techniques used in each category. It systematically examines the reported recommender systems through four dimensions: recommendation methods (such as CF), recommender systems software (such as BizSeeker), real-world application domains (such as e-business) and application platforms (such as mobile-based platforms). Some significant new topics are identified and listed as new directions. By providing a state-of-the-art knowledge, this survey will directly support researchers and practical professionals in their understanding of developments in recommender system applications. Research papers on various recommender system applications are summarized.The recommender systems are examined systematically through four dimensions.The recommender system applications are classified into eight categories.Related recommendation techniques in each category are identified.Several new recommendation techniques and application areas are uncovered.

Recommender system application developments

Handling forecasting problems using fuzzy time series

This paper develops improved methods of estimating local surface orientation from shading information with the aid of a coordinate system having one axis in the (assumed) direction of the light source. In this system, the surface tilt is related to the direction of the gray level gradient at the given point. An alternative formulation of the surface slant probability density is developed that takes the discrete nature of digital images into account, and that yields a better estimate of the light source direction.

Improved methods of estimating shape from shading using the light source coordinate system

S. Ullman's classical (1979) results on motion/structure from orthographic views are revisited. Specifically, two results are presented: (1) two orthographic views allow an uncountably infinite number of solutions to motion/structure of a rigid body, and (2) a linear algorithm for solving motion/structure from four point correspondences over three views. >

Motion and structure from orthographic projections

The main purpose of this paper is to use off-the-shelf devices to develop a fall detection system. In human body identification, human body silhouette is adopted to improve privacy protection, and vertical projection histograms of the silhouette image and statistical scheme are used to reduce the effect of human body upper limb activities. The kNN classification algorithm is used to classify the postures using the ratio and difference of human body silhouette bounding box height and width. Meanwhile, since time difference is a vital factor to differentiate fall incident event and lying down event, the critical time difference is obtained from the experiment and verified by statistical hypothesis testing. With the help of the kNN classifier and the critical time difference, a fall incident detection system is developed to detect fall incident events. The experiment shows that it could reduce the effect of upper limb activities and the system has a correct rate of 84.44% on fall detection and lying down event detection.

https://ir.nctu.edu.tw:443/bitstream/11536/32136/1/000279408200052.pdf

Chia-Hoang Lee

Papers

Handling forecasting problems using fuzzy time series

Improved methods of estimating shape from shading using the light source coordinate system

Improved methods of estimating shape from shading using the light source coordinate system

Motion and structure from orthographic projections

A fall detection system using k-nearest neighbor classifier