检索结果-内蒙古大学图书馆

A binary coding method for half-period sinusoidal stripes in focused projection

MEASUREMENT SCIENCE AND TECHNOLOGY 2025年第2期36卷 025011-025011页

作者： Yan, Fei Xiang, Qianhuai Zhu, Rui Ma, Xingyu Liu, Yinping Nanjing Univ Informat Sci & Technol Sch Automat Nanjing 210044 Peoples R China Jiangsu Collaborat Innovat Ctr Atmospher Environm Nanjing 210044 Peoples R China Nanjing Univ Informat Sci & Technol Sch Emergency Management Nanjing 210044 Peoples R China

During sinusoidal streak projection measurements, the nonlinear responses inherent in projectors and cameras can significantly alter the characteristics of projection and imaging. Traditional techniques require precise out-of-focus levels to achieve accurate depth measurements, which inherently limit the depth range that can be effectively measured. Addressing this limitation, this paper introduces an innovative binarization coding method for half-period sinusoidal stripes in focused projection. Our approach begins with a binarization process that encodes the half-period sinusoidal stripes. We then capture these stripes as they are modulated by the height of the object under test. The subsequent synthesis of the half-period sinusoidal stripes is achieved through a method of superposition calculation. To enhance the experimental procedure, we employ a four-step phase-shifting technique, complemented by an assisted phase unfolding using the gray code method. For the validation of our method, a standard ball with a diameter of 50.8140 mm was measured. The results are compelling, demonstrating a root mean square error of merely 0.0285 mm. Comparative experimental results prove that the proposed method can effectively avoid the influence of nonlinearity, and also obtain high-precision reconstruction results for discontinuous scenes.

关键词： three-dimensional measurement binary coding nonlinearity focusing projection gray code

来源：评论

学校读者我要写书评

暂无评论

Spatial-temporal 3D directional binary coding method for fringe projection profilometry

引用

IEEE Transactions on Instrumentation and Measurement 2025年 74卷

作者： Wu, Haitao Cao, Yiping Dai, Yongbo Qin, Jiayi Sichuan University Department of Opto-electronics Chengdu 610065 China AVIC Chengdu Caic Electronics Co.Ltd Chengdu 611130 China

Fringe projection profilometry (FPP) is a leading optical technique for high-speed and efficient 3D measurements, crucial in automation for enhancing efficiency, quality, productivity, and reliability. Traditional FPP methods face challenges with limited pattern quantity and coding efficiency. This paper introduces a novel spatial-temporal 3D directional binary coding (STDBC) method, enhancing the conventional binary coding approach by incorporating the temporal dimension. Compared to the traditional 4 codewords in 1D (x) and 9 codewords in 2D (x,y) methods, this integration expands codewords in the 3D (x, y, t) space, achieving up to 81 ultra-large codewords. To address decoding difficulties caused by synchronization circuit delays or memory optimization, the paper introduces a directional coding method to ensure the correct decoding position of coded patterns. Additionally, a region contraction method was developed to suppress the percentage shift problem caused by static defocusing and motion blur, respectively. Under the optimized projection-decoding paradigm, the proposed method can achieve the same reconstruction efficiency as conventional single-frame coded map with guaranteed reconstruction accuracy. Experimental results demonstrate that this method significantly advances high-precision and high efficiency 3D imaging as well as paves the way for further research and practical applications in various automated dynamic measurement environments. © 1963-2012 IEEE.

关键词： automated measurement binary coding Fringe projection profilometry projection-decoding paradigm

来源：评论

学校读者我要写书评

暂无评论

binary coding of algebraic Kekule structures of catacondensed benzenoid graphs

引用

APPLIED MATHEMATICS LETTERS 2008年第7期21卷 712-716页

作者： Vukicevic, Damir Zigert, Petra Univ Maribor Dept Math & Comp Sci PEF SI-2000 Maribor Slovenia Univ Split Fac Sci Split 21000 Croatia

The algebraic Kekule structure of a finite catacondensed benzenoid graph with h hexagons is described by a binary code of length h. The procedure can be reversed, any (algebraic) Kekule structure can be recovered from... 详细信息

关键词： benzenoid hydrocarbons benzenoid graph Kekule structures algebraic Kekule structures randic structures 1-factor binary coding

来源：评论

学校读者我要写书评

暂无评论

binary coding based feature extraction in remote sensing high dimensional data

引用

INFORMATION SCIENCES 2016年 342卷 191-208页

作者： Imani, Maryam Ghassemian, Hassan Tarbiat Modares Univ Fac Elect & Comp Engn Tehran Iran

A binary coding based feature extraction (BCFE) method is proposed in this paper. In the BCFE method, the spectral signature of each pixel of hyperspectral image is partitioned into some equal segments. Then, the weighted mean of spectral bands in each segment is considered as an extracted feature. BCFE uses a new method for calculation of weights. In BCFE, the binary codes of class means are obtained. Then, the information contained in the binary values and the edges of class means is used for calculation of weight in each band. The experimental results on three real hyperspectral images show the better performance of BCFE compared to some popular and state-of-the-art feature extraction methods, from the accuracy and computation time point of views, in a small sample size situation. (C) 2016 Elsevier Inc. All rights reserved.

关键词： binary coding Feature extraction Classification High dimensional data Small sample size situation

来源：评论

学校读者我要写书评

暂无评论

binary coding of Kekule structures of catacondensed benzenoid hydrocarbons

引用

COMPUTERS & CHEMISTRY 2001年第6期25卷 569-575页

作者： Klavzar, S Vesel, A Zigert, P Gutman, I Univ Maribor PEF Dept Math Pedagoska Fukulteta Maribor Maribor 2000 Slovenia Univ Kragujevac Fac Sci YU-34000 Kragujevac Yugoslavia

An algorithm is described by means of which the Kekule structures of a catacondensed benzenoid molecule (with It hexagons) are transformed into binary codes (of length h). By this, computer-aided manipulations with, and memory-storage of Kekule structures are much facilitated. Any Kekule structure can easily be recovered from its binary code. (C) 2001 Elsevier Science Ltd. All rights reserved.

关键词： benzenoid hydrocarbons benzenoid graph resonance graph Kekule structure algorithm binary coding

来源：评论

学校读者我要写书评

暂无评论

binary coding by Matrix Classifier for Efficient Subspace Retrieval 18

Binary Coding by Matrix Classifier for Efficient Subspace Re...

引用

8th ACM International Conference on Multimedia Retrieval (ACM ICMR)

作者： Zhou, Lei Bai, Xiao Liu, Xianglong Zhou, Jun Beihang Univ Sch Comp Sci & Engn Beijing Peoples R China Beihang Univ Beijing Adv Innovat Ctr Big Data & Brain Comp Beijing Peoples R China Griffith Univ Sch Informat & Commun Technol Nathan Qld Australia

ISBN: (纸本)9781450350464

Fast retrieval in large-scale database with high-dimensional subspaces is an important task in many applications, such as image retrieval, video retrieval and visual recognition. This can be facilitated by approximate nearest subspace (ANS) retrieval which requires effective subspace representation. Most of the existing methods for this problem represent subspace by point in the Euclidean space or the Grassmannian space before applying the approximate nearest neighbor (ANN) search. However, the efficiency of these methods can not be guaranteed because the subspace representation step can be very time consuming when coping with high dimensional data. Moreover, the transforming process for subspace to point will cause subspace structural information loss which influence the retrieval accuracy. In this paper, we present a new approach for hashing-based ANS retrieval. The proposed method learns the binary codes for given subspace set following a similarity preserving criterion. It simultaneously leverages the learned binary codes to train matrix classifiers as hash functions. This method can directly binarize a subspace without transforming it into a vector. Therefore, it can efficiently solve the large-scale and high-dimensional multimedia data retrieval problem. Experiments on face recognition and video retrieval show that our method outperforms several state-of-the-art methods in both efficiency and accuracy.

关键词： Large-Scale Multimedia Data Retrieval Subspace Retrieval binary coding Hashing Matrix Classifier

来源：评论

学校读者我要写书评

暂无评论

binary coding-BASED VEHICLE IMAGE CLASSIFICATION 12

BINARY CODING-BASED VEHICLE IMAGE CLASSIFICATION

引用

12th IEEE International Conference on Signal Processing (ICSP)

作者： Peng Yishu Yan Yunhui Zhu Wenjie Zhao Jiuliang Northeastern Univ Sch Mech Engn & Automat Shenyang Peoples R China Xidian Univ Sch Elect Engn Xian Peoples R China

ISBN: (纸本)9781479921867

Vehicle image classification can describe the visual vehicle with a semantically meaningful category directly. Motivated by its importance, this paper proposes a fast vehicle image classification based on binary coding. As for the vehicle image classification, this paper focuses on the image obtained from the video via analyzing the moving object near the key frames. The proposed method extracts a dense boosting binary feature computed with a boosted binary hash function, and then pools the features in different resolutions. At last, the SVM with spatial pyramid kernel finishes the classification task. In this work, 8 bytes for the feature computed with a hash function that ensures the real-time need. Experimental results on the vehicle datasets includes sedan, taxi, van, and truck show the efficiency and accuracy of the proposed method for vehicle classification in practice.

关键词： binary coding spatial pyramid matching vehicle image classification

来源：评论

学校读者我要写书评

暂无评论

binary coding for Partial Action Analysis with Limited Observation Ratios 30

Binary Coding for Partial Action Analysis with Limited Obser...

引用

30th IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Qin, Jie Liu, Li Shao, Ling Ni, Bingbing Chen, Chen Shen, Fumin Wang, Yunhong Beihang Univ Beijing Adv Innovat Ctr Big Data & Brain Comp Beijing Peoples R China Beihang Univ State Key Lab Virtual Real Technol & Syst Beijing Peoples R China Swiss Fed Inst Technol Comp Vis Lab Zurich Switzerland Malong Technol Co Ltd Shenzhen Peoples R China Univ East Anglia Norwich Norfolk England Shanghai Jiao Tong Univ Shanghai Peoples R China Univ Cent Florida Ctr Res Comp Vis Orlando FL 32816 USA Univ Elect Sci & Technol China Chengdu Sichuan Peoples R China

ISBN: (纸本)9781538604571

Traditional action recognition methods aim to recognize actions with complete observations/executions. However, it is often difficult to capture fully executed actions due to occlusions, interruptions, etc. Meanwhile, action prediction/recognition in advance based on partial observations is essential for preventing the situation from deteriorating. Besides, fast spotting human activities using partially observed data is a critical ingredient for retrieval systems. Inspired by the recent success of data binarization in efficient retrieval/recognition, we propose a novel approach, named Partial Reconstructive binary coding (PRBC), for action analysis based on limited frame glimpses during any period of the complete execution. Specifically, we learn discriminative compact binary codes for partial actions via a joint learning framework, which collaboratively tackles feature reconstruction as well as binary coding. We obtain the solution to PRBC based on a discrete alternating iteration algorithm. Extensive experiments on four realistic action datasets in terms of three tasks (i.e., partial action retrieval, recognition and prediction) clearly show the superiority of PRBC over the state-of-the-art methods, along with significantly reduced memory load and computational costs during the online test.

关键词： binary coding Partial Action Analysis Limited Observation Ratios binary code on line detection Action Search engines Iterative algorithms Occlusion

来源：评论

学校读者我要写书评

暂无评论

Digital-division-mask technique by binary coding for microstructure fabrication

引用

OPTOELECTRONICS AND ADVANCED MATERIALS-RAPID COMMUNICATIONS 2012年第1-2期6卷 313-318页

作者： Luo, Ningning Gao, Yiqing Zhang, Zhimin Xiao, Mengchao Nanjing Univ Aeronaut & Astronaut Coll Automat Engn Nanjing 210016 Peoples R China Nanchang HangKong Univ Chinese Minist Educ Key Lab Nondestruct Test Nanchang 330063 Peoples R China

We present a new lithography technique, namely digital-division-mask technique by binary coding, which is developed for forming microstructure relief and improving the edge lithography resolution. The microstructure relief is firstly transformed into multiple binary patterns and then they are superposed on a photoresist-coated silicon substrate in sequence. The mechanism for improvement of image edge sharpness by using division method is disclosed, and the division principle is described. As a result of the digital-division-mask lithography, positive photoresist patterns of zigzag gratings with a period of 16 mu m and 64 mu m are fabricated.

关键词： Digital-division-mask technique binary coding Edge lithography resolution Edge sharpness

来源：评论

学校读者我要写书评

暂无评论

A binary coding genetic algorithm for multi-purpose process scheduling: A case study

引用

CHEMICAL ENGINEERING SCIENCE 2010年第16期65卷 4816-4828页

作者： He, Yaohua Hui, Chi-Wai Natl Univ Singapore Dept Ind & Syst Engn Off Provost PVO Singapore 117576 Singapore Hong Kong Univ Sci & Technol Dept Chem & Biomol Engn Hong Kong Hong Kong Peoples R China

This paper presents a novel genetic algorithm (GA) for the scheduling of a typical multi-purpose batch plant with a network structure. Multi-purpose process scheduling is more difficult to deal with compared to single-stage or multi-stage process scheduling. A large amount of literature on this problem has been published and nearly all of the authors used mathematical programming (MP) methods for solution. In the MP methods, a huge number of binary variables, as well as numerous constraints to consider mass balance and sequencing of batches in space/time dimensions, are needed for the large-size problem, which leads to very long computational time. In the proposed GA, only a small part of the binary variables are selected to code into binary chromosomes, which is realized through the identification of crucial products/tasks/units. Due to the logical heuristics utilized to decode a chromosome into a schedule, only the feasible solution space is searched. Our genetic algorithm has first been devised with particular crossover for makespan minimization and then adjusted for production maximization. (C) 2010 Elsevier Ltd. All rights reserved.

关键词： Process systems engineering Scheduling Multi-purpose batch plant Genetic algorithm binary coding Special crossover

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：