To see the other types of publications on this topic, follow the link: Partial object matching.
Journal articles on the topic 'Partial object matching'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Partial object matching.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
Ying Shan, H. S. Sawhney, B. Matei, and R. Kumar. "Shapeme histogram projection and matching for partial object recognition." IEEE Transactions on Pattern Analysis and Machine Intelligence 28, no. 4 (April 2006): 568–77. http://dx.doi.org/10.1109/tpami.2006.83.
Full text
2
Fan, Huijie, Yang Cong, and Yandong Tang. "Object detection based on scale-invariant partial shape matching." Machine Vision and Applications 26, no. 6 (June 27, 2015): 711–21. http://dx.doi.org/10.1007/s00138-015-0693-y.
Full text
3
Arhid, K., F. R. Zakani, M. Bouksim, B. Sirbal, M. Aboulfatah, and T. Gad. "A novel approach for partial shape matching and similarity based on data envelopment analysis." Computer Optics 43, no. 2 (April 2019): 316–23. http://dx.doi.org/10.18287/2412-6179-2019-43-2-316-323.
Full textAbstract:
Due to the growing number of 3D objects in digital libraries, the task of searching and browsing models in an extensive 3D database has been the focus of considerable research in the area. In the last decade, several approaches to retrieve 3D models based on shape similarity have been proposed. The majority of the existing methods addresses the problem of similarity between objects as a global matching problem. Consequently, most of these techniques do not support a part of the object as a query, in addition to their poor performance for classes with globally non-similar shape models and also for articulated objects. The partial matching technique seems to be a suitable solution to these problems. In this paper, we address the problem of shape matching and retrieval. We propose a new approach based on partial matching in which each 3D object is segmented into its constituent parts, and shape descriptors are computed from these elements to compare similarities. Several experiments investigated that our technique enables fast computing for content-based 3D shape retrieval and significantly improves the results of our method based on Data Envelopment Analysis descriptor for global matching.
4
BHANDARKAR, SUCHENDRA M. "A SURFACE FEATURE ATTRIBUTED HYPERGRAPH REPRESENTATION FOR 3-D OBJECT RECOGNITION." International Journal of Pattern Recognition and Artificial Intelligence 09, no. 06 (December 1995): 869–909. http://dx.doi.org/10.1142/s0218001495000365.
Full textAbstract:
A surface feature hypergraph (SFAHG) representation is proposed for the recognition and localization of three-dimensional objects. The hypergraph representation is shown to be viewpoint independent thus resulting in substantial savings in terms of memory for the object model database. The resulting hypergraph matching algorithm integrates both, relational and the rigid pose constraint in a consistent unified manner. The matching algorithm is also shown to have a polynomial order of complexity even in multiple-object scenes with instances of objects partially occluding each other. An algorithm for incrementally constructing the hypergraph representation of an object model from range images of the object taken from different viewpoints is also presented. The hypergraph matching and the hypergraph construction algorithms are shown to be capable of correcting errors in the initial segmentation of the range image. The hypergraph construction algorithm and the matching algorithm are tested on range images of scenes containing multiple three-dimensional objects with partial occlusion.
5
Eckes, Christian, Jochen Triesch, and Christoph von der Malsburg. "Analysis of Cluttered Scenes Using an Elastic Matching Approach for Stereo Images." Neural Computation 18, no. 6 (June 2006): 1441–71. http://dx.doi.org/10.1162/neco.2006.18.6.1441.
Full textAbstract:
We present a system for the automatic interpretation of cluttered scenes containing multiple partly occluded objects in front of unknown, complex backgrounds. The system is based on an extended elastic graph matching algorithm that allows the explicit modeling of partial occlusions. Our approach extends an earlier system in two ways. First, we use elastic graph matching in stereo image pairs to increase matching robustness and disambiguate occlusion relations. Second, we use richer feature descriptions in the object models by integrating shape and texture with color features. We demonstrate that the combination of both extensions substantially increases recognition performance. The system learns about new objects in a simple one-shot learning approach. Despite the lack of statistical information in the object models and the lack of an explicit background model, our system performs surprisingly well for this very difficult task. Our results underscore the advantages of view-based feature constellation representations for difficult object recognition problems.
6
Wang, Hong Shen, Lin Zhang, and Yong Gui Zhang. "Partial Matching of 3D CAD Models with Attributed Graph." Applied Mechanics and Materials 528 (February 2014): 302–9. http://dx.doi.org/10.4028/www.scientific.net/amm.528.302.
Full textAbstract:
This paper presents an algorithm for matching similar sub-parts of 3D CAD models. The matching process is based on the attributed graphs. Each model in target object database is represented by attributed graph. The sub-part, which is to be retrieved, is selected interactively by users from a 3D CAD model described by boundary representation (B-Rep) and its attributed graph is automatically generated. For each target CAD model in the database, its surfaces which are similar to those surfaces of the query sub-part are identified by means of the attributes. Then, other irrelevant surfaces of the target object are deleted from the model’s attributed graph. Thus, the parts that are possibly similar to the query sub-part are separated from the target model. A method for calculating the similarity coefficient between the separated part and the sub-part, which uses an optimal matching algorithm for bi-graphs, is proposed. Experimental results show that this algorithm can efficiently achieve partial retrieval.
7
Zulkoffli, Z., and Elmi Abu Bakar. "Partial pose estimation of 3D rigid object system using outer box method." Indonesian Journal of Electrical Engineering and Computer Science 18, no. 2 (May 1, 2020): 790. http://dx.doi.org/10.11591/ijeecs.v18.i2.pp790-798.
Full textAbstract:
<p><span>This article introduces a novel approach for identify partial pose estimation using template matching method. The algorithms performs 2D correlation matching on tested image to CAD database by using regional shape representation in order to get the similar object pose in CAD database. The descriptor named outer box method, it is useful for rescale or aligning object size in both different images of tested image and CAD database image and also provide interest point for segmentation in image registration stage. The proposed algorithm were experimentally shown to be robust to apply on scale changes, various complex shape, unstructured CAD database and mixed CAD model database. Last part, the identified pose and its retrieved pose angle was calculated and achieved high accuracyin range ±0.388˚ to ±1.471˚.</span></p>
8
CHAUDHURY, SANTANU, S. SUBRAMANIAN, and GUTURU PARTHASARATHY. "RECOGNITION OF PARTIAL PLANAR SHAPES IN LIMITED MEMORY ENVIRONMENTS." International Journal of Pattern Recognition and Artificial Intelligence 04, no. 04 (December 1990): 603–28. http://dx.doi.org/10.1142/s0218001490000344.
Full textAbstract:
Industrial vision systems should be capable of recognising noisy objects, partially occluded objects and randomly located and/or oriented objects. This paper considers the problem of recognition of partially occluded planar shapes using contour segment-based features. None of the techniques suggested in the literature for solving the above problem guarantee reliable results for problem instances which require memory in excess of what is available. In this paper, a heuristic search-based recognition algorithm is presented, which guarantees reliable recognition results even when memory is limited. This algorithm identifies an object, the maximum portion of whose contour is visible in a conglomerate of objects. For increasing efficiency of the method, a two-stage recognition scheme has been designed. In the first phase, a relevant subset of the known model shapes is chosen and in the second stage, matching between the unknown shape and elements of the relevant subset is attempted using the above approach. The technique is general in the sense that it can be used with any kind of contour features. To evaluate the efficiency of the method, experimentation was carried out using polygonal approximations of the object contours. Results are cited for establishing the effectiveness of the approach.
9
WU, YOUFU, and MO DAI. "DETECTION AND ANALYSIS OF MOVING OBJECTS FOR VIDEO SURVEILLANCE." International Journal of Information Acquisition 02, no. 03 (September 2005): 227–39. http://dx.doi.org/10.1142/s0219878905000623.
Full textAbstract:
In this paper, we address the problem of detection and analysis of moving objects in a video stream obtained by a fixed camera. To detect the moving objects, the tradition method is to create a fixed image first, which includes all the motionless parts of the scene, known as the background model. The difficulty of this approach lies mainly in two aspects: The first relates to the fact that a slow moving object can leave a visible trace in background model. The latter comes from the variation of illumination in the course of time so it cannot obtain a reasonable background model. To overcome these difficulties, we propose a multiple background model. At the exit of the detection of moving objects, the tracking (matching) of a moving object extracted in the successive images is necessary to analyze its behavior. After the matching of mobile objects, a series of analysis methods are presented. The proposed tracking and analysis methods allow dealing with partial occlusions, stopping and going motion, moving directions, crossing of moving object in very challenging situations. The experiment and comparison results are reported for different real sequences, which show better performance of our methods.
10
Elboushaki, Abdessamad, Rachida Hannane, Karim Afdel, and Lahcen Koutti. "A robust approach for object matching and classification using Partial Dominant Orientation Descriptor." Pattern Recognition 64 (April 2017): 168–86. http://dx.doi.org/10.1016/j.patcog.2016.11.004.
Full text
11
Kunimitsu, Satoshi, Hajime Asama, Kuniaki Kawabata, and Taketoshi Mishima. "Detection of Object under Outdoor Environment by Matching with Partial and Whole Templates." IEEJ Transactions on Electronics, Information and Systems 125, no. 1 (2005): 57–66. http://dx.doi.org/10.1541/ieejeiss.125.57.
Full text
12
Kunimitsu, Satoshi, Hajime Asama, Kuniaki Kawabata, and Taketoshi Mishima. "Detection of object under outdoor environment by matching with partial and whole templates." Electrical Engineering in Japan 154, no. 4 (March 2006): 49–60. http://dx.doi.org/10.1002/eej.20270.
Full text
13
VILLAMAYOR-VENIALBO, WALDEMAR, HORACIO LEGAL-AYALA, EDSON J. R. JUSTINO, and JACQUES FACON. "A PARTIAL MATCHING FRAMEWORK BASED ON SET EXCLUSION CRITERIA." International Journal of Pattern Recognition and Artificial Intelligence 26, no. 02 (March 2012): 1265003. http://dx.doi.org/10.1142/s021800141265003x.
Full textAbstract:
This article introduces a partial matching framework, based on set theory criteria, for the measurement of shape similarity. The matching framework is described in an abstract way because the proposed scheme is independent of the selection of a segmentation method and feature space. This paradigm ensures the high adaptability of the algorithm and brings the implementer a wide control over the robustness, the ability to balance between selectivity and sensitivity, and the freedom to deal with more general and arbitrary image transformations required for some particular problem. A strategy to establish a descriptor set obtained from components segmented from the main shape is expounded, and two exclusion measure functions are formulated. Proofs are given to show that it is not required to match the entire descriptor sets to determine that two shapes are similar. The methodology provides a dissimilarity score that may be used for shape-based retrieval and object recognition; this is demonstrated applying the proposed approach in a cattle brand identification system.
14
Cui, Ying Min, Hai Wang, and Jian Zhang. "3D Restructuring and Splicing Technology of Shape Space Frame." Applied Mechanics and Materials 644-650 (September 2014): 1438–42. http://dx.doi.org/10.4028/www.scientific.net/amm.644-650.1438.
Full textAbstract:
The 3D Shape Measuring Technology for physical objects has wide application in fields covering automatic detection, physical object profile modelling, automatic production, computer aided design/manufacturing and quality control, etc. Through the matching relations of several feature points between the partial 3D scanning point cloud data and the space frame, the transformation relations between different coordinate systems can be inferred. As for the inferring of the transformation parameters R and T, the SVD matrix decomposition algorithm has been used to acquire a better precision solution. According to the transformation relation, after registering the partial 3D scanning point cloud data and the space frame, through splicing the partial scanning point cloud data and the space frame data, the detection across the whole field on large-area objects can be realized, which will effectively increase the precision of three-dimensional measuring of large-area objects.
15
Foerster, Rebecca M., and Werner X. Schneider. "Task-Irrelevant Features in Visual Working Memory Influence Covert Attention: Evidence from a Partial Report Task." Vision 3, no. 3 (August 27, 2019): 42. http://dx.doi.org/10.3390/vision3030042.
Full textAbstract:
Selecting a target based on a representation in visual working memory (VWM) affords biasing covert attention towards objects with memory-matching features. Recently, we showed that even task-irrelevant features of a VWM template bias attention. Specifically, when participants had to saccade to a cued shape, distractors sharing the cue’s search-irrelevant color captured the eyes. While a saccade always aims at one target location, multiple locations can be attended covertly. Here, we investigated whether covert attention is captured similarly as the eyes. In our partial report task, each trial started with a shape-defined search cue, followed by a fixation cross. Next, two colored shapes, each including a letter, appeared left and right from fixation, followed by masks. The letter inside that shape matching the preceding cue had to be reported. In Experiment 1, either target, distractor, both, or no object matched the cue’s irrelevant color. Target-letter reports were most frequent in target-match trials and least frequent in distractor-match trials. Irrelevant cue and target color never matched in Experiment 2. Still, participants reported the distractor more often to the target’s disadvantage, when cue and distractor color matched. Thus, irrelevant features of a VWM template can influence covert attention in an involuntarily object-based manner when searching for trial-wise varying targets.
16
Yang, Da Wei, Yan Qi, and Li Ping Liu. "An Object Tracking Method Based on Illumination Compensation." Applied Mechanics and Materials 742 (March 2015): 286–89. http://dx.doi.org/10.4028/www.scientific.net/amm.742.286.
Full textAbstract:
Aiming at the illumination change and partial occlusion in the object tracking, an object tracking method based on illumination compensation was proposed. An illumination compensation method based on Retinex was applied to the sequence images, a structural appearance model and template matching were used to track the object. Dense sampling was used to obtain candidates, extended least median square was used to match templates, and a step by step template updating method is applied. The experimental results demonstrate the effect of the proposed method.
17
Westphal, Günter, and Rolf P. Würtz. "Combining Feature- and Correspondence-Based Methods for Visual Object Recognition." Neural Computation 21, no. 7 (July 2009): 1952–89. http://dx.doi.org/10.1162/neco.2009.12-07-675.
Full textAbstract:
We present an object recognition system built on a combination of feature- and correspondence-based pattern recognizers. The feature-based part, called preselection network, is a single-layer feedforward network weighted with the amount of information contributed by each feature to the decision at hand. For processing arbitrary objects, we employ small, regular graphs whose nodes are attributed with Gabor amplitudes, termed parquet graphs. The preselection network can quickly rule out most irrelevant matches and leaves only the ambiguous cases, so-called model candidates, to be verified by a rudimentary version of elastic graph matching, a standard correspondence-based technique for face and object recognition. According to the model, graphs are constructed that describe the object in the input image well. We report the results of experiments on standard databases for object recognition. The method achieved high recognition rates on identity and pose. Unlike many other models, it can also cope with varying background, multiple objects, and partial occlusion.
18
Aoyagi, Seiji, Nobuhiko Hattori, Atsushi Kohama, Sho Komai, Masato Suzuki, Masaharu Takano, and Eiji Fukui. "Object Detection and Recognition Using Template Matching with SIFT Features Assisted by Invisible Floor Marks." Journal of Robotics and Mechatronics 21, no. 6 (December 20, 2009): 689–97. http://dx.doi.org/10.20965/jrm.2009.p0689.
Full textAbstract:
For simultaneously localizing and mapping (SLAM) an indoor mobile robot, a method to process a monocular image of entire environmental view is proposed. To ensure that an object can be searched for, invisible floor marks are proposed for modifying the environment and which are useful in narrowing the search area in an image. Specifically our approach involves: 1) narrowing the searched area using invisible floor marks, 2) extracting features based on scale-invariant feature transform (SIFT), 3) using template matching with SIFT features assisted by partial templates and the spatial relationship to the floor, and 4) verifying object recognition with an AdaBoost classifier using Haar-like features based on object shape information. A robot is localized relative to the floor using the floor marks, then, objects in a clattered image are extracted and recognized, and 3D solid models of them are mapped on the floor to build a highly structured 3D map. Recognition was over 80% successful, including tables and chairs and taking several tens of seconds per 640 × 480 pixel image.
19
Cao, Shuang, Yongtao Yu, Haiyan Guan, Daifeng Peng, and Wanqian Yan. "Affine-Function Transformation-Based Object Matching for Vehicle Detection from Unmanned Aerial Vehicle Imagery." Remote Sensing 11, no. 14 (July 19, 2019): 1708. http://dx.doi.org/10.3390/rs11141708.
Full textAbstract:
Vehicle detection from remote sensing images plays a significant role in transportation related applications. However, the scale variations, orientation variations, illumination variations, and partial occlusions of vehicles, as well as the image qualities, bring great challenges for accurate vehicle detection. In this paper, we present an affine-function transformation-based object matching framework for vehicle detection from unmanned aerial vehicle (UAV) images. First, meaningful and non-redundant patches are generated through a superpixel segmentation strategy. Then, the affine-function transformation-based object matching framework is applied to a vehicle template and each of the patches for vehicle existence estimation. Finally, vehicles are detected and located after matching cost thresholding, vehicle location estimation, and multiple response elimination. Quantitative evaluations on two UAV image datasets show that the proposed method achieves an average completeness, correctness, quality, and F1-measure of 0.909, 0.969, 0.883, and 0.938, respectively. Comparative studies also demonstrate that the proposed method achieves compatible performance with the Faster R-CNN and outperforms the other eight existing methods in accurately detecting vehicles of various conditions.
20
Deng, Ting-quan, Jia-shu Dai, Tian-zhen Dong, and Ke-jia Yi. "Visual Tracking via Feature Tensor Multimanifold Discriminate Analysis." Mathematical Problems in Engineering 2014 (2014): 1–12. http://dx.doi.org/10.1155/2014/787093.
Full textAbstract:
In the visual tracking scenarios, if there are multiple objects, due to the interference of similar objects, tracking may fail in the progress of occlusion to separation. To address this problem, this paper proposed a visual tracking algorithm with discrimination through multimanifold learning. Color-gradient-based feature tensor was used to describe object appearance for accommodation of partial occlusion. A prior multimanifold tensor dataset is established through the template matching tracking algorithm. For the purpose of discrimination, tensor distance was defined to determine the intramanifold and intermanifold neighborhood relationship in multimanifold space. Then multimanifold discriminate analysis was employed to construct multilinear projection matrices of submanifolds. Finally, object states were obtained by combining with sequence inference. Meanwhile, the multimanifold dataset and manifold learning embedded projection should be updated online. Experiments were conducted on two real visual surveillance sequences to evaluate the proposed algorithm with three state-of-the-art tracking methods qualitatively and quantitatively. Experimental results show that the proposed algorithm can achieve effective and robust effect in multi-similar-object mutual occlusion scenarios.
21
Yu, Yongtao, Jonathan Li, Jun Yu, Haiyan Guan, and Cheng Wang. "Pairwise Three-Dimensional Shape Context for Partial Object Matching and Retrieval on Mobile Laser Scanning Data." IEEE Geoscience and Remote Sensing Letters 11, no. 5 (May 2014): 1019–23. http://dx.doi.org/10.1109/lgrs.2013.2285237.
Full text
22
MIYAJIMA, Koji, Toshio NORITA, and Anca RALESCU. "MANAGEMENT OF UNCERTAINTY IN TOP-DOWN, FUZZY LOGIC-BASED IMAGE UNDERSTANDING OF NATURAL OBJECTS." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 01, no. 02 (December 1993): 183–92. http://dx.doi.org/10.1142/s0218488593000103.
Full textAbstract:
This paper is concerned with the integration of knowledge intensive methods with low level image processing, in order to achieve a top-down image processing system. The knowledge part contains information about the object to be recognized, the model, expressed here as a part-of hierarchy, and expert knowledge on image processing. Both of these bodies of knowledge are allowed to be imprecise and/or incomplete, in which case fuzzy logic based methods are used for representation and inference. As a consequence, uncertainty management issues, such as partial matching, and evidence combination must be addressed. The approach proposed is most suitable for complex/natural objects and is illustrated for the task of recognizing a human face.
23
Xin, Ming, Sheng Wei Li, and Miao Hui Zhang. "Robust Object Tracking by Particle Filter with Scale Invariant Features." Applied Mechanics and Materials 151 (January 2012): 458–62. http://dx.doi.org/10.4028/www.scientific.net/amm.151.458.
Full textAbstract:
Few literatures employ SIFT (scale-invariant feature transform) for tracking because it is time-consuming. However, we found that SIFT can be adapted to real-time tracking by employing it on a subarea of the whole image. In this paper the particle filter based method exploits SIFT features to handle challenging scenarios such as partial occlusions, scale variations and moderate deformations. As proposed in our method, not a brute-force feature extraction in the whole image, we firstly extract SIFT keypoints in the object search region only for once, through matching SIFT features between object search region and object template, the number of matched keypoints is obtained, which is utilized to compute the particle weights. Finally, we can obtain an optimal estimate to object location by the particle filter framework. Comparative experiments with quantitative evaluations are provided, which indicate that the proposed method is both robust and faster.
24
Kim, Jaekyung, and Euysik Jeon. "Electromagnetic Field Simulation in a Microwave Chamber with Multiple Waveguides." MATEC Web of Conferences 167 (2018): 03001. http://dx.doi.org/10.1051/matecconf/201816703001.
Full textAbstract:
While microwaves have many features and advantages, problems may occur, including non-heating, partial overheating, and fire due to damaged magnetrons caused by reflected waves, when they are used without a proper understanding of the permittivity of the object to be heated, the electromagnetic field distribution, the matching between the chamber and the waveguide, and the reflected electromagnetic waves. Simulation was performed using the Ansys HFSS tool. Conditions for the uniform electromagnetic field were derived using the distance from the waveguides to the ceramic material as well as the microwave energy intensity as major parameters.
25
Nelson, M. J., S. Moeller, A. Basu, L. Christopher, E. J. Rogalski, M. Greicius, S. Weintraub, B. Bonakdarpour, R. S. Hurley, and M.-M. Mesulam. "Taxonomic Interference Associated with Phonemic Paraphasias in Agrammatic Primary Progressive Aphasia." Cerebral Cortex 30, no. 4 (December 4, 2019): 2529–41. http://dx.doi.org/10.1093/cercor/bhz258.
Full textAbstract:
Abstract Phonemic paraphasias are thought to reflect phonological (post-semantic) deficits in language production. Here we present evidence that phonemic paraphasias in non-semantic primary progressive aphasia (PPA) may be associated with taxonomic interference. Agrammatic and logopenic PPA patients and control participants performed a word-to-picture visual search task where they matched a stimulus noun to 1 of 16 object pictures as their eye movements were recorded. Participants were subsequently asked to name the same items. We measured taxonomic interference (ratio of time spent viewing related vs. unrelated foils) during the search task for each item. Target items that elicited a phonemic paraphasia during object naming elicited increased taxonomic interference during the search task in agrammatic but not logopenic PPA patients. These results could reflect either very subtle sub-clinical semantic distortions of word representations or partial degradation of specific phonological word forms in agrammatic PPA during both word-to-picture matching (input stage) and picture naming (output stage). The mechanism for phonemic paraphasias in logopenic patients seems to be different and to be operative at the pre-articulatory stage of phonological retrieval. Glucose metabolic imaging suggests that degeneration in the left posterior frontal lobe and left temporo-parietal junction, respectively, might underlie these different patterns of phonemic paraphasia.
26
Vetter, Sebastian, and Gunnar Siedler. "Automated 3D-Objectdocumentation on the Base of an Image Set." Geoinformatics FCE CTU 6 (December 21, 2011): 370–75. http://dx.doi.org/10.14311/gi.6.46.
Full textAbstract:
Digital stereo-photogrammetry allows users an automatic evaluation of the spatial dimension and the surface texture of objects. The integration of image analysis techniques simplifies the automation of evaluation of large image sets and offers a high accuracy [1]. Due to the substantial similarities of stereoscopic image pairs, correlation techniques provide measurements of subpixel precision for corresponding image points. With the help of an automated point search algorithm in image sets identical points are used to associate pairs of images to stereo models and group them. The found identical points in all images are basis for calculation of the relative orientation of each stereo model as well as defining the relation of neighboured stereo models. By using proper filter strategies incorrect points are removed and the relative orientation of the stereo model can be made automatically. With the help of 3D-reference points or distances at the object or a defined distance of camera basis the stereo model is orientated absolute. An adapted expansion- and matching algorithm offers the possibility to scan the object surface automatically. The result is a three dimensional point cloud; the scan resolution depends on image quality. With the integration of the iterative closest point- algorithm (ICP) these partial point clouds are fitted to a total point cloud. In this way, 3D-reference points are not necessary. With the help of the implemented triangulation algorithm a digital surface models (DSM) can be created. The texturing can be made automatically by the usage of the images that were used for scanning the object surface. It is possible to texture the surface model directly or to generate orthophotos automatically. By using of calibrated digital SLR cameras with full frame sensor a high accuracy can be reached. A big advantage is the possibility to control the accuracy and quality of the 3d-objectdocumentation with the resolution of the images. The procedure described here is implemented in software Metigo 3D.
27
Ding, Youli, Xianwei Zheng, Yan Zhou, Hanjiang Xiong, and and Jianya Gong. "Low-Cost and Efficient Indoor 3D Reconstruction Through Annotated Hierarchical Structure-from-Motion." Remote Sensing 11, no. 1 (December 29, 2018): 58. http://dx.doi.org/10.3390/rs11010058.
Full textAbstract:
With the widespread application of location-based services, the appropriate representation of indoor spaces and efficient indoor 3D reconstruction have become essential tasks. Due to the complexity and closeness of indoor spaces, it is difficult to develop a versatile solution for large-scale indoor 3D scene reconstruction. In this paper, an annotated hierarchical Structure-from-Motion (SfM) method is proposed for low-cost and efficient indoor 3D reconstruction using unordered images collected with widely available smartphone or consumer-level cameras. Although the reconstruction of indoor models is often compromised by the indoor complexity, we make use of the availability of complex semantic objects to classify the scenes and construct a hierarchical scene tree to recover the indoor space. Starting with the semantic annotation of the images, images that share the same object were detected and classified utilizing visual words and the support vector machine (SVM) algorithm. The SfM method was then applied to hierarchically recover the atomic 3D point cloud model of each object, with the semantic information from the images attached. Finally, an improved random sample consensus (RANSAC) generalized Procrustes analysis (RGPA) method was employed to register and optimize the partial models into a complete indoor scene. The proposed approach incorporates image classification in the hierarchical SfM based indoor reconstruction task, which explores the semantic propagation from images to points. It also reduces the computational complexity of the traditional SfM by avoiding exhausting pair-wise image matching. The applicability and accuracy of the proposed method was verified on two different image datasets collected with smartphone and consumer cameras. The results demonstrate that the proposed method is able to efficiently and robustly produce semantically and geometrically correct indoor 3D point models.
28
Ni, Ming, Baoan Chen, Jia Hua Ding, Qiang Lin, and Yu Ma. "Clinical Analysis of Invasive Fungal Infection after Allo-Geneic Stem Cell Transplantation." Blood 126, no. 23 (December 3, 2015): 5487. http://dx.doi.org/10.1182/blood.v126.23.5487.5487.
Full textAbstract:
Abstract Object: The study was aimed to analyze the incidence, risk factors and outcome of invasive fungal infection (IFI) in allogeneic hematopoietic cell transplantation (HSCT) recipients, and to provide evidence for the prevention and treatment of IFI. Method: 79 patients undergoing formed HSCT at this institute from Jan 2005 to Sep 2014 with intact datum, were analyzed retrospectively according to the diagnostic criteria of IFI. The data of age, sex, primary disease, the source of stem cell, HLA-identical situation, ABO matching, conditioning regimen, use of ATG, season, aGVHD, neutropenia less than 0.5×109/L, CMV infection, etiology culture, blood routine test, imaging, relapse of disease and survival were recorded. Moreover, the data of patients with IFI including usage of glucocorticoid and the neutrophil count were recorded when IFI occurred and the blood cells count after IFI. Result: 17 patients has been diagnosed with IFI, in which 13 cases were probable and 4 cases were possible. The infection rate was 21.5%. There were 8 female and 9 male. The median age was 26 years (6-50 years).The total non relapse survival (NRS) rate was 55.6%, The NRS rate in non-infection group was 61.2% and that in infection group was 35.2%. The single-factor analysis showed matching(x2=15.061, p=0.010) and aGVHD (x2=6.983 p=0.008) were risk factors. After IFI, 8 patients died, 2 patients got complete response, 5 patients got partial response and 2 patients got stable response. The death rate was 47%, there was significant difference between two groups. The dose of glucocorticoid before IFI within 30 days was risk factor. Multiple-factor analysis further showed Ⅱ-Ⅳ degree of aGVHD (OR=4.810 p=0.012 CI:1.406-16.459 ) and matching (OR=25 p=0.007 CI:2.380-262.653) were risk factors. Moreover, before IFI, use of methylprednisolone more than 360 mg before infection (OR=0.041 P=0.017 CI:0.003-0.56) was risk factor. Conclusion: Patients with poor matching, unrelated stem cell and Ⅱ-Ⅳ degree of aGVHD are more likely to occur IFI and those who were used more glucocorticoid are likely to die. Therefore, avoiding the risk factors might reduce the incidence rate of IFI and respect using dose of immunosupperssor before infection within 30 days may improve the patients' prognosis. Disclosures No relevant conflicts of interest to declare.
29
Rajendra, Y. D., S. C. Mehrotra, K. V. Kale, R. R. Manza, R. K. Dhumal, A. D. Nagne, and A. D. Vibhute. "Evaluation of Partially Overlapping 3D Point Cloud's Registration by using ICP variant and CloudCompare." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XL-8 (November 28, 2014): 891–97. http://dx.doi.org/10.5194/isprsarchives-xl-8-891-2014.
Full textAbstract:
Terrestrial Laser Scanners (TLS) are used to get dense point samples of large object’s surface. TLS is new and efficient method to digitize large object or scene. The collected point samples come into different formats and coordinates. Different scans are required to scan large object such as heritage site. Point cloud registration is considered as important task to bring different scans into whole 3D model in one coordinate system. Point clouds can be registered by using one of the three ways or combination of them, Target based, feature extraction, point cloud based. For the present study we have gone through Point Cloud Based registration approach. We have collected partially overlapped 3D Point Cloud data of Department of Computer Science & IT (DCSIT) building located in Dr. Babasaheb Ambedkar Marathwada University, Aurangabad. To get the complete point cloud information of the building we have taken 12 scans, 4 scans for exterior and 8 scans for interior façade data collection. There are various algorithms available in literature, but Iterative Closest Point (ICP) is most dominant algorithms. The various researchers have developed variants of ICP for better registration process. The ICP point cloud registration algorithm is based on the search of pairs of nearest points in a two adjacent scans and calculates the transformation parameters between them, it provides advantage that no artificial target is required for registration process. We studied and implemented three variants Brute Force, KDTree, Partial Matching of ICP algorithm in MATLAB. The result shows that the implemented version of ICP algorithm with its variants gives better result with speed and accuracy of registration as compared with CloudCompare Open Source software.
30
Li, Y. H., T. Shinohara, T. Satoh, and K. Tachibana. "ROAD SIGNS DETECTION AND RECOGNITION UTILIZING IMAGES AND 3D POINT CLOUD ACQUIRED BY MOBILE MAPPING SYSTEM." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLI-B1 (June 6, 2016): 669–73. http://dx.doi.org/10.5194/isprsarchives-xli-b1-669-2016.
Full textAbstract:
High-definition and highly accurate road maps are necessary for the realization of automated driving, and road signs are among the most important element in the road map. Therefore, a technique is necessary which can acquire information about all kinds of road signs automatically and efficiently. Due to the continuous technical advancement of Mobile Mapping System (MMS), it has become possible to acquire large number of images and 3d point cloud efficiently with highly precise position information. In this paper, we present an automatic road sign detection and recognition approach utilizing both images and 3D point cloud acquired by MMS. The proposed approach consists of three stages: 1) detection of road signs from images based on their color and shape features using object based image analysis method, 2) filtering out of over detected candidates utilizing size and position information estimated from 3D point cloud, region of candidates and camera information, and 3) road sign recognition using template matching method after shape normalization. The effectiveness of proposed approach was evaluated by testing dataset, acquired from more than 180 km of different types of roads in Japan. The results show a very high success in detection and recognition of road signs, even under the challenging conditions such as discoloration, deformation and in spite of partial occlusions.
31
Li, Y. H., T. Shinohara, T. Satoh, and K. Tachibana. "ROAD SIGNS DETECTION AND RECOGNITION UTILIZING IMAGES AND 3D POINT CLOUD ACQUIRED BY MOBILE MAPPING SYSTEM." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLI-B1 (June 6, 2016): 669–73. http://dx.doi.org/10.5194/isprs-archives-xli-b1-669-2016.
Full textAbstract:
High-definition and highly accurate road maps are necessary for the realization of automated driving, and road signs are among the most important element in the road map. Therefore, a technique is necessary which can acquire information about all kinds of road signs automatically and efficiently. Due to the continuous technical advancement of Mobile Mapping System (MMS), it has become possible to acquire large number of images and 3d point cloud efficiently with highly precise position information. In this paper, we present an automatic road sign detection and recognition approach utilizing both images and 3D point cloud acquired by MMS. The proposed approach consists of three stages: 1) detection of road signs from images based on their color and shape features using object based image analysis method, 2) filtering out of over detected candidates utilizing size and position information estimated from 3D point cloud, region of candidates and camera information, and 3) road sign recognition using template matching method after shape normalization. The effectiveness of proposed approach was evaluated by testing dataset, acquired from more than 180 km of different types of roads in Japan. The results show a very high success in detection and recognition of road signs, even under the challenging conditions such as discoloration, deformation and in spite of partial occlusions.
32
Bespalov, Dmitriy, William C. Regli, and Ali Shokoufandeh. "Local feature extraction and matching partial objects." Computer-Aided Design 38, no. 9 (September 2006): 1020–37. http://dx.doi.org/10.1016/j.cad.2006.07.005.
Full text
33
Stanikūnas, Rytis, Henrikas Vaitkevičius, Algimantas Švegžda, Vilius Viliūnas, Aušra Daugirdienė, Janus J. Kulikowski, and Ian J. Murray. "DU OBJEKTŲ SPALVOS SUVOKIMO PROCESAI." Psichologija 30 (January 1, 2004): 7–16. http://dx.doi.org/10.15388/psichol.2004..4350.
Full textAbstract:
Objektų spalvų suvokimas aiškinamas dviem procesais. Atlikti bandomieji tyrimai, kuriais nustatyta kontrasto ir fono adaptacijos įtaka spalvų suvokimui. Bandyme dalyvavo keturi tiriamieji. Jų spalvinis regėjimas buvo normalus. 40 spalvotų stimulų ir 6 apšvietimai buvo generuojami vaizduoklio ekrane. Tiriamiesiems buvo rodomas spalvotas objektas pilkame fone esant įvairiems apšvietimams. Tiriamasis turėjo nustatyti, kokią objekto spalvą mato esant įvairiems adaptacijos laikams. Paaiškėjo, kad galima išskirti dvi subjektyvaus spalvos įvertinimo sistemas: viena sistema įvertina objekto ir suvokiamo fono spalvų skirtumą, o kita – fono spalvą. Suvokiamas spalvų skirtumas adaptacijos metu keičiasi nedaug, o suvokiama fono spalva artėja prie neutralios. Gauti duomenys pagrindžia dviejų lygmenų spalvų suvokimo hipotezę: sistema, įvertinanti spalvų skirtumus, yra lokali, o sistema, įvertinanti foną, – globali.
TWO PROCESSES IN OBJECT COLOUR PERCEPTIONRytis Stanikūnas, Henrikas Vaitkevičius, Algimantas Švegžda, Vilius Viliūnas, Aušra Daugirdienė, Janus J. Kulikowski, Ian J. Murray
SummaryPerception of colour depends on the spectral composition of light that reaches retina and depends as well on various mechanisms of visual system that processes information flow. The few important mechanisms can be distinguished in colour perception: colour adaptation, colour constancy and colour contrast. If the visual field has only one coloured object, then colour perception will be determined by spectral composition of the light and colour adaptation. Whereas mechanisms of colour constancy and colour contrast switches on when in the visual field there are at least two colour objects. Von Kries (1905) have attributed colour constancy phenomenon to theory of receptoral adaptation. But this is theory is applicable to local processes happening in relatively small size of visual field. Craven and Foster (1992) shows that receptor excitation ratios remains constant during change of illumination. But again remains unexplained colour change during adaptation. So, the hypothesis is raised that two processes attribute colour perception: local colour contrast calculation and global adaptation to the background. Therefore the experiments have been carried out to establish the colour contrast and background adaptation impact on colour perception.Four subjects with normal colour vision participated in the experiments. 40 Munsell samples (value 7 and chroma 4) illuminated with one reference illuminant (standard C) and 6 test illuminants (standard A, standard S, cardinal red, cardinal green, cardinal yellow and cardinal blue) were simulated on computer monitor. The dark-adapted subjects have been shown colour samples on neutral background illuminated with one of test illuminants. The task was to match the colour stimuli appearance under reference illuminant. The sequential asymmetric matching procedure was carried out. First subject adapts to neutral background under illuminan C then test stimulus and test background appears for limited time followed by readaptation to neutral background. Then subject is asked to adjust the colour mach under illuminant C. Two different experiment paradigms have been used. In the first one the stimulus had 2° on neutral background covering 20° of visual field. In the second paradigm the stimulus size was the same but the background was covering the all visual field. The adaptation and presentation timings were 1, 5, 30 or 60 seconds.Results under the first experiment paradigm show partial colour constancy for all subjects and for all test illuminants under various adaptation times. Despite quite a long adaptation time of 30 seconds subjects was unable to achieve full colour constancy. Colour constancy improves under second experiment paradigm. 60-second adaptation time is enough to achieve full colour constancy. The less adaptation time (1 or 30 second) gives partial colour constancy.The subject sees two colours (stimulus and background) during the experiment. The colour perception of stimulus and background changes during adaptation time. In the first 5 seconds of adaptation 40–60% of full adaptation level is reached (Fairchild and Reniff, 1995; Werner et al., 2000). Wesner and Shevell (1992, 1994) shown that signals from all visual field have influence on colour perception of object. The first part of our experiment shows that neutral background of 20° gives partial adaptation to background colour. Therefore, increase background illumination to full visual field gives full adaptation to background. So, subject perceives different coloured background under various illuminants as the same neutral (grey) background.We can state that two different systems have been distinguished in the process of colour perception. One system evaluates the colour difference between the stimulus and the background. Second system evaluates the colour of the background. Perceived colour difference during adaptation does not change much, but perceived colour of the background changes a lot and drifts towards neutral colour. The hypothesis of two level colour perception is supported by experimental data.
34
Sfikas, Konstantinos, Ioannis Pratikakis, Anestis Koutsoudis, Michalis Savelonas, and Theoharis Theoharis. "Partial matching of 3D cultural heritage objects using panoramic views." Multimedia Tools and Applications 75, no. 7 (June 1, 2014): 3693–707. http://dx.doi.org/10.1007/s11042-014-2069-0.
Full text
35
Wang, Shuai, Qingsheng Guo, Xinglin Xu, and Yuwu Xie. "A Study on a Matching Algorithm for Urban Underground Pipelines." ISPRS International Journal of Geo-Information 8, no. 8 (August 10, 2019): 352. http://dx.doi.org/10.3390/ijgi8080352.
Full textAbstract:
Urban underground pipelines are known as “urban blood vessels”. To detect changes in integrated pipelines and professional pipelines, the matching of same-name spatial objects is critical. Existing algorithms used for vector network matching were analyzed to develop an improved matching algorithm that can adapt to underground pipeline networks. Our algorithm improves the holistic matching of pipeline strokes, and also a partial matching algorithm is provided. In this study, appropriate geometric measures were selected to calculate the geometric similarity between pipeline strokes in their holistic matching. Existing methods for evaluating similarities in spatial scene structures in partial underground pipeline networks were improved. A method of partial matching of strokes was additionally investigated, and it compensates for the deficiencies of holistic stroke matching. Experiments showed that the matching performance was good, and the operation efficiency was high.
36
Patil, Chirag G., Anthony Yi, Adam Elramsisy, Jethro Hu, Debraj Mukherjee, Dwain K. Irvin, John S. Yu, Serguei I. Bannykh, Keith L. Black, and Miriam Nuño. "Prognosis of patients with multifocal glioblastoma: a case-control study." Journal of Neurosurgery 117, no. 4 (October 2012): 705–11. http://dx.doi.org/10.3171/2012.7.jns12147.
Full textAbstract:
Object The prognosis of patients with glioblastoma who present with multifocal disease is not well documented. The objective of this study was to determine whether multifocal disease on initial presentation is associated with worse survival. Methods The authors retrospectively reviewed records of 368 patients with newly diagnosed glioblastoma and identified 47 patients with multifocal tumors. Each patient with a multifocal tumor was then matched with a patient with a solitary glioblastoma on the basis of age, Karnofsky Performance Scale (KPS) score, and extent of resection, using a propensity score matching methodology. Radiation and temozolomide treatments were also well matched between the 2 cohorts. Kaplan-Meier estimates and log-rank tests were used to compare patient survival. Results The incidence of multifocal tumors was 12.8% (47/368). The median age of patients with multifocal tumors was 61 years, 76.6% had KPS scores ≥ 70, and 87.2% underwent either a biopsy or partial resection of their tumors. The 47 patients with multifocal tumors were almost perfectly matched on the basis of age (p = 0.97), extent of resection (p = 1.0), and KPS score (p = 0.80) compared with 47 patients with a solitary glioblastoma. Age (>65 years), partial resection or biopsy, and low KPS score (<70) were associated with worse median survival within the multifocal group. In the multifocal group, 19 patients experienced tumor progression on postradiation therapy MRI, compared with 11 patients (26.8%) with tumor progression in the unifocal group (p = 0.08). Patients with multifocal tumors experienced a significantly shorter median overall survival of 6 months (95% CI 4–10 months), compared with the 11-month median survival (95% CI 10–19 months) of the matched solitary glioblastoma group (p = 0.02, log-rank test). Two-year survival rates were 4.3% for patients with multifocal tumors and 29.0% for the unifocal cohort. Patients with newly diagnosed multifocal tumors were found to have an almost 2-fold increase in the hazard of death compared with patients with solitary glioblastoma (hazard ratio 1.8, 95% CI 1.1–3.1; p = 0.02). Tumor samples were analyzed for expression of phosphorylated mitogen-activated protein kinase, phosphatase and tensin homolog, O6-methylguanine-DNA methyltransferase, laminin β1 and β2, as well as epidermal growth factor receptor amplification, and no significant differences in expression profile between the multifocal and solitary glioblastoma groups was found. Conclusions Patients with newly diagnosed multifocal glioblastoma on presentation experience significantly worse survival than patients with solitary glioblastoma. Patients with multifocal tumors continue to pose a therapeutic challenge in the temozolomide era and magnify the challenges faced while treating patients with malignant gliomas.
37
Ko, K. H., T. Maekawa, and N. M. Patrikalakis. "Algorithms for optimal partial matching of free-form objects with scaling effects." Graphical Models 67, no. 2 (March 2005): 120–48. http://dx.doi.org/10.1016/j.gmod.2004.05.005.
Full text
38
Xie, Jie, Fei Liu, and Sheng-Uei Guan. "Tree-structure Based Ontology Integration." Journal of Information Science 37, no. 6 (November 4, 2011): 594–613. http://dx.doi.org/10.1177/0165551511421856.
Full textAbstract:
This paper defines a framework for ontology integration – Tree-structure Based Ontology Integration (TSBOI). Unlike other methodologies in the area, which mainly concentrate on attribute comparison, this methodology is designed to map objects of an ontology to a tree structure, restructure the tree, and rely on the tree structure to integrate ontologies through attribute comparison. The new methodology utilizes accurate matching and partial matching to group the matched objects to enhance the mapping accuracy. Once the tree structure is established, it can be reused to answer different queries. This significantly enhances its efficiency.
39
Kanezaki, Asako, Tatsuya Harada, and Yasuo Kuniyoshi. "Partial matching of real textured 3D objects using color cubic higher-order local auto-correlation features." Visual Computer 26, no. 10 (July 30, 2010): 1269–81. http://dx.doi.org/10.1007/s00371-010-0521-3.
Full text
40
BASAK, JAYANTA, SANTANU CHAUDHURY, S. K. PAL, and D. DUTTA MAJUMDER. "MATCHING OF STRUCTURAL SHAPE DESCRIPTIONS WITH HOPFIELD NET." International Journal of Pattern Recognition and Artificial Intelligence 07, no. 02 (April 1993): 377–404. http://dx.doi.org/10.1142/s0218001493000194.
Full textAbstract:
Structural description of objects comprised descriptions of the parts and spatial relations between the parts. This paper presents a Hopfield net based scheme for matching structural shape descriptions. The current formulation of the matching scheme is general enough to take care of partial mismatch between the individual parts and spatial constraints between these parts. In addition, a transformation of the shape descriptions has been suggested with which shape descriptions containing asymmetrical spatial constraints between the parts can be matched using symmetric interconnection weights for the Hopfield net. The Hopfield net based formulation has been extended to consider the problem of finding the best match of the test shape descriptions with one of the stored prototypes. The matching scheme has been experimentally applied for recognition of hand-tools and symbols. In both cases, the network produced encouraging recognition results.
41
Polska, O. V., R. K. Kudermetov, and V. V. Shkarupylo. "AN APPROACH WEB SERVICE SELECTION BY QUALITY CRITERIA BASED ON SENSITIVITY ANALYSIS OF MCDM METHODS." Radio Electronics, Computer Science, Control, no. 2 (July 7, 2021): 133–43. http://dx.doi.org/10.15588/1607-3274-2021-2-14.
Full textAbstract:
Context. The problem of QoS based Web service from the list of Web services with equal or similar functionality was considered. This task is an essential part of the processes of finding, discover, matching and using Web services on the Internet due to the numerous offerings of Web services with equal or similar functionality. The reasonable selection of a suitable Web service takes into account a lot of user’s quality requirements, such as response time, throughput, reliability, cost, etc. Such a task is usually formulated as an MCDM problem, in which the parameters are the Web service quality factors and the importance degree of these factors. The object of this research is a process of selection Web services using MCDM methods, taking into accounts the user’s preferences and requirements to the Web service quality characteristics. The subject of the research is the LSP method, which, in addition to the degree of importance of the criteria used in all MCDM methods, simulates the user’s reasoning about quality, taking into account, in particular, such characteristics of the criteria as mandatory, sufficiency, desirability, simultaneity and substitutability. Objective. The objective of the work is to develop an approach for comparing the result of using the LSP method with the results of using other MCDM methods. Method. A method for calculating the weights of input criteria that are not always explicitly specified in the LSP method was proposed. For this, the conjunctive coefficients of impact are used, which are calculated as a result of the sensitivity analysis of the Web service generalized quality criterion to changes the partial quality criteria. This method underlies the proposed approach to comparing the efficiency of the LSP method with other MCDM methods, which consists of using the obtained weights as the weights of the input criteria for the MCDM methods. Results. The developed method and approach was verified experimentally. The Web service ranking produced by the LSP method was compared with the ones produced by SAW, AHP, TOPSIS and VIKOR methods. This comparison confirmed the efficiency of the proposed method and approach. Conclusions. From the obtained results of comparing the LSP method and the MCDM methods considered in this study, it follows that the proposed method and approach provide the equivalent input conditions for these methods as for the LSP method, which is a necessary condition for the correct comparison of MCDM methods. The use of the proposed approach made it possible to study the sensitivities of the considered MCDM methods. In practical applications, this approach can be used to select a suitable MCDM method. The proposed method can be useful for creating professional evaluation systems in which it is necessary to assess the importance (weights) of tens and hundreds of quality criteria.
42
Ahmed, Ejaz, Nik Bessis, Peter Norrington, and Yong Yue. "Managing Inconsistencies in Data Grid Environments." International Journal of Grid and High Performance Computing 2, no. 4 (October 2010): 51–64. http://dx.doi.org/10.4018/jghpc.2010100105.
Full textAbstract:
Much work has been done in the area of data access and integration using various data mapping, matching, and loading techniques. One of the main concerns when integrating data from heterogeneous data sources is data redundancy. The concern is mainly due to the different business contexts and purposes from which the data systems were originally built. A common process for accessing data from integrated databases involves the use of each data source’s own catalogue or metadata schema. In this article, the authors take the view that there is a greater chance of data inconsistencies, such as data redundancies when integrating them within a grid environment as compared to traditional distributed paradigms. The importance of improving the data search and matching process is briefly discussed, and a partial service oriented generic strategy is adopted to consolidate distinct catalogue schemas of federated databases to access information seamlessly. To this end, a proposed matching strategy between structure objects and data values across federated databases in a grid environment is presented.
43
Ono, Eiichi, Nobuyuki Kita, and Shigeyuki Sakane. "Unfolding Folded Fabric Using Outline Information with Vision and Touch Sensors." Journal of Robotics and Mechatronics 10, no. 3 (June 20, 1998): 235–43. http://dx.doi.org/10.20965/jrm.1998.p0235.
Full textAbstract:
A hand/eye system for handling flexible materials is under development. Much more attention must be paid to cooperative touch and vision sensing when handling flexible or limp objects such as fabric. This paper presents basic concepts for handling flexible materials and a sensor-based manipulation strategy for unfolding folded fabric. Fabric easily changes shape in 3-dimensional (3D) space. Partial pattern matching of fabrics using outline information can determine where a corner was folded. In this paper, vision and tactile sensing were used to pick up folded fabric.
44
Mengshoel, Ole Jakob, Sanjeev Chauhan, and Yong Se Kim. "Intelligent critiquing and tutoring of spatial reasoning skills." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 10, no. 3 (June 1996): 235–49. http://dx.doi.org/10.1017/s0890060400001578.
Full textAbstract:
AbstractThe ability to reason spatially is an important skill required for engineers, particularly in engineering design and construction. One aspect of spatial reasoning is visualizing and constructing three-dimensional (3D) solid objects from two-dimensional (2D) projections. To assist in teaching this to engineering students, an instructional software system is being developed at the University of Illinois. This instructional software system is comprised of the Visual Sweeper and the Visual Teacher. The Visual Sweeper is a geometric framework for solving missing view problems. In missing view problems, students create 3D solid objects from two 2D projections by applying operations inverse to orthographic projection. The Visual Teacher, which is the focus of this article, is an intelligent critiquing and tutoring module that gives feedback to the student regarding partial solutions to missing view problems. The Visual Teacher is comprised of a Recognizer and a Critiquer. The Recognizer identifies which solution solid the student's partial solution is closest to. Based on the solution solid and a student's partial solution, the Criti-quer gives critique and advice to the student. The Recognizer is based on an algorithm for bipartite graph matching, while the Critiquer uses a rule-based approach. This paper describes the Visual Teacher, gives examples of how it can be used, presents preliminary evaluation results, and discusses the system's assumptions and limitations.
45
Prokopchuk, Oleh, and Serhii Vovk. "Application of morphological processing methods in computer stereo vision." System technologies 6, no. 131 (March 10, 2021): 18–27. http://dx.doi.org/10.34185/1562-9945-6-131-2020-03.
Full textAbstract:
Computer vision algorithms are important for many areas of human activity. In particular, the number of applications related to the need to process images of real-world objects with computerized tools and the subsequent use of descriptive information in a variety of interactive and automated decision-making systems is increased. An important tool for analyzing real-world scenes are approaches to the application of stereo vision algorithms. The important step of many stereo matching algorithms is a disparity map. Depending on the content of the observed scene, part of the values on the disparity map can be immediately attributed to background values on a certain basis, or form a "natural" background, which is characterized by loss of informative data due to unacceptable error of subsequent resultant distance values. The calculated disparity map of any algorithm may contain some shortcomings in the form of discontinuities of continuous information areas caused by the complexity of shooting conditions, the impact of noise of various natures, hardware imperfections, and so on. An approach to mitigating the undesirable influence of negative factors on the resulting disparity is the use of mathematical morphology operations to process disparity maps at the post-processing stage. This paper presents information technology for increasing the content of disparity maps based on the mathematical morphology methods. The technology is based on a combination of morphological operations of erosion and dilation, which eliminates the typical problems of discontinuities of monotone regions and erroneous values on disparity maps. The proposed approach allows reducing the impact of common problems that arise during the operation of stereo matching algorithms, as well as increase the overall informativeness of disparity maps for images of real objects in the absence of partial or complete initial data on the characteristics of the observed scene. The results of testing morphological operations with disparity maps for real objects allow us to conclude about the possibility of partial restoration of areas of disparity maps with gaps in continuous information areas, as well as to reduce the impact of random anomalous values on the overall content of the disparity maps.
46
Tierney, Kevin J., and Howard V. Smith. "The Effect of Different Combinations of Continuous and Partial Reinforcement Schedules on Response Persistence in Mentally Handicapped Children." Behavioural Psychotherapy 16, no. 1 (January 1988): 23–37. http://dx.doi.org/10.1017/s0141347300008478.
Full textAbstract:
Two experiments investigated the effects on persistence of behaviour in extinction of different training procedures, using mentally handicapped boys who were trained to place objects of different shapes into matching holes in a box for sensory reinforcers. In Experiment 1 two subjects were given three training procedures: (i) a C-C procedure, consisting of 80 trials of continuous reinforcement (CRF); (ii)a P-P procedure, consisting of 80 trials of variable ratio reinforcement (VR5); and (iii) a C-P procedure, consisting of 40 trials on CRF followed by 40 on VR5. Extinction occurred most quickly after C-C training, next quickest after P-P training. In experiment 2 with four boys, C-P training of 160 trials of CRF, followed by 120 trials of VR5, produced quicker extinction than P-P training of 280 trials of VR5 reinforcement. The implications of these results for training persistent behaviour in mentally handicapped people are discussed.
47
Sebastian, Stephen, Eric S. Seemiller, and Wilson S. Geisler. "Local reliability weighting explains identification of partially masked objects in natural images." Proceedings of the National Academy of Sciences 117, no. 47 (November 23, 2020): 29363–70. http://dx.doi.org/10.1073/pnas.1912331117.
Full textAbstract:
A fundamental natural visual task is the identification of specific target objects in the environments that surround us. It has long been known that some properties of the background have strong effects on target visibility. The most well-known properties are the luminance, contrast, and similarity of the background to the target. In previous studies, we found that these properties have highly lawful effects on detection in natural backgrounds. However, there is another important factor affecting detection in natural backgrounds that has received little or no attention in the masking literature, which has been concerned with detection in simpler backgrounds. Namely, in natural backgrounds the properties of the background often vary under the target, and hence some parts of the target are masked more than others. We began studying this factor, which we call the “partial masking factor,” by measuring detection thresholds in backgrounds of contrast-modulated white noise that was constructed so that the standard template-matching (TM) observer performs equally well whether or not the noise contrast modulates in the target region. If noise contrast is uniform in the target region, then this TM observer is the Bayesian optimal observer. However, when the noise contrast modulates then the Bayesian optimal observer weights the template at each pixel location by the estimated reliability at that location. We find that human performance for modulated noise backgrounds is predicted by this reliability-weighted TM (RTM) observer. More surprisingly, we find that human performance for natural backgrounds is also predicted by the RTM observer.
48
Wei, L., E. Keogh, X. Xi, and S. H. Lee. "Supporting anthropological research with efficient rotation invariant shape similarity measurement." Journal of The Royal Society Interface 4, no. 13 (October 17, 2006): 207–22. http://dx.doi.org/10.1098/rsif.2006.0168.
Full textAbstract:
The matching of two-dimensional shapes is an important problem with many applications in anthropology. Examples of objects that anthropologists are interested in classifying, clustering and indexing based on shape include bone fragments, projectile points (arrowheads/spearpoints), petroglyphs and ceramics. Interest in matching such objects originates from the fundamental question for many biological anthropologists and archaeologists: how can we best quantify differences and similarities? This interest is fuelled in part by a movement that notes: ‘an increasing number of archaeologists are showing interest in employing Darwinian evolutionary theory to explain variation in the material record’. Aiding such research efforts with computers requires a shape similarity measure that is invariant to many distortions, including scale, offset, noise, partial occlusion, etc. Most of these distortions are relatively easy to handle, either in the representation of the data or in the similarity measure used. However, rotation invariance seems to be uniquely difficult. Current approaches typically try to achieve rotation invariance in the representation of the data, at the expense of poor discrimination ability, or in the distance measure, at the expense of efficiency. In this work, we show that we can take the slow but accurate approaches and dramatically speed them up. On real world problems, our technique can take current approaches and make them four orders of magnitude faster, without false dismissals. Moreover, our technique can be used with any of the dozens of existing shape representations and with all the most popular distance measures, including Euclidean distance, dynamic time warping and longest common subsequence. We show the applications of our work to several important problems in anthropology, including clustering and indexing of skulls, projectile points and petroglyphs.
49
Huang, Haifeng, and Jing Zhang. "Research on the Environmental Effect of Green Finance Policy Based on the Analysis of Pilot Zones for Green Finance Reform and Innovations." Sustainability 13, no. 7 (March 28, 2021): 3754. http://dx.doi.org/10.3390/su13073754.
Full textAbstract:
In this study, taking the pilot zones for green finance reform and innovations set up in 2017 as the objects, a quasi-natural experiment is conducted to assess the environmental effects of green finance policy using the difference-in-difference propensity score matching (PSM-DID) method based on the panel data in 30 provincial-level administrative regions from 2011 to 2019. In addition, further efforts are made to investigate the differences of green financial policies in environmental effect. According to the research findings, the set-up of green finance pilot zones can reduce the environmental pollution, and green finance policy is conductive to environmental enhancement. Meanwhile, a partial mediating effect exists between a region’s innovation capability and industrial structure. On the whole, green finance policy plays the most significant role in improving the eastern region’s environmental pollution, followed by the central region, but barely enhances the environment in the western region. To sum up, the more serious the environmental pollution is, the better the effect of green finance policy.
50
Verykokou, Styliani, Argyro-Maria Boutsi, and Charalabos Ioannidis. "Mobile Augmented Reality for Low-End Devices Based on Planar Surface Recognition and Optimized Vertex Data Rendering." Applied Sciences 11, no. 18 (September 20, 2021): 8750. http://dx.doi.org/10.3390/app11188750.
Full textAbstract:
Mobile Augmented Reality (MAR) is designed to keep pace with high-end mobile computing and their powerful sensors. This evolution excludes users with low-end devices and network constraints. This article presents ModAR, a hybrid Android prototype that expands the MAR experience to the aforementioned target group. It combines feature-based image matching and pose estimation with fast rendering of 3D textured models. Planar objects of the real environment are used as pattern images for overlaying users’ meshes or the app’s default ones. Since ModAR is based on the OpenCV C++ library at Android NDK and OpenGL ES 2.0 graphics API, there are no dependencies on additional software, operating system version or model-specific hardware. The developed 3D graphics engine implements optimized vertex-data rendering with a combination of data grouping, synchronization, sub-texture compression and instancing for limited CPU/GPU resources and a single-threaded approach. It achieves up to 3× speed-up compared to standard index rendering, and AR overlay of a 50 K vertices 3D model in less than 30 s. Several deployment scenarios on pose estimation demonstrate that the oriented FAST detector with an upper threshold of features per frame combined with the ORB descriptor yield best results in terms of robustness and efficiency, achieving a 90% reduction of image matching time compared to the time required by the AGAST detector and the BRISK descriptor, corresponding to pattern recognition accuracy of above 90% for a wide range of scale changes, regardless of any in-plane rotations and partial occlusions of the pattern.