To see the other types of publications on this topic, follow the link: Image partition.

Journal articles on the topic 'Image partition'

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Image partition.'

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

Wang, Lei, Bo Yu, Fang Chen, Congrong Li, Bin Li, and Ning Wang. "A Cluster-Based Partition Method of Remote Sensing Data for Efficient Distributed Image Processing." Remote Sensing 14, no. 19 (2022): 4964. http://dx.doi.org/10.3390/rs14194964.

Full text
Abstract:
Data stream partitioning is a fundamental and important mechanism for distributed systems. However, use of an inappropriate partition scheme may generate a data skew problem, which can influence the execution efficiency of many application tasks. Processing of skewed partitions usually takes a longer time, need more computational resources to complete the task and can even become a performance bottleneck. To solve such data skew issues, this paper proposes a novel partition method to divide on demand the image tiles uniformly into partitions. The partitioning problem is then transformed into a
APA, Harvard, Vancouver, ISO, and other styles
2

Jung, Ho Yub, and Kyoung Mu Lee. "Image Segmentation by Edge Partitioning over a Nonsubmodular Markov Random Field." Mathematical Problems in Engineering 2015 (2015): 1–9. http://dx.doi.org/10.1155/2015/683176.

Full text
Abstract:
Edge weight-based segmentation methods, such as normalized cut or minimum cut, require a partition number specification for their energy formulation. The number of partitions plays an important role in the segmentation overall quality. However, finding a suitable partition number is a nontrivial problem, and the numbers are ordinarily manually assigned. This is an aspect of the general partition problem, where finding the partition number is an important and difficult issue. In this paper, the edge weights instead of the pixels are partitioned to segment the images. By partitioning the edge we
APA, Harvard, Vancouver, ISO, and other styles
3

Zuo, Yong Xia, Guo Qiang Wang, and Chun Cheng Zuo. "The Segmentation Algorithm for Pavement Cracking Images Based on the Improved Fuzzy Clustering." Applied Mechanics and Materials 319 (May 2013): 362–66. http://dx.doi.org/10.4028/www.scientific.net/amm.319.362.

Full text
Abstract:
The segmentation technology of pavement cracking image is critical for identifying, quantifying and classifying pavement cracks. An improved fuzzy clustering algorithm is introduced to segment pavement cracking images. The algorithm makes no assumptions the initial position of clusters. For each value of the multiscale parameter, it obtains a corresponding hard partition. The different partitions values of the multiscale parameter indicate the structure of the image in different partitional scales. The algorithm was tested on actual pavement cracking images. We compared the results with FCM an
APA, Harvard, Vancouver, ISO, and other styles
4

Jiang, Chun, Tao Chen, Changzheng Lu, et al. "Automatic Inhomogeneous Background Correction for Spatial Target Detection Image Based on Partition Processing." Photonics 10, no. 4 (2023): 433. http://dx.doi.org/10.3390/photonics10040433.

Full text
Abstract:
High-resolution imaging with wide field of view (FoV) ground-based telescopes is often affected by skylight background and noise due to the detector, resulting in an inhomogeneous background. In this paper, we propose an improved method for spatial image non-uniformity correction based on partition processing. First, an evaluation metric is introduced to evaluate the partition size and automatically iterate a suitable partition value for different scenarios based on the different operating conditions of the telescope. Then, we iteratively calculate the mean and variance in each partitioned reg
APA, Harvard, Vancouver, ISO, and other styles
5

Liang, Dong, Rui Wang, Xiaowei Tian, and Cong Zou. "PCGAN: Partition-Controlled Human Image Generation." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 8698–705. http://dx.doi.org/10.1609/aaai.v33i01.33018698.

Full text
Abstract:
Human image generation is a very challenging task since it is affected by many factors. Many human image generation methods focus on generating human images conditioned on a given pose, while the generated backgrounds are often blurred. In this paper, we propose a novel Partition-Controlled GAN to generate human images according to target pose and background. Firstly, human poses in the given images are extracted, and foreground/background are partitioned for further use. Secondly, we extract and fuse appearance features, pose features and background features to generate the desired images. Ex
APA, Harvard, Vancouver, ISO, and other styles
6

Alqadi, Ziad, and Mohammad Al-Raqqad. "Securing Message Steganography by using Modified LSB Method." International Journal of Computer Science and Mobile Computing 12, no. 4 (2023): 110–24. http://dx.doi.org/10.47760/ijcsmc.2023.v12i04.010.

Full text
Abstract:
Message steganography is one of the popular methods used to protect secret message. In this research paper a modified LSB method of message steganography will be introduced. The introduced method will use a complicated private key to protect the message from being hacked, the key will provide an excellent key space capable to resist hacking attacks, it will contain 6 values with a double data type. The private key will be used to divide the covering image into segments and divide the secret message into partitions; each message partition will be hidden in one image segment. The hiding and extr
APA, Harvard, Vancouver, ISO, and other styles
7

Yao, Hongtai, Xianpei Wang, Le Zhao, et al. "An Object-Based Markov Random Field with Partition-Global Alternately Updated for Semantic Segmentation of High Spatial Resolution Remote Sensing Image." Remote Sensing 14, no. 1 (2021): 127. http://dx.doi.org/10.3390/rs14010127.

Full text
Abstract:
The Markov random field (MRF) method is widely used in remote sensing image semantic segmentation because of its excellent spatial (relationship description) ability. However, there are some targets that are relatively small and sparsely distributed in the entire image, which makes it easy to misclassify these pixels into different classes. To solve this problem, this paper proposes an object-based Markov random field method with partition-global alternately updated (OMRF-PGAU). First, four partition images are constructed based on the original image, they overlap with each other and can be re
APA, Harvard, Vancouver, ISO, and other styles
8

Alameddine, Jihan, Kacem Chehdi, and Claude Cariou. "Hierarchical Unsupervised Partitioning of Large Size Data and Its Application to Hyperspectral Images." Remote Sensing 13, no. 23 (2021): 4874. http://dx.doi.org/10.3390/rs13234874.

Full text
Abstract:
In this paper, we propose a true unsupervised method to partition large-size images, where the number of classes, training samples, and other a priori information is not known. Thus, partitioning an image without any knowledge is a great challenge. This novel adaptive and hierarchical classification method is based on affinity propagation, where all criteria and parameters are adaptively calculated from the image to be partitioned. It is reliable to objectively discover classes of an image without user intervention and therefore satisfies all the objectives of an unsupervised method. Hierarchi
APA, Harvard, Vancouver, ISO, and other styles
9

Lin, Cheng-Shian, Chien-Chang Chen, and Yu-Cheng Chen. "XOR-Based Progressively Secret Image Sharing." Mathematics 9, no. 6 (2021): 612. http://dx.doi.org/10.3390/math9060612.

Full text
Abstract:
Secret image sharing technology is a strategy for jointly protecting secret images. The (n, n) secret image sharing problem can be solved by conventional Boolean calculation easily. However, how to recover secret images with progressive steps is not addressed. In this study, we proposed an XOR-based (m, t, Ti) multi-secret image sharing scheme that shares m secret images among m participants and recovers m shared images progressively with t thresholds. The proposed secret images partition strategy (SIPS) partitions m secret images to generate intermediate images for different thresholds in the
APA, Harvard, Vancouver, ISO, and other styles
10

Chiang, Yung-Kuei, Piyu Tsai, and Feng-Long Huang. "Codebook Partition Based Steganography without Member Restriction." Fundamenta Informaticae 82, no. 1-2 (2008): 15–27. https://doi.org/10.3233/fun-2008-821-202.

Full text
Abstract:
The practice of concealing secret messages into index-based images has generally suffered from problems of image quality degradation and hiding capacity restriction. A steganographic scheme using an improved codebook partition is proposed in this paper. The proposed scheme partitions the codebook into different member sub-clusters in terms of their similarity between the codewords for increasing the hiding capacity and reducing the image distortion. Any size of a subcluster was allowed in the proposed scheme, so as to improve the traditional approaches in which the size of a sub-cluster was re
APA, Harvard, Vancouver, ISO, and other styles
11

Wei, Yuan, and Kin Tak U. "A Novel Non-Uniform BTC and its Application." Applied Mechanics and Materials 590 (June 2014): 789–94. http://dx.doi.org/10.4028/www.scientific.net/amm.590.789.

Full text
Abstract:
In this paper, a novel image representation coding based on non-uniform Block Truncation Coding (BTC) is proposed. A given image can automatically be partitioned into different regions with different sizes and the bivariate piecewise polynomials are used to do the Least Square Approximation for the pixel values in each sub-region based on BTC bitmap. When the approximation error and initial partition are specified, a specific image partition result is obtained. The image re-construction quality of the proposed algorithm is better than that of the traditional BTC. Based on this algorithm, an ef
APA, Harvard, Vancouver, ISO, and other styles
12

Gondimalla, Ashish, Jianqiao Liu, Mithuna Thottethodi, and T. N. Vijaykumar. "Occam: Optimal Data Reuse for Convolutional Neural Networks." ACM Transactions on Architecture and Code Optimization 20, no. 1 (2022): 1–25. http://dx.doi.org/10.1145/3566052.

Full text
Abstract:
Convolutional neural networks (CNNs) are emerging as powerful tools for image processing in important commercial applications. We focus on the important problem of improving the latency of image recognition. While CNNs are highly amenable to prefetching and multithreading to avoid memory latency issues, CNNs’ large data – each layer’s input, filters, and output – poses a memory bandwidth problem. While previous work captures only some of the enormous data reuse, full reuse implies that the initial input image and filters are read once from off-chip and the final output is written once off-chip
APA, Harvard, Vancouver, ISO, and other styles
13

Hindman, Neil, and Imre Leader. "Image Partition Regularity of Matrices." Combinatorics, Probability and Computing 2, no. 4 (1993): 437–63. http://dx.doi.org/10.1017/s0963548300000821.

Full text
Abstract:
Many of the classical results of Ramsey Theory, including those of Hilbert, Schur, and van der Waerden, are naturally stated as instances of the following problem: given a u × ν matrix A with rational entries, is it true, that whenever the set ℕ of positive integers is finitely coloured, there must exist some x∈ℕν such that all entries of Ax are the same colour? While the theorems cited are all consequences of Rado's theorem, the general problem had remained open. We provide here several solutions for the alternate problem, which asks that x∈ℕν. Based on this, we solve the general problem, giv
APA, Harvard, Vancouver, ISO, and other styles
14

De, Dibyendu, and Neil Hindman. "Image partition regularity near zero." Discrete Mathematics 309, no. 10 (2009): 3219–32. http://dx.doi.org/10.1016/j.disc.2008.09.023.

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

Yu, Hai Yan. "An Image Adaptive Watermarking Algorithm Based on Ridgelet Transform and Two-Dimensional Fuzzy Partition." Advanced Materials Research 301-303 (July 2011): 1299–304. http://dx.doi.org/10.4028/www.scientific.net/amr.301-303.1299.

Full text
Abstract:
An image adaptive watermarking algorithm based on ridgelet transform and two- dimensional(2-D) fuzzy partition classification is proposed. In order to obtain a sparse representation of straight edge singularity, the image is first partitioned into small pieces and the ridgelet transform is applied for each piece. After analyzing texture distribution in ridgelet coefficients of each piece, two feature vectors are selected to make up for the ‘wrap around’ effect for FRIT on representation of the image texture. Then the image is classifed into frat regions and texture regions by applying 2-D fuzz
APA, Harvard, Vancouver, ISO, and other styles
16

Assas, Ouarda. "Improvement of 2-Partition Entropy Approach Using Type-2 Fuzzy Sets for Image Thresholding." International Journal of Applied Evolutionary Computation 6, no. 3 (2015): 33–48. http://dx.doi.org/10.4018/ijaec.2015070103.

Full text
Abstract:
Thresholding is a fundamental task and a challenge for many image analysis and pre-processing process. However, the automatic selection of an optimum threshold has remained a challenge in image segmentation. The fuzzy 2-partition entropy approach for threshold selection is one of the best image thresholding techniques. In this work, an improvement of the later method using type-2 fuzzy sets is proposed to represent the imprecision or lack of knowledge of the expert in the choice of the membership function associated with the image. Two databases are used to evaluate its effectiveness: dataset
APA, Harvard, Vancouver, ISO, and other styles
17

Zhao, Shuhuan, and Zheng-ping Hu. "Occluded Face Recognition Based on Double Layers Module Sparsity Difference." Advances in Electronics 2014 (August 18, 2014): 1–6. http://dx.doi.org/10.1155/2014/687827.

Full text
Abstract:
Image recognition with occlusion is one of the popular problems in pattern recognition. This paper partitions the images into some modules in two layers and the sparsity difference is used to evaluate the occluded modules. The final identification is processed on the unoccluded modules by sparse representation. Firstly, we partition the images into four blocks and sparse representation is performed on each block, so the sparsity of each block can be obtained; secondly, each block is partitioned again into two modules. Sparsity of each small module is calculated as the first step. Finally, the
APA, Harvard, Vancouver, ISO, and other styles
18

Liu, Zhi Yuan, Jin He, Jin Long Wang, and Fei Zhao. "Scene Classification Based on Improved Spatial Partition Model." Applied Mechanics and Materials 527 (February 2014): 339–42. http://dx.doi.org/10.4028/www.scientific.net/amm.527.339.

Full text
Abstract:
In order to make full use of the spatial information of images in the classification of natural scene, we use the spatial partition model. But mechanically space division caused the abuse of spatial information. So spatial partition model must be properly improved to make the different categories of images were more diversity, so that the classification performance is improved. In addition, to further improve the performance, we use FAN-SIFT as local image features. Experiments made on 8 scenes image dataset and Caltech101 dataset show that the improved model can obtain better classification p
APA, Harvard, Vancouver, ISO, and other styles
19

Shi, Cheng, Zhiyong Lv, Xiuhong Yang, Pengfei Xu, and Irfana Bibi. "Hierarchical Multi-View Semi-Supervised Learning for Very High-Resolution Remote Sensing Image Classification." Remote Sensing 12, no. 6 (2020): 1012. http://dx.doi.org/10.3390/rs12061012.

Full text
Abstract:
Traditional classification methods used for very high-resolution (VHR) remote sensing images require a large number of labeled samples to obtain higher classification accuracy. Labeled samples are difficult to obtain and costly. Therefore, semi-supervised learning becomes an effective paradigm that combines the labeled and unlabeled samples for classification. In semi-supervised learning, the key issue is to enlarge the training set by selecting highly-reliable unlabeled samples. Observing the samples from multiple views is helpful to improving the accuracy of label prediction for unlabeled sa
APA, Harvard, Vancouver, ISO, and other styles
20

MIGUET, SERGE, and JEAN-MARC PIERSON. "QUALITY AND COMPLEXITY BOUNDS OF LOAD BALANCING ALGORITHMS FOR PARALLEL IMAGE PROCESSING." International Journal of Pattern Recognition and Artificial Intelligence 14, no. 04 (2000): 463–76. http://dx.doi.org/10.1142/s0218001400000301.

Full text
Abstract:
The parallel implementation of image processing algorithms implies an important choice of data distribution strategy. In order to handle the specific constraints associated with images, data distribution must take into account not only the locality of the data and its geometrical regularity but also the possible irregular computation costs associated with different image elements. A widely studied field to tackle this problem is the family of methods related to rectilinear partitioning. We introduce two fully parallel heuristics that compute suboptimal partitions, with a better complexity than
APA, Harvard, Vancouver, ISO, and other styles
21

Abdul-Kareem Abdul-Azeez, Bushra. "Fast Image Retrieval Prototype using Color Descriptor." Journal of Education College Wasit University 1, no. 22 (2016): 745–58. http://dx.doi.org/10.31185/eduj.vol1.iss22.233.

Full text
Abstract:
In recent years, image retrieval prototypes become important and increased noticeably. Color feature is one of the most significant features to represent image. In this paper, we use a Dominant Color (DC) feature to represent images where each image represented by 8-DCs as maximum. Based on DCs values, image database is indexed using 3-D RGB partitioning color space. This is to reduce searching process where once a query image is given to the prototype; it will not search the whole database. Proposed technique will identify the partition and search the image within this partition only. Accordi
APA, Harvard, Vancouver, ISO, and other styles
22

M, Manjula, Leena N. Shenoy, and Sowmya Krishna. "Laceability Partition Dimension of Some Special Graphs." Indian Journal Of Science And Technology 17, no. 31 (2024): 3183–89. http://dx.doi.org/10.17485/ijst/v17i31.1955.

Full text
Abstract:
Objectives: Laceability partition dimension of a connected graph is the minimum number of partitions of vertex set such that the subgraph induced by each partition is laceable in the case of a bipartite graph and random Hamiltonian laceable in case of non-bipartite graph . Methods: Mathematical Induction method and tracing Hamiltonian path. Findings: This study presents the laceability partition dimension (lpd) of some special graphs namely the Crown graph, Windmill graph, Dutch windmill graph, Cocktail party graph, shadow graph, and image graph. Novelty: This study discusses the laceability p
APA, Harvard, Vancouver, ISO, and other styles
23

Singh, Sukhjit, Dr V.K Jain, and Dr Amanpreet Singh. "A novel LSB steganographic method using partition and matching algorithms." International Journal of Engineering & Technology 7, no. 4 (2018): 7079–85. http://dx.doi.org/10.14419/ijet.v7i4.22273.

Full text
Abstract:
There is always a trade-off between embedding efficiency and hiding capacity of secret information. This paper presents a new ste-ganographic technique that improves the embedding efficiency and hiding capacity. For hiding information we extract LSB bits from 24-bit bmp color image. The LSB bits are joined to form an array of bits. An array is divided into N partitions depending upon the size of secret information to hide. The secret information is also divided into N partitions. Each data part finds the best possible matching location within each LSB array partition. The maximum bit matching
APA, Harvard, Vancouver, ISO, and other styles
24

Ali, Ban Hussein, Niran Sabah Jasim, Mohammed Yasin, Hadi Hamad, and K. P. SANTHOSH KUMAR. "Outcome for the Partition (9,6,3)." Babylonian Journal of Mathematics 2024 (December 2, 2024): 117–31. https://doi.org/10.58496/bjm/2024/015.

Full text
Abstract:
The set of all irreducible polynomial representations of general linear group of degree is described by the module ; where runs over all partitions . There are a number of classical formulas that express the formal character of the representation in terms of standard symmetric polynomials. Such formulas are also valid for the more general representation modules associated to skew partition ; where . Let be a commutative ring with identity and a free -module. The Weyl module resolution studied by Buchsbaum where the Weyl module is the image of the Weyl map for the skew-partition . Reduction the
APA, Harvard, Vancouver, ISO, and other styles
25

Hassan, Estbraq Fleeh, Niran Sabah Jasim, Mohammed Yasin, Ahmad Issa, and Samira moftah Abo garara. "Consequence for the Partition (9,9,3)." Babylonian Journal of Mathematics 2024 (December 5, 2024): 132–51. https://doi.org/10.58496/bjm/2024/016.

Full text
Abstract:
Let be a free module defined on the commutative ring with identity. Buchsbaum studied the Weyl module resolution where the Weyl module is the image of the Weyl map for the skew-partition ; where runs over all partitions . There are a number of classical formulas that express the formal character of the representation in terms of standard symmetric polynomials. Such formulas are also valid for the more general representation modules associated to skew partition ; where , where the set of all irreducible polynomial representations of general linear group of degree is described by the module For
APA, Harvard, Vancouver, ISO, and other styles
26

Ali, Abeer Hussein, Niran Sabah Jasim, Hadi Hamad, Zeinab Saeidian, and Faoziya Musbah. "Score for the Partition (9,8,3)." Babylonian Journal of Mathematics 2024 (December 6, 2024): 152–70. https://doi.org/10.58496/bjm/2024/017.

Full text
Abstract:
The Weyl module resolution studied by Buchsbaum where the Weyl module is the image of the Weyl map for the skew-partition and is a free module defined on a commutative ring with identity; where runs over all partitions . There are a number of classical formulas that express the formal character of the representation in terms of standard symmetric polynomials. Such formulas are also valid for the more general representation modules associated to skew partition ; where , where the set of all irreducible polynomial representations of general linear group of degree is described by the module The r
APA, Harvard, Vancouver, ISO, and other styles
27

Xue, Dan, and Weiqi Yuan. "Dynamic Partition Gaussian Crack Detection Algorithm Based on Projection Curve Distribution." Sensors 20, no. 14 (2020): 3973. http://dx.doi.org/10.3390/s20143973.

Full text
Abstract:
When detecting the cracks in the tunnel lining image, due to uneven illumination, there are generally differences in brightness and contrast between the cracked pixels and the surrounding background pixels as well as differences in the widths of the cracked pixels, which bring difficulty in detecting and extracting cracks. Therefore, this paper proposes a dynamic partitioned Gaussian crack detection algorithm based on the projection curve distribution. First, according to the distribution of the image projection curve, the background pixels are dynamically partitioned. Second, a new dynamic pa
APA, Harvard, Vancouver, ISO, and other styles
28

Hiik Ling, Kelvin Chia, Tan Tian Swee, Yan Chai Hum, et al. "Structure-preserving Contrast Enhancement of Fundus Images using Dualistic Sub-Image Bi-histogram Bezier Curve." Jurnal Kejuruteraan 35, no. 2 (2023): 361–74. http://dx.doi.org/10.17576/jkukm-2023-35(2)-07.

Full text
Abstract:
Diabetic retinopathy is a common eye disease among diabetic patients which is caused by excessive sugar in the blood vessels that damage the retina. Fundus images are retina images that are captured and diagnosed by ophthalmologists. Ophthalmologists diagnose the progressive stages of diabetic retinopathy so that early detection of pre-diabetic retinopathy can be carried out. However, the quality of the fundus image can be associated with the brightness of the background and the indistinctive vessel contrast. This paper presents a novel extension of Bi-histogram Bezier curve contrast enhanceme
APA, Harvard, Vancouver, ISO, and other styles
29

Mohan, C. Rama, Kiran S, Vasu deva, and A. Ashok Kumar. "Advanced Multispectral Image Fusion based on Frequency Partition and Normalization." Journal of Advanced Research in Dynamical and Control Systems 11, no. 11-SPECIAL ISSUE (2019): 546–55. http://dx.doi.org/10.5373/jardcs/v11sp11/20193065.

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

Manjula, M., N. Shenoy Leena, and Krishna Sowmya. "Laceability Partition Dimension of Some Special Graphs." Indian Journal of Science and Technology 17, no. 31 (2024): 3183–89. https://doi.org/10.17485/IJST/v17i31.1955.

Full text
Abstract:
Abstract <strong>Objectives:</strong>&nbsp;Laceability partition dimension of a connected graph is the minimum number of partitions of vertex set such that the subgraph induced by each partition is laceable in the case of a bipartite graph and random Hamiltonian laceable in case of non-bipartite graph .&nbsp;<strong>Methods:</strong>&nbsp;Mathematical Induction method and tracing Hamiltonian path.&nbsp;<strong>Findings:</strong>&nbsp;This study presents the laceability partition dimension (lpd) of some special graphs namely the Crown graph, Windmill graph, Dutch windmill graph, Cocktail party
APA, Harvard, Vancouver, ISO, and other styles
31

Liang, Ye, Jian Yu, Hongzhe Liu, and Zhifeng Xiao. "Multi-annulus partition based image representation for image classification." International Journal of Sensor Networks 13, no. 1 (2013): 57. http://dx.doi.org/10.1504/ijsnet.2013.052733.

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

Lv, Xuan, Zezhong Ma, and Qing Liu. "A Subblock Partition Of Multi-Layer Pattern Based Image Classification Approach." MATEC Web of Conferences 246 (2018): 03043. http://dx.doi.org/10.1051/matecconf/201824603043.

Full text
Abstract:
Since traditional partition approach may construct very different image representation because of the changed locations of objects in the same image, a subblock partition of multi-layer pattern method for image representation is proposed. The saliency windows straddled by superpixels are utilized to partition the image into multi-layer pattern subblocks. Then all the subblocks are combined to a three order tensor. Comparing to the results of image classification item of Pascal Voc 2007 Challenge,it indicates that the proposed representation method is robust to the varied object locations and a
APA, Harvard, Vancouver, ISO, and other styles
33

Yuchi Huang, Qingshan Liu, Fengjun Lv, Yihong Gong, and Dimitris N. Metaxas. "Unsupervised Image Categorization by Hypergraph Partition." IEEE Transactions on Pattern Analysis and Machine Intelligence 33, no. 6 (2011): 1266–73. http://dx.doi.org/10.1109/tpami.2011.25.

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

Lu, H., J. C. Woods, and M. Ghanbari. "Image segmentation by binary partition tree." Electronics Letters 42, no. 17 (2006): 966. http://dx.doi.org/10.1049/el:20061398.

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

Li, Minxian, Chunxia Zhao, and Jinhui Tang. "Hybrid image summarization by hypergraph partition." Neurocomputing 119 (November 2013): 41–48. http://dx.doi.org/10.1016/j.neucom.2012.02.050.

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

Efstratiadis, S. N., D. Tzovaras, and M. G. Strintzis. "Hierarchical partition priority wavelet image compression." IEEE Transactions on Image Processing 5, no. 7 (1996): 1111–23. http://dx.doi.org/10.1109/83.502391.

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

Hindman, Neil, and Irene Moshesh. "Image partition regularity of affine transformations." Journal of Combinatorial Theory, Series A 114, no. 8 (2007): 1375–93. http://dx.doi.org/10.1016/j.jcta.2007.02.002.

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

Mohammed, Hind Rostom, and Hanaa Muhsen Ali. "Anew method for speeding up FractalCompression using different value of affine transformation and highest gray value of pixel." Journal of Kufa for Mathematics and Computer 1, no. 5 (2012): 93–101. http://dx.doi.org/10.31642/jokmc/2018/010512.

Full text
Abstract:
In this paper new algorithm for speeding up fractal image compression  is presented. A new adapted method based on computing the highest value of the pixel of the image to reduce the computational complexity in the encoder stage and which are led to decreasing the encoding time while the reconstructed image from the work as good as we want. For increasing the effectiveness of search stage we used another type of partitioning method that led to increase the flexibility of range partition, this method is HV-partition. We applied this method on images and also present a comparison of this meth
APA, Harvard, Vancouver, ISO, and other styles
39

Nathalie Diane, Wandji Nanda, Sun Xingming, and Fah Kue Moise. "A Survey of Partition-Based Techniques for Copy-Move Forgery Detection." Scientific World Journal 2014 (2014): 1–13. http://dx.doi.org/10.1155/2014/975456.

Full text
Abstract:
A copy-move forged image results from a specific type of image tampering procedure carried out by copying a part of an image and pasting it on one or more parts of the same image generally to maliciously hide unwanted objects/regions or clone an object. Therefore, detecting such forgeries mainly consists in devising ways of exposing identical or relatively similar areas in images. This survey attempts to cover existing partition-based copy-move forgery detection techniques.
APA, Harvard, Vancouver, ISO, and other styles
40

Nenashev, Vadim, and Igor Khanykov. "Formation of a fused image of the land surface based on pixel clustering of location images in a multi-position onboard system." Informatics and Automation 20, no. 2 (2021): 302–40. http://dx.doi.org/10.15622/ia.2021.20.2.3.

Full text
Abstract:
The paper proposes a method for fusioning multi-angle images implementing the algorithm for quasi-optimal clustering of pixels to the original images of the land surface. The original multi-angle images formed by the onboard equipment of multi-positional location systems are docked into a single composite image and, using a high-speed algorithm for quasi-optimal pixel clustering, are reduced to several colors while maintaining characteristic boundaries. A feature of the algorithm of quasi-optimal pixel clustering is the generation of a series of partitions with gradually increasing detail due
APA, Harvard, Vancouver, ISO, and other styles
41

Suroso Putro, Tunjung Atmadi, Rizky Dinata, and Ali Ramadhan. "STUDY OF APPLICATION "BATIK" IN THE INTERIOR OFFICE PARTITION." Journal of Urban Society's Arts 6, no. 2 (2019): 123–27. http://dx.doi.org/10.24821/jousa.v6i2.3187.

Full text
Abstract:
Office partitions are part of office furniture that serves as a dividers of office space. Office partitions provide solutions to organize work space in the office to make it more tidy and efficient. The use of office partition is a modern concept of office space in maximizing office space to make it more comfortable. By applying knock down system to the office partition, wall panels can be dismantled and installed back to be installed or applied with certain batik pattern. The office interior now became an important part to represent clients to increase the look of an office. The method used i
APA, Harvard, Vancouver, ISO, and other styles
42

Zhao, Yifei, Jianhong Chen, Shan Yang, Kang He, Hideki Shimada, and Takashi Sasaoka. "A Multi-Point Geostatistical Modeling Method Based on 2D Training Image Partition Simulation." Mathematics 11, no. 24 (2023): 4900. http://dx.doi.org/10.3390/math11244900.

Full text
Abstract:
In this paper, a multi-point geostatistical (MPS) method based on variational function partition simulation is proposed to solve the key problem of MPS 3D modeling using 2D training images. The new method uses the FILTERSIM algorithm framework, and the variational function is used to construct simulation partitions and training image sequences, and only a small number of training images close to the unknown nodes are used in the partition simulation to participate in the MPS simulation. To enhance the reliability, a new covariance filter is also designed to capture the diverse features of the
APA, Harvard, Vancouver, ISO, and other styles
43

Chen, Lin, Shuaizhao Wang, Xingling Guo, et al. "P‐6.4: Research on Image Quality of AMOLED Displays Based on Cathode Partition." SID Symposium Digest of Technical Papers 56, S1 (2025): 1152–55. https://doi.org/10.1002/sdtp.19021.

Full text
Abstract:
The cathode of AMOLED is designed as a single piece limited by factors such as technical and cost, and there is a waste of power consumption. Recently, the photolithography without FMM process began to develop, and the power saving scheme of AMOLED based on cathode partition became possible, and the image quality evaluation and compensation of cathode partition began to be studied. In this paper, two kinds of signal statistics and mapping methods are used to simulate the image quality of the cathode partition, and the image quality is evaluated. The human factor experiment shows that the subje
APA, Harvard, Vancouver, ISO, and other styles
44

Arif, Kazi Hasan Ibn, JinYi Yoon, Dimitrios S. Nikolopoulos, Hans Vandierendonck, Deepu John, and Bo Ji. "HiRED: Attention-Guided Token Dropping for Efficient Inference of High-Resolution Vision-Language Models." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 2 (2025): 1773–81. https://doi.org/10.1609/aaai.v39i2.32171.

Full text
Abstract:
High-resolution Vision-Language Models (VLMs) are widely used in multimodal tasks to enhance accuracy by preserving detailed image information. However, these models often generate an excessive number of visual tokens due to the need to encode multiple partitions of a high-resolution image input. Processing such a large number of visual tokens poses significant computational challenges, particularly for resource-constrained commodity GPUs. To address this challenge, we propose High-Resolution Early Dropping (HiRED), a plug-and-play token-dropping method designed to operate within a fixed token
APA, Harvard, Vancouver, ISO, and other styles
45

Sharma, Dr Kamlesh, and Nidhi Garg. "An Extensive Review on Image Segmentation Techniques." Indian Journal of Image Processing and Recognition 1, no. 2 (2021): 1–5. http://dx.doi.org/10.35940/ijipr.b1002.061221.

Full text
Abstract:
Image processing is the use of algorithms to perform various operations on digital images. The techniques that are explained further are image segmentation and image enhancement. Image Segmentation is a method to partition an image into multiple segments, to change the presentation of an image into something more meaningful and easier to analyze. The current image segmentation techniques include region-based segmentation and edge detection segmentation. Image Enhancement is the process of improving the quality of image. Under this section there are two broad divisions- Spatial Domain Technique
APA, Harvard, Vancouver, ISO, and other styles
46

Sharma, Dr Kamlesh, and Nidhi Garg. "An Extensive Review on Image Segmentation Techniques." Indian Journal of Image Processing and Recognition 1, no. 2 (2021): 1–5. http://dx.doi.org/10.54105/ijipr.b1002.061221.

Full text
Abstract:
Image processing is the use of algorithms to perform various operations on digital images. The techniques that are explained further are image segmentation and image enhancement. Image Segmentation is a method to partition an image into multiple segments, to change the presentation of an image into something more meaningful and easier to analyze. The current image segmentation techniques include region-based segmentation and edge detection segmentation. Image Enhancement is the process of improving the quality of image. Under this section there are two broad divisions- Spatial Domain Technique
APA, Harvard, Vancouver, ISO, and other styles
47

Kamlesh, Sharma, and Garg Nidhi. "An Extensive Review on Image Segmentation Techniques." Indian Journal of Image Processing and Recognition (IJIPR) 1, no. 2 (2021): 1–5. https://doi.org/10.54105/ijipr.B1002.061221.

Full text
Abstract:
Image processing is the use of algorithms to perform various operations on digital images. The techniques that are explained further are image segmentation and image enhancement. Image Segmentation is a method to partition an image into multiple segments, to change the presentation of an image into something more meaningful and easier to analyze. The current image segmentation techniques include region-based segmentation and edge detection segmentation. Image Enhancement is the process of improving the quality of image. Under this section there are two broad divisions- Spatial Domain Technique
APA, Harvard, Vancouver, ISO, and other styles
48

Zhang, Xiaoli, Xiongfei Li, Zhaojun Liu, and Yuncong Feng. "Multi-focus image fusion using image-partition-based focus detection." Signal Processing 102 (September 2014): 64–76. http://dx.doi.org/10.1016/j.sigpro.2014.02.024.

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

Farah Nabilah Zabani, Haryati Jaafar, Nur Rodiatul Raudah Mohamed Radzuan, Fatin Norazima Mohamad Ariff, and Azirah Baharum. "An Evaluation of Fuzzy in Image Enhancement: Design and Comparison for Penicillium and Aspergillus Species." Journal of Advanced Research in Applied Sciences and Engineering Technology 44, no. 2 (2024): 52–71. http://dx.doi.org/10.37934/araset.44.2.5271.

Full text
Abstract:
The main focus in this study is to enhance and classify the image of a type of filamentous fungi named Penicillium and Aspergillus. For image enhancement, fuzzy-partition gamma adaptive histogram equalization (FpGAHE) is proposed to improve the quality of an image, in particular the low quality of a microscopic image. Two stages have been considered in this technique. In the first stage, a fuzzy partition is developed to handle the inconsistency of the grey level values of the images by introducing a fuzzy set. In the second stage, surrounding neighbourhood is employed to avoid the imbalance d
APA, Harvard, Vancouver, ISO, and other styles
50

Breton, V., I. E. Magnin, and J. Montagnat. "Partitioning Medical Image Databases for Content-based Queries on a Grid." Methods of Information in Medicine 44, no. 02 (2005): 154–60. http://dx.doi.org/10.1055/s-0038-1633937.

Full text
Abstract:
Summary Objectives: In this paper we study the impact of executing a medical image database query application on the grid. For lowering the total computation time, the image database is partitioned into subsets to be processed on different grid nodes. Methods: A theoretical model of the application complexity and estimates of the grid execution overhead are used to efficiently partition the database. Results: We show results demonstrating that smart partitioning of the database can lead to significant improvements in terms of total computation time. Conclusions: Grids are promising for content
APA, Harvard, Vancouver, ISO, and other styles
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!