Relevant bibliographies by topics / Projection extraction

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Projection extraction'

Author: Grafiati
Published: 28 June 2021
Last updated: 18 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Projection extraction.'

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.

Journal articles on the topic "Projection extraction"

1

ZHAO, JIAN, and JIAN AN. "AN ITERATIVE CONVEX HULL APPROACH FOR IMAGE SEGMENTATION AND CONTOUR EXTRACTION." International Journal of Pattern Recognition and Artificial Intelligence 26, no. 07 (November 2012): 1255013. http://dx.doi.org/10.1142/s0218001412550130.

Full text
Abstract:
The contours and segments of objects in digital images have many important applications. Contour extractions of gray images can be converted into contour extractions of binary images. This paper presents a novel contour-extraction algorithm for binary images and provides a deduction theory for this algorithm. First, we discuss the method used to construct convex hulls of regions of objects. The contour of an object evolves from a convex polygon until the exact boundary is obtained. Second, the projection methods from lines to objects are studied, in which, a polygon iteration method is presented using linear projection. The result of the iteration is the contour of the object region. Lastly, addressing the problem that direct projections probably cannot find correct projection points, an effective discrete ray-projection method is presented. Comparisons with other contour deformation algorithms show that the algorithm in the present paper is very robust with respect to the shapes of the object regions. Numerical tests show that time consumption is primarily concentrated on convex hull computation, and the implementation efficiency of the program can satisfy the requirement of interactive operations.
APA, Harvard, Vancouver, ISO, and other styles
2

Giannella, Chris R., Ransom K. Winder, and Joseph P. Jubinski. "Annotation projection for temporal information extraction." Natural Language Engineering 25, no. 3 (May 2019): 385–403. http://dx.doi.org/10.1017/s1351324919000044.

Full text
Abstract:
AbstractApproaches to building temporal information extraction systems typically rely on large, manually annotated corpora. Thus, porting these systems to new languages requires acquiring large corpora of manually annotated documents in the new languages. Acquiring such corpora is difficult owing to the complexity of temporal information extraction annotation. One strategy for addressing this difficulty is to reduce or eliminate the need for manually annotated corpora through annotation projection. This technique utilizes a temporal information extraction system for a source language (typically English) to automatically annotate the source language side of a parallel corpus. It then uses automatically generated word alignments to project the annotations, thereby creating noisily annotated target language training data. We developed an annotation projection technique for producing target language temporal information extraction systems. We carried out an English (source) to French (target) case study wherein we compared a French temporal information extraction system built using annotation projection with one built using a manually annotated French corpus. While annotation projection has been applied to building other kinds of Natural Language Processing tools (e.g., Named Entity Recognizers), to our knowledge, this is the first paper examining annotation projection as applied to temporal information extraction where no manual corrections of the target language annotations were made. We found that, even using manually annotated data to build a temporal information extraction system, F-scores were relatively low (<0.35), which suggests that the problem is challenging even with manually annotated data. Our annotation projection approach performed well (relative to the system built from manually annotated data) on some aspects of temporal information extraction (e.g., event–document creation time temporal relation prediction), but it performed poorly on the other kinds of temporal relation prediction (e.g., event–event and event–time).
APA, Harvard, Vancouver, ISO, and other styles
3

Yi, Huangjian, Xu Zhang, Jinye Peng, Fengjun Zhao, Xiaodong Wang, Yuqing Hou, Duofang Chen, and Xiaowei He. "Reconstruction for Limited-Projection Fluorescence Molecular Tomography Based on a Double-Mesh Strategy." BioMed Research International 2016 (2016): 1–11. http://dx.doi.org/10.1155/2016/5682851.

Full text
Abstract:
Limited-projection fluorescence molecular tomography (FMT) has short data acquisition time that allows fast resolving of the three-dimensional visualization of fluorophore within small animal in vivo. However, limited-projection FMT reconstruction suffers from severe ill-posedness because only limited projections are used for reconstruction. To alleviate the ill-posedness, a feasible region extraction strategy based on a double mesh is presented for limited-projection FMT. First, an initial result is rapidly recovered using a coarse discretization mesh. Then, the reconstructed fluorophore area in the initial result is selected as a feasible region to guide the reconstruction using a fine discretization mesh. Simulation experiments on a digital mouse and small animal experiment in vivo are performed to validate the proposed strategy. It demonstrates that the presented strategy provides a good distribution of fluorophore with limited projections of fluorescence measurements. Hence, it is suitable for reconstruction of limited-projection FMT.
APA, Harvard, Vancouver, ISO, and other styles
4

Li, Bo, Jing Du, and Xiao-Ping Zhang. "Feature extraction using maximum nonparametric margin projection." Neurocomputing 188 (May 2016): 225–32. http://dx.doi.org/10.1016/j.neucom.2014.11.105.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hainaut, Donatien, and Michel Denuit. "WAVELET-BASED FEATURE EXTRACTION FOR MORTALITY PROJECTION." ASTIN Bulletin 50, no. 3 (June 25, 2020): 675–707. http://dx.doi.org/10.1017/asb.2020.18.

Full text
Abstract:
AbstractWavelet theory is known to be a powerful tool for compressing and processing time series or images. It consists in projecting a signal on an orthonormal basis of functions that are chosen in order to provide a sparse representation of the data. The first part of this article focuses on smoothing mortality curves by wavelets shrinkage. A chi-square test and a penalized likelihood approach are applied to determine the optimal degree of smoothing. The second part of this article is devoted to mortality forecasting. Wavelet coefficients exhibit clear trends for the Belgian population from 1965 to 2015, they are easy to forecast resulting in predicted future mortality rates. The wavelet-based approach is then compared with some popular actuarial models of Lee–Carter type estimated fitted to Belgian, UK, and US populations. The wavelet model outperforms all of them.
APA, Harvard, Vancouver, ISO, and other styles
6

Xu, Jie, and Shengli Xie. "Recursive locality preserving projection for feature extraction." Soft Computing 20, no. 10 (June 21, 2015): 4099–109. http://dx.doi.org/10.1007/s00500-015-1745-y.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Yuan, Sen, Xia Mao, and Lijiang Chen. "Sparsity Regularization Discriminant Projection for Feature Extraction." Neural Processing Letters 49, no. 2 (April 24, 2018): 539–53. http://dx.doi.org/10.1007/s11063-018-9842-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Li, Guo Ping, and Zhao Yan. "The Method of Character Recognition Based on Projection Transformation Combined with LS-SVM." Advanced Materials Research 468-471 (February 2012): 3050–55. http://dx.doi.org/10.4028/www.scientific.net/amr.468-471.3050.

Full text
Abstract:
A method of character feature extraction based on circular projection transformation is proposed. First, it transforms the Cartesian coordinates into polar coordinates using the centroid of character image as the pole. It makes circular projection calculation and generates character feature vector by transforming 2-D character image into 1-D projection curves. Based on circular projection transformation feature extraction, the least squares support vector machine (LS-SVM) is introduced into the small character set embossed concave-convex character recognition.It adopted LS-SVM training software in the experiment for the simulation of embossed concave-convex characters’ number set. It studied on the effect of different core function and multi-classifier method, and compared with the results of neural networks, pattern matching and other identification classification methods.The experiment results show that the character feature has the scale and rotation invariance by the method of circular projection transformation extraction. Which combined with LS-SVM method has high recognition rate and more practicability in recognition small character set .
APA, Harvard, Vancouver, ISO, and other styles
9

Liu, Xiao-Zhang, and Guan Yang. "Block-Wise Two-Dimensional Maximum Margin Criterion for Face Recognition." Scientific World Journal 2014 (2014): 1–9. http://dx.doi.org/10.1155/2014/875090.

Full text
Abstract:
Maximum margin criterion (MMC) is a well-known method for feature extraction and dimensionality reduction. However, MMC is based on vector data and fails to exploit local characteristics of image data. In this paper, we propose a two-dimensional generalized framework based on a block-wise approach for MMC, to deal with matrix representation data, that is, images. The proposed method, namely, block-wise two-dimensional maximum margin criterion (B2D-MMC), aims to find local subspace projections using unilateral matrix multiplication in each block set, such that in the subspace a block is close to those belonging to the same class but far from those belonging to different classes. B2D-MMC avoids iterations and alternations as in current bilateral projection based two-dimensional feature extraction techniques by seeking a closed form solution of one-side projection matrix for each block set. Theoretical analysis and experiments on benchmark face databases illustrate that the proposed method is effective and efficient.
APA, Harvard, Vancouver, ISO, and other styles
10

YANG, JIAN, JING-YU YANG, ALEJANDRO F. FRANGI, and DAVID ZHANG. "UNCORRELATED PROJECTION DISCRIMINANT ANALYSIS AND ITS APPLICATION TO FACE IMAGE FEATURE EXTRACTION." International Journal of Pattern Recognition and Artificial Intelligence 17, no. 08 (December 2003): 1325–47. http://dx.doi.org/10.1142/s0218001403002903.

Full text
Abstract:
In this paper, a novel image projection analysis method (UIPDA) is first developed for image feature extraction. In contrast to Liu's projection discriminant method, UIPDA has the desirable property that the projected feature vectors are mutually uncorrelated. Also, a new LDA technique called EULDA is presented for further feature extraction. The proposed methods are tested on the ORL and the NUST603 face databases. The experimental results demonstrate that: (i) UIPDA is superior to Liu's projection discriminant method and more efficient than Eigenfaces and Fisherfaces; (ii) EULDA outperforms the existing PCA plus LDA strategy; (iii) UIPDA plus EULDA is a very effective two-stage strategy for image feature extraction.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Projection extraction"

1

Martinez, Eduardo Rodriguez. "Evolutionary induction of projection maps for feature extraction." Thesis, University of Liverpool, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.569587.

Full text
Abstract:
This thesis proposes an evolutionary scheme for automatic design of feature extraction methods, tailored to a given classification problem. The main advantage of the proposed scheme is its capacity to formulate new models when the exiR.tmg'ones do not fit the .. ' problem at hand. The learning phase is expressed as a model selection problem, where the best performing model is selected among the genetic pool, assessed by an estimation of out-of-sample generalization error. Each individual in the genetic pool represents a potential model encoded into a hybrid genotype, specifically designed to hold a tree structure and an scalar array to represent both feature-extraction and classification stages. The role of the inducer is to automatically design a mapping function to be used as the core of the feature-extraction stage, as well as fine-tune the corresponding hyper-parameters for the feature-extraction/classification pair. Two paradigms are explored to express the feature-extraction stage, namely projection pursuit and spectral embedding methods. Both paradigms can express several feature extraction algorithms under a common template. In the case of projection pursuit, such template consist on the optimisation of a cost function, also known as projection index, that can be specifically designed to highlight certain properties of the extracted features. While for spectral embedding methods, a suitable set of similarity metrics is needed to construct a weight matrix, which encodes the links between any two samples on the vertices of a graph. The eigendecomposition of such weight matrix represents the solution to an optimisation problem looking for a low-dimensional space, retaining the characteristics described by the original distance metric. The proposed inducer evolves an optimal projection index or a desired distance metric for the corresponding feature-extraction paradigm. Addi- tionally, projection pursuit was extended to the nonlinear case by means of the kernel trick. The determination of a nonlinear residual subspace for sequential projection pursuit is reduced to the computation of an updated kernel matrix.
APA, Harvard, Vancouver, ISO, and other styles
2

Weingessel, Andreas, Martin Natter, and Kurt Hornik. "Using independent component analysis for feature extraction and multivariate data projection." SFB Adaptive Information Systems and Modelling in Economics and Management Science, WU Vienna University of Economics and Business, 1998. http://epub.wu.ac.at/1424/1/document.pdf.

Full text
Abstract:
Deriving low-dimensional perceptual spaces from data consisting of many variables is of crucial interest in strategic market planning. A frequently used method in this context is Principal Components Analysis, which finds uncorrelated directions in the data. This methodology which supports the identification of competitive structures can gainfully be utilized for product (re)positioning or optimal product (re)design. In our paper, we investigate the usefulness of a novel technique, Independent Component Analysis, to discover market structures. Independent Component Analysis is an extension of Principal Components Analysis in the sense that it looks for directions in the data that are not only uncorrelated but also independent. Comparing the two approaches on the basis of an empirical data set, we find that Independent Component Analysis leads to clearer and sharper structures than Principal Components Analysis. Furthermore, the results of Independent Component Analysis have a reasonable marketing interpretation.
Series: Working Papers SFB "Adaptive Information Systems and Modelling in Economics and Management Science"
APA, Harvard, Vancouver, ISO, and other styles
3

Herrmann, Carmen. "Projection techniques for complexity reduction and information extraction in correlated quantum systems /." Zürich : ETH, 2006. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=16952.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Rutledge, Glen A. "Dictionary projection pursuit, a wavelet packet technique for acoustic spectral feature extraction." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0008/NQ52770.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Onak, Onder Nazim. "Comparison Of Ocr Algorithms Using Fourier And Wavelet Based Feature Extraction." Master's thesis, METU, 2011. http://etd.lib.metu.edu.tr/upload/12612928/index.pdf.

Full text
Abstract:
A lot of research have been carried in the field of optical character recognition. Selection of a feature extraction scheme is probably the most important factor in achieving high recognition performance. Fourier and wavelet transforms are among the popular feature extraction techniques allowing rotation invariant recognition. The performance of a particular feature extraction technique depends on the used dataset and the classifier. Dierent feature types may need dierent types of classifiers. In this thesis Fourier and wavelet based features are compared in terms of classification accuracy. The influence of noise with dierent intensities is also analyzed. Character recognition system is implemented with Matlab. Isolated gray scale character image first transformed into one dimensional function. Then, set of features are extracted. The feature set are fed to a classifier. Two types of classifier were used, Nearest Neighbor and Linear Discriminant Function. The performance of each feature extraction and classification methods were tested on various rotated and scaled character images.
APA, Harvard, Vancouver, ISO, and other styles
6

Nilsson, Jim, and Peter Valtersson. "Machine Vision Inspection of the Lapping Process in the Production of Mass Impregnated High Voltage Cables." Thesis, Blekinge Tekniska Högskola, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-16707.

Full text
Abstract:
Background. Mass impregnated high voltage cables are used in, for example, submarine electric power transmission. One of the production steps of such cables is the lapping process in which several hundred layers of special purpose paper are wrapped around the conductor of the cable. It is important for the mechanical and electrical properties of the finished cable that the paper is applied correctly, however there currently exists no reliable way of continuously ensuring that the paper is applied correctly. Objective. The objective of this thesis is to develop a prototype of a cost-effective machine vision system which monitors the lapping process and detects and records any errors that may occur during the process; with an accuracy of at least one tenth of a millimetre. Methods. The requirements of the system are specified and suitable hardware is identified. Using a method where the images are projected down to one axis as well as other signal processing methods, the errors are measured. Experiments are performed where the accuracy and performance of the system is tested in a controlled environment. Results. The results show that the system is able to detect and measure errors accurately down to one tenth of a millimetre while operating at a frame rate of 40 frames per second. The hardware cost of the system is less than €200. Conclusions. A cost-effective machine vision system capable of performing measurements accurate down to one tenth of a millimetre can be implemented using the inexpensive Raspberry Pi 3 and Raspberry Pi Camera Module V2. Th
APA, Harvard, Vancouver, ISO, and other styles
7

Alencar, Aretha Barbosa. "Visualização da evolução temporal de coleções de artigos científicos." Universidade de São Paulo, 2013. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-11042013-155653/.

Full text
Abstract:
Artigos científicos são o principal mecanismo que pesquisadores usam para reportar suas descobertas científicas, e uma coleção de artigos em uma área de pesquisa pode revelar muito sobre sua evolução ao longo do tempo, como a emergência de novos tópicos e a evolução dos mesmos quanto ao seu conteúdo. No entanto, dada uma ampla coleção de artigos é geralmente muito difícil extrair informações importantes que possam ajudar leitores a interpretar globalmente, navegar e então eventualmente focar em itens relevantes para sua tarefa. Mapas de documentos baseados em conteúdo são representações visuais criadas para avaliar a similaridade entre documentos, e têm se mostrado úteis em auxiliar tarefas exploratórias neste cenário. Documentos são representados por marcadores visuais projetados em um espaço bidimensional de forma que documentos com conteúdo similar permaneçam próximos. Apesar de estes mapas permitirem a identificação visual de grupos de documentos relacionados e de fronteiras entre esses grupos, eles não transmitem explicitamente a evolução temporal de uma coleção. Nesta tese, propomos e validamos um mapa de documentos dinâmico interativo para coleções de artigos científicos capaz de evidenciar o comportamento temporal para apoiar tarefas de análise, preservando ao mesmo tempo a acurácia local do mapa e o contexto do usuário. As mudanças nas relações de similaridade, evidenciadas ao longo do tempo nesse mapa, oferecem suporte para detecção da evolução temporal dos tópicos. Essa evolução é caracterizada por meio de eventos de transição entre grupos, como a emergência de novos grupos e tópicos em momentos específicos e a especialização de um grupo, e pela detecção de mudanças no vocabulário dos tópicos, utilizando técnicas que extraem os termos mais relevantes (tópicos) em cada grupo, em diferentes momentos
Scientific articles are the major mechanism used by researchers to report their scientific results, and a collection of articles in a research area can reveal a lot about its evolution over time, such as the emergence of new topics and changes in topic vocabulary. However, given a broad collection of articles it is usually very difficult to extract important information that can help readers to globally interpret, navigate and then eventually focus on subjects relevant to their task. Document maps based on content are visual representations created to convey the similarity between documents, and have proven to be useful in helping users conducting exploratory tasks in this scenario. Documents are represented by graphical markers projected onto a two-dimensional space so that documents similar in content remain close. Although these maps allow visual identification of groups of related documents and boundaries between these groups, they do not explicitly convey the temporal evolution of a collection. In this thesis, we propose and validate a dynamic document map for collections of scientific articles capable of showing the temporal behavior to support analysis tasks, while simultaneously preserving the local accuracy of the map and the user global context. Changes in the similarity relationships, evidenced over time in this map, support the detection of the temporal evolution of topics. This evolution is characterized by transition events between groups such as the emergence of new groups and topics at specific moments and the specialization of a group, as well by detecting changes in the vocabulary of topics, using techniques that extract the most relevant terms (topics) in each group, at different times
APA, Harvard, Vancouver, ISO, and other styles
8

Piffet, Loïc. "Décomposition d’image par modèles variationnels : débruitage et extraction de texture." Thesis, Orléans, 2010. http://www.theses.fr/2010ORLE2053/document.

Full text
Abstract:
Cette thèse est consacrée dans un premier temps à l’élaboration d’un modèle variationnel dedébruitage d’ordre deux, faisant intervenir l’espace BV 2 des fonctions à hessien borné. Nous nous inspirons ici directement du célèbre modèle de Rudin, Osher et Fatemi (ROF), remplaçant la minimisation de la variation totale de la fonction par la minimisation de la variation totale seconde, c’est à dire la variation totale de ses dérivées. Le but est ici d’obtenir un modèle aussi performant que le modèle ROF, permettant de plus de résoudre le problème de l’effet staircasing que celui-ci engendre. Le modèle que nous étudions ici semble efficace, entraînant toutefois l’apparition d’un léger effet de flou. C’est afin de réduire cet effet que nous introduisons finalement un modèle mixte, permettant d’obtenir des solutions à la fois non constantes par morceaux et sans effet de flou au niveau des détails. Dans une seconde partie, nous nous intéressons au problème d’extraction de texture. Un modèle reconnu comme étant l’un des plus performants est le modèle T V -L1, qui consiste simplement à remplacer dans le modèle ROF la norme L2 du terme d’attache aux données par la norme L1. Nous proposons ici une méthode originale permettant de résoudre ce problème utilisant des méthodes de Lagrangien augmenté. Pour les mêmes raisons que dans le cas du débruitage, nous introduisons également le modèle T V 2-L1, consistant encore une fois à remplacer la variation totale par la variation totale seconde. Un modèle d’extraction de texture mixte est enfin très brièvement introduit. Ce manuscrit est ponctué d’un vaste chapitre dédié aux tests numériques
This thesis is devoted in a first part to the elaboration of a second order variational modelfor image denoising, using the BV 2 space of bounded hessian functions. We here take a leaf out of the well known Rudin, Osher and Fatemi (ROF) model, where we replace the minimization of the total variation of the function with the minimization of the second order total variation of the function, that is to say the total variation of its partial derivatives. The goal is to get a competitive model with no staircasing effect that generates the ROF model anymore. The model we study seems to be efficient, but generates a blurry effect. In order to deal with it, we introduce a mixed model that permits to get solutions with no staircasing and without blurry effect on details. In a second part, we take an interset to the texture extraction problem. A model known as one of the most efficient is the T V -L1 model. It just consits in replacing the L2 norm of the fitting data term with the L1 norm.We propose here an original way to solve this problem by the use of augmented Lagrangian methods. For the same reason than for the denoising case, we also take an interest to the T V 2-L1 model, replacing again the total variation of the function by the second order total variation. A mixed model for texture extraction is finally briefly introduced. This manuscript ends with a huge chapter of numerical tests
APA, Harvard, Vancouver, ISO, and other styles
9

Breutel, Stephan Werner. "Analysing the behaviour of neural networks." Queensland University of Technology, 2004. http://eprints.qut.edu.au/15943/.

Full text
Abstract:
A new method is developed to determine a set of informative and refined interface assertions satisfied by functions that are represented by feed-forward neural networks. Neural networks have often been criticized for their low degree of comprehensibility.It is difficult to have confidence in software components if they have no clear and valid interface description. Precise and understandable interface assertions for a neural network based software component are required for safety critical applications and for theintegration into larger software systems. The interface assertions we are considering are of the form "e if the input x of the neural network is in a region (alpha symbol) of the input space then the output f(x) of the neural network will be in the region (beta symbol) of the output space "e and vice versa. We are interested in computing refined interface assertions, which can be viewed as the computation of the strongest pre- and postconditions a feed-forward neural network fulfills. Unions ofpolyhedra (polyhedra are the generalization of convex polygons in higher dimensional spaces) are well suited for describing arbitrary regions of higher dimensional vector spaces. Additionally, polyhedra are closed under affine transformations. Given a feed-forward neural network, our method produces an annotated neural network, where each layer is annotated with a set of valid linear inequality predicates. The main challenges for the computation of these assertions is to compute the solution of a non-linear optimization problem and the projection of a polyhedron onto a lower-dimensional subspace.
APA, Harvard, Vancouver, ISO, and other styles
10

NEDELJKOVIC, SONJA R. "PARAMETER EXTRACTION AND DEVICE PHYSICS PROJECTIONS ON LATERAL LOW VOLTAGE POWER MOSFET CONFIGURATIONS." University of Cincinnati / OhioLINK, 2001. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1005163403.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Projection extraction"

1

Markowitz, Jonathan N. Perils of Plenty. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780190078249.001.0001.

Full text
Abstract:
Why do some states project military force to seek control of resources, while others do not? Conventional wisdom asserts that resource-scarce states have the strongest interest in securing control over resources. Counterintuitively, this book finds that, under certain conditions, the opposite is true. Perils of Plenty argues that what states make influences what they want to take. Specifically, the more economically dependent states are on extracting income from resource rents, the stronger their preferences to secure control over resources will be. This theory is tested with a set of case studies analyzing states’ reactions to the 2007 exogenous climate shock that exposed energy resources in the Arctic. This book finds that some states, such as Russia and Norway, responded to the shock by dramatically increasing their Arctic military presence, while others, such as the United States, Canada, and Denmark, did not. Contrary to the conventional wisdom, countries with plentiful natural resources, such as Norway and Russia, were more—not less—willing to back their claims by projecting military force. This book finds that plenty can actually lead to peril when states with plentiful resources become economically dependent on those resources and thus have stronger incentives to secure their control. These findings have implications for understanding both the political effects of climate change in the Arctic and the prospects for resource competition in other regions, such as the Middle East and the South China Sea
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Projection extraction"

1

Breaban, Mihaela Elena. "Multiobjective Projection Pursuit for Semisupervised Feature Extraction." In Applications of Evolutionary Computation, 324–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-37192-9_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Li, Jun-Bao, Shu-Chuan Chu, and Jeng-Shyang Pan. "Locally Discriminant Projection with Kernels for Feature Extraction." In Advanced Data Mining and Applications, 586–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-73871-8_56.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Guan, Zhen-yu, Jie Li, and Huan Yang. "Runway Extraction Method Based on Rotating Projection for UAV." In Proceedings of the 6th International Asia Conference on Industrial Engineering and Management Innovation, 311–24. Paris: Atlantis Press, 2015. http://dx.doi.org/10.2991/978-94-6239-145-1_30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Rodrigues, Roberto J., Gizelle K. Vianna, and Antonio C. G. Thomé. "Character Feature Extraction Using Polygonal Projection Sweep (Contour Detection)." In Bio-Inspired Applications of Connectionism, 687–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45723-2_83.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kwon, Yong-Il, Ho-Hyun Park, Jixue Liu, and Mario A. Nascimento. "Radial Projection: A Feature Extraction Method for Topographical Shapes." In Advances in Multimedia Information Processing - PCM 2005, 582–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11581772_51.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sorokin, Dmitry V., Maxim M. Mizotin, and Andrey S. Krylov. "Gauss-Laguerre Keypoints Extraction Using Fast Hermite Projection Method." In Lecture Notes in Computer Science, 284–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21593-3_29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Santa Cruz, C., and J. Dorronsoro. "A nonlinear discriminant algorithm for data projection and feature extraction." In Artificial Neural Networks — ICANN 96, 563–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61510-5_96.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Feng, Linhui, Linbo Qiao, Yi Han, Zhigang Kan, Yifu Gao, and Dongsheng Li. "Syntactic Enhanced Projection Network for Few-Shot Chinese Event Extraction." In Knowledge Science, Engineering and Management, 75–87. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-82147-0_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Huang, Hui-Yu, and Yan-Ching Lin. "An Approach for Mouth Localization Using Face Feature Extraction and Projection Technique." In Advances in Intelligent Systems and Applications - Volume 2, 247–57. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-35473-1_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Tang, Yu, Zhao Zhang, and Weiming Jiang. "Two-Dimensional Soft Linear Discriminant Projection for Robust Image Feature Extraction and Recognition." In Neural Information Processing, 514–21. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-46681-1_61.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Projection extraction"

1

Lan, Rushi, Jianwei Yang, Yong Jiang, and Xiaoxia Feng. "Feature extraction using extended central projection." In 2012 International Conference on Wavelet Analysis and Pattern Recognition (ICWAPR). IEEE, 2012. http://dx.doi.org/10.1109/icwapr.2012.6294802.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhonglong Zheng, Chenmao Xie, and Jiong Jia. "ISO-Container Projection for feature extraction." In 2010 International Symposium on Intelligent Signal Processing and Communications Systems (ISPACS 2010). IEEE, 2010. http://dx.doi.org/10.1109/ispacs.2010.5704690.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

He, Mingyi, and Shaohui Mei. "Dimension Reduction by Random Projection for Endmember Extraction." In 2010 5th IEEE Conference on Industrial Electronics and Applications (ICIEA). IEEE, 2010. http://dx.doi.org/10.1109/iciea.2010.5516724.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Faruqui, Manaal, and Shankar Kumar. "Multilingual Open Relation Extraction Using Cross-lingual Projection." In Proceedings of the 2015 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. Stroudsburg, PA, USA: Association for Computational Linguistics, 2015. http://dx.doi.org/10.3115/v1/n15-1151.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Jing, Xiaoyuan, Sheng Li, Songhao Zhu, Qian Liu, Jingyu Yang, and Jiasen Lu. "Supervised local sparsity preserving projection for face feature extraction." In 2011 First Asian Conference on Pattern Recognition (ACPR 2011). IEEE, 2011. http://dx.doi.org/10.1109/acpr.2011.6166662.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Li, G. P., H. G. Liu, and CH SH Ai. "Feature extraction of label character based on projection transformation." In 2010 8th World Congress on Intelligent Control and Automation (WCICA 2010). IEEE, 2010. http://dx.doi.org/10.1109/wcica.2010.5554756.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kezheng, Lin, Wang Huixin, and Lin Sheng. "Face Feature Extraction Based on Uncorrelated Locality Information Projection." In 2008 International Conference on Computational Intelligence and Security (CIS). IEEE, 2008. http://dx.doi.org/10.1109/cis.2008.154.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Youngsung Kim and Kar-Ann Toh. "Sparse random projection for efficient cancelable face feature extraction." In 2008 3rd IEEE Conference on Industrial Electronics and Applications (ICIEA). IEEE, 2008. http://dx.doi.org/10.1109/iciea.2008.4582897.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Jiun-Lin Chen and Hsi-Jian Lee. "A novel form structure extraction method using strip projection." In Proceedings of 13th International Conference on Pattern Recognition. IEEE, 1996. http://dx.doi.org/10.1109/icpr.1996.547283.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Sun, Yu-jie, Yang Li, and Huan Yang. "Runway extraction method based on rotating projection for UAV." In 2016 IEEE 11th Conference on Industrial Electronics and Applications (ICIEA). IEEE, 2016. http://dx.doi.org/10.1109/iciea.2016.7603621.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Projection extraction"

1

Bollen, Georg, and David Morrissey. Development of a fast cyclotron gas stopper for intense rare isotope beams from projectile fragmentation: Study of ion extraction with a radiofrequency carpet. Office of Scientific and Technical Information (OSTI), January 2011. http://dx.doi.org/10.2172/1083431.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Projection extraction' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography