scholarly journals Combining Stereovision Matching Constraints for Solving the Correspondence Problem

10.5772/13025 ◽  
2011 ◽  
Author(s):  
Gonzalo Pajares ◽  
P. Javier ◽  
Jess M. de la Cruz
Keyword(s):  
Correspondence Problem ◽  
Matching Constraints

Wire Load Oriented Analog Routing with Matching Constraints

2020 ◽  
Vol 25 (6) ◽  
pp. 1-26
Author(s):  
Hao Yu Chi ◽  
Chien Nan Jimmy Liu ◽  
Hung Ming Chen
Keyword(s):  
Matching Constraints

Van der Waals Epitaxy of GaSe on GaAs(111)

1994 ◽  
Vol 340 ◽  
Author(s):  
L. E. Rumaner ◽  
F.S. Ohuchi
Keyword(s):  
Lattice Mismatch ◽  
Van Der Waals ◽  
Three Dimensional ◽  
Structured Materials ◽  
Lattice Matching ◽  
Molecular Beam Deposition ◽  
Crystal Films ◽  
Low Dimensional ◽  
Matching Constraints ◽  
Lattice Matched

ABSTRACTAlthough heteroepitaxy of lattice-matched and lattice-mismatched materials leading to artificially structured materials has resulted in impressive performance in various electronics devices, material combinations are usually limited by lattice matching constraints. A new concept for fabricating material systems using the atomically abrupt and low dimensional nature of layered materials, called van der Waals epitaxy (VDWE), has been developed. GaSe (Eg = 2.1 eV) has been deposited on the three dimensional surface of GaAs (111) using a molecular beam deposition system. GaSe was evaporated from a single Knudsen source, impinging on a heated substrate. Even with a lattice mismatch of 6% between the substrate and the growing film, good quality single crystal films were grown as determined by RHEED. The films have further been analyzed using a complementary combination of XPS and X-ray reflectivity.

The Modeling and Locating Technology of Assembly\Disassembly Tools in Virtual Environment

2013 ◽  
Vol 483 ◽  
pp. 229-233
Author(s):  
Yi Liu ◽  
Shi Qi Li ◽  
Jun Feng Wang
Keyword(s):  
Real Time ◽  
Virtual Environment ◽  
Virtual Assembly ◽  
Vector Model ◽  
Assembly System ◽  
Virtual Scene ◽  
Matching Constraints ◽  
Point Vector

This paper presents a feasible approach for modeling and locating of assembly\disassembly tools in the virtual scene: First, a novel point-vector model for tool is presented by means of abstracting the locating constraints of tools; Then, the mapping relationship for locating constraints between tools and parts is detailed; Finally, the best matching constraints algorithm is proposed on basis of point-vector model, which can calculate the locating constraints to the triangle model of part in real time. The proposed method has been integrated in the virtual assembly system to solve practical assembly problems.

Relaxed current-matching constraints by bifacial operation and luminescent coupling in perovskite/silicon tandem solar cells

2021 ◽  
Author(s):  
Peter Tillmann ◽  
Klaus Jager ◽  
Eugene A. Katz ◽  
Christiane Becker
Keyword(s):  
Solar Cells ◽  
Tandem Solar Cells ◽  
Current Matching ◽  
Matching Constraints

Tackling the Correspondence Problem

2013 ◽  
pp. 84-95 ◽  
Author(s):  
Yasser Mohammad ◽  
Toyoaki Nishida
Keyword(s):  
Correspondence Problem

scholarly journals Encoding of Binocular Disparity by Complex Cells in the Cat's Visual Cortex

1997 ◽  
Vol 77 (6) ◽  
pp. 2879-2909 ◽  
Author(s):  
Izumi Ohzawa ◽  
Gregory C. Deangelis ◽  
Ralph D. Freeman
Keyword(s):  
Visual Cortex ◽  
Striate Cortex ◽  
Binocular Disparity ◽  
Substantial Reduction ◽  
Energy Model ◽  
Simple Type ◽  
Correspondence Problem ◽  
Complex Cell ◽  
Stimulus Contrast ◽  
Complex Cells

Ohzawa, Izumi, Gregory C. DeAngelis, and Ralph D. Freeman. Encoding of binocular disparity by complex cells in the cat's visual cortex. J. Neurophysiol. 77: 2879–2909, 1997. To examine the roles that complex cells play in stereopsis, we have recorded extracellularly from isolated single neurons in the striate cortex of anesthetized paralyzed cats. We measured binocular responses of complex cells using a comprehensive stimulus set that encompasses all possible combinations of positions over the receptive fields for the two eyes. For a given position combination, stimulus contrast could be the same for the two eyes (2 bright or 2 dark bars) or opposite (1 bright and 1 dark). These measurements provide a binocular receptive field (RF) profile that completely characterizes complex cell responses in a joint domain of left and right stimulus positions. Complex cells typically exhibit a strong selectivity for binocular disparity, but are only broadly selective for stimulus position. For most cells, selectivity for disparity is more than twice as narrow as that for position. These characteristics are highly desirable if we assume that a disparity sensor should exhibit position invariance while encoding small changes in stimulus depth. Complex cells have nearly identical binocular RFs for bright and dark stimuli as long as the sign of stimulus contrast is the same for the two eyes. When stimulus contrast is opposite, the binocular RF also is inverted such that excitatory subregions become suppressive. We have developed a disparity energy model that accounts for the behavior of disparity-sensitive complex cells. This is a hierarchical model that incorporates specific constraints on the selection of simple cells from which a complex cell receives input. Experimental data are used to examine quantitatively predictions of the model. Responses of complex cells generally agree well with predictions of the disparity energy model. However, various types of deviations from the predictions also are found, including a highly elongated excitatory region beyond that supported by a single energy mechanism. Complex cells in the visual cortex appear to provide a next level of abstraction in encoding information for stereopsis based on the activity of a group of simple-type subunits. In addition to exhibiting narrow disparity tuning and position invariance, these cells seem to provide a partial solution to the stereo correspondence problem that arises in complex natural scenes. Based on their binocular response properties, these cells provide a substantial reduction in the complexity of the correspondence problem.

REDUCTION TREE OF THE BINARY GENERALIZED POST CORRESPONDENCE PROBLEM

2011 ◽  
Vol 22 (02) ◽  
pp. 473-490 ◽  
Author(s):  
VESA HALAVA ◽  
ŠTĚPÁN HOLUB
Keyword(s):  
Detailed Analysis ◽  
Polynomial Time ◽  
Upper Bound ◽  
Decision Process ◽  
Correspondence Problem ◽  
Single Instance ◽  
Binary Case

An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper we study the reduction tree of GPCP in the binary case. This entails in particular a detailed analysis of the structure of end blocks. We give an upper bound for the number of end blocks, and show that even if an instance has more than one successor, it can nevertheless be reduced to a single instance. This, in particular, implies that binary GPCP can be decided in polynomial time.

Amodal Completion and the Perception of Depth without Binocular Correspondence

Perception ◽  
10.1068/p3305 ◽  
2002 ◽  
Vol 31 (9) ◽  
pp. 1037-1045 ◽  
Author(s):  
Benoit A Bacon ◽  
Pascal Mamassian
Keyword(s):  
Amodal Completion ◽  
Correspondence Problem ◽  
Illusory Contours ◽  
Binocular Matching ◽  
Partially Occluded ◽  
Global Surface

Half-occlusions and illusory contours have recently been used to show that depth can be perceived in the absence of binocular correspondence and that there is more to stereopsis than solving the correspondence problem. In the present study we show a new way for depth to be assigned in the absence of binocular correspondence, namely amodal completion. Although an occluder removed all possibility of direct binocular matching, subjects consistently assigned the correct depth (convexity or concavity) to partially occluded ‘folded cards’ stimuli. Our results highlight the importance of more global, surface-based processes in stereopsis.

Sign in / Sign up

Export Citation Format

Share Document