Relevant bibliographies by topics / Binary projection

Academic literature on the topic 'Binary projection'

Author: Grafiati
Published: 10 December 2022
Last updated: 28 January 2023

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

Select a source type:

Contents

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

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 "Binary projection"

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

TANG, Peikai, Wei CHEN, and Yicheng MAI. "Binary projection for image local descriptor." Journal of Computer Applications 33, no. 4 (October 11, 2013): 1096–99. http://dx.doi.org/10.3724/sp.j.1087.2013.01096.

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

Bleichrodt, Folkert, Jan De Beenhouwer, Jan Sijbers, and Kees Joost Batenburg. "Aligning Projection Images from Binary Volumes." Fundamenta Informaticae 135, no. 1-2 (2014): 21–42. http://dx.doi.org/10.3233/fi-2014-1110.

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

Varga, László, Péter Balázs, and Antal Nagy. "Projection Selection Dependency in Binary Tomography." Acta Cybernetica 20, no. 1 (2011): 167–87. http://dx.doi.org/10.14232/actacyb.20.1.2011.12.

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

Delhomm�, C. "Projection properties and reflexive binary relations." Algebra Universalis 41, no. 4 (September 1, 1999): 255–81. http://dx.doi.org/10.1007/s000120050115.

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

Yan, Hui, Xiaotong Yuan, Shuicheng Yan, and Jingyu Yang. "Correntropy based feature selection using binary projection." Pattern Recognition 44, no. 12 (December 2011): 2834–42. http://dx.doi.org/10.1016/j.patcog.2011.04.014.

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

KUMAR, CHANDAN. "NP/DP Parameter and Classifier Languages: A Case of Magahi." Journal of Indian and Asian Studies 01, no. 01 (January 2020): 2050005. http://dx.doi.org/10.1142/s2717541320500059.

Full text
Abstract:
The paper presents the structural evidence for the existence of DP in the article-less language, Magahi. Article-less languages can be divided into two types: class languages and non-class languages. Most of the debate surrounding the treatment of article-less languages as DP/NP languages see only the binary distinction (article and non-article languages). In this paper, it is argued that the class-languages present richer structural evidences for the presence of the functional projection above NP. Along with presenting few structural evidences against the generalization presented by Bošković (2005), language-independent motivation for the functional projection like DP is also discussed. It is also argued that merit of the projection of the DP is also semantically justified. The argument that there can be various functional projections in the extended projection of NP weakens the strongest claim that article-less languages lack DP.
APA, Harvard, Vancouver, ISO, and other styles
8

Fu Lina, 付莉娜, 杨静雯 Yang Jingwen, 李雁玲 Li Yanling, 张宗华 Zhang Zonghua, 高楠 Gao Nan, 孟召宗 Meng Zhaozong, 高峰 Gao Feng, and 蒋向前 Jiang Xiangqian. "二值条纹离焦投影技术综述." Laser & Optoelectronics Progress 59, no. 14 (2022): 1415011. http://dx.doi.org/10.3788/lop202259.1415011.

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

Weng, Zhenyu, and Yuesheng Zhu. "Online Hashing with Efficient Updating of Binary Codes." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 07 (April 3, 2020): 12354–61. http://dx.doi.org/10.1609/aaai.v34i07.6920.

Full text
Abstract:
Online hashing methods are efficient in learning the hash functions from the streaming data. However, when the hash functions change, the binary codes for the database have to be recomputed to guarantee the retrieval accuracy. Recomputing the binary codes by accumulating the whole database brings a timeliness challenge to the online retrieval process. In this paper, we propose a novel online hashing framework to update the binary codes efficiently without accumulating the whole database. In our framework, the hash functions are fixed and the projection functions are introduced to learn online from the streaming data. Therefore, inefficient updating of the binary codes by accumulating the whole database can be transformed to efficient updating of the binary codes by projecting the binary codes into another binary space. The queries and the binary code database are projected asymmetrically to further improve the retrieval accuracy. The experiments on two multi-label image databases demonstrate the effectiveness and the efficiency of our method for multi-label image retrieval.
APA, Harvard, Vancouver, ISO, and other styles
10

Fu, Guangkai, Yiping Cao, Yapin Wang, Yingying Wan, Lu Wang, and Chengmeng Li. "Three-dimensional shape measurement based on binary fringe conventional projection." Transactions of the Institute of Measurement and Control 41, no. 14 (May 17, 2019): 4073–83. http://dx.doi.org/10.1177/0142331219848029.

Full text
Abstract:
A three-dimensional (3D) shape measurement method based on binary fringe conventional projection is proposed. In traditional 3D shape measurement methods based on binary fringe projection, the binary fringe is used as an approximate sinusoidal fringe by defocusing projection or even directly used as an approximate sinusoidal fringe by nonlinear error suppression feature of large-step phase measuring profilometry (PMP). In the proposed method (Prop), neither defocusing projection is needed nor large-step PMP must be used. When the binary fringe is conventionally projected on the measured object, just by filtering operation in spatial frequency domain from the captured deformed pattern, the nearly unbroken sinusoidal deformed pattern can be extracted efficiently. While N ( N≥3) frames binary fringes with 1/ N period misalignment between each adjacent fringe are conventionally projected onto the measured object sequentially, the corresponding nearly unbroken N-step sinusoidal deformed patterns extracted from the N frames captured deformed patterns can be used to reconstruct the 3D shape of the measured object with N-step PMP algorithm. The experimental results show the feasibility and validity of the Prop. It is more flexible for its optional fringe period and optional phase-shifting steps. It has potential application in the real-time 3D shape measurement.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Binary projection"

1

Landgraf, Andrew J. "Generalized Principal Component Analysis: Dimensionality Reduction through the Projection of Natural Parameters." The Ohio State University, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=osu1437610558.

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

Eldredge, Nate. "An Eigenspace Approach to Isotropic Projections for Data on Binary Trees." Scholarship @ Claremont, 2003. https://scholarship.claremont.edu/hmc_theses/146.

Full text
Abstract:
The classical Fourier transform is, in essence, a way to take data and extract components (in the form of complex exponentials) which are invariant under cyclic shifts. We consider a case in which the components must instead be invariant under automorphisms of a binary tree. We present a technique by which a slightly relaxed form of the generalized Fourier transform in this case can eventually be computed using only simple tools from linear algebra, which has possible advantages in computational efficiency.
APA, Harvard, Vancouver, ISO, and other styles
3

Wang, Lin. "Binary tomography reconstruction of bone microstructures from a limited number of projections." Thesis, Lyon, 2016. http://www.theses.fr/2016LYSEI054/document.

Full text
Abstract:
La reconstruction en tomographie discrète de la microstructure de l’os joue un role très important pour le diagnostic de l’ostéoporse, une maladie des os très fréquente. Le diagnostic clinique est basé sur l’absortiométrie duale de rayons X. Avec la tomographie de rayons X, une résolution spatiale élevée avec des images reconstruites in vivo requiert une dose d’irradiation élevée et un temps de balayage long, ce qui est dangereux pour le patient. Une des méthodes pour résoudre ce problème est de limiter le nombre de projections. Cependant, avec cette méthode le problème de reconstruction devient mal posé. Deux types de régularisation par Variation Totale minimisées avec la méthode Alternate Direction of Minimization Method (ADMM) et deux schémas basés sur les méthodes de régularisation Level-set sont appliquées à deux images d’os expérimentales acquises avec un synchrotron (pixel size: 15 μm). Des images de tailles variées et avec différents niveaux de bruit Gaussien additifs ajoutés aux projections sont utlisées pour étudier l’efficacité des méthodes de régularisation. Des minima locaux sont obtenus avec ces méthodes déterministes. Une approche globale d’optimisation est nécessaire pour améliorer les résultats. Des perturbations stochastiques peuvent être un moyen très utile pour échapper aux minima locaux. Dans une première approche, une équation différentielle stochastique basée sur la régularisation level-set est étudiée. Cette méthode améliore les résultats de reconstruction mais ne modifie que les frontières entre les régions 0 et 1. Ensuite une équation aux dérivées partielles stochastique est obtenue avec la régularisation TV pour améliorer la méthode stochastique level-set. A la fin de notre travail, nous avons étendu la méthode de régularisation à des images 3D avec des données réelles. Cette algorithme a été implémenté avec RTK. Nous avons aussi étendu l’approche level-set utilisée pour la tomographie binaire au cas multi-level
Discrete tomography reconstruction of bone microstructure is important in diagnosis of osteoporosis. One way to reduce the radiation dose and scanning time in CT imaging is to limit the number of projections. This method makes the reconstruction problem highly ill-posed. A common solution is to reconstruct only a finite number of intensity levels. In this work, we investigate only binary tomography reconstruction problem. First, we consider variational regularization methods. Two types of Total Variation (TV) regularization approaches minimized with the Alternate Direction of Minimization Method (ADMM) and two schemes based on Level-set (LS) regularization methods are applied to two experimental bone cross-section images acquired with synchrotron micro-CT. The numerical experiments have shown that good reconstruction results were obtained with TV regularization methods and that level-set regularization outperforms the TV regularization for large bone image with complex structures. Yet, for both methods, some reconstruction errors are still located on the boundaries and some regions are lost when the projection number is low. Local minima were obtained with these deterministic methods. Stochastic perturbations is a useful way to escape the local minima. As a first approach, a stochastic differential equation based on level-set regularization was studied. This method improves the reconstruction results but only modifies the boundaries between the 0 and 1 regions. Then partial stochastic differential equation obtained with the TV regularization semi-norm were studied to improve the stochastic level-set method. The random change of the boundary are performed in a new way with the gradient or wavelet decomposition of the reconstructed image. Random topological changes are included to find the lost regions in the reconstructed images. At the end of our work, we extended the TV regularization method to 3D images with real data on RTK (Reconstruction Toolkit). And we also extended the level-set to the multi-level cases
APA, Harvard, Vancouver, ISO, and other styles
4

Huang, Jen-Fa. "On finding generator polynomials and parity-check sums of binary projective geometry codes." Thesis, University of Ottawa (Canada), 1985. http://hdl.handle.net/10393/4800.

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

Hitchcock, Yvonne Roslyn. "Elliptic curve cryptography for lightweight applications." Thesis, Queensland University of Technology, 2003. https://eprints.qut.edu.au/15838/1/Yvonne_Hitchcock_Thesis.pdf.

Full text
Abstract:
Elliptic curves were first proposed as a basis for public key cryptography in the mid 1980's. They provide public key cryptosystems based on the difficulty of the elliptic curve discrete logarithm problem (ECDLP) , which is so called because of its similarity to the discrete logarithm problem (DLP) over the integers modulo a large prime. One benefit of elliptic curve cryptosystems (ECCs) is that they can use a much shorter key length than other public key cryptosystems to provide an equivalent level of security. For example, 160 bit ECCs are believed to provide about the same level of security as 1024 bit RSA. Also, the level of security provided by an ECC increases faster with key size than for integer based discrete logarithm (dl) or RSA cryptosystems. ECCs can also provide a faster implementation than RSA or dl systems, and use less bandwidth and power. These issues can be crucial in lightweight applications such as smart cards. In the last few years, ECCs have been included or proposed for inclusion in internationally recognized standards. Thus elliptic curve cryptography is set to become an integral part of lightweight applications in the immediate future. This thesis presents an analysis of several important issues for ECCs on lightweight devices. It begins with an introduction to elliptic curves and the algorithms required to implement an ECC. It then gives an analysis of the speed, code size and memory usage of various possible implementation options. Enough details are presented to enable an implementer to choose for implementation those algorithms which give the greatest speed whilst conforming to the code size and ram restrictions of a particular lightweight device. Recommendations are made for new functions to be included on coprocessors for lightweight devices to support ECC implementations Another issue of concern for implementers is the side-channel attacks that have recently been proposed. They obtain information about the cryptosystem by measuring side-channel information such as power consumption and processing time and the information is then used to break implementations that have not incorporated appropriate defences. A new method of defence to protect an implementation from the simple power analysis (spa) method of attack is presented in this thesis. It requires 44% fewer additions and 11% more doublings than the commonly recommended defence of performing a point addition in every loop of the binary scalar multiplication algorithm. The algorithm forms a contribution to the current range of possible spa defences which has a good speed but low memory usage. Another topic of paramount importance to ECCs for lightweight applications is whether the security of fixed curves is equivalent to that of random curves. Because of the inability of lightweight devices to generate secure random curves, fixed curves are used in such devices. These curves provide the additional advantage of requiring less bandwidth, code size and processing time. However, it is intuitively obvious that a large precomputation to aid in the breaking of the elliptic curve discrete logarithm problem (ECDLP) can be made for a fixed curve which would be unavailable for a random curve. Therefore, it would appear that fixed curves are less secure than random curves, but quantifying the loss of security is much more difficult. The thesis performs an examination of fixed curve security taking this observation into account, and includes a definition of equivalent security and an analysis of a variation of Pollard's rho method where computations from solutions of previous ECDLPs can be used to solve subsequent ECDLPs on the same curve. A lower bound on the expected time to solve such ECDLPs using this method is presented, as well as an approximation of the expected time remaining to solve an ECDLP when a given size of precomputation is available. It is concluded that adding a total of 11 bits to the size of a fixed curve provides an equivalent level of security compared to random curves. The final part of the thesis deals with proofs of security of key exchange protocols in the Canetti-Krawczyk proof model. This model has been used since it offers the advantage of a modular proof with reusable components. Firstly a password-based authentication mechanism and its security proof are discussed, followed by an analysis of the use of the authentication mechanism in key exchange protocols. The Canetti-Krawczyk model is then used to examine secure tripartite (three party) key exchange protocols. Tripartite key exchange protocols are particularly suited to ECCs because of the availability of bilinear mappings on elliptic curves, which allow more efficient tripartite key exchange protocols.
APA, Harvard, Vancouver, ISO, and other styles
6

Hitchcock, Yvonne Roslyn. "Elliptic Curve Cryptography for Lightweight Applications." Queensland University of Technology, 2003. http://eprints.qut.edu.au/15838/.

Full text
Abstract:
Elliptic curves were first proposed as a basis for public key cryptography in the mid 1980's. They provide public key cryptosystems based on the difficulty of the elliptic curve discrete logarithm problem (ECDLP) , which is so called because of its similarity to the discrete logarithm problem (DLP) over the integers modulo a large prime. One benefit of elliptic curve cryptosystems (ECCs) is that they can use a much shorter key length than other public key cryptosystems to provide an equivalent level of security. For example, 160 bit ECCs are believed to provide about the same level of security as 1024 bit RSA. Also, the level of security provided by an ECC increases faster with key size than for integer based discrete logarithm (dl) or RSA cryptosystems. ECCs can also provide a faster implementation than RSA or dl systems, and use less bandwidth and power. These issues can be crucial in lightweight applications such as smart cards. In the last few years, ECCs have been included or proposed for inclusion in internationally recognized standards. Thus elliptic curve cryptography is set to become an integral part of lightweight applications in the immediate future. This thesis presents an analysis of several important issues for ECCs on lightweight devices. It begins with an introduction to elliptic curves and the algorithms required to implement an ECC. It then gives an analysis of the speed, code size and memory usage of various possible implementation options. Enough details are presented to enable an implementer to choose for implementation those algorithms which give the greatest speed whilst conforming to the code size and ram restrictions of a particular lightweight device. Recommendations are made for new functions to be included on coprocessors for lightweight devices to support ECC implementations Another issue of concern for implementers is the side-channel attacks that have recently been proposed. They obtain information about the cryptosystem by measuring side-channel information such as power consumption and processing time and the information is then used to break implementations that have not incorporated appropriate defences. A new method of defence to protect an implementation from the simple power analysis (spa) method of attack is presented in this thesis. It requires 44% fewer additions and 11% more doublings than the commonly recommended defence of performing a point addition in every loop of the binary scalar multiplication algorithm. The algorithm forms a contribution to the current range of possible spa defences which has a good speed but low memory usage. Another topic of paramount importance to ECCs for lightweight applications is whether the security of fixed curves is equivalent to that of random curves. Because of the inability of lightweight devices to generate secure random curves, fixed curves are used in such devices. These curves provide the additional advantage of requiring less bandwidth, code size and processing time. However, it is intuitively obvious that a large precomputation to aid in the breaking of the elliptic curve discrete logarithm problem (ECDLP) can be made for a fixed curve which would be unavailable for a random curve. Therefore, it would appear that fixed curves are less secure than random curves, but quantifying the loss of security is much more difficult. The thesis performs an examination of fixed curve security taking this observation into account, and includes a definition of equivalent security and an analysis of a variation of Pollard's rho method where computations from solutions of previous ECDLPs can be used to solve subsequent ECDLPs on the same curve. A lower bound on the expected time to solve such ECDLPs using this method is presented, as well as an approximation of the expected time remaining to solve an ECDLP when a given size of precomputation is available. It is concluded that adding a total of 11 bits to the size of a fixed curve provides an equivalent level of security compared to random curves. The final part of the thesis deals with proofs of security of key exchange protocols in the Canetti-Krawczyk proof model. This model has been used since it offers the advantage of a modular proof with reusable components. Firstly a password-based authentication mechanism and its security proof are discussed, followed by an analysis of the use of the authentication mechanism in key exchange protocols. The Canetti-Krawczyk model is then used to examine secure tripartite (three party) key exchange protocols. Tripartite key exchange protocols are particularly suited to ECCs because of the availability of bilinear mappings on elliptic curves, which allow more efficient tripartite key exchange protocols.
APA, Harvard, Vancouver, ISO, and other styles
7

Muzikářová, Zdena. "Binární relace a zobrazení ve výuce matematiky." Master's thesis, 2018. http://www.nusl.cz/ntk/nusl-389633.

Full text
Abstract:
The diploma thesis presents a collection of solved problems in binary relations. Students are familiarized with various applications of binary relations on high school mathematics and geometry. The work focuses on graphical representation of binary relations and their use in solving equations, inequalities and their sys- tems. It is a teaching text designated for a mathematics seminar at high school. In addition to exercises, it also includes an introduction of new concepts which are supplemented by relevant definitions and illustrative examples. 1
APA, Harvard, Vancouver, ISO, and other styles
8

Li, Paul. "On the universal embeddings of the binary symplectic and unitary dual polar spaces /." 2001. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:3006525.

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

Pai, Srikanth B. "Classical Binary Codes And Subspace Codes in a Lattice Framework." Thesis, 2015. http://etd.iisc.ernet.in/handle/2005/2708.

Full text
Abstract:
The classical binary error correcting codes, and subspace codes for error correction in random network coding are two different forms of error control coding. We identify common features between these two forms and study the relations between them using the aid of lattices. Lattices are partial ordered sets where every pair of elements has a least upper bound and a greatest lower bound in the lattice. We shall demonstrate that many questions that connect these forms have a natural motivation from the viewpoint of lattices. We shall show that a lattice framework captures the notion of Singleton bound where the bound is on the size of the code as a function of its parameters. For the most part, we consider a special type of a lattice which has the geometric modular property. We will use a lattice framework to combine the two different forms. And then, in order to demonstrate the utility of this binding view, we shall derive a general version of Singleton bound. We will note that the Singleton bounds behave differently in certain respects because the binary coding framework is associated with a lattice that is distributive. We shall demonstrate that lack of distributive gives rise to a weaker bound. We show that Singleton bound for classical binary codes, subspace codes, rank metric codes and Ferrers diagram rank metric codes can be derived using a common technique. In the literature, Singleton bounds are derived for Ferrers diagram rank metric codes where the rank metric codes are linear. We introduce a generalized version of Ferrers diagram rank metric codes and obtain a Singleton bound for this version. Next, we shall prove a conjecture concerning the constraints of embedding a binary coding framework into a subspace framework. We shall prove a conjecture by Braun, Etzion and Vardy, which states that any such embedding which contains the full space in its range is constrained to have a particular size. Our proof will use a theorem due to Lovasz, a subspace counting theorem for geometric modular lattices, to prove the conjecture. We shall further demonstrate that any code that achieves the conjectured size must be of a particular type. This particular type turns out to be a natural distributive sub-lattice of a given geometric modular lattice.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Binary projection"

1

Pagán Cánovas, Cristóbal, and Anna Piata. The Way Time Goes By. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190457747.003.0004.

Full text
Abstract:
Conceptual metaphor theory has used TIME IS SPACE as the paradigmatic case of projection from a concrete to an abstract domain. More recently, within the framework of conceptual integration or blending theory, a more complex view of time–space mappings—and of mappings in general—has been proposed. Rather than a binary, unidirectional projection between the vast experiential domains of TIME and SPACE, the blending account proposes that meanings combining time and motion emerge from successive integrations within a network of relatively small conceptual packets, including event structure, motion from A to B, and a cultural mechanism for measuring duration. We examine how poetic effects can be created by using the conventional opportunities provided by this conceptual template, as well as by manipulating the path (with a linear or circular shape), one of the basic spatial features in this representation. We analyze examples in Greek, English, and Spanish.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Binary projection"

1

Lékó, Gábor, and Péter Balázs. "Sequential Projection Selection Methods for Binary Tomography." In Computational Modeling of Objects Presented in Images. Fundamentals, Methods, and Applications, 70–81. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-20805-9_7.

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

Choi, Yukyung, Chaehoon Park, and In So Kweon. "Accelerated Kmeans Clustering Using Binary Random Projection." In Computer Vision -- ACCV 2014, 257–72. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-16808-1_18.

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

Lékó, Gábor, Péter Balázs, and László G. Varga. "Projection Selection for Binary Tomographic Reconstruction Using Global Uncertainty." In Lecture Notes in Computer Science, 3–10. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-93000-8_1.

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

Kullmann, Oliver, and Oleg Zaikin. "Projection Heuristics for Binary Branchings Between Sum and Product." In Theory and Applications of Satisfiability Testing – SAT 2021, 299–314. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-80223-3_21.

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

Lékó, Gábor, Szilveszter Domány, and Péter Balázs. "Uncertainty Based Adaptive Projection Selection Strategy for Binary Tomographic Reconstruction." In Computer Analysis of Images and Patterns, 74–84. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-29891-3_7.

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

Akcam, Halil, and Volker Lohweg. "Pollen Classification Based on Binary 2D Projections of Pollen Grains." In Technologien für die intelligente Automation, 273–89. Berlin, Heidelberg: Springer Berlin Heidelberg, 2022. http://dx.doi.org/10.1007/978-3-662-64283-2_20.

Full text
Abstract:
AbstractPollen is one of the main causes of allergic diseases in humans. Therefore, it is indispensable to develop and conduct effective treatment and prevention measures. For this purpose, detailed and differentiated information about the respective local exposure profiles for the individual patients is required. The present paper serves the purpose of testing a new approach which aims at detecting and classifying individual pollen grains by using binary 2D projection. This paper explores the question of whether and to what extent a classification of individual pollen grains is possible using this new imaging technology. To this end, using artificial pollen grains, binary 2D projections with different levels of resolution are simulated. To extract the respective features, both shape-based Fourier descriptors and topological features are used. Apart from that, Zernike moments for different orders are measured to extract the respective characteristics of the pollen grains. While the feature selection is conducted by means of a feature forward selection method, a kernel machine (Support Vector Machine) with a Gaussian kernel is used for the classification. First results of the simulation show that with a resolution of 0.1 μm, 100% of the allergologically relevant artificial pollen are classified correctly. Conversely, a lower resolution corresponds with a higher error rate in the classification.
APA, Harvard, Vancouver, ISO, and other styles
7

Balázs, Péter, and Kees Joost Batenburg. "A Central Reconstruction Based Strategy for Selecting Projection Angles in Binary Tomography." In Lecture Notes in Computer Science, 382–91. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31295-3_45.

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

Jin, Quming, Masaya Nakashima, Takeshi Shinohara, Kouichi Hirata, and Tetsuji Kuboyama. "Central Point Selection in Dimension Reduction Projection Simple-Map with Binary Quantization." In New Frontiers in Artificial Intelligence, 310–16. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-48119-6_23.

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

Hantos, Norbert, and Péter Balázs. "A Fast Algorithm for Reconstructing hv-Convex Binary Images from Their Horizontal Projection." In Advances in Visual Computing, 789–98. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-14364-4_76.

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

Bräuer-Burchardt, Christian, Peter Kühmstedt, and Gunther Notni. "Combination of Sinusoidal and Single Binary Pattern Projection for Fast 3D Surface Reconstruction." In Lecture Notes in Computer Science, 276–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32717-9_28.

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

Conference papers on the topic "Binary projection"

1

Lo, V. L., and R. P. Millane. "Iterative projection algorithms for reconstructing compact binary images." In Optical Engineering + Applications, edited by Philip J. Bones, Michael A. Fiddy, and Rick P. Millane. SPIE, 2008. http://dx.doi.org/10.1117/12.792947.

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

Jun Cheng, R. Chung, E. Y. Lam, and K. S. M. Fung. "Bit-pairing Codification for Binary Pattern Projection System." In 18th International Conference on Pattern Recognition (ICPR'06). IEEE, 2006. http://dx.doi.org/10.1109/icpr.2006.331.

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

Li, Shasha, Yukai Tu, Weihong Deng, and Jiwen Lu. "Noise-resistant local binary pattern based on random projection." In 2015 3rd IAPR Asian Conference on Pattern Recognition (ACPR). IEEE, 2015. http://dx.doi.org/10.1109/acpr.2015.7486614.

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

Kang, Daesung, Jooyoung Park, and Jose C. Principe. "Binary classification based on SVDD projection and nearest neighbors." In 2010 International Joint Conference on Neural Networks (IJCNN). IEEE, 2010. http://dx.doi.org/10.1109/ijcnn.2010.5596291.

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

Chhaniwal, Vani K., Arun Anand, Sanjay Girhe, N. Subrahmanyam, and C. S. Narayanamurthy. "Diffusion studies of transparent binary liquid solutions using fringe projection." In Optical Metrology, edited by Wolfgang Osten, Malgorzata Kujawinska, and Katherine Creath. SPIE, 2003. http://dx.doi.org/10.1117/12.500265.

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

Xiao, Yi, and Youfu Li. "Binary fringe patterns generation for high-quality digital fringe projection." In 2017 IEEE International Conference on Mechatronics and Automation (ICMA). IEEE, 2017. http://dx.doi.org/10.1109/icma.2017.8015954.

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

Oukili, A., J. C. Nunes, Y. Chen, L. Luo, and C. Toumoulin. "Object-based 3D binary reconstruction from sparse projections in cone beam CT: Comparison of three projection operators." In 2013 IEEE 10th International Symposium on Biomedical Imaging (ISBI 2013). IEEE, 2013. http://dx.doi.org/10.1109/isbi.2013.6556764.

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

Liu, Li, Mengyang Yu, and Ling Shao. "Projection Bank: From High-Dimensional Data to Medium-Length Binary Codes." In 2015 IEEE International Conference on Computer Vision (ICCV). IEEE, 2015. http://dx.doi.org/10.1109/iccv.2015.323.

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

Song, Zhan, Ronald Chung, Jun Cheng, and Edmund Y. Lam. "Surface orientation recovery of specular micro-surface via binary pattern projection." In Electronic Imaging 2006, edited by Fabrice Meriaudeau and Kurt S. Niel. SPIE, 2006. http://dx.doi.org/10.1117/12.650026.

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

Ye, Zhiqiang, Xueqi Wei, Congzhong Wu, and Fumeng Yang. "Learning binary code via PCA of angle projection for image retrieval." In LIDAR Imaging Detection and Target Recognition 2017, edited by Yueguang Lv, Jianzhong Su, Wei Gong, Jian Yang, Weimin Bao, Weibiao Chen, Zelin Shi, Jindong Fei, Shensheng Han, and Weiqi Jin. SPIE, 2018. http://dx.doi.org/10.1117/12.2296255.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Binary projection' for particular source types:
Journal articles
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