580 California St., Suite 400
San Francisco, CA, 94104
In this short paper we give the final resolution of "P versus NP" theorem according to our previous results obtained in the field of automaton implementation for extended regular expressions and generally intersection operator.
This paper argues that the idea of a computer is unique. Calculators and analog computers are not different ideas about computers, and nature does not compute by itself. Computers, once clearly defined in all their terms and mechanisms,... more
We propose a simple and intuitive algorithm for solving md-DFA problem using algorithm concepts within extended operators, our approach shows quadratic polynomial time and hence proves the equivalence between polynomial and non-polynomial... more
We are to investigate the most common mistake in science and failure, which goes through the lenses of what is to be done and proved, thus, we give the full proof in this book according to “P versus NP” theorem by Stephen Cook, which was... more
Determining point-to-point correspondence in multiple images is a complex problem because of the multiple geometric and photometric transformations and/or occlusions that the same point can undergo in corresponding images. This paper... more
We present a novel algorithm for deciding whether a given planar curve is an image of a given spatial curve, obtained by a central or a parallel projection with unknown parameters. The motivation comes from the problem of establishing a... more
Registration is a fundamental task in image processing. Its purpose is to find a geometrical transformation that relates the points of an image to their corresponding points of another image. The determination of the optimal... more
This paper studies the perturbation of a Lie-Poisson (or, equivalently an Euler-Poincar6) system by a special dissipation term that has Brockett's double bracket form. We show that a formally unstable equilibrium of the unperturbed system... more
We propose a technique that combines geometric hashing with stereo vision. The idea is to use the robustness of geometric hashing to spurious data to overcome the correspondence problem, while the stereo vision setup enables direct model... more
One of the goals in the field of mobile robotics is the development of mobile platforms which operate in populated environments and offer various services to humans. For many tasks it is highly desirable that a robot can determine the... more
A simple extension method of the ICP algorithm using point quality based on the distance and incident angle is presented for improving the registration accuracy of TLS point clouds. First, using a structured point cloud representation,... more
Perturbations A T of a selfadjoint operator A by symmetric finite rank operators T from H 2 (A) to H -2 (A) are studied. The finite dimensional family of selfadjoint extensions determined by A T is given explicitly.
Perceived positions of flashed stimuli can be altered by motion signals in the visual field—position capture (Whitney and Cavanagh, 2000 Nature Neuroscience3 954–959). We examined whether position capture of flashed stimuli depends on the... more
WAXMAN DUNCAN // 1. INTRODUCTION In decomposing the visual information processing task into several stages, it is the intermediate level which is responsible for the recovery of surface shapes in a scene.fMarr 1982)> It is often described... more
Feature detection and matching are fundamental components in computer vision, underpinning a broad spectrum of applications. This study offers a comprehensive evaluation of traditional feature detections and descriptors, analyzing methods... more
Publication in the conference proceedings of EUSIPCO, Rhodes, Greece, 1998
Many previous literatures use landmarks to guide the correspondence of 3D faces. However, these landmarks, either manually or automatically annotated, are hard to define consistently across different faces in many circumstances. We... more
We introduce a new type of language equation, namely implicit equations, and derive a number of properties which clearly demonstrate that the behavior of implicit equations differs substantially from that of conventional or explicit ones.... more
The asymptotic behavior of the sequence {un} of positive first eigenfunctions for a class of eigenvalue problems is studied in a bounded domain with smooth boundary ∂Ω. We prove , where δ is the distance function to ∂Ω. Our study... more
When people track moving objects, they concentrate on different characteristics. Recent results show that people more often concentrate on spatiotemporal than featural properties of the objects. In other words, location and direction of... more
This paper presents a novel segment-based stereo matching algorithm for disparity map generation which is computationally inexpensive. In this paper, bilateral filtered left and right images are segmented. Then, high confidence disparity... more
In the last decade or so, projective geometric techniques have led to major advances in the analysis of structure of a scene from a video sequence, or from individual images. This is the problem known as "Structure from Motion". Much of... more
This article discusses our recent proof that above eight dimensions the scaling limit of sufficiently spread-out lattice trees is the variant of super-Brownian motion calledintegrated super-Brownian excursion(ISE), as conjectured by... more
In program verification, we check that an implementation meets its specification. Both the specification and the implementation describe the possible behaviors of the program, though at different levels of abstraction. We distinguish... more
overlap implies runaway growth in hierarchical tile systems
— We propose a novel solution to object detection, localization and pose estimation with applications in robot vision. The proposed method is especially applicable when the objects of interest may not be richly textured and are immersed... more
A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems
In this paper, we consider a graphical realization of dynamic programming. The concept is discussed on the partition and knapsack problems. In contrast to dynamic programming, the new algorithm can also treat problems with non-integer... more
Feature correspondence is an important step in image registration. Chamfer matching is a process of establishing the feature correspondence of an object (subimage) in an image where both the subimage and the image are binary. Chamfer... more
We present a novel algorithm for deciding whether a given planar curve is an image of a given spatial curve, obtained by a central or a parallel projection with unknown parameters. The motivation comes from the problem of establishing a... more
A novel method ICF (Identifying point correspondences by Correspondence Function) is proposed for rejecting mismatches from given putative point correspondences. By analyzing the connotation of homography, we introduce a novel concept of... more
We propose general variational inclusion problems which are slightly different from corresponding problems considered in several recent papers in the literature and show that they are advantageous. Sufficient conditions for the solution... more
We describe a theoretical formulation for stereo in terms of the Markov Random Field and Bayesian approach to vision. This formulation enables us to integrate the depth information from different types of matching primitives, or from... more
It is shown that the encoding/decoding problem for any asynchronous -user discrete memoryless multiple-access channel can be reduced to corresponding problems for at most 2 1 single-user discrete memoryless channels. This result, which... more
We propose a proximal uniformity constraint to solve the correspondence problem. According to this constraint, most objects in the real world follow smooth paths and cover a small distance in a small time. An efficient, non iterative... more
We propose a simple and intuitive algorithm for solving md-DFA problem using algorithm concepts within extended operators, our approach shows quadratic polynomial time and hence proves the equivalence between polynomial and non-polynomial... more
This paper describes some of the work on stereo that has been going on at INRIA in the last four years. The work has concentrated on obtaining dense, accurate, and reliable range maps of the environment at rates compatible with the... more
This work describes the hypothesis of the relation between the classes of complexity: for this purpose we define the functions over algorithms or state machines for which the equality holds true and, thus, the decision can be made towards... more
In this article, we compute the topological expansion of all possible mixed-traces in a hermitian two matrix model. In other words we give a recipe to compute the number of discrete surfaces of given genus, carrying an Ising model, and... more
This paper aims to propose a unified theoretical background for the investigation of unstable behaviour onset of inelastic solids. By using the theory of dynamical systems we present definitions and a method, which could be a general tool... more
Sometimes one needs to approximate a curve by means of splines that preserve the length of the given curve. This is the case, for instance, of the trajectory of an inclined oil-well, where the length of the path described by the... more
Estimating a meaningful average or mean shape from a set of shapes represented by unlabeled point-sets is a challenging problem since, usually this involves solving for point correspondence under a non-rigid motion setting. In this paper,... more
The visual system integrates information from the left and right eyes and constructs a visual world that is perceived as single and three dimensional. To understand neural mechanisms underlying this process, it is important to learn about... more
The visual system integrates information from the left and right eyes and constructs a visual world that is perceived as single and three dimensional. To understand neural mechanisms underlying this process, it is important to learn about... more
In metabonomics it is difficult to tell which peak is which in datasets with many samples. This is known as the correspondence problem. Data from different samples are not synchronised, i.e., the peak from one metabolite does not appear... more
A geometrical realization of wonderful varieties by means of a suitably chosen class of invariant Hilbert schemes is given. As a consequence, Luna's conjecture asserting that wonderful varieties are classified by combinatorial invariants,... more
A geometrical realization of wonderful varieties by means of a suitably chosen class of invariant Hilbert schemes is given. As a consequence, Luna's conjecture asserting that wonderful varieties are classified by combinatorial invariants,... more
In this study, an adaptive space mapping technique based on response of objective was suggested for solving practical engineering problems. Response surface methodology was engaged in approximation of objective and constraint functions... more
The automatic co-registration of point clouds, representing 3D surfaces, is a relevant problem in 3D modeling. This multiple registration problem can be defined as a surface matching task. We treat it as least squares matching of... more